A quantum lower bound for the query complexity of Simon's problem
From MaRDI portal
Recommendations
- The quantum query complexity of the abelian hidden subgroup problem
- Query complexity of generalized Simon's problem
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum algorithms for Simon's problem over general groups
- Optimal separation in exact query complexities for Simon's problem
Cited in
(12)- Deterministic polynomial-time quantum algorithms for Simon's problem
- Query complexity of generalized Simon's problem
- Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization
- The quantum query complexity of the abelian hidden subgroup problem
- Sample complexity of hidden subgroup problem
- Quantum and classical query complexities for generalized Simon's problem
- A quantum polynomial time algorithm in worst case for Simon's problem
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Complexity bounds on some fundamental computational problems for quantum branching programs.
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Adversary lower bounds for nonadaptive quantum algorithms
This page was built for publication: A quantum lower bound for the query complexity of Simon's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716753)