Abstract
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Finally, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.
| Original language | English |
|---|---|
| Article number | 012306 |
| Journal | Physical Review A |
| Volume | 100 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 8 2019 |
Funding
This work was supported in part by the US Department of Energy, Office of Science, Office of Workforce Development for Teachers and Scientists (WDTS) under the Science Undergraduate Laboratory Internships Program (SULI) as well as the Department of Energy, Office of Science Early Career Research Program and the Mathematical Sciences Graduate Internship program of the National Science Foundation.