Quantum Query Algorithms are Completely Bounded Forms

We prove a characterization of $t$-query quantum algorithms in terms of the unit ball of a space of degree-$2t$ polynomials. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query complexity, answering a question of Aaronson et al. (CCC'16). Our proof is based on a fundamental result of Christensen and Sinclair (J. Funct. Anal., 1987) that generalizes the well-known Stinespring representation for quantum channels to multilinear forms. Using our characterization, we show that many polynomials of degree four are far from those coming from two-query quantum algorithms. We also give a simple and short proof of one of the results of Aaronson et al. showing an equivalence between one-query quantum algorithms and bounded quadratic polynomials.

[1]  Can M. Le,et al.  Sparse random graphs: regularization and concentration of the Laplacian , 2015, ArXiv.

[2]  Gilles Pisier,et al.  Introduction to Operator Space Theory , 2003 .

[3]  Hyunjoong Kim,et al.  Functional Analysis I , 2017 .

[4]  J. Diestel,et al.  Absolutely Summing Operators , 1995 .

[5]  Noga Alon,et al.  Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.

[6]  Roger R. Smith,et al.  Completely Bounded Multilinear Maps and Grothendieck's Inequality , 1988 .

[7]  B. Tsirelson.  Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .

[8]  Troy Lee,et al.  Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  David W. Kribs,et al.  Computing stabilized norms for quantum operations via the theory of completely bounded maps , 2007, Quantum Inf. Comput..

[10]  G. Murphy.  C*-Algebras and Operator Theory , 1990 .

[11]  G. Pisier.  Grothendieck's Theorem, past and present , 2011, 1101.4195.

[12]  Vern I. Paulsen,et al.  Multilinear maps and tensor norms on operator systems , 1987 .

[13]  Joel A. Tropp,et al.  Column subset selection, matrix factorization, and eigenvalue optimization , 2008, SODA.

[14]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

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

[16]  Carlos Palazuelos,et al.  Survey on Nonlocal Games and Operator Space Theory , 2015, 1512.00419.

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

[18]  Thomas Vidick,et al.  MULTIPLAYER XOR GAMES AND QUANTUM COMMUNICATION COMPLEXITY WITH CLIQUE-WISE ENTANGLEMENT , 2009, 0911.4007.

[19]  W. Arveson.  An Invitation To C*-Algebras , 1976 .

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

[21]  Andris Ambainis,et al.  Polynomials, Quantum Query Complexity, and Grothendieck's Inequality , 2015, CCC.

[22]  Harry Buhrman,et al.  All Schatten spaces endowed with the Schur product are Q-algebras , 2012 .

[23]  Justin Thaler,et al.  The polynomial method strikes back: tight quantum query bounds via dual polynomials , 2017, Electron. Colloquium Comput. Complex..

[24]  Ronald de Wolf,et al.  Query Complexity in Expectation , 2014, ICALP.

[25]  Allan M. Sinclair,et al.  Representations of completely bounded multilinear operators , 1987 .

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

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

[28]  J. Lamperti.  ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .

[29]  Aleksandrs Belovs,et al.  Span programs for functions with constant-sized 1-certificates: extended abstract , 2011, STOC '12.

[30]  Andris Ambainis,et al.  Forrelation: A Problem that Optimally Separates Quantum from Classical Computing , 2014, STOC.

[31]  Nikolai K. Vereshchagin,et al.  On Computation and Communication with Small Bias , 2007, Computational Complexity Conference.

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

[33]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[34]  Andris Ambainis,et al.  Separations in query complexity based on pointer functions , 2015, STOC.

[35]  L. Terrell Gardner.  An elementary proof of the Russo-Dye theorem , 1984 .

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

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

[38]  Peter Høyer,et al.  Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[39]  Edward Farhi,et al.  A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..

[40]  Timur Oikhberg,et al.  The ``maximal" tensor product of operator spaces , 1997 .

[41]  Raymond H. Putra,et al.  Unbounded-Error Quantum Query Complexity , 2008, ISAAC.

[42]  Mark Braverman,et al.  The Grothendieck Constant is Strictly Smaller than Krivine's Bound , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[43]  Troy Lee,et al.  Multipartite entanglement in XOR games , 2013, Quantum Inf. Comput..

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

[45]  Ashley Montanaro.  Nonadaptive quantum query algorithms for total functions , 2009 .

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

[47]  AaronsonScott,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004 .

[48]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[49]  Monique Laurent,et al.  Semidefinite programming formulations for the completely bounded norm of a tensor , 2019, 1901.04921.

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

[51]  Subhash Khot,et al.  Grothendieck‐Type Inequalities in Combinatorial Optimization , 2011, ArXiv.

[52]  Thomas Vidick,et al.  Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games , 2011 .

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

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

[55]  Scott Aaronson,et al.  Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..

[56]  V. Paulsen.  Completely Bounded Maps and Operator Algebras , 2003 .

[57]  T. Tao.  Topics in Random Matrix Theory , 2012 .

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

[59]  M. Wolf,et al.  Unbounded Violation of Tripartite Bell Inequalities , 2007, quant-ph/0702189.

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

[61]  Troy Lee,et al.  Optimal Quantum Adversary Lower Bounds for Ordered Search , 2008, ICALP.