On the Speed of Quantum Computation
Feynman and Margolus have shown that a closed, locally interacting quantum system is capable of performing deterministic computation. Feynman's system computes in a serial way. Margolus was able to extend Feynman's ideas to get quantum description of a cellular automaton, i.e. a model which calculates in parallel. <p> In this, article, a new kind of speed limit for quantum computation is established. An upper bound on the average velocity (``instructions per second'') for both computers is derived. One would expect a cellular automaton to have a computational velocity which scales with the number {\it k} of its cells. However, the upper bound on the average velocity is only proportional to $\sqrt{k}$ in this case. This does not reflect the parallelism of the cellular automaton. Whether it is possible to construct a locally interacting quantum computer that really works in parallel remains an open problem.
Year of publication: |
1994-04
|
---|---|
Authors: | Gramss, Tino |
Institutions: | Santa Fe Institute |
Saved in:
Saved in favorites
Similar items by person
-
Solving the Schrodinger Equation for the Feynman Quantum Computer
Gramss, Tino, (1995)
-
On the Speed of Quantum Computers with Finite Size Clocks
Gramss, Tino, (1995)
-
The economy as an evolving complex system
(1988)
- More ...