Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic quantifiers vs. distrustful adversaries
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
SIAM Journal on Computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
Quantum versus Classical Proofs and Advice
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Computational Complexity
Quantum Information & Computation
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Journal of the ACM (JACM)
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Guest column: the quantum PCP conjecture
ACM SIGACT News
| Hi-index | 0.00 |
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum oracle" relative to which QMA ≠ QMA1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP ⊆ ZQEXP.