Sciweavers

18 search results - page 1 / 4
» Using Entanglement in Quantum Multi-prover Interactive Proof...
Sort
View
FOCS
2008
IEEE
13 years 12 months ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
14 years 4 months ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
14 years 20 days ago
Using Entanglement in Quantum Multi-prover Interactive Proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, ...
CADE
2010
Springer
14 years 6 hour ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 5 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...