The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Quantum mechanical computers
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“As originally conceived, quantum computers would indeed act strictly in accordance with U, but at some point a measurement is made causing a quantum state reduction R (with some randomness normally introduced).Accordingly, the output is in the form of a definite state in terms of classical bits.”
From Consciousness in the universe (2014) · cites this paper as [139]
In the citing paper
“In the standard picture of quantum computers [137][138][139], information is represented not just as bits of either 1 or 0, but during the U process, also as quantum superposition of both 1 and 0 together (quantum bits or 'qubits') where, moreover, large-scale entanglements among many qubits would also be involved.”
From Consciousness in the universe (2014) · cites this paper as [139]
In the citing paper
“For a 2-qubit case, one can use a CNOT for example to copy in the classical computational basis 30 : b j i 0 j i ! b j i b j i, if b j i 2 0 j i; 1 j i f g”
From Quantum generalisation of feedforward neural networks (2017) · cites this paper as [30]
In the citing paper
“in particular, some of the '2 bits in -1 bit out' functions the neuron can implement require 3 bits to be made reversible in this manner.”
From Quantum generalisation of feedforward neural networks (2017) · cites this paper as [30]
In the citing paper
“The classical neurons are firstly rendered reversible by adding ancillary bits.”
From Quantum generalisation of feedforward neural networks (2017) · cites this paper as [30]
Citations
Cites
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
Bicontinuous extensions of invertible combinatorial functions
Toffoli, T. (1981) · Theory of Computing Systems · doi:10.1007/bf01752388 · Cited by 107
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
Priese, L. (1976) · Journal of Cybernetics · doi:10.1080/01969727608927527 · Cited by 25
Flagged first, then by citations
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
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
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
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
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
Metadata
- Authors
- Feynman, R. P.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Feynman, Richard P.
- Venue
- Foundations of Physics
- Published
- 1986-06
- Volume
- 16
- Issue
- 6
- Pages
- 507-531
- ISSN
- 0015-9018 (ISSN-L)
- 1572-9516
- OpenAlex
- W2012206667
- Cited by
- 1,770
- References
- 5
- Citations by year
- 2026: 37 · 2025: 69 · 2024: 63 · 2023: 72 · 2022: 52 · 2021: 72 · 2020: 61 · 2019: 95 · 2018: 55 · 2017: 62 · 2016: 60 · 2015: 63 · 2014: 98 · 2013: 85 · 2012: 65
- FWCI
- 5.82
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Foundations of Physics (publishedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum computing hardware, physical limits of computation, quantum mechanics, quantum 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
