CoChat
Sign Up
Cited by 1,770Quantum Computing Algorithms and ArchitectureQuantum Mechanics and ApplicationsQuantum Information and Cryptography

Quantum mechanical computers

Feynman, Richard P.·1986·Foundations of Physics
DOI 10.1007/bf01886518
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/bf01886518

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • As originally conceived, quantum computers act strictly in accordance with U, but at some point a measurement causes quantum state reduction R, so output is definite classical bits.

    “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 standard picture of quantum computers, information is represented not just as bits of 1 or 0, but during the U process also as quantum superposition of both 1 and 0 together (qubits), with large-scale entanglements among many qubits.

    “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]

  • A CNOT can copy a qubit in the classical computational basis: |b>|0> -> |b>|b> for |b> in {|0>,|1>}.

    “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]

  • Some 2-bit-in-1-bit-out functions implemented by a classical neuron require 3 bits to be made reversible by adding a dummy input bit.

    “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]

  • Classical neurons can be rendered reversible by adding ancillary bits.

    “The classical neurons are firstly rendered reversible by adding ancillary bits.”

    From Quantum generalisation of feedforward neural networks (2017) · cites this paper as [30]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Related

Authors
Feynman, R. P.
Affiliations
California Institute of Technology (US)
Corresponding author
Feynman, Richard P.
Venue
Foundations of Physics
Publisher
Springer Science and Business Media LLC
Published
1986-06
Volume
16
Issue
6
Pages
507-531
ISSN
  • 0015-9018 (ISSN-L)
  • 1572-9516
DOI
10.1007/bf01886518
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 › Computer Science › Artificial Intelligence › 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