activity
20042021
most citedSolid State Implementation of Quantum Random Walks on General Graphs

7 citations · 14 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2021★ 5 cited

A framework for optimal quantum spatial search using alternating phase-walks

S. Marsh, J. B. Wang

We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone () algorithm via alternating applications of marked-vertex…

quant-ph2018★ 1 cited

A new method to building Dirac quantum walks coupled to electromagnetic fields

Gareth Jay, Fabrice Debbasch, J. B. Wang

A quantum walk whose continuous limit coincides with Dirac equation is usually called a Dirac Quantum Walk (DQW). A new systematic method to build DQWs coupled to electromagnetic (…

quant-ph2018

Graph comparison via nonlinear quantum search

M. Chiew, K. de Lacy, C. H. Yu +2

In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meanin…

quant-ph2017

Controlled Quantum Search

K. de Lacy, L. Noakes

Quantum searching for one of marked items in an unsorted database of items is solved in steps using Grover's algorithm. Using nonlinear quantum dy…

quant-ph2008★ 7 cited

Solid State Implementation of Quantum Random Walks on General Graphs

K Manouchehri, J. B. Wang

Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized…

quant-ph2007★ 1 cited

Efficient quantum circuit implementation of quantum walks

B. L. Douglas, J. B. Wang

Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been develo…