Grover's algorithm on a Feynman computer

Details Grover's algorithm on a Feynman computer Grover's algorithm on a Feynman computer

2006-10-16

arxiv.org/abs/quant-ph/0610130v1

J. Phys. A: Math. Gen. 37 (2004) 909-930

Physics

Quantum Physics

Scientific paper

10.1088/0305-4470/37/3/025

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.

Affiliated with

Also associated with

No associations

Rating

Grover's algorithm on a Feynman computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grover's algorithm on a Feynman computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grover's algorithm on a Feynman computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245342