Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka

TL;DR
This paper explores quantum generalizations of the polynomial hierarchy, establishing their properties and implications for the complexity class QMA(2), including potential separations and containment results.
Contribution
It introduces two quantum generalizations of the polynomial hierarchy and analyzes their properties, providing new insights into the complexity of QMA(2) and related classes.
Findings
Quantum variants of the Karp-Lipton and Toda's theorems are established.
The third level of QPH is placed within NEXP using semidefinite programming.
Implications for QMA(2) include potential containment in the Counting Hierarchy or strict separation from NEXP.
Abstract
The polynomial-time hierarchy () has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as does not collapse). Here, we study whether two quantum generalizations of can similarly prove separations in the quantum setting. The first generalization, , uses classical proofs, and the second, , uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, , into {using the Ellipsoid Method for efficiently solving semidefinite programs}. These results yield two implications for , the variant of Quantum Merlin-Arthur () with two unentangled proofs, a complexity class whose characterization has proven…
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.
