Adversary Lower Bounds for Nonadaptive Quantum Algorithms

Authors:
Pascal Koiran;Jürgen Landes;Natacha Portier;Penghui Yao
Affiliations:
LIP, Ecole Normale Supérieure de Lyon, Université de Lyon,;School of Mathematics, University of Manchester,;LIP, Ecole Normale Supérieure de Lyon, Université de Lyon,;State Key Laboratory of Computer Science, Chinese Academy of Sciences,
Venue:
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Year:
2008

Citing 13
Cited 1

Sampling algorithms: lower bounds and applications

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Hidden translation and orbit coset in quantum computing

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Lower bounds for local search by quantum arguments

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the time required to recognize properties of graphs: a problem

ACM SIGACT News
Quantum lower bounds for the collision and the element distinctness problems

Journal of the ACM (JACM)
Quantum Query Complexity of Some Graph Problems

SIAM Journal on Computing
Polynomial degree vs. quantum query complexity

Journal of Computer and System Sciences - Special issue on FOCS 2003
The quantum query complexity of the abelian hidden subgroup problem

Theoretical Computer Science
On the power of quantum computation

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

SIAM Journal on Computing
A quantum lower bound for the query complexity of simon's problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
All quantum adversary methods are equivalent

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Nonadaptive quantum query complexity

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.