3 papers
quant-ph2026
Faster Computation with the Generalized Laplacian Quantum Walk
Jonas Duda, Thomas G. Wong
Quantum walks are the quantum analogues of classical random walks or Markov chains. They are universal models of quantum computing, and they underpin a variety of quantum algorithm…
quant-ph2025
Quantum Search with a Generalized Laplacian
Jonas Duda, Molly E. McLaughlin, Thomas G. Wong
A single excitation in a quantum spin network described by the Heisenberg model can effect a variety of continuous-time quantum walks on unweighted graphs, including those governed…
quant-ph2024
Searching Weighted Barbell Graphs with Laplacian and Adjacency Quantum Walks
Jonas Duda, Thomas G. Wong
A quantum particle evolving by Schrödinger's equation in discrete space constitutes a continuous-time quantum walk on a graph of vertices and edges. When a vertex is marked by an o…