activity
20092013
most citedUniversal quantum computation using the discrete time quantum walk

513 citations · 595 across the 5 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2013★ 71 cited

Differential Evolution for Many-Particle Adaptive Quantum Metrology

Neil B. Lovett, Cécile Crosnier, Martí Perarnau-Llobet +1

We devise powerful algorithms based on differential evolution for adaptive many-particle quantum metrology. Our new approach delivers adaptive quantum metrology policies for feedba…

quant-ph2011★ 10 cited

The quantum walk search algorithm: Factors affecting efficiency

Neil B. Lovett, Matthew Everitt, Robert M. Heath +1

We numerically study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA \textbf{67} 052307] and the factors which affect its efficiency in finding an individual sta…

quant-ph2011

Generation of topologically useful entangled states

Neil B. Lovett, Benjamin T. H. Varcoe

Measurement based quantum computation requires the generation of a cluster state (quantum resource) prior to starting a computation. Generation of this entangled state can be diffi…

quant-ph2010★ 1 cited

Spatial search using the discrete time quantum walk

Neil B. Lovett, Matthew Everitt, Matthew Trevers +3

We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought…

quant-ph2009★ 513 cited

Universal quantum computation using the discrete time quantum walk

Neil B. Lovett, Sally Cooper, Matthew Everitt +2

A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009…