Parallelization of entanglement-resistant multi-prover interactive proofs
From MaRDI portal
Publication:2015158
Recommendations
- Using entanglement in quantum multi-prover interactive proofs
- Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- scientific article; zbMATH DE number 1979492
- Entanglement in Interactive Proof Systems with Binary Answers
Cites work
- Coding theorem and strong converse for quantum channels
- Computational Complexity
- Computational Complexity
- Entangled games are hard to approximate
- Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Non-deterministic exponential time has two-prover interactive protocols
- PSPACE is provable by two provers in one round
- Proposed experiment to test local hidden-variable theories
- The complexity of promise problems with applications to public-key cryptography
- Using entanglement in quantum multi-prover interactive proofs
Cited in
(8)- Constant-space quantum interactive proofs against multiple provers
- Perfect parallel repetition theorem for quantum XOR proof systems
- scientific article; zbMATH DE number 6292749 (Why is no real title available?)
- Entanglement in Interactive Proof Systems with Binary Answers
- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
- Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
- Using entanglement in quantum multi-prover interactive proofs
- scientific article; zbMATH DE number 5568627 (Why is no real title available?)
This page was built for publication: Parallelization of entanglement-resistant multi-prover interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015158)