论文信息 - Reversibility and stability of information processing systems

Reversibility and stability of information processing systems

Classical and quantum models of dynamically reversible computers are considered. Instabilities in the evolution of the classical ''billiard ball computer'' are analyzed and shown to result in a one-bit increase of entropy per step of computation. ''Quantum spin computers,'' on the other hand, are not only microscopically, but also operationally reversible. Readoff of the output of quantum computation is shown not to interfere with this reversibility. Dissipation, while avoidable in principle, can be used in practice along with redundancy to prevent errors.

Wojciech H. Zurek | W. H. Zurek | W. Zurek

[1] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .

[2] T. Toffoli. Physics and computation , 1982 .

[3] W. Porod,et al. Dissipation in Computation , 1984 .

[4] R. Landauer,et al. Minimal energy dissipation in logic , 1970 .

[5] J. Bekenstein. Energy Cost of Information Transfer , 1981 .

[6] P. Benioff. Quantum Mechanical Models of Turing Machines That Dissipate No Energy , 1982 .

[7] Charles H. Bennett,et al. The thermodynamics of computation—a review , 1982 .

[8] E. Sudarshan,et al. Zeno's paradox in quantum theory , 1976 .

[9] W. Zurek. Environment-induced superselection rules , 1982 .

[10] Measuring processes in quantum mechanics I. Continuous observation and the watchdog effect , 1981 .

[11] L. Szilard. über die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen , 1929 .

[12] R. Landauer. Uncertainty principle and minimal energy dissipation in the computer , 1982 .

[13] P. Benioff. Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines , 1982 .