Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
arXiv:1805.11139 · doi:10.1007/s00037-022-00231-8 10.4230/LIPIcs.MFCS.2018.58
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 difficult. First, if (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then is in the Counting Hierarchy (specifically, in ). Second, unless (i.e., alternating quantifiers do not help in the presence of "unentanglement"), is strictly contained in .
v2 adds some observations on connections between Quantum Refereed Games and
References in corpus (9)
- N-representability is QMA-complete
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- Quantum NP - A Survey
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Importance of the spectral gap in estimating ground-state energies
- Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
- The complexity of simulating local measurements on quantum systems
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
- Quantum State Isomorphism
Cited by in corpus (7)
- Importance of the spectral gap in estimating ground-state energies
- The complexity of simulating local measurements on quantum systems
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
- A fidelity measure for quantum states based on the matrix geometric mean
- The 7 faces of quantum NP
- Towards a quantum-inspired proof for IP = PSPACE
- The Acrobatics of BQP