Write
262
edits
Device-Independent Quantum Key Distribution: Difference between revisions
→Pseudocode
| Line 82: | Line 82: | ||
#Using <math>B_1^n</math> and <math>\tilde{B}_1^n</math>, Bob sets <math>C_i</math> | #Using <math>B_1^n</math> and <math>\tilde{B}_1^n</math>, Bob sets <math>C_i</math> | ||
##'''If''' <math>T_i=1</math> and <math>A_i\oplus B_i=X_i\cdot Y_i</math> '''then''' <math>C_i=1</math> | ##'''If''' <math>T_i=1</math> and <math>A_i\oplus B_i=X_i\cdot Y_i</math> '''then''' <math>C_i=1</math> | ||
##'''If''' <math>T_i=1</math> and <math>A_i\oplus B_i | ##'''If''' <math>T_i=1</math> and <math>A_i\oplus B_i\neq X_i\cdot Y_i</math> '''then''' <math>C_i=0</math> | ||
## '''If''' <math>T_i= | ## '''If''' <math>T_i=0</math> '''then''' <math>C_i=\bot</math> | ||
# He aborts '''If''' <math>\sum_j C_{j}<m\times (\omega_{exp}-\delta_{est})(1-(1-\gamma)^{s_{\max}})</math>, i.e., if they do not achieve the expected violation. | # He aborts '''If''' <math>\sum_j C_{j}<m\times (\omega_{exp}-\delta_{est})(1-(1-\gamma)^{s_{\max}})</math>, i.e., if they do not achieve the expected violation. | ||
''For the summation in 3.2 we use the convention that <math>\forall x\in \{0,1,\bot\},\ x+\bot=\bot+x=x</math>, that is <math>\bot</math> acts as <math>0</math> with respect to the addition.'' | |||
'''4.''' Privacy amplification | '''4.''' Privacy amplification | ||