Entanglement in Interactive Proof Systems with Binary Answers

DOI10.1007/11672142_12MaRDI QIDQ5449795zbMATH OpenOpenAlexFDO

Authors S. Wehner

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Using entanglement in quantum multi-prover interactive proofs
• Quantum multi-prover interactive proof systems with limited prior entanglement.
• scientific article; zbMATH DE number 1979492
• Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
• Parallelization of entanglement-resistant multi-prover interactive proofs

Cited in

(8)

• Using entanglement in quantum multi-prover interactive proofs
• Quantum hedging in two-round prover-verifier interactions
• Quantum free games
• Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's
• Generalized quantum Arthur-Merlin games
• Parallelization of entanglement-resistant multi-prover interactive proofs
• scientific article; zbMATH DE number 6292749 (Why is no real title available?)
• scientific article; zbMATH DE number 1979492 (Why is no real title available?)

This page was built for publication: Entanglement in Interactive Proof Systems with Binary Answers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449795)