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:1103.1180 · Quantum Information and Computation

Return probability of quantum walks with final-time dependence

Yusuke Ide, Norio Konno, Takuya Machida, Etsuo Segawa

Published Sep 1, 2011• 6 citations
arXivHTMLPDF

Abstract

We analyze final-time dependent discrete-time quantum walks in one dimension. We compute asymptotics of the return probability of the quantum walk by a path counting approach. Moreover, we discuss a relation between the quantum walk and the corresponding final-time dependent classical random walk.
DOI
10.26421/qic11.9-10-3

Related papers

Recurrence in discrete-time quantum stochastic walks

M. Štefaňák, Václav Potoček, İ. Yalçınkaya +2 more

Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability – despite the fact that the classical random walk returns with certainty – and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.

arXiv:2501.08674•Quantum•Jan 22, 2026•4 citations

Return Probability of the Fibonacci Quantum Walk

Clement Boateng Ampadu

In this paper the return probability of the one-dimensional discrete-time quantum walk is studied. We derive probabilistic formulas for the return probability related to the quantum walk governed by the Fibonacci coin.

Communications in Theoretical Physics•Aug 1, 2012•4 citations

Return Probability of the Open Quantum Random Walk with Time-Dependence

Clement Boateng Ampadu

We study the open quantum random walk (OQRW) with time-dependence on the one-dimensional lattice space and obtain the associated limit distribution. As an application we study the return probability of the OQRW. We also ask, "What is the average time for the return probability of the OQRW?"

Communications in Theoretical Physics•May 1, 2013•4 citations

Return Probability of Quantum and Correlated Random Walks

Chusei Kiumi, Norio Konno, Shunya Tamura

The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional integer lattice by the path counting method. We show that the return probability of both quantum and correlated random walks can be expressed in terms of the Legendre polynomial. Moreover, the generating function of the return probability can be written in terms of elliptic integrals of the first and second kinds for the quantum walk.

arXiv:2203.07674•Entropy•Apr 21, 2022•5 citations

A limit law of the return probability for a quantum walk on a hexagonal lattice

Takuya Machida

A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random walker moves. On the other hand, the return probability of quantum walks, which are quantum models corresponding to random walks, has also been investigated to some extend lately. In this paper, we take care of a discrete-time three-state quantum walk on a hexagonal lattice from the view point of mathematics. The mathematical result shows a limit of the return probability when the walker starts off at the origin. The result of the limit tells us about a possibility of localization at the position and a dependence of localization on the initial state.

arXiv:1502.06453•International Journal of Quantum Information•Oct 1, 2015•6 citations

Limit theorems for quantum walks with memory

Norio Konno, Takuya Machida

Recently Mc Gettrick introduced and studied a discrete-time 2-state quantum walk (QW) with a memory in one dimension. He gave an expression for the amplitude of the QW by path counting method. Moreover he showed that the return probability of the walk is more than 1/2 for any even time. In this paper, we compute the stationary distribution by considering the walk as a 4-state QW without memory. Our result is consistent with his claim. In addition, we obtain the weak limit theorem of the rescaled QW. This behavior is strikingly different from the corresponding classical random walk and the usual 2-state QW without memory as his numerical simulations suggested.

arXiv:1004.0443•Quantum Information and Computation•Nov 1, 2010•20 citations
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability – despite the fact that the classical random walk returns with certainty – and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.
The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional integer lattice by the path counting method. We show that the return probability of both quantum and correlated random walks can be expressed in terms of the Legendre polynomial. Moreover, the generating function of the return probability can be written in terms of elliptic integrals of the first and second kinds for the quantum walk.
A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random walker moves. On the other hand, the return probability of quantum walks, which are quantum models corresponding to random walks, has also been investigated to some extend lately. In this paper, we take care of a discrete-time three-state quantum walk on a hexagonal lattice from the view point of mathematics. The mathematical result shows a limit of the return probability when the walker starts off at the origin. The result of the limit tells us about a possibility of localization at the position and a dependence of localization on the initial state.
Recently Mc Gettrick introduced and studied a discrete-time 2-state quantum walk (QW) with a memory in one dimension. He gave an expression for the amplitude of the QW by path counting method. Moreover he showed that the return probability of the walk is more than 1/2 for any even time. In this paper, we compute the stationary distribution by considering the walk as a 4-state QW without memory. Our result is consistent with his claim. In addition, we obtain the weak limit theorem of the rescaled QW. This behavior is strikingly different from the corresponding classical random walk and the usual 2-state QW without memory as his numerical simulations suggested.