Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems

Simple item page
dc.creatorCleve, Richard
dc.creatorGavinsky, Dmitry
dc.creatorJain, Rahul
dc.date2007-07-12
dc.date.accessioned2026-07-07T08:16:12Z
dc.date.available2026-07-07T08:16:12Z
dc.descriptionWe show that, for any language in NP, there is an entanglement-resistant constant-bit two-prover interactive proof system with a constant completeness vs. soundness gap. The previously proposed classical two-prover constant-bit interactive proof systems are known not to be entanglement-resistant. This is currently the strongest expressive power of any known constant-bit answer multi-prover interactive proof system that achieves a constant gap. Our result is based on an "oracularizing" property of certain private information retrieval systems, which may be of independent interest.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0707.1729
dc.identifierhttp://arxiv.org/abs/0707.1729
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133699
dc.subjectQuantum Physics
dc.titleEntanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems
dc.typetext

Files

Collections

arXiv