Walking on Vertices and Edges by Continuous-Time Quantum Walk
From MaRDI portal
Publication:6401374
DOI10.1007/S11128-023-03842-4arXiv2206.03375MaRDI QIDQ6401374FDOQ6401374
Authors: Cauê F. Teixeira da Silva, Daniel F. D. Posner, R. Portugal 
Publication date: 7 June 2022
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 with success probability , where is the number of edges of the complete bipartite graph.
Eigenvalues, singular values, and eigenvectors (15A18) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
This page was built for publication: Walking on Vertices and Edges by Continuous-Time Quantum Walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401374)
