On perfect completeness for QMA

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.

[1]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  P. Michor,et al.  Choosing roots of polynomials smoothly , 1998, math/9801026.

[3]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[4]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[5]  Dorit Aharonov,et al.  Quantum NP - A Survey , 2002, quant-ph/0210077.

[6]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[7]  Stathis Zachos,et al.  Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.

[8]  Oded Goldreich,et al.  Another proof that bpp?ph (and more) , 1997 .

[9]  Alexei Y. Kitaev,et al.  Parallelization, amplification, and exponential time simulation of quantum interactive proof systems , 2000, STOC '00.

[10]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[11]  Greg Kuperberg,et al.  Quantum versus Classical Proofs and Advice , 2006, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[12]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[14]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[15]  Sergey Bravyi,et al.  Efficient algorithm for a quantum analogue of 2-SAT , 2006, quant-ph/0602108.