The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Reversible logic and quantum computers
Abstract
This article is concerned with the construction of a quantum-mechanical Hamiltonian describing a computer. This Hamiltonian generates a dynamical evolution which mimics a sequence of elementary logical steps. This can be achieved if each logical step is locally reversible (global reversibility is insufficient). Computational errors due to noise can be corrected by means of redundancy. In particular, reversible error-correcting codes can be embedded in the Hamiltonian itself. An estimate is given for the minimum amount of entropy which must be dissipated at a given noise level and tolerated error rate.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
An Introduction to Probability Theory and its Applications.
Kingman, J. F. C., & Feller, W. (1972) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344620 · Cited by 4,938
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Switching and Finite Automata Theory
Kohavi, Z., & Jha, N. K. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511816239 · Cited by 1,766
Quantum Theory and Measurement
(1983) · Princeton University Press eBooks · doi:10.1515/9781400854554 · Cited by 1,357
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Macroscopic Quantum Systems and the Quantum Theory of Measurement
Leggett, A. J. (1980) · Progress of Theoretical Physics Supplement · doi:10.1143/ptps.69.80 · Cited by 674
Cited by
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549
“Some 3-qubit unitaries with minimal depth implementations found include the well-known Toffoli gate (controlledCNOT ), Fredkin gate (controlled-SWAP), quantum OR (defined as the unitary mapping |a〉|b〉|c〉 → |a〉|b〉|c ⊕ a ∨ b〉), and Peres gate [22] (see Fig.”
BackgroundThe physical nature of information
Landauer, R. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00453-7 · Cited by 517
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · 38th International Symposium on Multiple Valued Logic (ismvl 2008) · doi:10.1109/ismvl.2008.43 · Cited by 495
Milburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440
Chuang, I. L., & Yamamoto, Y. (1995) · Physical Review A · doi:10.1103/physreva.52.3489 · Cited by 434
BDD-based synthesis of reversible logic for large functions
Wille, R., & Drechsler, R. (2009) · Proceedings of the 46th Annual Design Automation Conference · doi:10.1145/1629911.1629984 · Cited by 323
PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
KAY, A. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006514 · Cited by 319
Synthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
Hung, W. N. N., Song, X., Yang, G., Yang, J., & Perkowski, M. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.858352 · Cited by 261
Coherent quantum transport in photonic lattices
Perez-Leija, A., Keil, R., Kay, A., Moya-Cessa, H., Nolte, S., Kwek, L.-C., Rodríguez-Lara, B. M., Szameit, A., & Christodoulides, D. N. (2013) · Physical Review A · doi:10.1103/physreva.87.012309 · Cited by 182
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
Structural basis of multistationary quantum systems. I. Effective single-particle dynamics
Obermayer, K., Teich, W. G., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8096 · Cited by 48
MARGOLUS, N. (1986) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1986.tb12451.x · Cited by 38
Quantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
Quantum-mechanical computers and uncomputability
Lloyd, S. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.943 · Cited by 31
Necessary and Sufficient Conditions for Quantum Computation
Lloyd, S. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552341 · Cited by 19
Quantum error correction and fault tolerance: A comprehensive tutorial
Spencer, D. J., Jain, S. P., Tanggara, A., Sun, Z., Haug, T., Khu, D., & Bharti, K. (2026) · arXiv
Metadata
- Authors
- Peres, A.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1985-12-01
- Volume
- 32
- Issue
- 6
- Pages
- 3266-3276
- ISSN
- 0556-2791 (ISSN-L)
- OpenAlex
- W2003989103
- Cited by
- 892
- References
- 27
- FWCI
- 4.69
- 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.