The DOI matches its Crossref record.
Notes on the history of reversible computation
Abstract
We review the history of the thermodynamics of information processing, beginning with the paradox of Maxwell's demon; continuing through the efforts of Szilard, Brillouin, and others to demonstrate a thermodynamic cost of information acquisition; the discovery by Landauer of the thermodynamic cost of information destruction; the development of the theory of and classical models for reversible computation; and ending with a brief survey of recent work on quantum reversible computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
The role of relative entropy in quantum information theory
Vedral, V. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.197 · Cited by 1,166
Quantum networks for elementary arithmetic operations
Vedral, V., Barenco, A., & Ekert, A. (1996) · Physical Review A · doi:10.1103/physreva.54.147 · Cited by 806
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Quantum, classical, and total amount of correlations in a quantum state
Groisman, B., Popescu, S., & Winter, A. (2005) · Physical Review A · doi:10.1103/physreva.72.032317 · Cited by 615
The physical nature of information
Landauer, R. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00453-7 · Cited by 517
Sterling, P., & Laughlin, S. (2015) · doi:10.7551/mitpress/9780262028707.001.0001 · Cited by 482
Algorithmic randomness and physical entropy
Zurek, W. H. (1989) · Physical Review A · doi:10.1103/physreva.40.4731 · Cited by 364
Overview of nanoelectronic devices
Goldhaber-Gordon, D., Montemerlo, M. S., Love, J. C., Opiteck, G. J., & Ellenbogen, J. C. (1997) · Proceedings of the IEEE · doi:10.1109/5.573739 · Cited by 354
Thermodynamic cost of computation, algorithmic complexity and the information metric
Zurek, W. H. (1989) · Nature · doi:10.1038/341119a0 · Cited by 279
Probabilities from entanglement, Born’s rulepk=∣ψk∣2from envariance
Zurek, W. H. (2005) · Physical Review A · doi:10.1103/physreva.71.052105 · Cited by 261
DNA molecule provides a computing machine with both data and fuel
Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., & Shapiro, E. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0535624100 · Cited by 255
Fifty Years of Research on Self-Replication: An Overview
Sipper, M. (1998) · Artificial Life · doi:10.1162/106454698568576 · Cited by 231
Dissipation and noise immunity in computation and communication
Landauer, R. (1988) · Nature · doi:10.1038/335779a0 · Cited by 208
Minimal Energy Requirements in Communication
Landauer, R. (1996) · Science · doi:10.1126/science.272.5270.1914 · Cited by 191
Reversible electronic logic using switches
Merkle, R. C. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/002 · Cited by 178
Landauer, R. (1995) · Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences · doi:10.1098/rsta.1995.0106 · Cited by 124
Metadata
- Authors
- Bennett, C. H.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1988-01
- Volume
- 32
- Issue
- 1
- Pages
- 16-23
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W4253477627
- Cited by
- 289
- References
- 0
- FWCI
- 2.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.