On Exact Quantum Query Complexity

We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these functions cannot be obtained by simply computing parities of pairs of bits. We also characterise the model of nonadaptive exact quantum query complexity in terms of coding theory and completely characterise the query complexity of symmetric boolean functions in this context. These results were originally inspired by numerically solving the semidefinite programs characterising quantum query complexity for small problem sizes.

[1]  Ben Reichardt,et al.  Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..

[2]  Michael E. Saks,et al.  Quantum query complexity and semi-definite programming , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[3]  Thomas P. Hayes,et al.  The Quantum Black-Box Complexity of Majority , 2002, Algorithmica.

[4]  Alina Vasiljeva.  Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions , 2008 .

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  Ben Reichardt,et al.  Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Andris Ambainis,et al.  Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Alina Vasilieva.  Exact Quantum Query Algorithm for Error Detection Code Verification , 2009, MEMICS.

[9]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[10]  Andris Ambainis,et al.  Superlinear advantage for exact quantum algorithms , 2012, STOC '13.

[11]  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.

[12]  Wim van Dam,et al.  Quantum Oracle Interrogation: Getting All Information for Almost Half the Price , 1999 .

[13]  Gérard D. Cohen,et al.  Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[14]  Alina Dubrovska Vasilieva,et al.  Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials , 2006 .

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

[16]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[17]  Troy Lee,et al.  Negative weights make adversaries stronger , 2007, STOC '07.

[18]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[19]  Vijay Raghavan,et al.  Exact Learning when Irrelevant Variables Abound , 1999, Inf. Process. Lett..

[20]  M. Sipser,et al.  Limit on the Speed of Quantum Computation in Determining Parity , 1998, quant-ph/9802045.

[21]  W. Marsden.  I and J , 2012 .

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

[23]  Gatis Midrijanis.  Exact quantum query complexity for total Boolean functions , 2004, quant-ph/0403168.

[24]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[25]  Robert Spalek,et al.  Lower Bounds on Quantum Query Complexity , 2005, Bull. EATCS.

[26]  Andris Ambainis,et al.  Exact quantum query complexity of EXACT and THRESHOLD , 2013, TQC.

[27]  Scott Aaronson,et al.  Quantum lower bound for recursive fourier sampling , 2002, Quantum Inf. Comput..

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

[29]  Ashley Montanaro,et al.  Nonadaptive quantum query complexity , 2009, Inf. Process. Lett..

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