Laplacian versus adjacency matrix in quantum walk search

DOI10.1007/S11128-016-1373-1zbMATH Open1348.81188arXiv1512.05554OpenAlexW2215009292MaRDI QIDQ332103FDOQ332103

Authors: Thomas G. Wong, Luís Tarrataca, Nikolay Nahimov 

Publication date: 27 October 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: A quantum particle evolving by Schr"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs, and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Laplacian and adjacency matrix. The two walks differ qualitatively and quantitatively in their required jumping rate, runtime, sampling of marked vertices, and in what constitutes a natural initial state. Thus the choice of the Laplacian or adjacency matrix to effect the walk has important algorithmic consequences.

Full work available at URL: https://arxiv.org/abs/1512.05554

Recommendations

• Walking on vertices and edges by continuous-time quantum walk
• Adjacent vertices can be hard to find by quantum walks
• QUANTUM WALKS ON GENERAL GRAPHS
• Grover search with lackadaisical quantum walks
• Adjacent vertices can be hard to find by quantum walks

zbMATH Keywords

adjacency matrixLaplaciancontinuous timequantum walkspatial search

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Cites Work

• Exponential algorithmic speedup by a quantum walk
• Deformations of spin structures and gravity
• Title not available (Why is that?)
• Grover search with lackadaisical quantum walks
• Title not available (Why is that?)
• Diagrammatic approach to quantum search
• Spatial search by continuous-time quantum walk with multiple marked vertices
• Analysis and synchronization of a novel chaotic system based on Chen's system
• Perfect state transfer in Laplacian quantum walk
• COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Coupon Collecting for Uneqal Probabilities
• Laplacian state transfer in coronas

Cited In (15)

• Decoherence and classicalization of continuous-time quantum walks on graphs
• Search algorithm on strongly regular graph by lackadaisical quantum walk
• Swift chiral quantum walks
• Gluing of graph Laplacians and their spectra
• Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks
• Quantum walks in the normalized Laplacian
• Vertices cannot be hidden from quantum spatial search for almost all random graphs
• Lackadaisical discrete-time quantum walk on Johnson graph
• Hamiltonians of bipartite walks
• Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
• A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
• Degenerate perturbation theory to quantum search
• Exceptional quantum walk search on the cycle
• Ranking nodes in directed networks via continuous-time quantum walks
• Walking on vertices and edges by continuous-time quantum walk

This page was built for publication: Laplacian versus adjacency matrix in quantum walk search

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