Parallelization of entanglement-resistant multi-prover interactive proofs

DOI10.1016/j.ipl.2014.05.005zbMath1371.68088OpenAlexW2027107615MaRDI QIDQ2015158

Tsuyoshi Ito

Publication date: 23 June 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.05.005

zbMATH Keywords

computational complexityquantum computingquantum nonlocalityinteractive proof

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Using entanglement in quantum multi-prover interactive proofs
• Non-deterministic exponential time has two-prover interactive protocols
• PSPACE is provable by two provers in one round
• Entangled Games Are Hard to Approximate
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• The complexity of promise problems with applications to public-key cryptography
• Coding theorem and strong converse for quantum channels
• Computational Complexity
• Proposed Experiment to Test Local Hidden-Variable Theories
• Computational Complexity

This page was built for publication: Parallelization of entanglement-resistant multi-prover interactive proofs