18 search results - page 2 / 4 » Using Entanglement in Quantum Multi-prover Interactive Proof... |
COCO
2005
Springer
13 years 12 months ago
2005
Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
MSCS
2006
13 years 6 months ago
2006
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
COCO
2008
Springer
13 years 8 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
STOC
2000
ACM
13 years 10 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
FOCS
2008
IEEE
14 years 26 days ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...