Complexity Theory for Quantum Promise Problems

Abstract

We begin by establishing structural results for several fundamental quantum complexity classes: p/mBQP, p/mQ(C)MA, ${\text{p/mQSZK}}_{\text{hv}}$, p/mQIP, p/mBQP/qpoly, p/mBQP/poly, and p/mPSPACE. This includes identifying complete problems, as well as proving containment and separation results among these classes. Here, p/mC denotes the corresponding quantum promise complexity class with pure (p) or mixed (m) quantum input states for any classical complexity class C. Surprisingly, our findings uncover relationships that diverge from their classical analogues -- specifically, we show unconditionally that p/mQIP$\ne$p/mPSPACE and p/mBQP/qpoly$\ne$p/mBQP/poly. This starkly contrasts the classical setting, where QIP$=$PSPACE and separations such as BQP/qpoly$\ne$BQP/poly are only known relative to oracles. More interestingly, these separation results further connected to the topic of for both quantum property testing and unitary synthesis. This new framework has numerous applications in quantum cryptography, particularly in the contexts of Microcrypt. We provide a better characterization of its primitives; for example, we show that OWSG and PRS can be broken by a p/mQCMA oracle, leading to a natural quantum analogue of Impagliazzo's five worlds by substituting the classical complexity classes in Pessiland, Heuristica, and Algorithmica with mBQP and mQCMA. Moreover, we establish the relativization barrier for proving the existence of EFI, noting that no such barrier currently exists within traditional complexity theory.

arXiv comment(v3)Rewrite technical overview, add the relativization barrier for EFI and remove the application of unconditional cryptography. (v2)Add the new separation results of pBQP/poly and pBQP/qpoly, and the unconditionally secure auxiliary-input quantum commitment with statistical hiding and computational binding (v1)79 pages, 3 figures