93 citations · 870 across the 38 of their papers we have counts for
8 papers · 1 filter
Equivalence of Szegedy's and Coined Quantum Walks
Thomas G. Wong
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To sear…
Exceptional Quantum Walk Search on the Cycle
Thomas G. Wong, Raqueline A. M. Santos
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional…
Stationary States in Quantum Walk Search
Krišjānis Prūsis, Jevgēnijs Vihrovs, Thomas G. Wong
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, a…
Full Characterization of Oscillatory Localization of Quantum Walks
Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs +1
Discrete-time quantum walks are well-known for exhibiting localization, a quantum phenomenon where the walker remains at its initial location with high probability. In companion wi…
Oscillatory Localization of Quantum Walks Analyzed by Classical Electric Circuits
Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs +1
We examine an unexplored quantum phenomenon we call oscillatory localization, where a discrete-time quantum walk with Grover's diffusion coin jumps back and forth between two verti…
Engineering the Success of Quantum Walk Search Using Weighted Graphs
Thomas G. Wong, Pascal Philipp
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to ge…
Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
Thomas G. Wong, David A. Meyer
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolut…
Quantum Walk Search on Johnson Graphs
Thomas G. Wong
The Johnson graph is defined by symbols, where vertices are -element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In part…