Protecting information: From classical error correction to quantum cryptography

Protecting Information: From Classical Error Correction to Quantum Cryptography

Volumn 9780521827409, Issue , 2006, Pages 1-287

  Loepp, Susan ^a   Wootters, William K ^a  

^a WILLIAMS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM OPTICS; QUANTUM THEORY;

COMPLEX NUMBER; DIGITAL INFORMATION; POTENTIAL IMPACTS; PRIOR KNOWLEDGE; PUBLIC KEY CRYPTOSYSTEMS; QUANTUM COMPUTING; QUANTUM INFORMATION THEORY; QUANTUM PHYSICS;

CRYPTOGRAPHY;

EID: 84924440871     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511813719     Document Type: Book

References (86)

1. Barenco, A., C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A 52, 3457–3467 (1995).
2. Barrett, M. D., J. Chiaverini, T. Schaetz, J. Britton, W. M. Itano, J. D. Jost, E. Knill, C. Langer, D. Leibfried, R. Ozeri, and D. J. Wineland, “Deterministic quantum teleportation of atomic qubits,” Nature 429, 737 (2004).
3. Benenti, G., G. Casati, and G. Strini, Principles of Quantum Computation and Information, Volume I: Basic Concepts (World Scientific, Singapore, 2004).
4. Bennett, C. H., “Logical reversibility of computation,” IBM J. Res. Develop. 17, 525–532 (1973).
5. Bennett, C. H., F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,” J. Cryptol. 5, 3–28 (1992).
6. Bennett, C. H., and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984 (IEEE, New York, 1984), pp. 175–179.
7. Bennett, C. H., G. Brassard, and J.-M. Robert, “Privacy amplification by public discussion,” SIAM J. Comput. 17, 210–229 (1988).
8. Bennett, C. H., G. Brassard, and A. K. Ekert, “Quantum cryptography,” Sci. Am. 267(4), 50 (Oct. 1992).
9. Bennett, C. H., G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels,” Phys. Rev. Lett. 70, 1895–1899 (1993).
10. Bennett, C. H., G. Brassard, C. Crépeau, and U. M. Maurer, “Generalized privacy amplification,” IEEE Trans. Inf. Theory, 41(6), 1915–1923 (Nov. 1995).
11. Bennett, C. H., G. Brassard, S. Popescu, B. Schumacher, J.A. Smolin, and W.K. Wootters, “Purification of noisy entanglement and faithful teleportation via noisy channels,” Phys. Rev. Lett. 76, 722–725 (1996a).
12. Bennett, C. H., D.P. DiVincenzo, J.A. Smolin, and W.K. Wootters, “Mixed state entanglement and quantum error correction,” Phys. Rev. A 54, 3824 (1996b).
13. Berrou, C., A. Glavieux, and P. Thitimijashima, “Near Shannon limit error-correction coding and decoding: Turbo codes,” in Proceedings of the 1993 IEEE International Conference on Communications, Geneva, Switzerland, 1993, pp. 1064–1070.
14. Biham, E., M. Boyer, P. O. Boykin, T. Mor, and V. Roychowdhury, “A proof of the security of quantum key distribution,” in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (ACM Press, New York, 2000).
15. Bouwmeester, D., A. K. Ekert, and A. Zeilinger, editors, The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation (Springer, Berlin, 2000).
16. Brassard, G., and L. Salvail, “Secret-key reconciliation by public discussion,” Lect. Notes Comput. Sci. 765, 410–423 (1993).
17. Briegel, H.-J., W. Dür, J. I. Cirac, and P. Zoller, “Quantum repeaters: The role of imperfect local operations in quantum communication,” Phys. Rev. Lett. 81, 5932–5935 (1998).
18. Boykin, P. O., T. Mor, M. Pulver, V. Rowchowdhury, and F. Vatan, “On universal and fault-tolerant quantum computing:Anovel basis and a new constructive proof of universality for Shor’s basis,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS’99) (IEEE Computer Society Press, Los Alamitos, CA, 1999), pp. 486–494.
19. Chau, H. F., “Practical scheme to share a secret key through a quantum channel with a 27.6% bit error rate,” Phys. rev. A 66, 60302 (2002).
20. Chor, B., O. Goldreich, J. Hastad, J. Friedmann, S. Rudich, and R. Smolensky, “The bit extraction problem of t-resilient functions,” in Proceedings of the 26thIEEESymposium on Foundations of Computer Science, Portland, Oregon, 1985, pp. 396–407.
21. Chuang, I. L., N. Gershenfeld, and M. Kubinec, “Experimental implementation of fast quantum searching,” Phys. Rev. Lett. 80, 3408–3411 (1998).
22. Coppersmith, D., “Modifications to the number field sieve,” J. Cryptology 6, 169–180 (1993).
23. Coppersmith, D., “An approximate Fourier transform useful in quantum factoring,” IBM Research Report RC 19642 (1994).
24. Crandall, R. and C. Pomerance, Prime Numbers: A Computational Perspective, 2nd edition (Springer, New York, 2005).
25. Dawson, C. M., and M. A. Nielsen, “The Solovay-Kitaev algorithm,” Quantum Inf. Comput. 6, 81–95 (2006).
26. Deutsch, D., A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera, “Quantum privacy amplification and the security of quantum cryptography over noisy channels,” Phys. Rev. Lett. 77, 2818–2821 (1996).
27. Deutsch, D., “Quantum theory, the Church-Turing Principle and the universal quantum computer,” Proc. Roy. Soc. Lond. A 400, 97 (1985).
28. Dieks, D. “Communication by EPR devices” Phys. Lett. A 92, 271–272 (1982).
29. DiVincenzo, D. P., “Two-bit gates are universal for quantum computation,” Phys. Rev. A 51, 1015–1022 (1995).
30. Dusek, M., N. Lutkenhaus, and M. Hendrych, “Quantum Cryptography,” e-print quant-ph/0601207, available at http://www.arXiv. org (2006).
31. Ekert, A. K., “Quantum cryptography based on Bell’s theorem” Phys. Rev. Lett. 67, 661–663 (1991).
32. Ekert, A., and R. Jozsa, “Quantum computation and Shor’s factoring algorithm,” Rev. Mod. Phys. 68, 733–753 (1996).
33. Elliott, C., A. Colvin, D. Pearson, O. Pikalo, J. Schlafer, and H. Yeh, “Current status of theDARPAQuantum Network,” e-print quant-ph/0503058, available at http://www.arXiv.org (2005).
34. Fuchs, C. A., N. Gisin, R. B. Griffiths, C.-S. Niu, and A. Peres, “Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy,” Phys. Rev. A 56, 1163–1172 (1997).
35. Gallager, R.G. Low-Density Parity-Check Codes (MIT Press, Cambridge, MA, 1963).
36. Gallian, Joseph A. Contemporary Abstract Algebra, 6th ed. (Houghton Mifflin, Boston, 2006).
37. Gerjuoy, E., “Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers,” Am. J. Phys. 73, 521 (2005).
38. Gisin, N., G. Ribordy, W. Tittel, and H. Zbinden, “Quantum cryptography,” Rev. Mod. Phys. 74, 145–195 (2002).
39. Greenstein, George, and Arthur G. Zajonc, The Quantum Challenge: Modern Research on the Foundations of Quantum Mechanics (Jones and Bartlett, Sudbury, MA, 1997).
40. Griffiths, David J. Introduction to Quantum Mechanics (Prentice Hall, Englewood Cliffs, NJ, 1995).
41. Grover, L., “A fast quantum mechanical algorithm for database search,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (ACM Press, New York, 1996), pp. 212–219.
42. Grover, L., “Quantum mechanics helps in searching for a needle in a haystack,” Phys. Rev. Lett. 79, 325 (1997).
43. Hamming, R.W., “Error detecting and error correcting codes,” Bell Syst. Tech. J., 29, 147–160 (1950).
44. Hardy, G. H., and E.M. Wright, AnIntroduction to the Theory of Numbers, 4th ed. (Clarendon, Oxford, 1965).
45. Kahn, D., The Codebreakers (Macmillan, New York, 1967).
46. Kitaev, A.Y.,“Quantumcomputations: Algorithms and error correction,” Russ. Math. Surv. 52, 1191–1249 (1997).
47. Koblitz, Neal, A Course in Number Theory and Cryptography (Springer- Verlag, New York, 1994).
48. Kraus, B., N. Gisin, and R. Renner, “Lower and upper bounds on the secret-key rate for quantum key distribution protocols using one-way classical communication,” Phys. Rev. Lett. 95, 080501 (2005).
49. Laflamme, R., C. Miquel, J.-P. Paz, and W. H. Zurek, “Perfect quantum error correction code,” Phys. Rev. Lett. 77, 198 (1996).
50. Leon, Steven J., Linear Algebra with Applications (Prentice Hall, Upper Saddle River, NJ, 2006).
51. Levy, Steven, Crypto: How the Code Rebels Beat the Government–Saving Privacy in the Digital Age (Viking, New York, 2001).
52. Lo, H.-K., and H. F. Chau, “Unconditional security of quantum key distribution over arbitrarily long distances,” Science 283, 2050 (1999).
53. Lo, H.-K., S. Popescu, and T. Spiller, editors, Introduction to Quantum Computation and Information (World Scientific, Singapore, 2001).
54. MacKay, D. J. C., and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electron. Lett. 32(18), 1645–1646 (1996).
55. Mayers, D., Lecture Notes in Computer Science, Vol. 1109 (Springer- Verlag, Berlin, 1996), p. 343.
56. Mayers, D., “Unconditional security in quantum cryptography,” JACM 48, 351–406 (2001).
57. Mermin, N. D., “From Cbits to Qbits: Teaching computer scientists quantum mechanics,” Am. J. Phys. 71, 23–30 (2003).
58. Nielsen, Michael A., and Isaac L. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, Cambridge, 2000).
59. Park, David, Introduction to the Quantum Theory, 3rd ed. (McGraw-Hill, New York, 1992).
60. Peres, Asher, Quantum Theory: Concepts and Methods (Kluwer, Dordrecht, 1995).
61. Piper, Fred, and Sean Murphy, Cryptography: A Very Short Introduction (Oxford Univ. Press, Oxford, 2002).
62. Pittenger, A. O., An Introduction to Quantum Computing Algorithms (Birkhäuser, Boston, 2000).
63. Pless, Vera, Introduction to the Theory of Error-Correcting Codes, 3rd ed. (Wiley, New York, 1998).
64. Pless, V., Huffman, W. C., editors, Handbook of Coding Theory, Vols. I and II (Elsevier, New York, 1998).
65. Preskill, J., “Fault-tolerant quantum computation,” in Quantum Information and Computation, edited by H.-K. Lo, T. Spiller, and S. Popescu (World Scientific, Singapore, 1998).
66. Preskill, J., Physics 229: Quantum Computation and Information, California Institute of Technology. URL: http://www.theory.caltech.edu/people/preskill/ph229/(2004).
67. Rényi, A., “On the foundations of information theory,” Rev. Int. Statist. Inst. 33, 1 (1965).
68. Riebe, M., H. Häffner, C. F. Roos, W. Hänsel, J. Benhelm, G. P. T. Lancaster, T. W. Körber, C. Becher, F. Schmidt-Kaler, D. F. V. James, and R. Blatt, “Deterministic quantum teleportation with atoms,” Nature 429, 734 (2004).
69. Rieffel, E. G., and W. Polak, “An introduction to quantum computing for non-physicists,” ACM Comput. Surv. 32, 300–335 (2000).
70. Sebag-Montefiore, Hugh, Enigma: The Battle for the Code (Wiley, New York, 2000).
71. Shannon, C. E., “A mathematical theory of communication,” Bell Syst. Tech. J., 27, 379–423, 623–656 (1948).
72. Shannon, C. E., “Communication theory of secrecy systems,” Bell. Sys. Tech. J. 28, 656 (1949).
73. Shor, P. W., “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society Press, Los Alamitos, CA, 1994), pp. 124–134.
74. Shor, P., “Scheme for reducing decoherence in a quantum computer memory,” Phys. Rev. A 52, 2493 (1995).
75. Shor, P. W. “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput. 26, 1484 (1997).
76. Shor, P.W., and J. Preskill, “Simple proof of security of the BB84 quantum key distribution protocol,” Phys. Rev. Lett. 85, 441 (2000).
77. Singh, Simon, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography (Random House, New York, 1999).
78. Stark, Harold M., An Introduction to Number Theory (The MIT Press, Cambridge, 1970).
79. Stinson, Douglas R., Cryptography: Theory and Practice, 2nd ed. (CRC Press, Boca Raton, FL, 2002).
80. Styer, D. F., The StrangeWorld of Quantum Mechanics (Cambridge Univ. Press, Cambridge, 2000).
81. Tang, X., L. Ma, A. Mink, A. Nakassis, H. Xu, B. Hershman, J.C. Bienfang, D. Su, R. F. Boisvert, C.W. Clark, and C. J. Williams. “Experimental study of high speed polarization-coding quantum key distribution with siftedkey rates over Mbit/s,” Optics Express 14, 2062 (2006).
82. Vandersypen, L. M. K., M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance,” Nature 414, 883– 887 (2001).
83. Welsh, Dominic, Codes and Cryptography (Oxford Univ. Press, Oxford, 1988).
84. Wiesner, S., “Conjugate coding,” SIGACT News 15, 77 (1983).
85. Wootters, W. K., and W. H. Zurek, “A single quantum cannot be cloned,” Nature 299, 802–803 (1982).
86. Yurke, B. and D. Stoler, “Bell’s-inequality experiments using independent-particle sources,” Phys. Rev. A 46, 2229 (1992).