On the Speed of Quantum Computation

Tino Gramss

Working Papers from Santa Fe Institute

Abstract: 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.

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.

Date: 1994-04
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:safiwp:94-04-017

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().