Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
SIAM Journal on Computing
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Commutative version of the local Hamiltonian problem and common eigenspace problem
Quantum Information & Computation
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Commuting quantum circuits: efficient classical simulations versus hardness results
Quantum Information & Computation
| Hi-index | 0.00 |
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 BQP ⊆ AM.