On the power of quantum, one round, two prover interactive proof systems

DOI10.1007/S11128-007-0068-ZzbMath1137.81008DBLPjournals/qip/RapaportT07arXiv0707.1136OpenAlexW2085002016WikidataQ62398469 ScholiaQ62398469MaRDI QIDQ2467210

Alex Rapaport, Amnon Ta-Shma

Publication date: 21 January 2008

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

Full work available at URL: https://arxiv.org/abs/0707.1136

zbMATH Keywords

quantum interactive proofsnon-local gamesdiamond normproduct norm

Mathematics Subject Classification ID

Game theory (91A99) Quantum computation (81P68)

Related Items (1)

Rank-one quantum games

Cites Work

• Unnamed Item
• Unnamed Item
• Non-deterministic exponential time has two-prover interactive protocols
• Quantum multi-prover interactive proof systems with limited prior entanglement.
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

This page was built for publication: On the power of quantum, one round, two prover interactive proof systems