Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games

Abstract

We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then the complexity class BQP is contained in AM.

arXiv commentSubstantially revised version, 13 pages, 1 figure, to appear in QIC. Small correction in Theorem 1 added

Cited by in corpus (3)

• Efficient classical simulation of random shallow 2D quantum circuits
• Structural risk minimization for quantum linear classifiers
• Feynman-path type simulation using stabilizer projector decomposition of unitaries