Quantum mechanical computers

@article{Feynman2018QuantumMC,
  title={Quantum mechanical computers},
  author={Richard Phillips Feynman},
  journal={Foundations of Physics},
  year={2018},
  volume={16},
  pages={507-531}
}
  • R. Feynman
  • Published 18 June 1984
  • Physics
  • Foundations of Physics
The physical limitations, due to quantum mechanics, on the functioning of computers are analyzed. 
View on Springer
54 Citations
Highly Influential Citations
7
Background Citations
14
Methods Citations
5

54 Citations

Halting probability amplitude of quantum computers
The classical halting probability Ω introduced by Chaitin is generalized to quantum computations.
Quantum Engineering: Theory and Design of Quantum Coherent Structures
1. Quantum mechanics for quantum engineers 2. Superconducting quantum circuits 3. Quantum devices based on two-dimensional electron gas 4. Superconducting multiqubit devices 5. Noise and decoherence…
Hybrid Quantum Computing
TLDR
Necessary and sufficient conditions are given for the construction of a hybrid quantum computer that operates on both continuous and discrete quantum variables that are more efficient than conventional quantum computers for performing a variety of quantum algorithms.
Quantum computing with neutral atoms
TLDR
A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits.
Controlling photons in a box and exploring the quantum to classical boundary (Nobel Lecture).
TLDR
This lecture starts by an introduction stressing the connection between the ENS photon box and the ion trap experiments of David Wineland, whose accompanying lecture recalls his own contribution to the field of single particle control.
Geometry of quantum computation
Preface Basic of Quantum Computation Quantum Computers Based on Exactly Solvable Models & Geometric Phases Quantum Processor Based on the Three-Level Quantum System Methods of Geometric Control…
Quantum entanglement of unitary operators on bipartite systems
We study the entanglement of unitary operators on d 1 ×d 2 quantum systems. This quantity is closely related to the entangling power of the associated quantum evolutions. The entanglement of a class…
A no-go theorem for halting a universal quantum computer
TLDR
It is proved that, under very general and desirable assumptions, it is not possible to check for halting a universal quantum computer without losing the quantum computation.
Introduction from Quantum Physics to Quantum Technology
In the overview of the report on physics published under the direction of W.F. Brinkman: Physics through the 1990’s (1), one can read about quantum mechanics that it illustrates the unpredictable…
Why quantum engineering
Progress in experimental techniques and theoretical modeling has made it possible to fabricate and test macroscopic structures which use quantum coherent solid state qubits as building blocks. The…
...
...

References

SHOWING 1-4 OF 4 REFERENCES
Bicontinuous extensions of invertible combinatorial functions
  • T. Toffoli
  • Mathematics
    Mathematical systems theory
  • 2005
TLDR
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.
The thermodynamics of computation—a review
Computers may be thought of as engines for transforming free energy into waste heat and mathematical work. Existing electronic computers dissipate energy vastly in excess of the mean thermal…
Logical reversibility of computation
TLDR
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.
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
TLDR
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.