93 citations · 870 across the 38 of their papers we have counts for
12 papers · 1 filter
Laplacian versus Adjacency Matrix in Quantum Walk Search
Thomas G. Wong, Luís Tarrataca, Nikolay Nahimov
A quantum particle evolving by Schrödinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete s…
Doubling the Success of Quantum Walk Search Using Internal-State Measurements
Krišjānis Prūsis, Jevgēnijs Vihrovs, Thomas G. Wong
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in thi…
Quantum Walk on the Line through Potential Barriers
Thomas G. Wong
Quantum walks are well-known for their ballistic dispersion, traveling away in steps, which is quadratically faster than a classical random walk's diffusive spreading. I…
Faster Quantum Walk Search on a Weighted Graph
Thomas G. Wong
A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time . In this paper,…
Nonlinear Quantum Search
Thomas G. Wong
Although quant mech is linear, there are nevertheless quant sys with multiple interacting particles in which the effective evo of a single particle is governed by a nonlinear eq. T…
Correcting for Potential Barriers in Quantum Walk Search
Andris Ambainis, Thomas G. Wong
A randomly walking quantum particle searches in Grover's iterations for a marked vertex on the complete graph of vertices by repeatedly querying an oracle that fl…
Quantum Walk Search with Time-Reversal Symmetry Breaking
Thomas G. Wong
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction.…
Quantum Walk Search through Potential Barriers
Thomas G. Wong
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the par…
Completeness is Unnecessary for Fast Nonlinear Quantum Search
David A. Meyer, Thomas G. Wong
Although strongly regular graphs and the hypercube are not complete, they are "sufficiently complete" such that a randomly walking quantum particle asymptotically searches on them…
Quantum Search with Multiple Walk Steps per Oracle Query
Thomas G. Wong, Andris Ambainis
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas…
Grover Search with Lackadaisical Quantum Walks
Thomas G. Wong
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk,…
Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
Thomas G. Wong
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we con…