Grover's algorithm on a Feynman computer
| dc.creator | de Falco, Diego | |
| dc.creator | Tamascelli, Dario | |
| dc.date | 2006-10-16 | |
| dc.date.accessioned | 2026-07-07T07:30:23Z | |
| dc.date.available | 2026-07-07T07:30:23Z | |
| dc.description | We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin-spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our model implements the idea of "timing" a quantum algorithm using a continuous-time random walk. In this context we examine some consequences of the entanglement between the states of the input/output register and the states of the quantum clock. | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0610130 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0610130 | |
| dc.identifier | J. Phys. A: Math. Gen. 37 (2004) 909-930 | |
| dc.identifier | doi:10.1088/0305-4470/37/3/025 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118439 | |
| dc.subject | Quantum Physics | |
| dc.title | Grover's algorithm on a Feynman computer | |
| dc.type | text |