1 |
G. Brassard and L. Salvail, "Secret key reconciliation by public discussion," Lecture Notes in Computer Science, vol. 765, pp. 410-423, 1994.
|
2 |
W. T. Buttler, S. K. Lamoreaux, J. R. Torgerson, G. H. Nickel, C. H. Donahue, and C. G. Peterson, "Fast, efficient error reconciliation for quantum cryptography," Physical Review A, vol. 67, no. 5, May 2003.
|
3 |
D. Elkouss, A. Leverrier, R. Alleaume, and J. J. Boutros, "Efficient reconciliation protocol for discretevariable quantum key distribution," in Information Theory, 2009 IEEE International Symposium, pp. 1879-1883. Jul. 2009.
|
4 |
C. H. Bennet, G. Brassard and J. Robert, "Privacy Amplification by Public Discussion" SIAM Journal on Computing Vol. 17 No. 2 Apr. 1988
|
5 |
C. H. Bennet, G. Brassard, C. Crepeau and U. M. Maurer, "Generalized Privacy Amplification" IEEE Transaction on Information Theory Vol. 41 No. 6 Nov. 1995
|
6 |
Richard P. Feynman, "Simulating Physics with Computers" International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982
|
7 |
David P. DiVincenzo, "The Physical Implementation of Quantum Computation", arXiv:quant-ph/0002077v3, 13-Apr-2000.
DOI
|
8 |
Peter W. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer"arXiv:quant-ph/9508027v2 1994
|
9 |
P. W. Shor, "Scheme for reducing decoherence in quantum computer memory," Phys. Rev. A vol. 52, num. 4, pp. 2493-2496 May. 1995.
DOI
|
10 |
Wootters, William; Zurek, Wojciech , " A Single Quantum Cannot be Cloned," Nature vol. 299 pp. 802-803, Oct. 1982.
DOI
|
11 |
Daniel Gottesman, "Stabilizer Codes and Quantum Error Correction," arXiv.org, vol. quant-ph. 28-May-1997.
|
12 |
Bruno Sanguinetti, Anthony Martin, Hugo Zbinden, Nicolas Gisin, "Quantum Random Number Generation on a Mobile Phone" Phys. Rev X vol 4, 031056. 2014
|