Three-state quantum walk on the Cayley Graph of the Dihedral Group

Abstract

The finite dihedral group generated by one rotation and one reflection is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the dihedral group. Considering the characteristics of the elements in the dihedral group, we propose a model of three-state discrete-time quantum walk (DTQW) on the Caylay graph of the dihedral group with Grover coin. We derive analytic expressions for the the position probability distribution and the long-time limit of the return probability starting from the origin. It is shown that the localization effect is governed by the size of the underlying dihedral group, coin operator and initial state. We also numerically investigate the properties of the proposed model via the probability distribution and the time-averaged probability at the designated position. The abundant phenomena of three-state Grover DTQW on the Caylay graph of the dihedral group can help the community to better understand and to develop new quantum algorithms.

References in corpus (14)

• A Quantum Random Walk Search Algorithm
• Weak limits for quantum random walks
• Quantum Walks driven by many coins
• Localization of Two-Dimensional Quantum Walks
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• String-derived D4 flavor symmetry and phenomenological implications
• Quantum Walk with a time-dependent coin
• A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
• Weak Limit of the 3-State Quantum Walk on the Line
• Two quantum walkers sharing coins
• Limit distributions of three-state quantum walks: the role of coin eigenstates
• Learning-Graph-Based Quantum Algorithm for k-distinctness
• Generic Quantum Walks with Memory
• Localization and limit laws of a three-state alternate quantum walk on a two-dimensional lattice