Scinovex
articleTop 10% cited

Reversible logic and quantum computers

Physical review. A, General physics · 1985 · Vol. 32(6) · pp. 3266–3276
Asher Peres

Abstract

This article is concerned with the construction of a quantum-mechanical Hamiltonian describing a computer. This Hamiltonian generates a dynamical evolution which mimics a sequence of elementary logical steps. This can be achieved if each logical step is locally reversible (global reversibility is insufficient). Computational errors due to noise can be corrected by means of redundancy. In particular, reversible error-correcting codes can be embedded in the Hamiltonian itself. An estimate is given for the minimum amount of entropy which must be dissipated at a given noise level and tolerated error rate.

Quantum Computing Algorithms and ArchitectureComputability, Logic, AI AlgorithmsQuantum Information and CryptographyHamiltonian (control theory)QuantumComputer scienceQuantum computerStatistical physicsQuantum error correctionRedundancy (engineering)AlgorithmQuantum mechanicsPhysics
Citations
892
FWCI
8.12
field-weighted impact
References
31
Percentile
97%
vs. same field & year
Citations per year
Cited by
The physical nature of information
Physics Letters A · 1996 · 502 citations
Elementary gates for quantum computation
Physical Review A · 1995 · 4,250 citations
References
Quantum theory, the Church–Turing principle and the universal quantum computer
Proceedings of the Royal Society of London A Mathematical and Physical Sciences · 1985 · 4,530 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.