BB84 Quantum Key Distribution: Difference between revisions

Jump to navigation Jump to search
m
no edit summary
mNo edit summary
Line 5: Line 5:
[[Category:Multi Party Protocols]] [[Category:Quantum Enhanced Classical Functionality]][[Category:Specific Task]][[Category:Prepare and Measure Network Stage]]
[[Category:Multi Party Protocols]] [[Category:Quantum Enhanced Classical Functionality]][[Category:Specific Task]][[Category:Prepare and Measure Network Stage]]


== Requirements ==
==Outline==
*'''Network Stage:''' [[:Category:Prepare and Measure Network Stage|Prepare and Measure]]
*'''Relevant Network Parameters:''' <math>\epsilon_T, \epsilon_M</math> (see [[:Category:Prepare and Measure Network Stage|Prepare and Measure]])
*'''Benchmark values:'''
**Minimum number of rounds ranging from <math>\mathcal{O}(10^2)</math> to <math>\mathcal{O}(10^5)</math> depending on the network parameters, for commonly used secure parameters.
**<math>QBER \leq 0.11</math>, taking a depolarizing model as benchmark. Parameters satisfying <math> \epsilon_T+\epsilon_M\leq 0.11</math> are sufficient.
*requires Authenticated classical channel, Random number generator.
 
==Example:==
===Outline===
----
----
The protocol shares a classical between two parties, sender (Alice) and receiver (Bob).
The protocol shares a classical between two parties, sender (Alice) and receiver (Bob).
Line 24: Line 15:
*'''Privacy amplification:''' Both use an [[extractor]] on the previously established string to generate a smaller but completely secret string of bits, which is the final key.
*'''Privacy amplification:''' Both use an [[extractor]] on the previously established string to generate a smaller but completely secret string of bits, which is the final key.


==Hardware Requirements ==
*'''Network Stage:''' [[:Category:Prepare and Measure Network Stage|Prepare and Measure]]
*'''Relevant Network Parameters:''' <math>\epsilon_T, \epsilon_M</math> (see [[:Category:Prepare and Measure Network Stage|Prepare and Measure]])
*'''Benchmark values:'''
**Minimum number of rounds ranging from <math>\mathcal{O}(10^2)</math> to <math>\mathcal{O}(10^5)</math> depending on the network parameters, for commonly used secure parameters.
**<math>QBER \leq 0.11</math>, taking a depolarizing model as benchmark. Parameters satisfying <math> \epsilon_T+\epsilon_M\leq 0.11</math> are sufficient.
*requires Authenticated classical channel, Random number generator.


===Notations Used===
==Notations Used==
**<math>n</math> number of total rounds of the protocol.
**<math>n</math> number of total rounds of the protocol.
**<math>\ell</math> size of the secret key.
**<math>\ell</math> size of the secret key.
Line 38: Line 36:
**<math>\epsilon_{\rm PA}</math> is the error probability of the privacy amplification protocol.
**<math>\epsilon_{\rm PA}</math> is the error probability of the privacy amplification protocol.
**<math>\epsilon_{\rm PE}</math> is the error probability of the parameter estimation.
**<math>\epsilon_{\rm PE}</math> is the error probability of the parameter estimation.
===Properties===
==Properties==
'''The protocol-'''
'''The protocol-'''
**is Information-theoretically secure
**is Information-theoretically secure
Line 54: Line 52:
(See [[Quantum Key Distribution]] for the precise security definition)
(See [[Quantum Key Distribution]] for the precise security definition)


===Pseudo Code===
==Pseudo Code==
----
----


Line 94: Line 92:
#Sender and Receiver run $PA(A_1^{n'},\tilde{B}_1^{n'})$ and obtain secret keys $K_A, K_B$\;
#Sender and Receiver run $PA(A_1^{n'},\tilde{B}_1^{n'})$ and obtain secret keys $K_A, K_B$\;


==Relevant Papers==
==Discussion==
Write, autoreview, editor, reviewer
3,125

edits

Navigation menu