Quantum Implications of Huang's Sensitivity Theorem

Based on the recent breakthrough of Huang (2019), we show that for any total Boolean function $f$, the deterministic query complexity, $D(f)$, is at most quartic in the quantum query complexity, $Q(f)$: $D(f) = O(Q(f)^4)$. This matches the known separation (up to log factors) due to Ambainis, Balodis, Belovs, Lee, Santha, and Smotrovs (2017). We also use the result to resolve the quantum analogue of the Aanderaa-Karp-Rosenberg conjecture. We show that if $f$ is a nontrivial monotone graph property of an $n$-vertex graph specified by its adjacency matrix, then $Q(f) = \Omega(n)$, which is also optimal.

[1]  Toniann Pitassi,et al.  Randomized Communication versus Partition Number , 2018, ACM Trans. Comput. Theory.

[2]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[3]  Troy Lee,et al.  The Quantum Adversary Method and Classical Formula Size Lower Bounds , 2005, Computational Complexity Conference.

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

[5]  Avishay Tal,et al.  Towards Optimal Separations between Quantum and Randomized Query Complexities , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[6]  David Galvin,et al.  A topological approach to evasiveness , 2010 .

[7]  David Rubinstein.  Sensitivity vs. block sensitivity of Boolean functions , 1995, Comb..

[8]  Avishay Tal,et al.  On Fractional Block Sensitivity , 2013, Chic. J. Theor. Comput. Sci..

[9]  Ryan O'Donnell,et al.  Every decision tree has an influential variable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

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

[12]  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).

[13]  Avishay Tal,et al.  Properties and applications of boolean function composition , 2013, ITCS '13.

[14]  Avi Wigderson,et al.  Computing Graph Properties by Randomized Subcube Partitions , 2002, RANDOM.

[15]  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).

[16]  Hao Huang,et al.  Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture , 2019, Annals of Mathematics.

[17]  Sophie Laplante,et al.  Sensitivity lower bounds from linear dependencies , 2020, Electron. Colloquium Comput. Complex..

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

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

[20]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[22]  Michael E. Saks,et al.  Composition limits and separating examples for some boolean function complexity measures , 2013, 2013 IEEE Conference on Computational Complexity.

[23]  Andrew Chi-Chih Yao.  Lower bounds to randomized algorithms for graph properties , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[24]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .

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

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

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

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

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

[30]  Eberhard Triesch,et al.  A Lower Bound for the Complexity of Monotone Graph Properties , 2013, SIAM J. Discret. Math..

[31]  Frédéric Magniez,et al.  Quantum algorithms for the triangle problem , 2005, SODA '05.

[32]  Subhash Khot,et al.  Improved lower bounds on the randomized complexity of graph properties , 2001, Random Struct. Algorithms.

[33]  Shalev Ben-David.  Low-Sensitivity Functions from Unambiguous Certificates , 2017, ITCS.

[34]  Justin Thaler,et al.  A Nearly Optimal Lower Bound on the Approximate Degree of AC^0 , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

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

[36]  Mario Szegedy,et al.  All Quantum Adversary Methods Are Equivalent , 2005, ICALP.

[37]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[38]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[40]  Elias Koutsoupias,et al.  Improvements on Khrapchenko's theorem , 1993, Theor. Comput. Sci..

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

[42]  Supartha Podder,et al.  Quantum Query Complexity of Subgraph Isomorphism and Homomorphism , 2016, STACS.

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

[44]  T. Sanders,et al.  Analysis of Boolean Functions , 2012, ArXiv.

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

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

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