Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
Quantum Physics
2014-05-28 v6 Computational Complexity
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.
Cite
@article{arxiv.quant-ph/0205133,
title = {Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games},
author = {Barbara M. Terhal and David P. DiVincenzo},
journal= {arXiv preprint arXiv:quant-ph/0205133},
year = {2014}
}
Comments
Substantially revised version, 13 pages, 1 figure, to appear in QIC. Small correction in Theorem 1 added