Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
arXiv:2108.01055 · doi:10.1103/PhysRevA.104.042604
Abstract
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 dynamic quantum walk, which is a continuous-time quantum walk on a sequence of graphs. This procedure for converting a quantum gate into a dynamic quantum walk, however, can result in long sequences of graphs. To alleviate this, in this paper, we develop a length-3 dynamic quantum walk that implements any single-qubit gate. Furthermore, we extend this result to give length-3 dynamic quantum walks that implement any single-qubit gate controlled by any number of qubits. Using these, we implement Draper's quantum addition circuit, which is based on the quantum Fourier transform, using a dynamic quantum walk.
arXiv comment15 pages, 12 figures
References in corpus (12)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Universal computation by quantum walk
- Exponential algorithmic speedup by quantum walk
- Quantum Networks for Elementary Arithmetic Operations
- Spatial search by quantum walk
- Addition on a Quantum Computer
- A Quantum Algorithm for the Hamiltonian NAND Tree
- Universal quantum computation by discontinuous quantum walk
- Continuous-Time Quantum Walks on Dynamic Graphs
- Isolated Vertices in Continuous-Time Quantum Walks on Dynamic Graphs
- Simplifying Continuous-Time Quantum Walks on Dynamic Graphs