QMA/qpoly /spl sube/ PSPACE/poly: de-Merlinizing quantum protocols

This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polynomial-size quantum advice, is also in PSPACE with polynomial-size classical advice. This builds on our earlier result that BQP/qpoly sube PP/poly, and offers an intriguing counterpoint to the recent discovery of Raz that QIP/qpoly = ALL. Finally, we show that QCMA/qpoly sube PP/poly and that QMA/rpoly = QMA/poly

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

[2]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

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

[4]  Richard E. Ladner.  Polynomial Space Counting Problems , 1989, SIAM J. Comput..

[5]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

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

[7]  Scott Aaronson,et al.  Quantum computing, postselection, and probabilistic polynomial-time , 2004, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[8]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[9]  John Watrous,et al.  Space-Bounded Quantum Complexity , 1999, J. Comput. Syst. Sci..

[10]  Ran Raz.  Quantum Information and the PCP Theorem , .

[11]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[12]  Ashwin Nayak,et al.  Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Hartmut Klauck,et al.  Quantum Communication Complexity , 2022 .

[14]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..