activity
20152021
most citedCompleteness is Unnecessary for Fast Nonlinear Quantum Search

2 citations · 5 across the 4 of their papers we have counts for

collaborators

11 papers

quant-ph20211 cited

Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks

Ibukunoluwa A. Adisa, Thomas G. Wong

It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a…

quant-ph2021

Equivalent Laplacian and Adjacency Quantum Walks on Irregular Graphs

Thomas G. Wong, Joshua Lockhart

The continuous-time quantum walk is a particle evolving by Schrödinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proport…

quant-ph2020

Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk

Mason L. Rhodes, Thomas G. Wong

The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shif…

quant-ph2019

Isolated Vertices in Continuous-Time Quantum Walks on Dynamic Graphs

Thomas G. Wong

It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of…

quant-ph2019

Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights

Mason L. Rhodes, Thomas G. Wong

The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on th…

quant-ph2018

Quantum Walk Search on the Complete Bipartite Graph

Mason L. Rhodes, Thomas G. Wong

The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches…