Gramss, T. (1994). On the speed of quantum computation. Technical Report 94-04-017, Santa Fe Institute. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Neural Computing - Kak (1995) (1 citation) (Correct)
....a problem where the partially evolved computations of some of these superimposed states are used to find the solution then it might be that such a machine offers improved speed in the sense of complexity theory. The idea of a quantum computer has not yet been shown to be practical (Landauer 1991, Gramss 1994). Furthermore, these proposals only deal with the question of the physics underlying 3 4 S.C. Kak basic computation; they do not consider the question of how a computation process leads to intelligence. The proposal for a quantum neural computer is based not only on an explicit representation of ....
Gramss, T. (1994). On the speed of quantum computation. Technical Report 94-04-017, Santa Fe Institute.
On the Speed of Quantum Computers With Finite Size Clocks - Gramss (1995) Self-citation (Gramss) (Correct)
....have been proposed in [Pe85] As for classical computers, computational clocks can be defined for such quantum computers in order to analyze their dynamic behavior. This clock can either be finite (i.e. it runs in a cycle) or infinite. Infinite size clock computers have been analyzed in detail in [Gr94] for the Feynman computer and in [Bi93] for the Margolus computer. Of particular interest is the average number of computational steps per time unit that a quantum computer performs. Quantum computational speed has first been defined in [Ma86] In [Ma90] it has been shown that the Margolus ....
....a quantum computer performs. Quantum computational speed has first been defined in [Ma86] In [Ma90] it has been shown that the Margolus automaton computes at a constant rate, in other words, that its computational speed is constant. This also applies to the Feynman computer with an infinite clock [Gr94]. In [Bi93] it is shown that the maximal speed is proportional to the number of sites of a quantum cellular automaton, just as for a classical cellular automaton 1 . In a previous work [Gr95a] the Schrodinger equation for the Feynman computer with a finite size clock was solved. Based on this ....
[Article contains additional citation context not shown here]
T.Gramss (1994): "On the speed of quantum computation", Santa Fe Institute Working Paper Series 94-04-017.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC