Quantum Information and Computation

OCT 01, 1995

A new quantum theory of communication and computation is emerging, in which the stuff transmitted or processed is not classical information, but arbitrary superpositions of quantum states.

DOI: 10.1063/1.881452

Charles H. Bennett

Thpheoretical computer scientists, like their counterparts in physics, suffer and benefit from a high level of intellectual machismo. They believe they have some of the biggest brains around, which they need to think about some of the hardest problems. Like mathematicians, they prove theorems and doubt the seriousness of those who don’t. Lately, however, theoretical computer scientists have sought the help of physicists in understanding quantum mechanics, a hard part of physics which they now believe has great significance for their own field.

This article is only available in PDF format

References

1. B. Schumacher, Phys. Rev. A 51, 2738 (1995).
2. D. DiVincenzo, Phys. Rev. A 51, 1015 (1995).https://doi.org/PLRAAN
3. A. Barenco, D. Deutsch, A. Ekert, R. Jozsa, Phys. Rev. Lett. 74, 4083 (1995).https://doi.org/PRLTAO
4. T. Sleator, H. Weinfurter, Phys. Rev. Lett. 74, 4087 (1995).https://doi.org/PRLTAO
5. R. Jozsa, B. Schumacher, J. Modern Optics 41, 2343 (1994).
6. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters, Phys. Rev. Lett. 70, 1895 (1993).https://doi.org/PRLTAO
7. C. H. Bennett, S. J. Wiesner, Phys. Rev. Lett. 69, 2881 (1992).https://doi.org/PRLTAO
8. P. W. Shor, Proc. of the 35th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, Calif. (1994), p. 124.
A. Ekert, R. Jozsa, “Shor’s quantum algorithm for factorising numbers,” preprint, Dept. of Mathematics and Statistics, Univ. of Plymouth, Plymouth, Devon, UK (1995).
9. D. Coppersmith, “An approximate Fourier transform useful in quantum factoring,” IBM Research Report RC19642, T. J. Watson Research Center, Yorktown Heights, N.Y. (1994).
R. Cleve, “A note on computing Fourier transforms by quantum programs,” preprint, Dept. of Computer Science, Univ. of Calgary, Calgary, Alberta, Canada (1994).
10. C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smolin, J. Cryptology 5, 3 (1992).https://doi.org/JOCREQ
11. For a review, see J. D. Franson, Opt. and Photonics News 6, 30 (March1995).
12. C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. Smolin, W. K. Wootters, “Purification of Noisy Entanglement, and Faithful Teleportation via Noisy Channels,” preprint, IBM T. J. Watson Research Center, Yorktown Heights, N.Y. (1995).
13. W. Unruh, Phys. Rev. A 51, 992 (1995).https://doi.org/PLRAAN
14. R. Landauer, Trans. R. Soc. London (to appear).
15. L. Davidovich, N. Zagury, M. Brune, J. M. Raimond, S. Haroche, Phys. Rev. A 50, R895 (1994).https://doi.org/PLRAAN
16. P. Berman, ed., Cavity QED, Advances in Atomic, Molecular, and Optical Phys., Suppl. 2, Academic, New York (1994).
17. J. I. Cirac, P. Zoller, Phys. Rev. Lett. 74, 4091 (1995).https://doi.org/PRLTAO

More about the Authors

Charles H. Bennett. J. Watson Research Center, Yorktown Heights, New York.