Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
arXiv:2106.06015 · doi:10.1007/s11128-021-03403-7
Abstract
A continuous-time quantum walk on a dynamic graph evolves by Schrödinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that implements a quantum circuit can be quite complicated. In this paper, we give six scenarios under which a dynamic graph can be simplified, and they exploit commuting graphs, identical graphs, perfect state transfer, complementary graphs, isolated vertices, and uniform mixing on the hypercube. As examples, we simplify dynamic graphs, in some instances allowing single-qubit gates to be implemented in parallel.
References in corpus (10)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- Universal computation by quantum walk
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- Universal quantum computation by discontinuous quantum walk
- Optimal quantum spatial search on random temporal networks
- Continuous-Time Quantum Walks on Dynamic Graphs
- Isolated Vertices in Continuous-Time Quantum Walks on Dynamic Graphs
Cited by in corpus (5)
- Performance Analysis of Multi-Angle QAOA for p > 1
- n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer
- Efficient Sparse State Preparation via Quantum Walks
- Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
- Decoherence and classicalization of continuous-time quantum walks on graphs