Pages that link to "Item:Q2906789"
From MaRDI portal
The following pages link to On QMA protocols with two short quantum proofs (Q2906789):
Displaying 14 items.
- Epsilon-net method for optimizations over separable states (Q496030) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Quantum Arthur-Merlin games (Q814420) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Shorter unentangled proofs for ground state connectivity (Q1993802) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Quantum interactive proofs and the complexity of separability testing (Q2941643) (← links)
- Quantum versus classical proofs and advice (Q3002783) (← links)
- The power of unentanglement (Q3002799) (← links)
- (Q3002832) (← links)
- Quantum hedging in two-round prover-verifier interactions (Q4637979) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2) (Q5005160) (← links)
- Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur? (Q5414574) (← links)
- Improved soundness for QMA with multiple provers (Q5414620) (← links)