Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2008.00316 · Physical Review A

Order from chaos in quantum walks on cyclic graphs

Abhisek Panda, Colin Benjamin

Published Jul 7, 2021• 15 citations
arXivHTMLPDF

Abstract

It has been shown classically that combining two chaotic random walks can yield an ordered (periodic) walk. Our aim in this paper is to find a quantum analog for this rather counterintuitive result. We study the chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.

DOI
10.1103/physreva.104.012204

Related papers

Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware

Alison M. Rath, Dinesh Kumar Panda, Colin Benjamin

Advancements in noisy intermediate-scale quantum (NISQ) computing are steadily pushing these systems toward outperforming classical supercomputers on specific well-defined computational tasks. In this work we explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQWs) on cyclic graphs. To efficiently implement quantum walks on NISQ hardware, we employ the quantum Fourier transform to diagonalize the conditional shift operator, optimizing circuit depth and fidelity. We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs, specifically 3- and 4-cycle graphs, using the counterintuitive Parrondo paradox strategy across three different NISQ devices. While the 4-cycle graphs exhibit high-fidelity quantum evolution, the 3-cycle implementation shows significant fidelity improvement when augmented with dynamical decoupling pulses. Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware, laying the groundwork for future quantum algorithms and cryptographic protocols based on quantum walks.

arXiv:2506.11225•Physical review. E•Nov 18, 2025•0 citations

Periodicity of the Discrete-time Quantum Walk on a Finite Graph

Yusuke Higuchi, Norio Konno, Iwao Sato +1 more

In this paper we discuss the periodicity of the evolution matrix of Szegedy walk, which is a special type of quantum walk induced by the classical simple random walk, on a finite graph. We completely characterize the periods of Szegedy walks for complete graphs, compete bipartite graphs and strongly regular graphs. In addition, we discuss the periods of Szegedy walk induced by a non-reversible random walk on a cycle.

Interdisciplinary Information Sciences•Jan 1, 2017•26 citations

Odd-periodic Grover walk

Yusuke Yoshie

The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the characterization of graphs exhibiting a periodic Grover walk. Graphs having a periodic Grover walk with periods of $2, 3, 4$, and $5$ have previously been characterized. It is expected that graphs exhibiting a periodic Grover walk with odd period correspond to cycles with odd length. We address that problem and are able to perfectly characterize the class of graphs exhibiting an odd-periodic Grover walk by using a combinatorial method.

arXiv:2106.06710•Jun 12, 2021•0 citations

Mimicking disorder on a clean graph: Interference-induced inhibition of spread in a cyclic quantum random walk

Jayanth Jayakumar, Sreetama Das, Aditi Sen +1 more

We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional “collision”-like interference in the quantum random walk along with the usual interference in any such walk on any graph, closed or otherwise. We find that the quantum walker exhibits inhibition of spread in comparison to the classical one, even in the absence of disorder, a phenomenon that is potentially attributable to the additional interference in the quantum case. This is to be contrasted with the situation on open graphs, where the quantum walker, being effectively denied the collision-like interference, garners a much higher spread than its classical counterpart. Inhibition of spread also occurs on open graphs, but with insertion of disorder. We use the Shannon entropy of the position probability distribution to quantify the spread of the walker in both quantum and classical cases. We find that for a given number of vertices on a cyclic graph, the entropy with respect to number of steps for the quantum walker saturates, on average, to a value lower than that for the corresponding classical one. We also analyze variations of the entropies with respect to system size, and look at the corresponding asymptotic growth rates.

arXiv:1812.05158•Europhysics Letters (EPL)•Jan 3, 2020•3 citations

Periodicity for the 3-state quantum walk on cycles

Takeshi Kajiwara, Norio Konno, Shohei Koyama +1 more

Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on the cyclotomic field. This method gives a necessary condition for the coin operator for quantum walks to be periodic. Moreover, we reveal the period T_N of typical two kinds of quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).

arXiv:1907.01725•Quantum Information and Computation•Nov 1, 2019•10 citations

Absolute Zeta functions and periodicity of quantum walks on cycles

Jirô Akahori, Norio Konno, Iwao Sato +1 more

The quantum walk is a quantum counterpart of the classical random walk. On the other hand, absolute zeta functions can be considered as zeta functions over $\mathbf{F}_1$. This study presents a connection between quantum walks and absolute zeta functions. In this paper, we focus on Hadamard walks and $3$-state Grover walks on cycle graphs. The Hadamard walks and the Grover walks are typical models of the quantum walks. We consider the periods and zeta functions of such quantum walks. Moreover, we derive the explicit forms of the absolute zeta functions of corresponding zeta functions. Also, it is shown that our zeta functions of quantum walks are absolute automorphic forms.

arXiv:2405.05995•Quantum Information and Computation•Oct 1, 2024•0 citations
It has been shown classically that combining two chaotic random walks can yield an ordered (periodic) walk. Our aim in this paper is to find a quantum analog for this rather counterintuitive result. We study the chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.
Advancements in noisy intermediate-scale quantum (NISQ) computing are steadily pushing these systems toward outperforming classical supercomputers on specific well-defined computational tasks. In this work we explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQWs) on cyclic graphs. To efficiently implement quantum walks on NISQ hardware, we employ the quantum Fourier transform to diagonalize the conditional shift operator, optimizing circuit depth and fidelity. We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs, specifically 3- and 4-cycle graphs, using the counterintuitive Parrondo paradox strategy across three different NISQ devices. While the 4-cycle graphs exhibit high-fidelity quantum evolution, the 3-cycle implementation shows significant fidelity improvement when augmented with dynamical decoupling pulses. Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware, laying the groundwork for future quantum algorithms and cryptographic protocols based on quantum walks.
The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the characterization of graphs exhibiting a periodic Grover walk. Graphs having a periodic Grover walk with periods of 2,3,42, 3, 42,3,4, and 555 have previously been characterized. It is expected that graphs exhibiting a periodic Grover walk with odd period correspond to cycles with odd length. We address that problem and are able to perfectly characterize the class of graphs exhibiting an odd-periodic Grover walk by using a combinatorial method.
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional “collision”-like interference in the quantum random walk along with the usual interference in any such walk on any graph, closed or otherwise. We find that the quantum walker exhibits inhibition of spread in comparison to the classical one, even in the absence of disorder, a phenomenon that is potentially attributable to the additional interference in the quantum case. This is to be contrasted with the situation on open graphs, where the quantum walker, being effectively denied the collision-like interference, garners a much higher spread than its classical counterpart. Inhibition of spread also occurs on open graphs, but with insertion of disorder. We use the Shannon entropy of the position probability distribution to quantify the spread of the walker in both quantum and classical cases. We find that for a given number of vertices on a cyclic graph, the entropy with respect to number of steps for the quantum walker saturates, on average, to a value lower than that for the corresponding classical one. We also analyze variations of the entropies with respect to system size, and look at the corresponding asymptotic growth rates.
Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on the cyclotomic field. This method gives a necessary condition for the coin operator for quantum walks to be periodic. Moreover, we reveal the period T_N of typical two kinds of quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, absolute zeta functions can be considered as zeta functions over F1\mathbf{F}_1F1​. This study presents a connection between quantum walks and absolute zeta functions. In this paper, we focus on Hadamard walks and 333-state Grover walks on cycle graphs. The Hadamard walks and the Grover walks are typical models of the quantum walks. We consider the periods and zeta functions of such quantum walks. Moreover, we derive the explicit forms of the absolute zeta functions of corresponding zeta functions. Also, it is shown that our zeta functions of quantum walks are absolute automorphic forms.