Quantum mechanical computers
Foundations of PhysicsPublished 1 June 1986
Richard P. Feynman
Citations1,701
SJR quartileQ1
SJR score0.48
SNIP0.83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The physical limitations, due to quantum mechanics, on the functioning of computers are analyzed.
Keywords
Computer SciencePhysics and Astronomy
IBM Journal of Research and DevelopmentLogical Reversibility of Computation
3,704 Citations1973C. H. Bennett
This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.
International Journal of Theoretical PhysicsThe thermodynamics of computation—a review
2,001 Citations1982Charles H. Bennett
The old Maxwell's demon problem is discussed in the light of the relation between logical and thermodynamic reversibility: the essential irreversible step, which prevents the demon from breaking the second law, is not the making of a measurement but rather the logically irreversible act of erasing the record of one measurement to make room for the next.
International Journal of Theoretical PhysicsConservative logic
1,843 Citations1982Edward Fredkin, Tommaso Toffoli
Theory of Computing SystemsBicontinuous extensions of invertible combinatorial functions
106 Citations1981Tommaso Toffoli
The solution of the problem of constructing a diffeomorphic componentwise extension for an arbitrary invertible combinatorial function constitutes a proof of the physical realizability of general computing mechanisms based on reversible primitives.
Journal of CyberneticsON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
25 Citations1976Lutz Priese
It can be shown that even in a world governed by this system M nontrivial self-reproduction can be established, thus illuminating what simple combinatorial structures allow for the handling of such logical somewhat difficult phenomenas as self-organization, self- reproduction, etc.