Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

Recently, Bravyi, Gosset, and Konig (Science, 2018) exhibited a search problem called the 2D Hidden Linear Function (2D HLF) problem that can be solved exactly by a constant-depth quantum circuit using bounded fan-in gates (or QNC^0 circuits), but cannot be solved by any constant-depth classical circuit using bounded fan-in AND, OR, and NOT gates (or NC^0 circuits). In other words, they exhibited a search problem in QNC^0 that is not in NC^0. We strengthen their result by proving that the 2D HLF problem is not contained in AC^0, the class of classical, polynomial-size, constant-depth circuits over the gate set of unbounded fan-in AND and OR gates, and NOT gates. We also supplement this worst-case lower bound with an average-case result: There exists a simple distribution under which any AC^0 circuit (even of nearly exponential size) has exponentially small correlation with the 2D HLF problem. Our results are shown by constructing a new problem in QNC^0, which we call the Parity Halving Problem, which is easier to work with. We prove our AC^0 lower bounds for this problem, and then show that it reduces to the 2D HLF problem.

[1]  Yasuhiro Takahashi,et al.  Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits , 2011, 2013 IEEE Conference on Computational Complexity.

[2]  Ryan Williams.  Nonuniform ACC Circuit Lower Bounds , 2014, JACM.

[3]  Ronen Shaltiel.  Towards proving strong direct product theorems , 2003, computational complexity.

[4]  Robert Spalek,et al.  Quantum Fan-out is Powerful , 2005, Theory Comput..

[5]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[6]  Ran Raz,et al.  Oracle separation of BQP and PH , 2019, Electron. Colloquium Comput. Complex..

[7]  Gilles Brassard,et al.  Recasting mermin's multi-player game into the framework of pseudo-telepathy , 2005, Quantum Inf. Comput..

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

[9]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  A. Zeilinger,et al.  Going Beyond Bell’s Theorem , 2007, 0712.0921.

[11]  David P. DiVincenzo,et al.  Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games , 2002, Quantum Inf. Comput..

[12]  Kiel T. Williams,et al.  Extreme quantum entanglement in a superposition of macroscopically distinct states. , 1990, Physical review letters.

[13]  Yong Zhang,et al.  Quantum lower bounds for fanout , 2006, Quantum Inf. Comput..

[14]  Martin Nilsson,et al.  Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..

[15]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[16]  Matthew Coudron,et al.  Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits , 2018, Communications in Mathematical Physics.

[17]  Emanuele Viola.  Extractors for Circuit Sources , 2011, FOCS.

[18]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[19]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[20]  M. Kafatos.  Bell's theorem, quantum theory and conceptions of the universe , 1989 .

[21]  J. Eisert,et al.  Architectures for quantum simulation showing a quantum speedup , 2017, 1703.00466.

[22]  Avishay Tal,et al.  Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..

[23]  Cristopher Moore,et al.  Counting, fanout and the complexity of quantum ACC , 2002, Quantum Inf. Comput..

[24]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[25]  Yasuhiro Takahashi,et al.  Power of Uninitialized Qubits in Shallow Quantum Circuits , 2016, STACS.

[26]  Cody Murray,et al.  Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP , 2018, Electron. Colloquium Comput. Complex..

[27]  François Le Gall,et al.  Average-case quantum advantage with shallow circuits , 2018, CCC.

[28]  Anand Natarajan,et al.  Algorithms, Bounds, and Strategies for Entangled XOR Games , 2019, ITCS.

[29]  Benjamin Rossman.  An entropy proof of the switching lemma and tight bounds on the decision-tree size of AC 0 , 2017 .

[30]  Johan Håstad,et al.  On the Correlation of Parity and Small-Depth Circuits , 2014, SIAM J. Comput..

[31]  Robert König,et al.  Quantum advantage with shallow circuits , 2017, Science.

[32]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[33]  Anup Rao,et al.  An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..

[34]  Yong Zhang,et al.  Bounds on the Power of Constant-Depth Quantum Circuits , 2005, FCT.

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

[36]  Robert Spalek,et al.  Quantum Circuits with Unbounded Fan-out , 2002, STACS.

[37]  Cristopher Moore.  Quantum Circuits: Fanout, Parity, and Counting , 1999, Electron. Colloquium Comput. Complex..

[38]  Steven Homer,et al.  Small depth quantum circuits , 2007, SIGA.

[39]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.