Discrete-Time Quantum Walks and Graph Structures
arXiv:1701.04474
Abstract
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the total entropy measures how close the limiting distribution is to uniform. Our numerical results indicate three relations between quantum walks and graph structures: for the first model, rotation systems with higher genera give lower traces and higher entropies, and for the second model, the symmetric 1-factorizations always give the highest trace.
References in corpus (7)
- A Quantum Random Walk Search Algorithm
- Hitting time for quantum walks on the hypercube
- Quantum walks on general graphs
- Quantum Random Walks Hit Exponentially Faster
- Equivalence of Szegedy's and Coined Quantum Walks
- An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
- Quantum Walks on Embeddings