scientific article; zbMATH DE number 5899305
From MaRDI portal
Publication:3002832
Recommendations
- On quantum interactive proofs with short messages
- Quantum multiprover interactive proofs with communicating provers
- Quantum interactive proofs with competing provers
- Quantum interactive proofs with weak error bounds
- Quantum interactive proofs and the complexity of separability testing
- On QMA protocols with two short quantum proofs
- Quantum multi-prover interactive proof systems with limited prior entanglement
- Constant-space quantum interactive proofs against multiple provers
- Interactive proofs with quantum finite automata
Cited in
(13)- PSPACE has constant-round quantum interactive proof systems
- Shorter unentangled proofs for ground state connectivity
- Quantum proofs
- Stronger methods of making quantum interactive proofs perfectly complete
- Stronger methods of making quantum interactive proofs perfectly complete
- Generalized quantum Arthur-Merlin games
- Distinguishing short quantum computations
- On quantum interactive proofs with short messages
- Quantum interactive proofs with competing provers
- Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
- Faithful squashed entanglement
- Quantum communication complexity of classical auctions
- Space-bounded quantum interactive proof systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002832)