Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
<|reference_start|>Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games: 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.<|reference_end|>
@article{terhal2002adaptive,
    title={Adaptive Quantum Computation, Constant Depth Quantum Circuits and
  Arthur-Merlin Games},
    author={Barbara M. Terhal and David P. DiVincenzo},
    journal={Quant. Inf. Comp. Vol. 4 (No. 2), pages 134--145 (2004)},
    year={2002},
    archivePrefix={arXiv},
    eprint={quant-ph/0205133},
    primaryClass={quant-ph cs.CC}
}