Notes on the history of reversible computation

By Charles H. Bennett. IBM Journal of Research and Development, 2000

337 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Measurement-based quantum computation on cluster states (2003, background): “Before Landauer investigated the question of physical irreversibility of logical operations in the 1960’s, the commonly accepted opinion was that a computer operating at temperature T needs to dissipate at least an amount ln2 kT of energy per elementary act of operation processing, [12].”
Quantum Amplitude Amplification and Estimation (2000, methodology): “As usual in quantum algorithms one will need ﬁrst to modify the heuristic G : F × R → X to make it reversible, which can be done eﬃciently using standard techniques [2].”