Partition-based discrete-time quantum walks
We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy’s model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.
KeywordsQuantum walk Coined walk Szegedy’s walk Staggered walk Graph tessellation Hypergraph walk Unitary equivalence Intersection graph Bipartite graph
- 2.Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithm, pp. 1099–1108 (2005)Google Scholar
- 5.Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 50–59 (2000)Google Scholar
- 14.Higuchi, Y., Segawa, E., Suzuki, A.: arXiv:1506.06457
- 16.Konno, N.: Quantum Walks, Lecture Notes in Mathematics. Springer, Berlin, Heidelberg (2008)Google Scholar
- 32.Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 32–41 (2004)Google Scholar