Some Publications by Charles H. Bennett

Bennett, C.H., "Logical Reversibility of Computation"(scanned pdf) IBM J. Res. Develop. 17, 525 (1973). Building on earlier work of IBM colleague Rolf Landauer, this paper shows that in principle there is no upper limit to the energy efficiency of computers—they can do an arbitrarily large number of steps of mathematical work per unit of physical energy converted into heat.

Bennett, Charles H. and Gill, John, "Relative to a Random Oracle A, P(A) is not equal to NP(A) is not equal to co-NP(A), With Probability 1"(scanned pdf) S.I.A.M. Journal on Computing 10, pp. 96-113 (1981). Shows that in a hypothetical world containing an infinite read-only memory filled with garbage, many of the big open questions of complexity theory, such as the P=NP problem, would have definite answers.

C.H. Bennett and G. Brassard "Quantum Cryptography: Public Key Distribution and Coin Tossing", Proceedings of IEEE International Conference on Computers Systems and Signal Processing, Bangalore India, December 1984, pp 175-179. Introduces quantum cryptography, a technique in which fundamental laws of physics protect the secrecy of communications.

A. Barenco, C.H. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, "Elementary Gates for Quantum Computation", Phys. Rev. A52, 3457-3467 (1995) eprint quant-ph/9503016 Shows that one- and two-qubit gates are sufficient for quantum computation, and develops many of the basic techniques of quantum programming.

Bennett, Charles H., "Dissipation-Error Tradeoff in Proofreading"(scanned pdf) BioSystems11, 85-91 (1979). Analyzes the speed/error/energy dissipation tradeoff of a model molecular computer patterned on the genetic apparatus.