Quantum certificate complexity

Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f) as the square root of RC(f). We then use this result to prove the new relation R/sub 0/(f)=O(Q/sub 2/(f)/sup 2/Q/sub 0/(f)log n) for total f, where R/sub 0/, Q/sub 2/, and Q/sub 0/ are zero-error randomized, bounded-error quantum, and zero-error quantum query complexities respectively. Finally we give asymptotic gaps between the measures, including a total f for which C(f) is superquadratic in QC(f), and a symmetric partial f for which QC(f)=O(1) yet Q/sub 2/(f)=/spl Omega/(n/log n).

[1]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[2]  Ronald de Wolf,et al.  Bounds for small-error and zero-error quantum algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[4]  Andris Ambainis,et al.  A Note on Quantum Black-Box Complexity of Almost all Boolean Functions , 1998, Inf. Process. Lett..

[5]  Ran Raz,et al.  On the power of quantum proofs , 2004 .

[6]  Nikolai K. Vereshchagin,et al.  Arthur-Merlin Games in Boolean Decision Trees , 1999, J. Comput. Syst. Sci..

[7]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[8]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[9]  R. de Wolf,et al.  Characterization of non-deterministic quantum query and quantum communication complexity , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

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

[11]  Ran Raz,et al.  On the power of quantum proofs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[12]  Gilles Brassard,et al.  Quantum cryptanalysis of hash and claw-free functions , 1997, SIGA.

[13]  Ingo Wegener,et al.  A Note on the Relations Between Critical and Sensitive Complexity , 1989, J. Inf. Process. Cybern..

[14]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

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

[16]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

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

[18]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[19]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[20]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[21]  Gatis Midrijanis.  On Randomized and Quantum Query Complexities , 2005 .

[22]  Harry Buhrman,et al.  Quantum Computing and Communication Complexity , 2001, Bull. EATCS.

[23]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

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

[25]  Ingo Wegener,et al.  Properties of Complexity Measures for Prams and Wrams , 1986, Theor. Comput. Sci..

[26]  Ronald de Wolf,et al.  Nondeterministic Quantum Query and Communication Complexities , 2003, SIAM J. Comput..

[27]  Ronald de Wolf,et al.  Improved Quantum Communication Complexity Bounds for Disjointness and Equality , 2001, STACS.

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

[29]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[30]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[31]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.