Draft:Ekert 91 Protocol
![]() | Review waiting, please be patient.
This may take 2 months or more, since drafts are reviewed in no specific order. There are 2,407 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Ekert-91(E91) protocol[1], is a QKD(Quantum Key Distribution Protocol) developed by Artur Ekert in 1991.
It's a entanglement-based protocol with foundations in the CHSH Inequality and the monogamy of entanglement which states that if Alice and Bob share a maximally entangled state it's impossible for their measured state to share correlations with a third party.
This protocol is designed to be used in complement with the classical networks as it provides an interface for sharing a P2P secret key without public keys for data encryption, which is not vulnerable to quantum attacks in asymmetric keys(PPK).
CHSH Game
[edit]In simple terms, the CHSH game a referee sends the bits and to the non-communicating players and respectively, and they answer with the bits and also respectively. The condition for and to win is that:

Optimal classical strategy
[edit]As and can't communicate, the best classical strategy by checking the truth table for these variables is or which has a success rate of .
But this strategy does not account the values of and
Optimal quantum strategy
[edit]If and share an entangled bell state , then according to the CHSH Inequality it's possible to have a success rate.
Details and Assumptions
[edit]Alice and Bob should use for measuring the bell state a basis according with the values of and .

So it's the proof of concept that players and can acquire information about each other through the quantum channel.
Basis choosing
[edit]For choosing the basis, Alice and Bob will choose randomly one of 3 basis for measuring the value of each entangled qubit.

Although bits can only be transferred if the basis Alice and Bob coincide, the results of the measurement now can be used for validating the quantum connection.
After the transmission of the qubits, similarly to the BB84 protocol, they share the information in a public classical channel and the measurements which were not made in the same basis can be shared in this channel for calculating how close is the connection to a maximally entangled state, if it's above a certain threshold defined by the users, they can proceed to use the generated key for cryptography or start over.
Characteristics
[edit]- On average, 1 in 3 qubits are going to carry information about the key
- No qubits are discarded (except for the ones which decay)
- The entangled state is verifiable and measurable.
- The secret key bits are never shared through a classical channel
References
[edit]- ^ Ekert, Artur K. (1991-08-05). "Quantum cryptography based on Bell's theorem". Physical Review Letters. 67 (6): 661–663. doi:10.1103/PhysRevLett.67.661.
- ^ a b Hajdušek, Michal; Meter, Rodney Van (2023-11-04), Quantum Communications, arXiv, doi:10.48550/arXiv.2311.02367, arXiv:2311.02367, retrieved 2025-02-17