Pages that link to "Item:Q5716753"

The following pages link to Automata, Languages and Programming (Q5716753):

Displaying 10 items.

• Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
• Deterministic polynomial-time quantum algorithms for Simon's problem (Q1762666) (← links)
• Query complexity of generalized Simon's problem (Q2051810) (← links)
• Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization (Q2285624) (← links)
• The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
• Sample complexity of hidden subgroup problem (Q2672576) (← links)
• Quantum and classical query complexities for generalized Simon's problem (Q2672650) (← links)
• (Q4249527) (← links)
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)