Grover's algorithm on a Feynman computer

DOI10.1088/0305-4470/37/3/025MaRDI QIDQ4467229zbMATH OpenOpenAlexFDO

Authors Diego de Falco, Dario Tamascelli

Publication date 9 June 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0610130, http://hdl.handle.net/2434/34864

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Search theory (90B40)

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

Recommendations

• scientific article; zbMATH DE number 1795884
• Complexity of Grover's algorithm: an algebraic approach
• The simulation of Grover quantum search algorithm
• Feynman checkers: towards algorithmic quantum theory
• Solving the Schrödinger equation for the Feynman quantum computer
• Simulation of quantum algorithms on a symbolic computer
• Quantum computation using the Aharonov-Casher set up
• Quantum algorithm for Feynman loop integrals
• Simulation and the exact complexity of Grover's search algorithm
• Grover's algorithm with errors

Cited in

(6)

• The rhythm of quantum algorithms
• Solving binary \(\mathcal {MQ}\) with Grover's algorithm
• Quantum walks on necklaces and mixing
• Entropy generation in a model of reversible computation
• Fast universal quantum computation with railroad-switch local Hamiltonians
• QUANTUM TIMING AND SYNCHRONIZATION PROBLEMS

This page was built for publication: Grover's algorithm on a Feynman computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467229)