28 search results - page 5 / 6 » Quantum Arthur-Merlin Games |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
CORR
2010
Springer
13 years 19 days ago
2010
Springer
FCT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
DAGSTUHL
2007
13 years 7 months ago
2007
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...
COCO
2007
Springer
13 years 12 months ago
2007
Springer
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...