Sciweavers

28 search results - page 6 / 6
» Quantum Arthur-Merlin Games
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Unique Games with Entangled Provers are Easy
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...
Julia Kempe, Oded Regev, Ben Toner
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 7 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
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...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 5 months ago
The Physical World as a Virtual Reality
This paper explores the idea that the universe is a virtual reality created by information processing, and relates this strange idea to the findings of modern physics about the ph...
Brian Whitworth