
Interactive quantum advantage with noisy, shallow Clifford circuits
Recent work by Bravyi et al. constructs a relation problem that a noisy ...
read it

Optimal SpaceDepth TradeOff of CNOT Circuits in Quantum Logic Synthesis
Due to the decoherence of the stateoftheart physical implementations ...
read it

Quantum Advantage from Conjugated Clifford Circuits
A wellknown result of Gottesman and Knill states that Clifford circuits...
read it

On the Power of Saturated Transformers: A View from Circuit Complexity
Transformers have become a standard architecture for many NLP problems. ...
read it

Estimating the entropy of shallow circuit outputs is hard
The decision problem version of estimating the Shannon entropy is the En...
read it

Approximating the Determinant of WellConditioned Matrices by Shallow Circuits
The determinant can be computed by classical circuits of depth O(log^2 n...
read it

Efficient classical simulation of random shallow 2D quantum circuits
Random quantum circuits are commonly viewed as hard to simulate classica...
read it
Interactive shallow Clifford circuits: quantum advantage against NC^1 and beyond
Recent work of Bravyi et al. and followup work by Bene Watts et al. demonstrates a quantum advantage for shallow circuits: constantdepth quantum circuits can perform a task which constantdepth classical (i.e., AC^0) circuits cannot. Their results have the advantage that the quantum circuit is fairly practical, and their proofs are free of hardness assumptions (e.g., factoring is classically hard, etc.). Unfortunately, constantdepth classical circuits are too weak to yield a convincing realworld demonstration of quantum advantage. We attempt to hold on to the advantages of the above results, while increasing the power of the classical model. Our main result is a tworound interactive task which is solved by a constantdepth quantum circuit (using only Clifford gates, between neighboring qubits of a 2D grid, with Pauli measurements), but such that any classical solution would necessarily solve ⊕Lhard problems. This implies a more powerful class of constantdepth classical circuits (e.g., AC^0[p] for any prime p) unconditionally cannot perform the task. Furthermore, under standard complexitytheoretic conjectures, logdepth circuits and logspace Turing machines cannot perform the task either. Using the same techniques, we prove hardness results for weaker complexity classes under more restrictive circuit topologies. Specifically, we give QNC^0 interactive tasks on 2 × n and 1 × n grids which require classical simulations of power NC^1 and AC^0[6], respectively. Moreover, these hardness results are robust to a small constant fraction of error in the classical simulation. We use ideas and techniques from the theory of branching programs, quantum contextuality, measurementbased quantum computation, and Kilian randomization.
READ FULL TEXT
Comments
There are no comments yet.