Bounds for small-error and zero-error quantum algorithms

We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for quantum versions of amplification problems. Next, we establish nearly optimal quantum-classical separations for the query complexity of monotone functions in the zero-error model (where our quantum zero-error model is defined so as to be robust when the quantum gates are noisy). Also, we present a communication complexity problem related to a total function for which there is a quantum-classical communication complexity gap in the zero-error model. Finally, we prove separations for monotone graph properties in the zero-error and other error models which imply that the evasiveness conjecture for such properties does not hold for quantum computers.

[1]  Juraj Hromkovic,et al.  Nondeterministic communication with a limited number of advice bits , 1996, STOC '96.

[2]  Stuart A. Kurtz,et al.  On oracle builder's toolkit , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[4]  Osamu Watanabe.  On One-Way Functions , 1989 .

[5]  Valerie King.  Lower bounds on the complexity of graph properties , 1988, STOC '88.

[6]  Michael Werman,et al.  On computing majority by comparisons , 1991, Comb..

[7]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[8]  Sanjeev Khanna,et al.  Space Time Tradeoffs for Graph Properties , 1999, ICALP.

[9]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Avi Wigderson,et al.  On read-once threshold formulae and their randomized decision tree complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[11]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[12]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[13]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[14]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[15]  Juris Hartmanis,et al.  One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets , 1987, Proceeding Structure in Complexity Theory.

[16]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[17]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[19]  Valerie King.  An Ω(n5/4) lower bound on the randomized complexity of graph properties , 1991, Comb..

[20]  Andrew Chi-Chih Yao.  Monotone Bipartite Graph Properties are Evasive , 1988, SIAM J. Comput..

[21]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[22]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[23]  T. J. Rivlin.  Chebyshev polynomials : from approximation theory to algebra and number theory , 1990 .

[24]  Miklos Santha.  On the Monte Carlo Boolean decision tree complexity of read-once formulae , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[25]  Lov K. Grover.  A framework for fast quantum mechanical algorithms , 1997, STOC '98.

[26]  Michael E. Saks,et al.  A topological approach to evasiveness , 1984, Comb..

[27]  Andris Ambainis,et al.  The quantum communication complexity of sampling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[28]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[29]  P. Hajnal.  An Ω(n4/3) lower bound on the randomized complexity of graph properties , 1991 .

[30]  Hartmut Klauck,et al.  On quantum and probabilistic communication: Las Vegas and one-way protocols , 2000, STOC '00.

[31]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[32]  Thomas P. Hayes,et al.  On the Quantum Complexity of Majority , 1998 .

[33]  Noam Nisan.  CREW PRAMs and Decision Trees , 1991, SIAM J. Comput..

[34]  M. Mosca.  Quantum Searching Counting and Amplitude Ampli cation by Eigenvector Analysis , 1998 .

[35]  A. Berthiaume.  Quantum computation , 1998 .

[36]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[37]  Edward M. Reingold,et al.  Determining the Majority , 1993, Inf. Process. Lett..

[38]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[39]  Miklos Santha.  On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae , 1995, Random Struct. Algorithms.

[40]  T. J. Rivlin,et al.  The growth of polynomials bounded at equally spaced points , 1992 .

[41]  Ramamohan Paturi,et al.  On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.

[42]  Ronald L. Rivest,et al.  On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..

[43]  P. Eter Hajnal.  An (n 4 3 ) Lower Bound on the Randomized Complexity of Graph Properties , 1991 .

[44]  Marc Snir,et al.  Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..