Have You Heard of Non-Local Machines for Simulating EPR States?

  • Context: Graduate 
  • Thread starter Thread starter seratend
  • Start date Start date
  • Tags Tags
    Entanglement
Click For Summary
SUMMARY

The discussion centers on the paper by Cerf, Gisin, Massar, and Popescu, titled "Hidden Variable Model of EPR State with a Hidden Communication Channel," which introduces the concept of non-local machines (PR-machines) for simulating EPR-like states. The paper outlines three levels of communication: e-bits, nl-bits, and real bits, highlighting the relationships and distinctions between them. The authors demonstrate that real bits can exceed nl-bits and e-bits in terms of information transmission, although superluminal transmission remains physically impossible. This innovative approach provides a fresh perspective on entanglement and classical physics representation of EPR states.

PREREQUISITES
  • Understanding of quantum entanglement and EPR states
  • Familiarity with Bell's inequality and CHSH inequality
  • Knowledge of hidden variable theories in quantum mechanics
  • Basic grasp of quantum information theory concepts
NEXT STEPS
  • Read the paper "Hidden Variable Model of EPR State with a Hidden Communication Channel" by Cerf et al. on arXiv
  • Explore the implications of non-local machines in quantum computing
  • Investigate the practical applications of e-bits and nl-bits in quantum communication
  • Study the limitations and challenges of superluminal communication in theoretical physics
USEFUL FOR

Researchers, physicists, and students interested in quantum mechanics, particularly those focused on quantum entanglement, hidden variable theories, and the implications of non-locality in quantum communication.

seratend
Messages
318
Reaction score
1
Hi everybody,


For the ones interested by a hidden variable model of EPR state with a hidden communication channel , I recommend the last Cerf, Gisisn Massar and Popescu quant-ph/0410027 paper (4 pages – a short concise one). I think it is a good one (with the pointers it gives).
It introduces a possible (logical) implementation of the EPR like state with what they call the non-local machines (PR- machines, I like the “machine” term they chosen rather than “interaction” :-p ): We have another different look to the EPR like states (and the cost to represent them by "classical physics") .

All the comments are welcome.

Seratend.
 
Physics news on Phys.org
The url for the article is http://arxiv.org/abs/quant-ph/0410027

They define three levels of communication:

(1) the information communicated through the nonlocality of quantum entanglement, which does not permit any detectable signaling, but which produces correlations that are impossible under local hidden variable models. An 'e-bit' is defined as the amount of information contained in an entanglement.

(2) The maximum amount that Bell's inequality (actually the CHSH inequality) can be violated through a nonlocal correlation that does not actually communicate a bit (this is a 'nl-bit'). Basically, they show how to make a machine that violates the inequality even more than quantum mechanics does, by using non-locality but not actually transmitting anything detectable,

(3) superluminal transmission of a real bit from A to B, which is a real signal, but physically impossible (so far).

They then demonstrate a measure > such that:
real bit > nl-bit > e-bit.

Bruce
 


Thank you for sharing this paper, Seratend. I find the concept of non-local machines to be very interesting and it definitely offers a different perspective on EPR states. It is always valuable to explore alternative ways of understanding and simulating entanglement. I will definitely take a look at this paper and share my thoughts. Thank you again for the recommendation and for opening up the discussion to others. I look forward to reading the paper and joining in on the conversation.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 47 ·
2
Replies
47
Views
6K
  • · Replies 23 ·
Replies
23
Views
6K
  • · Replies 23 ·
Replies
23
Views
5K
  • · Replies 45 ·
2
Replies
45
Views
7K
  • · Replies 37 ·
2
Replies
37
Views
8K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 11 ·
Replies
11
Views
5K