2019/08/31 by Thomas G. Wong
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum mechanics #Quantum walk #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.1103/physreva.100.062325
published as Phys. Rev. A 100, 062325 (2019) · 10 pages, 6 figures
arxiv created 2019/10/29 · openalex publication_date 2019/12/18 · arxiv updated 2019/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having self-loops, so they all evolved by a phase under the quantum walk. In this paper, we permit isolated vertices to be loopless or looped, and loopless isolated vertices do not evolve at all under the quantum walk. Using this distinction, we construct simpler dynamic graphs that implement the Pauli gates and a set of universal quantum gates consisting of the Hadamard, T, and controlled-not gates, and these gates are easily extended to multiqubit systems. For example, the T gate is simplified from a sequence of six graphs to a single graph, and the number of vertices is reduced by a factor of 4. We also construct a generalized phase gate, of which Z, S, and T are specific instances. Finally, we validate our implementations by numerically simulating a quantum circuit consisting of layers of one- and two-qubit gates, similar to those in recent quantum supremacy experiments, using a quantum walk.