Isolated Vertices in Continuous-Time Quantum Walks on Dynamic Graphs

Abstract

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 CNOT gates, and these gates are easily extended to multi-qubit 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 four. 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.

arXiv comment10 pages, 6 figures

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Quantum Computation and Decision Trees
• Universal computation by quantum walk
• Exponential algorithmic speedup by quantum walk
• Spatial search by quantum walk
• Grover Search with Lackadaisical Quantum Walks
• Laplacian versus Adjacency Matrix in Quantum Walk Search
• Coined Quantum Walks on Weighted Graphs
• Continuous-Time Quantum Walks on Dynamic Graphs

Cited by in corpus (7)

• The Missing Link in Gravitational-Wave Astronomy: Discoveries waiting in the decihertz range
• Complex Quantum Networks: a Topical Review
• Quantum routing of information using chiral quantum walks
• Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
• Efficient Sparse State Preparation via Quantum Walks
• Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
• Photon-Number Conserved Universal Quantum Logic Employing Continuous-Time Quantum Walk on Dual-Rail Qubit Arrays