Walking on Vertices and Edges by Continuous-Time Quantum Walk

Abstract

The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to distant places. Usually, the Hamiltonian is obtained from either the adjacency or the laplacian matrix of the graph and the walker hops from vertices to neighboring vertices. In this work, we define a version of the continuous-time quantum walk that allows the walker to hop from vertices to edges and vice versa. As an application, we analyze the spatial search algorithm on the complete bipartite graph by modifying the new version of the Hamiltonian with an extra term that depends on the location of the marked vertex or marked edge, similar to what is done in the standard continuous-time quantum walk model. We show that the optimal running time to find either a vertex or an edge is $O(\sqrt{N_e})$ with success probability $1-o(1)$, where $N_e$ is the number of edges of the complete bipartite graph.

arXiv comment15 pages

References in corpus (9)

• Quantum Computation and Decision Trees
• A Quantum Random Walk Search Algorithm
• Spatial search by quantum walk
• Global Symmetry is Unnecessary for Fast Quantum Search
• The Staggered Quantum Walk Model
• Quantum walk-based search algorithms with multiple marked vertices
• Quantum spatial search in two-dimensional waveguide arrays
• Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
• Quantum search with a continuous-time quantum walk in momentum space

Cited by in corpus (3)

• Review on Quantum Walk Computing: Theory, Implementation, and Application
• Quantum search by continuous-time quantum walk on t-designs
• Implementation of Continuous-Time Quantum Walks on Quantum Computers