Parallelization of entanglement-resistant multi-prover interactive proofs

DOI10.1016/J.IPL.2014.05.005zbMATH Open1371.68088OpenAlexW2027107615MaRDI QIDQ2015158FDOQ2015158

Authors: 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

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

zbMATH Keywords

computational complexityquantum computingquantum nonlocalityinteractive proof

Mathematics Subject Classification ID

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

Cites Work

• Computational Complexity
• Proposed Experiment to Test Local Hidden-Variable Theories
• Computational Complexity
• Non-deterministic exponential time has two-prover interactive protocols
• The complexity of promise problems with applications to public-key cryptography
• Entangled games are hard to approximate
• PSPACE is provable by two provers in one round
• Using entanglement in quantum multi-prover interactive proofs
• Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
• Coding theorem and strong converse for quantum channels
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing

Cited In (8)

• Constant-space quantum interactive proofs against multiple provers
• Perfect parallel repetition theorem for quantum XOR proof systems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)