Entangled games do not require much entanglement (withdrawn)

Details Entangled games do not require much entanglement (withdrawn) Entangled games do not require much entanglement (withdrawn)

2009-08-24

arxiv.org/abs/0908.3491v2

Physics

Quantum Physics

Withdrawn. I found a mistake in my proof. This one-page replacement note explains the problem in more detail. Sorry, everyone

Scientific paper

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qubit answers can be implemented exactly by players who share an entangled state of no more than 5n qubits--a bound which is optimal to within a factor of 5/2. Previously, no upper bound at all was known on the amount of entanglement required even to approximate such a strategy. It follows that the problem of computing the value of these games is in NP, whereas previously this problem was not known to be computable.

Affiliated with

Also associated with

No associations

Rating

Entangled games do not require much entanglement (withdrawn) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Entangled games do not require much entanglement (withdrawn), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entangled games do not require much entanglement (withdrawn) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232522