Review of quantum computation [electronic resource].

Published: Washington, D.C. : United States. Dept. of Energy, 1992.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description: 7 pages : digital, PDF file
Additional Creators: Los Alamos National Laboratory, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information

Access Online

www.osti.gov

Availability

Finding items...

Restrictions on Access

Free-to-read Unrestricted online access

Summary

Digital computers are machines that can be programmed to perform logical and arithmetical operations. Contemporary digital computers are ``universal,`` in the sense that a program that runs on one computer can, if properly compiled, run on any other computer that has access to enough memory space and time. Any one universal computer can simulate the operation of any other; and the set of tasks that any such machine can perform is common to all universal machines. Since Bennett`s discovery that computation can be carried out in a non-dissipative fashion, a number of Hamiltonian quantum-mechanical systems have been proposed whose time-evolutions over discrete intervals are equivalent to those of specific universal computers. The first quantum-mechanical treatment of computers was given by Benioff, who exhibited a Hamiltonian system with a basis whose members corresponded to the logical states of a Turing machine. In order to make the Hamiltonian local, in the sense that its structure depended only on the part of the computation being performed at that time, Benioff found it necessary to make the Hamiltonian time-dependent. Feynman discovered a way to make the computational Hamiltonian both local and time-independent by incorporating the direction of computation in the initial condition. In Feynman`s quantum computer, the program is a carefully prepared wave packet that propagates through different computational states. Deutsch presented a quantum computer that exploits the possibility of existing in a superposition of computational states to perform tasks that a classical computer cannot, such as generating purely random numbers, and carrying out superpositions of computations as a method of parallel processing. In this paper, we show that such computers, by virtue of their common function, possess a common form for their quantum dynamics.

Report Numbers

E 1.99:la-ur--92-3339
E 1.99: conf-9208189--1
conf-9208189--1
la-ur--92-3339

Subject(s)

Other Subject(s)

Note

Published through SciTech Connect.
12/01/1992.
"la-ur--92-3339"
" conf-9208189--1"
"DE93003735"
International symposium on quantum physics in the universe,Tokyo (Japan),19-23 Aug 1992.
Lloyd, S.

Funding Information

W-7405-ENG-36

View MARC record | catkey: 13826205