Publisher
Springer Berlin Heidelberg
Reference44 articles.
1. L. Adleman, Molecular computation of solutions to combinatorial problems, Science, Vol 266, Nov 1994, 1021–1024; A Vat of DNA May Become Fast Computer Of the Future, Gina Kolata in: The New York Times, April 11, 1995, Science Times, pp. C1, C10.
2. A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVicenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, Elementary gates for quantum computation, submitted to Physical Review A, March 1995.
3. P. Benioff, J. Stat. Phys., 22 (1980), 563–591, also J. Math. Phys., 22(1981), 495–507, Int. J. Theoret. Phys., 21(1982), 177–201, Phys. Rev. Letters, 48(1982), 1581–1585, J. Stat. Phys., 29(1982), 515–546, Phys. Rev. Letters, 53(1984), 1203, Ann. New York Acad. Sci., 480(1986), 475–486.
4. P. Benioff, Review of quantum computation, In: Trends in Statistical Physics, Council of Scientific Information, Trivandrum, India, To be published.
5. C.H. Bennett. Logical reversibility of computation. IBM J. Res. Develop., 17:525–532, 1973.