Conservative logic
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 49,574 · see citing works
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283 · see citing works
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 · see citing works
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · see citing works
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523 · see citing works
Self-citationBenioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · see citing works
Universal upper bound on the entropy-to-energy ratio for bounded systems
Bekenstein, J. D. (1981) · Physical Review D · doi:10.1103/physrevd.23.287 · Cited by 1,182 · see citing works
Cooperative phenomena in systems far from thermal equilibrium and in nonphysical systems
Haken, H. (1975) · Reviews of Modern Physics · doi:10.1103/revmodphys.47.67 · Cited by 1,000 · see citing works
Ohanian, H. C., & RUFFINI, R. J. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139003391 · Cited by 494 · see citing works
Principles of statistical mechanics : the information theory approach
Katz, A. (1967) · W.H. Freeman eBooks · Cited by 253 · see citing works
Energy cost of information transfer
Bekenstein, J. D. (1981) · Physical Review Letters · doi:10.1103/physrevlett.46.623 · Cited by 252 · see citing works
Computation and construction universality of reversible cellular automata
Toffoli, T. (1977) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(77)80007-x · Cited by 210 · see citing works
Self-citationDissipation-error tradeoff in proofreading
Bennett, C. H. (1979) · Biosystems · doi:10.1016/0303-2647(79)90003-0 · Cited by 152 · see citing works
Bicontinuous extensions of invertible combinatorial functions
Toffoli, T. (1981) · Theory of Computing Systems · doi:10.1007/bf01752388 · Cited by 107 · see citing works
Self-citationWanted: a physically possible theory of physics
Landauer, R. W. (1967) · IEEE Spectrum · doi:10.1109/mspec.1967.5215588 · Cited by 47 · see citing works
Femtojoule Josephson tunneling logic gates
Herrell, D. (1974) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1974.1050513 · Cited by 42 · see citing works
Design Principles for Achieving High-Performance Submicron Digital Technologies
Fredkin, E., & Toffoli, T. (2002) · Springer eBooks · doi:10.1007/978-1-4471-0129-1_2 · Cited by 31 · see citing works
Self-citationON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
Priese, L. (1976) · Journal of Cybernetics · doi:10.1080/01969727608927527 · Cited by 25 · see citing works
On Magnetic Bubble Logic Circuits
Kinoshita, K., Sasao, T., & Matsuda, J. (1976) · IEEE Transactions on Computers · doi:10.1109/tc.1976.5009251 · Cited by 19 · see citing works
Physical Uncertainty and Information
Keyes (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674737 · Cited by 10 · see citing works
Eigen, M., Klein, E., Kühn, H., et al. (1976) · Berichte der Bunsengesellschaft für physikalische Chemie · doi:10.1002/bbpc.19760801102 · Cited by 2 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · 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
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770 · see citing works
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Computation at the edge of chaos: Phase transitions and emergent computation
Langton, C. G. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90064-v · Cited by 1,527 · see citing works
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
Milburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440 · see citing works
Direct Estimations of Linear and Nonlinear Functionals of a Quantum State
Ekert, A. K., Alves, C. M., Oi, D. K. L., Horodecki, M., Horodecki, P., & Kwek, L. C. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.217901 · Cited by 427 · see citing works
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405 · see citing works
Reversible electronic logic using switches
Merkle, R. C. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/002 · Cited by 178 · see citing works
Jones, J. A. (2001) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/s0079-6565(00)00033-9 · Cited by 177 · 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
Universal logic with encoded spin qubits in silicon
Weinstein, A. J., Reed, M. D., Jones, A. M., Andrews, R. W., Barnes, D., Blumoff, J. Z., Euliss, L. E., Eng, K., Fong, B. H., Ha, S. D., et al. (2023) · Nature · doi:10.1038/s41586-023-05777-3 · Cited by 124 · see citing works
A coherent perceptron for all-optical learning
Tezak, N., & Mabuchi, H. (2015) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-015-0023-3 · Cited by 22 · see citing works
Necessary and Sufficient Conditions for Quantum Computation
Lloyd, S. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552341 · Cited by 19 · see citing works
Lattice physics approaches for neural networks
Bardella, G., Franchini, S., Pani, P., & Ferraina, S. (2024) · iScience · doi:10.1016/j.isci.2024.111390 · Cited by 17 · see citing works
- Authors
- Fredkin, E., & Toffoli, T.
- Affiliations
- Massachusetts Institute of Technology (US)
- ORCID
- Toffoli, Tommaso
- Venue
- International Journal of Theoretical Physics
- Published
- 1982-04
- Volume
- 21
- Issue
- 3-4
- Pages
- 219-253
- ISSN
- 0020-7748 (ISSN-L)
- 1572-9575
- OpenAlex
- W4251109627
- Cited by
- 1,896
- References
- 21
- Citations by year
- 2026: 31 · 2025: 72 · 2024: 60 · 2023: 75 · 2022: 72 · 2021: 82 · 2020: 68 · 2019: 81 · 2018: 87 · 2017: 86 · 2016: 86 · 2015: 78 · 2014: 83 · 2013: 79 · 2012: 83
- FWCI
- 12.56
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- International Journal of Theoretical Physics (publishedVersion)
- 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, energy conservation (physics), sequential circuits, switching theory, universal computation, elastic collisions, kinetic theory of gases, high-performance computing
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