Optimal separation in exact query complexities for Simon's problem
From MaRDI portal
Publication:1672002
DOI10.1016/j.jcss.2018.05.001zbMath1398.68173arXiv1610.01920OpenAlexW2964102687MaRDI QIDQ1672002
Publication date: 7 September 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.01920
Related Items (9)
Sample complexity of hidden subgroup problem ⋮ Quantum and classical query complexities for generalized Simon's problem ⋮ Quantum and classical query complexities for generalized Deutsch-Jozsa problems ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ Zero sum subsequences and hidden subgroups ⋮ Distributed Grover's algorithm ⋮ Revisiting Deutsch-Jozsa algorithm ⋮ Query complexity of generalized Simon's problem ⋮ Deterministic algorithms for the hidden subgroup problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic polynomial-time quantum algorithms for Simon's problem
- Complexity measures and decision tree complexity: a survey.
- On exact quantum query complexity
- The quantum query complexity of the abelian hidden subgroup problem
- Forrelation
- Rapid solution of problems by quantum computation
- On the Power of Quantum Computation
- Separations in Query Complexity Based on Pointer Functions
- Quantum lower bounds by polynomials
- Superlinear advantage for exact quantum algorithms
This page was built for publication: Optimal separation in exact query complexities for Simon's problem