Quantum Merlin-Arthur and proofs without relative phase

DOI10.4230/LIPICS.ITCS.2024.9MaRDI QIDQ6906431zbMATH OpenFDO

Authors Roozbeh Bassirian, Bill Fefferman

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.9

zbMATH Keywords

PCPsQMA(2)quantum complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Copositive programming
• How hard is it to approximate the Jones polynomial?
• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• scientific article; zbMATH DE number 515467 (Why is no real title available?)
• scientific article; zbMATH DE number 7829286 (Why is no real title available?)
• MIP* = RE
• On QMA protocols with two short quantum proofs
• On the power of nonstandard quantum oracles
• ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES
• Proof verification and the hardness of approximation problems
• Proposed experiment to test local hidden-variable theories
• Quantifying the phase of quantum states
• Quantum free games
• Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
• Quantum lower bounds for approximate counting via Laurent polynomials
• Rigidity for monogamy-of-entanglement games
• Testing product states, quantum Merlin-Arthur games and tensor optimization
• The PCP theorem by gap amplification
• The power of unentangled quantum proofs with non-negative amplitudes

Cited in

(1)

• Dimension independent disentanglers from unentanglement and applications

This page was built for publication: Quantum Merlin-Arthur and proofs without relative phase

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906431)