Characterizing the intersection of QMA and coQMA
Serge Massar, Miklos Santha

TL;DR
This paper explores the relationships between quantum complexity classes, showing that certain functional analogues of QMA and coQMA are equivalent to TFQMA, and discusses implications for the inclusions among these classes.
Contribution
It introduces alternative definitions of QMA∩coQMA and establishes their equivalence to TFQMA, providing insights into the structure of quantum complexity classes.
Findings
F(QMA∩coQMA) equals TFQMA
If TFQMA equals FBQP, then QMA∩coQMA equals BQP
QMA∩coQMA equals QMA under certain reductions
Abstract
We show that the functional analogue of QMAcoQMA, denoted F(QMAcoQMA), equals the complexity class Total Functional QMA (TFQMA). To prove this we need to introduce alternative definitions of QMAcoQMA in terms of a single quantum verification procedure. We show that if TFQMA equals the functional analogue of BQP (FBQP), then QMAcoQMA = BQP. We show that if there is a QMA complete problem that (robustly) reduces to a problem in TFQMA, then QMAcoQMA = QMA. These results provide strong evidence that the inclusions FBQPTFQMAFQMA are strict, since otherwise the corresponding inclusions in BQPQMAcoQMAQMA would become equalities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs
