Reversible Computing
Open accessAbstract
The theory of reversible computing is based on invertible primitives and composition rules that preserve invertibility. With these constraints, one can still satisfactorily deal with both functional and structural aspects of computing processes; at the same time, one attains a closer correspondence between the behavior of abstract computing systems and the microscopic physical laws (which are presumed to be strictly reversible) that underly any concrete implementation of such systems. According to a physical interpretation, the central result of this paper is that it is ideally possible to build sequential circuits with zero internal power dissipation . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Toffoli (and single) gates are universal.
“First, Toffoli (and single) gates are universal [33][34][35].”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [35]
Cited by
Sorted by citations
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works
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 · see citing works
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006 · see citing works
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · see citing works
Self-citationNuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
Cory, D. G., Price, M. D., & Havel, T. F. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00046-3 · Cited by 419 · see citing works
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183 · see citing works
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145 · see citing works
Kim, P., Han, D., & Jeong, K. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2107-3 · Cited by 80 · see citing works
“First, Toffoli (and single) gates are universal [33–35].”
Background
- Authors
- Toffoli, T.
- Affiliations
- Massachusetts Institute of Technology (US)
- Corresponding author
- Toffoli, Tommaso
- ORCID
- Toffoli, Tommaso
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1980
- Pages
- 632-644
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2912120411
- Cited by
- 1,523
- References
- 0
- Citations by year
- 2026: 30 · 2025: 41 · 2024: 42 · 2023: 41 · 2022: 47 · 2021: 58 · 2020: 54 · 2019: 73 · 2018: 67 · 2017: 78 · 2016: 91 · 2015: 84 · 2014: 112 · 2013: 90 · 2012: 89
- FWCI
- 1.31
- Type
- conference paper
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- cc-by-nc
- Locations
- Lecture notes in computer science (publishedVersion)
- Defense Technical Information Center (DTIC) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- International Colloquium on Automata, Languages and Programming
- Funders
- Office of Naval Research
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Keywords
- reversible computation, composition rules, sequential circuits, thermodynamics of computation
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
