On the Speed of Quantum Computers with Finite Size Clocks

Tino Gramss

Working Papers from Santa Fe Institute

Abstract: In previous work, the speef of locally coupled quantum computers with infinite size clocks has been investigated in detail. One of the results is that the Feynman quantum computer and the Margolus cellular automaton compute at a constant rate. We show that this is no longer true for computers with finite size clocks and we will argue that finite size clocks are more appropriate for the computers under consideration. Furthermore, we give alternative definitions for computational speed that seem to be appropriate for finite size computers.

Date: 1995-10
References: View references in EconPapers View complete reference list from CitEc
Citations:

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:95-10-086

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 ().