Embezzlement States are Universal for Non-Local Strategies

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We prove that the family of embezzlement states defined by van Dam and Hayden [vanDamHayden2002] is universal for both quantum and classical entangled two-prover non-local games with an arbitrary number of rounds. More precisely, we show that for each $\epsilon>0$ and each strategy for a k-round two-prover non-local game which uses a bipartite shared state on 2m qubits and makes the provers win with probability $\omega$, there exists a strategy for the same game which uses an embezzlement state on $2m + 2m/\epsilon$ qubits and makes the provers win with probability $\omega-\sqrt{2\epsilon}$. Since the value of a game can be defined as the limit of the value of a maximal 2m-qubit strategy as m goes to infinity, our result implies that the classes QMIP*_{c,s}[2,k] and MIP*_{c,s}[2,k] remain invariant if we allow the provers to share only embezzlement states, for any completeness value c in [0,1] and any soundness value s < c. Finally we notice that the circuits applied by each prover may be put into a very simple universal form.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Embezzlement States are Universal for Non-Local Strategies 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 Embezzlement States are Universal for Non-Local Strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embezzlement States are Universal for Non-Local Strategies will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-284348

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.