QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols
Scott Aaronson
Abstract
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 is contained in PP/poly, and offers an intriguing counterpoint to the recent discovery of Raz that QIP/qpoly = ALL. Finally, we show that QCMA/qpoly is contained in PP/poly and that QMA/rpoly = QMA/poly.
Create a lesson
Related papers
Approximate Synthetic Spectra of Quantum Systems Associated with Compact Lie Groups
Junyang Liu, Hang Wang, Houjin Wang et al.
An example of universal braiding in Links--Gould topological quantum computation
Matthew Harper, Ben-Michael Kohli
Reasoning about Shared-Qubit Concurrency in Quantum Computing
Mingsheng Ying
Information-Geometric Representation of Upper Bounds on Fluctuation Growth in Open Quantum Systems
Newshaw Bahreyni, Paul M. Alsing
Initialization-controlled fault sensitivity and force-balance plateaus in noisy variational quantum optimization
Longhui Shen, Fangzhou Jin, Bin Guo
Quantum identity authentication protocol via perturbed probability amplitudes
Xiangqun Fu, Zheng Han, Hongwei Li et al.