Characterizing the intersection of QMA and coQMA
Abstract
We show that the functional analogue of QMA, denoted F(QMA), equals the complexity class Total Functional QMA (TFQMA). To prove this we need to introduce alternative definitions of QMA in terms of a single quantum verification procedure. We show that if TFQMA equals the functional analogue of BQP (FBQP), then QMA = BQP. We show that if there is a QMA complete problem that (robustly) reduces to a problem in TFQMA, then QMA = QMA. These results provide strong evidence that the inclusions FBQP⊂eqTFQMA⊂eqFQMA are strict, since otherwise the corresponding inclusions in BQP⊂eqQMA⊂eqQMA would become equalities.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.