Quantum Merlin Arthur with Exponentially Small Gap

Abstract

We study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we show that a "precise" version of the Local Hamiltonian problem is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states is not as powerful as the ability to prepare the ground state of general Local Hamiltonians.

References in corpus (1)

• Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions

Cited by in corpus (8)

• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Importance of the spectral gap in estimating ground-state energies
• Non-Unitary Quantum Computation in the Ground Space of Local Hamiltonians
• Quantum search-to-decision reductions and the state synthesis problem
• Space-Efficient Error Reduction for Unitary Quantum Computations
• Towards a quantum-inspired proof for IP = PSPACE
• QMA(2) with postselection equals to NEXP
• On polynomially many queries to NP or QMA oracles