Universal quantum computation using the discrete-time quantum walk

Tools

Lovett, Neil B. and Cooper, Sally and Everitt, Matthew and Trevers, Matthew and Kendon, Viv (2010) Universal quantum computation using the discrete-time quantum walk. Physical Review A, 81 (4). 042330. ISSN 2469-9934 (https://doi.org/10.1103/PhysRevA.81.042330)

[thumbnail of Lovett-etal-PRA-2010-Universal-quantum-computation]
Preview
 Text. Filename: Lovett_etal_PRA_2010_Universal_quantum_computation.pdf
Final Published Version
Download (506kB)| Preview

Abstract

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

ORCID iDs

Lovett, Neil B., Cooper, Sally, Everitt, Matthew, Trevers, Matthew and Kendon, Viv ORCID logoORCID: https://orcid.org/0000-0002-6551-3056;
CORE (COnnecting REpositories)