Laplacian versus adjacency matrix in quantum walk search

DOI10.1007/S11128-016-1373-1zbMath1348.81188arXiv1512.05554OpenAlexW2215009292MaRDI QIDQ332103

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

Publication date: 27 October 2016

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

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

zbMATH Keywords

adjacency matrixLaplaciancontinuous timequantum walkspatial search

Mathematics Subject Classification ID

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

Related Items (10)

Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks ⋮ Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems ⋮ Vertices cannot be hidden from quantum spatial search for almost all random graphs ⋮ Exceptional quantum walk search on the cycle ⋮ A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks ⋮ Ranking nodes in directed networks via continuous-time quantum walks ⋮ Swift chiral quantum walks ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Gluing of graph Laplacians and their spectra ⋮ Decoherence and classicalization of continuous-time quantum walks on graphs

Cites Work

• Spatial search by continuous-time quantum walk with multiple marked vertices
• Perfect state transfer in Laplacian quantum walk
• Laplacian state transfer in coronas
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Diagrammatic approach to quantum search
• Grover search with lackadaisical quantum walks
• Exponential algorithmic speedup by a quantum walk
• COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
• Coupon Collecting for Uneqal Probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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