Back to Search
Start Over
Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
- Source :
- Quantum Inf. Process. 21, 54 (2022)
- Publication Year :
- 2021
-
Abstract
- A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger'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.
- Subjects :
- Quantum Physics
Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Journal :
- Quantum Inf. Process. 21, 54 (2022)
- Publication Type :
- Report
- Accession number :
- edsarx.2106.06015
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1007/s11128-021-03403-7