On QMA protocols with two short quantum proofs
From MaRDI portal
Recommendations
Cited in
(19)- Limitations of semidefinite programs for separable states and entangled games
- Shorter unentangled proofs for ground state connectivity
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
- Quantum interactive proofs and the complexity of separability testing
- Quantum versus classical proofs and advice
- The power of unentanglement
- scientific article; zbMATH DE number 5899305 (Why is no real title available?)
- NP vs QMA\(_{\log}(2)\)
- Fast amplification of QMA
- Quantum hedging in two-round prover-verifier interactions
- Epsilon-net method for optimizations over separable states
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
- An improved semidefinite programming hierarchy for testing entanglement
- Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
- Improved soundness for QMA with multiple provers
- The power of unentangled quantum proofs with non-negative amplitudes
- Dimension independent disentanglers from unentanglement and applications
- Quantum Merlin-Arthur and proofs without relative phase
- Quantum Arthur-Merlin games
This page was built for publication: On QMA protocols with two short quantum proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906789)