Quantum computing and communication

Advances in Computers

Volumn 56, Issue C, 2002, Pages 189-244

  Black, Paul E ^a   Kuhn, D Richard ^a   Williams, Carl J ^a  

^a NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 47749129900     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(02)80007-9     Document Type: Chapter

References (22)

1. Feynman R. Simulating physics with computers. International Journal of Theoretical Physics 21 6&7 (1982) 467-488
2. quant-ph/9508027. Shor P.W. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26 5 (1997) 1484-1509
3. Nielsen M.A., and Chuang I.L. Quantum Communication and Quantum Information (2000), Cambridge Unive. Press, Cambridge, UK
4. In: Lenstra A.K., and Lenstra Jr. H.W. (Eds). The Development of the Number Fields Sieve. Lecture Notes in Mathematics Vol. 1554 (1993), Springer-Verlag, Berlin
5. Schönhage A. Asymptotically fast algorithms for the numerical multiplication and division of polynomias with complex coefficients. Computer Algebra EUROCAM' 82. Lectures Notes in Computer Science Vol. 144 (1982), Springer-Verlag, Berlin 3-15
6. quant-ph/9809016. Rieffel E., and Polak W. An introduction to quantum computing for nonphysicists. ACM Computing Surveys 32 3 (2000) 300-335
7. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. of Royal Society London A 400 (1985) 97-117
8. Cleve R., Ekert A.K., Macchiavello C., and Mosca M. Quantum algorithms revisited. Proc. of Royal Society London A 454 (1998) 339-354
9. Grover L.K. A fast quantum mechanical algorithm for database search. 28th Annual ACM Symposium on the Theory of Computation (1996), ACM Press, New York 212-219
10. quant-ph/9605043. Grover L.K. A fast quantum mechanical algorithsm for database search (1996)
11. quant-ph/9602002. Ekert A.K., and Macchiavello C. Quantum error correction for communication. Physical Review Letters 77 (1996) 2585-2588
12. quantph/9608012. Knill E., and LaFlamme R. Concatenated quantum codes (1996)
13. Knill E., and LaFlamme R. A theory of quantum error-correcting codes. Phys. Rev. A 55 (1997) 900
14. Wright P. Spy Catcher: The Candid Autobiography of a Senior Intelligence Officer (1987), Viking Penguin, New York
15. Bennett C.H., and Brassard G. Proc. IEEE International Conf, on Computes, Systems and Signal Processing. Bangalore, India (1984), IEEE, New York 175
16. National Institute of Standards and Technology. A statistical test suite for random and pseudorandom number generators for cryptographic applications. SP (2000) 800-802
17. Brassard G., and Crépeau C. 25 years of quantum cryptography. SIGACT News 27 3 (1996) 13-24
18. Bennett C.H., Brassard G., Crépeau C., and Maurer U.M. Generalized privacy amplification. IEEE Transactions on Information Theory 41 6 (1995) 1915-1923
19. C/Alto del Leon 8, 4A, 28038 Madrid, Spain, May 21, quant-ph/0105096. Cereceda J.L. Quantum dense coding using three qubits (2001)
20. Gorbachev, V. N., Zhiliba, A. I., Trubilko, A. I., Yakovleva, E. S. "Telepoertation of entangled states and dense coding using a multiparticle quantum channels", quantph/0011124
21. Deutsch D., Barenco A., and Ekert A. Universality in quantum computation. Proc. of Royal Society London A 499 (1995) 669-677
22. Bell J.S. On the Einstein-Podosky-Rosen Paradox. Physics 1 (1964) 195-200