On exact quantum query complexity
From MaRDI portal
Publication:2350895
DOI10.1007/s00453-013-9826-8zbMath1325.68093DBLPjournals/algorithmica/MontanaroJM15arXiv1111.0475OpenAlexW3101283140WikidataQ58478263 ScholiaQ58478263MaRDI QIDQ2350895
Graeme Mitchison, Ashley Montanaro, Richard Jozsa
Publication date: 25 June 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0475
Related Items (13)
Quantum query as a state decomposition ⋮ Optimal separation in exact query complexities for Simon's problem ⋮ From Quantum Query Complexity to State Complexity ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Parity decision tree in classical-quantum separations for certain classes of Boolean functions ⋮ Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Revisiting Deutsch-Jozsa algorithm ⋮ Superlinear Advantage for Exact Quantum Algorithms ⋮ Evaluation of exact quantum query complexities by semidefinite programming ⋮ On exact quantum query complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the degree of Boolean functions as real polynomials
- Nonadaptive quantum query complexity
- Complexity measures and decision tree complexity: a survey.
- The quantum black-box complexity of majority
- On exact quantum query complexity
- Exact Quantum Query Algorithm for Error Detection Code Verification
- Exact Quantum Query Complexity of EXACT and THRESHOLD
- Matrix Analysis
- Covering radius---Survey and recent results
- Rapid solution of problems by quantum computation
- Quantum algorithms revisited
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Quantum lower bounds by polynomials
- Automata, Languages and Programming
- Superlinear advantage for exact quantum algorithms
This page was built for publication: On exact quantum query complexity
