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

06/20/2019
by   Adam Bene Watts, et al.
MIT
Microsoft
0

Recently, Bravyi, Gosset, and König (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 Relaxed 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. As a step towards even stronger lower bounds, we present a search problem that we call the Parity Bending Problem, which is in QNC^0/qpoly (QNC^0 circuits that are allowed to start with a quantum state of their choice that is independent of the input), but is not even in AC^0[2] (the class AC^0 with unbounded fan-in XOR gates). All the quantum circuits in our paper are simple, and the main difficulty lies in proving the classical lower bounds. For this we employ a host of techniques, including a refinement of Håstad's switching lemmas for multi-output circuits that may be of independent interest, the Razborov-Smolensky AC^0[2] lower bound, Vazirani's XOR lemma, and lower bounds for non-local games.

READ FULL TEXT
08/17/2020

Bounds on the QAC^0 Complexity of Approximating Parity

QAC circuits are quantum circuits with one-qubit gates and Toffoli gates...
11/12/2018

Circuit Depth Reductions

The best known circuit lower bounds against unrestricted circuits remain...
09/29/2021

Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes

In this work we establish lower bounds on the size of Clifford circuits ...
12/23/2021

Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation

Bottom-up knowledge compilation is a paradigm for generating representat...
11/15/2021

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search

We prove that any n-qubit unitary can be implemented (i) approximately i...
02/16/2022

The Parameterized Complexity of Quantum Verification

We initiate the study of parameterized complexity of problems in terms ...
01/30/2023

Near-perfect Reachability of Variational Quantum Search with Depth-1 Ansatz

Grover's search algorithm is renowned for its dramatic speedup in solvin...

Please sign up or login with your details

Forgot password? Click here to reset