most citedConnectivity is a Poor Indicator of Fast Quantum Search

84 citations · 132 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph201614 cited

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…

quant-ph201612 cited

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…

quant-ph201421 cited

Diagrammatic Approach to Quantum Search

Thomas G. Wong

We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted g…

quant-ph201484 cited

Connectivity is a Poor Indicator of Fast Quantum Search

David A. Meyer, Thomas G. Wong

A randomly walking quantum particle evolving by Schrödinger's equation searches on -dimensional cubic lattices in time when , and with progressively slowe…

cond-mat.stat-mech20141 cited

Confining multiple polymers between sticky walls: a directed walk model of two polymers

Thomas Wong, Aleksander L. Owczarek, Andrew Rechnitzer

We study a model of two polymers confined to a slit with sticky walls. More precisely, we find and analyse the exact solution of two directed friendly walks in such a geometry on t…