Intuition on why entanglement may not permit communication faster than light.
THE FOLLOWING INTERPRETATION OF THE NO GO THEOREM INDICATES THE ESSENTIAL REASON OF THE NO GO IMPOSSIBILITY -
A particle in entanglement shows correlated properties at the places where its entangled partners are, but any deliberate change in the state of particle causes it to lose entanglement! Any experimental determination of the state of particle destroys subsequent entanglement.
How else can one reuse entanglement ?
To keep things simple
1. Same is used to indicate removal of perfect correlation between entangled pairs
2. Setting up by some number of all 1's etc
3. New bits can be dynamically entangled. Initially some entangled bits transported slower than light.
Let us assume that it is somehow possible to detect if a particle is encrypted or not. One can make many copies of entangled particle, sacrificing one copy per bit whenever experimented, hence does photon had the right value. So a pair+ is sacrificed per bit - one to get the value and one+ repeatedly killed to state the correctness or not of the data bit!
Detection of entangled-or-not is done comparing a pair of remote entangled photons, either same or not. This sacrifice can be done faster than light The killed pair result may be wrong, then correctness sent by another pair and so on. This sequence terminates as bad cases are halved every time! In the rare case of no verification in some m steps, all attempts fail and next bit of bitstream is used, as if repeat of this bit was made. So the encryption-sacrifice returns yes or maybe (chance <= 1/2^m).
Above is not practical as many steps require very fast computation and sequentiality.
How to make it practical
This algorithm is likely slow wrt light. But one can make very large number of copies to send in parallel!
THE FOLLOWING INTERPRETATION OF THE NO GO THEOREM INDICATES THE ESSENTIAL REASON OF THE NO GO IMPOSSIBILITY -
A particle in entanglement shows correlated properties at the places where its entangled partners are, but any deliberate change in the state of particle causes it to lose entanglement! Any experimental determination of the state of particle destroys subsequent entanglement.
How else can one reuse entanglement ?
To keep things simple
1. Same is used to indicate removal of perfect correlation between entangled pairs
2. Setting up by some number of all 1's etc
3. New bits can be dynamically entangled. Initially some entangled bits transported slower than light.
Let us assume that it is somehow possible to detect if a particle is encrypted or not. One can make many copies of entangled particle, sacrificing one copy per bit whenever experimented, hence does photon had the right value. So a pair+ is sacrificed per bit - one to get the value and one+ repeatedly killed to state the correctness or not of the data bit!
Detection of entangled-or-not is done comparing a pair of remote entangled photons, either same or not. This sacrifice can be done faster than light The killed pair result may be wrong, then correctness sent by another pair and so on. This sequence terminates as bad cases are halved every time! In the rare case of no verification in some m steps, all attempts fail and next bit of bitstream is used, as if repeat of this bit was made. So the encryption-sacrifice returns yes or maybe (chance <= 1/2^m).
Above is not practical as many steps require very fast computation and sequentiality.
How to make it practical
This algorithm is likely slow wrt light. But one can make very large number of copies to send in parallel!
No comments:
Post a Comment