Nonadaptive quantum query complexity

Authors:
Ashley Montanaro
Affiliations:
Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge CB3 0WA, UK
Venue:
Information Processing Letters
Year:
2010

Citing 10
Cited 0

Quantum Complexity Theory

SIAM Journal on Computing
On the Power of Quantum Computation

SIAM Journal on Computing
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum versus Classical Learnability

CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Polynomial degree vs. quantum query complexity

Journal of Computer and System Sciences - Special issue on FOCS 2003
Adversary Lower Bounds for Nonadaptive Quantum Algorithms

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonadaptive quantum query algorithm that computes a total boolean function depending on n variables must make @W(n) queries to the input in total. Second, we show that, if there exists a quantum algorithm that uses k nonadaptive oracle queries to learn which one of a set of m boolean functions it has been given, there exists a nonadaptive classical algorithm using O(klogm) queries to solve the same problem. Thus, in the nonadaptive setting, quantum algorithms for these tasks can achieve at most a very limited speed-up over classical query algorithms.