Next Article in Journal
Multi-Step Natural Gas Load Forecasting Incorporating Data Complexity Analysis with Finite Features
Previous Article in Journal
Transformer Fault Diagnosis Based on Knowledge Distillation and Residual Convolutional Neural Networks
Previous Article in Special Issue
Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Normal Variance Mixture with Arcsine Law of an Interpolating Walk Between Persistent Random Walk and Quantum Walk

1
Graduate School of Environment and Information Sciences, Yokohama National University, Hodogaya, Yokohama 240-8501, Japan
2
Department of Information Physics and Computing, The University of Tokyo, Bunkyo, Tokyo 113-8656, Japan
*
Author to whom correspondence should be addressed.
Entropy 2025, 27(7), 670; https://doi.org/10.3390/e27070670
Submission received: 27 April 2025 / Revised: 14 June 2025 / Accepted: 21 June 2025 / Published: 23 June 2025
(This article belongs to the Special Issue Quantum Walks for Quantum Technologies)

Abstract

We propose a model that interpolates between quantum walks and persistent (correlated) random walks using one parameter on the one-dimensional lattice. We show that the limit distribution is described by the normal variance mixture with the arcsine law.

1. Introduction

Discrete-time quantum walk on the one-dimensional lattice with the uniform quantum coin is one of the first triggers that led to the development of studies on discrete-time quantum walks, e.g., [1,2,3,4,5]. The time evolution is determined by the 2-dimensional unitary matrix
C = a b c d .
Note that the unitarity of C implies | a | 2 = | d | 2 , | b | 2 = | c | 2 and | a | 2 + | b | 2 = | c | 2 + | d | 2 = 1 and so on. The diagonal elements of C represent the complex-valued weights associated with the transmission in the same direction (left or right) as that of the previous step, while the off-diagonal elements represent the complex-valued weights associated with the reflection to the different direction from that of the previous step at each vertex. Let us denote the time evolution of this quantum walk by L Q W . On the other hand, we choose the corresponding random walk model as persistent random walk (or equivalently correlated random walk) [6,7], where the probabilities of moving left and right are determined by the choice of the directions at the previous time. In this paper, we set that the moving probability at each time step and each position of the correlate random walk is locally represented by
C C ¯ = | a | 2 | b | 2 | c | 2 | d | 2 .
The total time evolution operator of such a persistent random walk mode is denoted by L R W . Since both dynamics evolve on the arcs of the one-dimensional lattice, we find that it is possible to represent L Q W and L R W so that both domains are the same and both operators preserve the trace. (See Section 3 for more detail.)
So we propose the following natural model which interpolates between the persistent random walk and the quantum walk. At each time step independently, a walker flips a Bernoulli coin for the choice of L R W or L Q W ; that is, a walker chooses L R W with probability p, while it chooses L Q W with probability q = 1 p . Let μ t ( p ) be the average of the distributions of the walker’s position at time t with respect to all the possible coin tosses and X t ( p ) of a position of an interpolate walker at time t, that is, X t ( p ) μ t ( p ) . Here, if a random variable X follows a distribution F, we write X F in short. The distribution μ t ( p ) can be realized by taking the trace of the t-th iteration of the convex combination of L R W and L Q W :
L p : = p L R W + q L Q W .
We emphasize that this model can be regarded as a discrete-time model analogous to the Lindblad master equation for the quantum stochastic walk [8,9] on a one-dimensional lattice. See [8] for more detail, which is discussed in the general connected graphs. Under the difference equation of the quantum stochastic walk given by [8], Equation (32), a discrete-time quantum stochastic walk driven by a convex combination of quantum walks and correlated random walks can be constructed on general graphs. Note that in this case, the graph G in [8] should not be converted to G itself but to L ( G ) , where L ( G ) = ( X , A ) is the directed line graph of G ; that is, X = A , and ( a , b ) A iff the terminal of a coincides with the origin of b in G . Thus, following the framework presented in [8], one can also extend our model on Z to higher dimensions Z d ( d 2 ) . We study such a discrete-time stochastic quantum walk model focusing on a simple graph Z to see its fundamental property.
In this paper, we characterize the limit behavior of the quantum stochastic walk model on the one-dimensional lattice by the normal variance mixture with the arcsine law as follows.
Theorem 1
(Main theorem). Let ν be the scaled arcsine distribution, such that
ν ( d u ) = 1 1 q 1 + q r , 1 + q 1 q r ( u ) π u 1 q 1 + q r u 1 + q 1 q r d u ,
where r = | a | 2 / | b | 2 , and 1 A ( u ) is the indicator function of the set A R . Let Σ ν 2 be a random variable following ν. A position of an interpolating walker with the parameter p ( 0 , 1 ) at time t is denoted by X t ( p ) with the initial state ρ 0 ( x ) = ( 1 / 2 ) δ 0 ( x ) I 2 . Then, X t ( p ) / t converges in distribution to the average of N ( 0 , Σ ν 2 ) in ν, that is,
X t ( p ) t E ν ( N ( 0 , Σ ν 2 ) ) ( t ) ,
where E ν ( · ) is the average in ν.
The following corollaries are equivalent expressions to Theorem 1.
Corollary 1.
Let Y * ( p ) be a random variable following the limit distribution of X t ( p ) / t ( t ) . The limit density function of Y * ( p ) is expressed by
f * ( x ) = E ν e x 2 2 Σ ν 2 2 π Σ ν 2 = e x 2 2 u 2 π u 1 1 q 1 + q r , 1 + q 1 q r ( u ) π u 1 q 1 + q r u 1 + q 1 q r d u .
Corollary 2.
Let Z be a random variable following the normal distribution N ( 0 , 1 ) . Assume that the random variables σ ( p ) : = | Σ ν 2 | and Z are independent. Then the (cumulative) distribution of Y * ( p ) is described by
P ( Y * ( p ) x ) = P ( σ ( p ) Z x ) ,
for any x R , which is nothing but the mixing variance of the normal distribution [10].
The variance of the limit distribution is given by a random variable following the arcsine distribution, where the highest probability is taken around both end points, that is, r ( 1 q ) / ( 1 + q ) and r ( 1 + q ) / ( 1 q ) . When q approaches 0, ν can be regarded as a delta function concentrated at | b | 2 / | a | 2 , which is consistent with the limiting distribution of the (purely) persistent random walk [7]. On the other hand, as q approaches 1, the domain of the density function that gives the variance spans all positive real numbers, reflecting the linear spreading of the quantum walk at q = 1 .
Such a crossover between the quantum walk and the persistent (or correlated) random walk models is discussed in [11] by a geometric control, and it is shown that a glimpse of the ballistic spreading of the quantum walk is already seen even in the geometry where the walk is close to the random walk. On the other hand, there are other types of quantum walk models that exhibit essentially diffusive spreading, for example, [12,13]. In [12], the quantum walk with decoherence is proposed as well as the diffusive spreading of the Hadamard-based walk. It seems that this model can be reproduced by setting | a | = 1 / 2 in our walk model. Note that when | a | = 1 / 2 , the persistent random walk is simply reduced to the isotropic random walk. We connect the persistent random walk, which is a double Markov process, and the quantum walk by considering 0 < | a | < 1 and characterize the interpolating walk model by the weak convergence. In [13], the random choice of unitary operators at each time step induces decoherence and, as a result, the diffusive spreading exhibits a drift. Recently, another discrete-time quantum stochastic walk model on a 1-dimensional lattice was proposed, and the recurrence properties were discussed in [14].
This paper is organized as follows. In Section 2, we give a numerical demonstration of the consistency of our main results of Theorem 1. In Section 3, we give a detailed definition of our interpolating walk model. In Section 3, we show the proofs of the main results. Section 4 presents the summary and discussion. The main theorem gives the discontinuity of the limit theorem with respect to the parameter p at p = 0 . Then we discuss the limit theorem for p close to 0.

2. Numerical Demonstrations

Let us see the demonstrations of the interpolating walks with the parameters p given by the numerical simulations and the consistency of Theorem 1.
First, we show the distributions μ t ( p ) of the interpolating walks given by the numerical simulations with a = b = c = d = 1 / 2 and the parameters p = 1 / 100 , 1 / 10 , 1 / 2 and 9 / 10 in Figure 1a–d, respectively, at the final time s = 100 . We can observe a transition from distributions of the quantum walk to the random walk as p increases. The shape of the distribution rapidly gets closer to a normal distribution along with the growth of the value of p; the peak around the origin is already higher than those around the edges in p = 1 / 10 shown in Figure 1b. This observation supports our statement of the main theorem that once the rate of decoherence p deviates from 0 slightly, the shape of the limit distribution of X t ( p ) / t has the structure of a normal distribution.
Secondly, let us discuss the consistency of our analytical results with Theorem 1 in more detail. Note that if x + t is odd, then μ t ( x ) = 0 for any t N and x Z . The following step function f t , which satisfies f t ( x ) d x = 1 and reflects such a parity with the position and time, should approximate the limit density function f * of E ν ( N ( 0 , Σ ν 2 ) ) in Theorem 1 in that
lim t P ( X t / t < x ) = lim t x f t ( u ) d u = x f * ( u ) d u ,
for any x R :
f t ( u ) = t 2 × μ t ( t ) : t 1 t < u t + 1 t , μ t ( t + 2 ) : t + 1 t < u t + 3 t , μ t ( t 2 ) : t 3 t < u t 1 t , μ t ( t ) : t 1 t < u t + 1 t , 0 : otherwise .
Figure 2 shows the simultaneous plot of f t and f * for t = 100 and p = 1 / 2 . Here we use the second equality in Equation (1) to approximately draw the limit density function of Y * ( p ) = σ ( p ) Z , f * , by the Gauss–Kronrod quadrature approximation [15]. We see that the step function f t ( x ) appears to be close to f * ( x ) for sufficiently large t, as expected with Equation (2).
Finally, let us discuss the case that the parameter p is very close to 0. It is well-known that if the parameter p = 0 , X s ( p ) / s converges to the Konno function [16]. On the other hand, if the parameter p is even slightly greater than 0, the shape of the limit distribution of X s ( p ) / s has the structure of a normal distribution by our main theorem. In this sense, Theorem 1 indicates that the limit distribution in p > 0 is clearly distinguished from that in p = 0 . However, in the above setting, it is assumed that the parameter p is independent of the final time s even if p is small, which implies that the decoherence occurs infinitely many times when s . Then we set the parameter p by λ / s with some positive constant value λ > 0 to avoid the infinitely many uses of the evolution operator L R W . Note that such a setting gives the Poisson occurrence of L R W because the probability that “the number of choices of the evolution operator L R W during the time span s is k” can be expressed by
s k p k ( 1 p ) s k e λ λ k k ! ( s ) .
Then the number of occurrence L R W during the infinite time span is finite (its average is λ ), and the time interval at which the evolution L R W is used follows the exponential distribution with parameter λ . We discuss the behavior of the interpolating walk in such a natural setting of p = λ / s in Section 5 and obtain an expression of the characteristic function of X t ( p ) / t in the long-time limit, which shows the ballistic spreading in Proposition 3. Figure 3 shows a distribution μ s ( 1 / s ) at the final time s with the parameter p = 1 / s . A “protrusion” is seen in the middle of a typical quantum walk distribution. Its characterization is left as an open problem in this paper.

3. Setting of Interpolating Walk

3.1. Random Walk

Let A Z be the set of symmetric arcs of Z . Each element of A Z is denoted by ( x , x 1 ) ( x Z ) . Here the origin and terminus of ( x , x 1 ) are x and x 1 , respectively. Note that the inverse of ( x , x 1 ) is ( x 1 , x ) . The total state space is set by 2 ( A Z ) . For each time step t = 0 , 1 , 2 , with the initial state ψ 0 2 ( A Z ) , ψ t 2 ( A Z ) is obtained by the following iterations: ψ t + 1 = M ψ t . Here the local time evolution at x Z is denoted by
ψ t + 1 ( x , x 1 ) = r ψ t ( x + 1 , x ) + ( 1 r ) ψ t ( x 1 , x )
ψ t + 1 ( x , x + 1 ) = ( 1 r ) ψ t ( x + 1 , x ) + r ψ t ( x 1 , x )
for every x Z and t N . It moves as shown in Figure 4 and Figure 5. This random walk model is called a persistent random/correlated random walk. At each time, the random walker chooses the same direction as the one chosen exactly 1 step before (right or left) with probability r, and a different direction with probability 1 r . The probability of being found at vertex x at time t is defined as
μ t R W ( x ) = ψ t ( x , x 1 ) + ψ t ( x , x + 1 ) .
Let M 2 ( C ) and U ( 2 ) be the sets of the 2-dimensional complex-valued matrices and the unitary matrices. Let us consider an equivalent expression to this random walk on the space ( M 2 ( C ) ) Z × Z as follows. Set 2 × 2 matrices P and Q as
P = a b 0 0 , Q = 0 0 c d ,
where P + Q = a b c d U ( 2 ) with | a | 2 = | d | 2 = r , | b | 2 = | c | 2 = 1 r . Define L R W : ( M 2 ( C ) ) Z × Z ( M 2 ( C ) ) Z × Z by
( L R W ρ ) ( x , y ) = P ρ ( x + 1 , y + 1 ) P * + Q ρ ( x 1 , y 1 ) Q *
for any ρ ( M 2 ( C ) ) Z × Z and ( x , y ) Z × Z . For each time step t = 0 , 1 , 2 , with the initial state ρ 0 ( M 2 ( C ) ) Z × Z , ρ t ( M 2 ( C ) ) Z × Z is obtained by ρ t + 1 = L R W ρ t . Thus this walk with the time evolution L R W can be regarded as an open quantum random walk [17]. Let us see that this open quantum random walk is isomorphic to the persistent random walk as follows. The time iteration can be reexpressed by
ρ t + 1 ( x , x ) = P ρ t ( x + 1 , x + 1 ) P * + Q ρ t ( x 1 , x 1 ) Q * = | ρ t ( x + 1 , x + 1 ) | | L L | + + | ρ t ( x 1 , x 1 ) | + | R R | .
The second equality derives from P = | L | , Q = | R + | , where we set | L , | R , | , | + as
| L = 1 0 , | R = 0 1 , | = a ¯ b ¯ , | + = c ¯ d ¯ .
Therefore, the following equation is derived:
| ρ t + 1 ( x , x ) | = r | ρ t ( x + 1 , x + 1 ) | + ( 1 r ) + | ρ t ( x 1 , x 1 ) | +
+ | ρ t + 1 ( x , x ) | + = r | ρ t ( x + 1 , x + 1 ) | + ( 1 r ) + | ρ t ( x 1 , x 1 ) | + ,
which is the same as the local time evolution at x Z on the space 2 ( A Z ) (3) and (4). Indeed we obtain the following proposition.
Proposition 1.
For a persistent random walk with the initial state μ t R W ( 0 ) = δ 0 ( x ) α β , if ρ 0 ( x , y ) = δ 0 , 0 ( x , y ) ρ 0 satisfies | ρ 0 | = α and + | ρ 0 | + = β , then for all t = 0 , 1 , 2 , ,
μ t R W ( x ) = tr [ ρ t ( x , x ) ] .
Here,
| = a b * , | + = c d * .
Proof. 
By calculating the trace of ρ in this case, we obtain
tr [ ρ t ( x , x ) ] = tr [ ρ t ( x , x ) ( | | + | + + | ) ] = tr [ ρ t ( x , x ) | | ] + t r [ ρ t ( x ) | + + | ] = tr [ | ρ t ( x , x ) | ] + t r [ + | ρ t ( x , x ) | + ] = | ρ t ( x , x ) | + + | ρ t ( x , x ) | + ,
so if we set ρ 0 such that it satisfies
α β = | ρ 0 ( x , x ) | + | ρ 0 ( x , x ) | +
when α β is given as the initial state, the finding probability μ t R W ( x ) defined in (5) for each time step t = 0 , 1 , 2 , is given by
μ t R W ( x ) = tr [ ρ t ( x , x ) ] .

3.2. Quantum Walk

As with the random walk discussed in the previous section, first, the total state space is set by 2 ( A Z ) . For each time step t = 0 , 1 , 2 , with the initial state ψ 0 2 ( A Z ) , ψ t 2 ( A Z ) is obtained by the following iterations: ψ t + 1 = U ψ t . Here the local time evolution at x Z is denoted by
ψ t + 1 ( x + 1 , x ) = a ψ t ( x + 2 , x + 1 ) + b ψ t ( x , x + 1 )
ψ t + 1 ( x 1 , x ) = c ψ t ( x , x 1 ) + d ψ t ( x 2 , x 1 )
for every x Z and t N . It moves as shown in Figure 6 and Figure 7. Here a , b , c , d C and C = a b c d is unitary. The left-moving quantum walker chooses to move left with probability amplitude a and right with probability amplitude c, while the right-moving quantum walker chooses to move left with probability amplitude b and right with probability amplitude d. The probability of being found at vertex x at time t is defined as
μ t Q W ( x ) = | ψ t ( x + 1 , x ) | 2 + | ψ t ( x 1 , x ) | 2 .
Let us consider an equivalent expression to this quantum walk on the space ( M 2 ( C ) ) Z × Z as follows. Define L Q W : ( M 2 ( C ) ) Z × Z ( M 2 ( C ) ) Z × Z by
( L Q W ρ ) ( x , y ) = P ρ ( x + 1 , y + 1 ) P * + Q ρ ( x 1 , y 1 ) Q * + P ρ ( x + 1 , y 1 ) Q * + Q ρ ( x 1 , y + 1 ) P *
for any ρ ( M 2 ( C ) ) Z × Z . For each time step t = 0 , 1 , 2 , with the initial state ρ 0 ( M 2 ( C ) ) Z × Z , ρ t ( M 2 ( C ) ) Z × Z is given by the recursion ρ t + 1 = L Q W ρ t . In particular, if we set ρ t ( x , y ) : = | ψ t ( x ) ψ t ( y ) | , it satisfies L Q W ρ t = ρ t + 1 because
| ψ t + 1 ( x ) ψ t + 1 ( x ) | = ( P | ψ t ( x + 1 ) + Q | ψ t ( x 1 ) ) ( P | ψ t ( y + 1 ) + Q | ψ t ( y 1 ) ) * = P | ψ t ( x + 1 ) ψ t ( y + 1 ) | P * + Q | ψ t ( x 1 ) ψ t ( y 1 ) | Q * + P | ψ t ( x + 1 ) ψ t ( y 1 ) | Q * + Q | ψ t ( x 1 ) ψ t ( y + 1 ) | P * .
This corresponds to the local time evolution at x Z on the space 2 ( A Z ) (7) and (8).
Proposition 2.
For a quantum walk with the initial state μ t Q W ( 0 ) = δ 0 ( x ) α β , if ρ 0 ( x , y ) = δ 0 , 0 ( x , y ) ρ 0 satisfies ρ 0 = | 0 0 | α β α ¯ β ¯ , then for all t = 0 , 1 , 2 , ,
μ t Q W ( x ) = tr [ ρ t ( x , x ) ] .
Proof. 
By the induction with respect to t, we have ρ t ( x , y ) = | ψ t ( x ) ψ t ( y ) | for any t 0 . Then taking the trace of ρ t ( x , x ) , we obtain
tr [ ρ t ( x , x ) ] = tr [ | ψ t ( x ) ψ t ( x ) | ] = tr [ ψ t ( x ) , ψ t ( x ) ] = | | ψ t ( x ) | | 2 = μ t Q W ( x ) ,
which implies the desired conclusion. □

3.3. Interpolating Walk

We define the interpolation model between the random walk and the quantum walk as follows. For a parameter 0 p 1 , let L p be defined as
L p : = ( 1 p ) L Q W + p L R W .
Set
ρ t : = L p ρ t 1 ,
with the initial state ρ 0 ( x , y ) = ( 1 / 2 ) δ ( 0 , 0 ) ( x , y ) I 2 . Since L p is a convex combination of L Q W in (10) and L R W in (6) which are trace-preserving, then at each time t = 0 , 1 , 2 , , the finding probability μ t ( x ) at each position x can be defined as
μ t ( x ) = tr [ ρ t ( x , x ) ] .
The operator L p is expressed by
L p ρ ( x , y ) = P ρ ( x + 1 , y + 1 ) P * + Q ρ ( x 1 , y 1 ) Q * + q P ρ ( x + 1 , y 1 ) Q * + Q ρ ( x 1 , y + 1 ) P * .
Then the first and second terms are interpreted as the decoherence and interference terms, respectively, and the strength of the interference is tunable by the parameter q = 1 p [ 0 , 1 ] .
The following observation is well-known, but let us confirm that this equation represents a process in which a random walk is performed with probability p, while a quantum walk is executed with probability q = 1 p . Here, we set i.i.d. Bernoulli sequence ω = ( ω ( 1 ) , ω ( 2 ) , , ω ( n ) ) such that ω ( t ) { R W , Q W } ( t = 1 , 2 , , n ) and
ρ n ω : = L ω ( n 1 ) ρ n 1 ω
with ρ 0 ω = ρ 0 . By taking the average over ω { R W , Q W } n , we have
E [ ρ n ω ] = E [ L ω ( n 1 ) ρ n 1 ω ] = ( ( 1 p ) L Q W + p L R W ) E [ ρ n 1 ω ] .
Since this equation satisfies the same recurrence relation as (11), the interpolation model can be interpreted as a walk that represents the average behavior of a system that randomly chooses the evolution of the random walk with probability p or that of the quantum walk with probability 1 p at each time step independently.

4. Proof of Theorem 1

4.1. Fourier Transform

The following isomorphism is useful for our analysis: for any matrices A , B and ρ of size N,
( A ρ B ) l , m = i , j ( A ) l , i ( ρ ) i , j ( B ) j , m = i , j ( A ) l , i ( B ) m , j ( ρ ) i , j = i , j ( A B ) ( l , m ) , ( i , j ) ( ρ ) i , j ,
where B is the matrix transpose of B. Therefore when the matrix ρ M N ( C ) is reinterpreted as a vector ρ C N × N as ( ρ ) i , j = ρ ( i , j ) , we have
A ρ B ( A B ) ρ .
From now on, denote the vector representation of ρ ( x , y ) M 2 ( C ) by ρ ( x , y ) C 4 .
Let X t be a random variable following the distribution μ t . To obtain the limit distribution of X t , we concentrate on obtaining the asymptotics of the characteristic function of X t ,
E [ e i ξ X t ] = x Z μ t ( x ) e i ξ x .
The following lemma plays an important role in computing the characteristic function.
Lemma 1.
Set ρ 0 ( k , l ) = x , y Z ρ 0 ( x , y ) e i k x e i l y for any k , l [ 0 , 2 π ) and
H ^ p ( k , l ) = e i ( k + l ) P P ¯ + e i ( k + l ) Q Q ¯ + ( 1 p ) ( e i ( k l ) P Q ¯ + e i ( k l ) Q P ¯ ) .
Then, we have
E [ e i ξ X t ] = ( L L | + R R | ) 0 2 π H ^ p t ( ξ k , k ) ρ 0 ( ξ k , k ) d k 2 π .
Proof. 
The finding probability μ t ( x ) = tr [ ρ t ( x , x ) ] defined in (12), so the characteristic function takes the following form:
E [ e i ξ X t ] = x tr [ ρ t ( x , x ) ] e i ξ x = tr x ρ t ( x , x ) e i ξ x .
Set the Fourier transform ( F ρ t ) ( k , l ) : = x , y ρ t ( x , y ) e i k x e i l y = : ρ ^ t ( k , l ) ( k , l [ 0 , 2 π ) ). Then the following equation is obtained:
0 2 π ρ ^ t ( ξ k , k ) d k 2 π = 0 2 π x , y ρ t ( x , y ) e i ( ξ k ) x e i k y d k 2 π = x , y ρ t ( x , y ) e i ξ x 0 2 π e i k ξ ( y x ) d k 2 π = x ρ t ( x , x ) e i ξ x .
This implies that the characteristic function of ρ t can be expressed by
E [ e i ξ X t ] = tr 0 2 π ρ ^ t ( ξ k , k ) d k 2 π .
By the recurrence relation representing the local time evolution,
ρ t + 1 ( x , y ) = L p ρ t ( x , y ) = ( 1 p ) L Q W ρ t ( x , y ) + p L R W ρ t ( x , y ) ,
ρ ^ t ( k , l ) satisfies the following recursion with respect to the time step t:
ρ ^ t + 1 ( k , l ) = ( e i k P ) ρ ^ t ( k , l ) ( e i l P * ) + ( e i k Q ) ρ ^ t ( k , l ) ( e i l Q * ) + ( 1 p ) { ( e i k P ) ρ ^ t ( k , l ) ( e i l Q * ) + ( e i k Q ) ρ ^ t ( k , l ) ( e i l P * ) } ,
which implies
ρ t ( k , l ) = H ^ p ( k , l ) ρ t 1 ( k , l ) = H ^ p t ( k , l ) ρ 0 ( k , l ) .
Inserting (14) into (13), we obtain the desired conclusion. □

4.2. Asymptotics of the Eigenvalues of H ^ p ( ξ / t k , k )

To obtain the limit of the characteristic function of X t / t , we consider the expansion of the time evolution operator in the Fourier space H ^ p ( ξ / t k , k ) in Lemma 1 as follows so that the Kato perturbation theorem [18] can be applied.
H ^ p ( ξ / t k , k ) = e i ( ξ / t ) P P ¯ + e i ( ξ / t ) Q Q ¯ + ( 1 p ) ( e i ( ξ / t 2 k ) P Q ¯ + e i ( ξ / t 2 k ) Q P ¯ ) = T + 1 t T ( 1 ) + 1 t T ( 2 ) + O 1 ( t ) 3 ,
where
T = P P ¯ + Q Q ¯ + ( 1 p ) ( e 2 i k P Q ¯ + e 2 i k Q P ¯ ) ,
T ( 1 ) = i ξ { P P ¯ + Q Q ¯ + ( 1 p ) ( e 2 i k P Q ¯ + e 2 i k Q P ¯ ) } = i ξ D T ,
T ( 2 ) = 1 2 ξ 2 { P P ¯ + Q Q ¯ + ( 1 p ) ( e 2 i k P Q ¯ + e 2 i k Q P ¯ ) } = 1 2 ξ 2 T .
Here, D is defined as D = 1 0 0 1 I .
Then let us put T ( ϵ ) : = H ^ p ( ϵ ξ k , k ) . We are interested in the expansion of the perturbed eigenvalues λ ( ϵ ) in spec ( T ( ϵ ) ) which split from the non-perturbed eigenvalue λ : = λ ( 0 ) by the small perturbation ϵ . To this end, we check the spectral formation of the non-perturbed matrix T.
Lemma 2.
Let T be the non-perturbed matrix of T ( ϵ ) . Then 1 spec ( T ) and
dim ( ker ( 1 T ) ) = 1 : p 0 , 2 : p = 0 .
The vector [ 1 0 0 1 ] C 4 is an eigenvector of T, which is independent of the parameter p. Moreover, for any λ spec ( T ) { 1 } ,
| λ | < 1 : p 0 , = 1 : p = 0 .
Proof. 
The non-perturbed matrix T is reexpressed by
T = ( I p Π L R , R L ) ( D ( k ) D ( k ) ) ( C C ¯ ) ,
where Π L R , R L is the projection onto span { | L R , | R L } and
D ( k ) = e i k 0 0 e i k .
Note that | | ( I p Π L R , R L ) ψ | | | | ψ | | for any ψ C 4 and the equality holds if and only if p = 0 or ψ Ran ( I Π L R , R L ) . By the properties of the unitarity of C, for example, | a | 2 + | b | 2 = | c | 2 + | d | 2 = 1 and a b ¯ + c d ¯ = 0 , only the eigenvector of T which belongs to Ran ( I Π L R , R L ) is [ 1 0 0 1 ] . This implies that if p 0 , then dim ker ( 1 T ) = 1 . On the other hand, if p = 0 , then T becomes ( D ( k ) C ) ( D ( k ) C ) ¯ . Since D ( k ) C is a unitary, all the eigenvalues of T are unitary, in particular, dim ker ( 1 T ) = 2 . This finishes the proof. □
Let us concentrate on the p 0 case, since the p = 0 case reproduces the usual quantum walk driven by the unitary operator. By Lemma 2, in a large time iteration of T ( ϵ ) , the eigenspace of the eigenvalue λ ( ϵ ) , which splits from the non-perturbed eigenvalue 1 of T by the small perturbation ϵ , contributes almost all the behavior. The following lemma gives the expansion of λ ( ϵ ) with respect to ϵ .
Lemma 3.
Assume p > 0 . Let λ ( ϵ ) be the eigenvalue of T ( ϵ ) which splits from the non-perturbed eigenvalue 1 of T. Then we have
λ ϵ = 1 ϵ 2 r 2 1 + q 2 2 q cos 2 l 1 q 2 ξ 2 + O ϵ 3
Proof. 
The eigenvalues of H ^ p that are close to 1 can be expanded as follows because 1 is a simple eigenvalue of T:
λ ϵ = 1 + ϵ λ ( 1 ) + ϵ 2 λ ( 2 ) + O ϵ 3 .
Here, since λ = 1 is simple, according to [18], λ ( 1 ) and λ ( 2 ) coincide with the coefficients of the second and third orders of the weighted mean of the eigenvalues that form the λ -group, ( λ = 1 ) ;
λ ( 1 ) = tr [ T ( 1 ) Π 0 ] and λ ( 2 ) = tr [ T ( 2 ) Π 0 T ( 1 ) S T ( 1 ) Π 0 ] ,
respectively, where Π 0 is the eigenprojection associated with the eigenvalue 1 of T, and S is the reduced resolvent associated with the eigenvalue 1 of T. By using (15) and (16), then we have Π 0 = 1 / 2 1 0 0 1 1 0 0 1 , and
λ ( 1 ) = tr [ T ( 1 ) Π 0 ] = tr [ i ξ D T Π 0 ] = tr [ i ξ D Π 0 ] = tr i ξ 2 1 0 0 1 I = 0 .
Let S be defined as S = i = 1 3 Π i / ( 1 λ i ) , where λ i are the eigenvalues of T that are not equal to 1, and P i are the corresponding eigenprojections. λ ( 2 ) is expressed as follows by using (15)–(17):
λ ( 2 ) = tr [ T ( 2 ) Π 0 T ( 1 ) S T ( 1 ) Π 0 ] = tr 1 2 ξ 2 T Π 0 ξ 2 D T i = 1 3 Π i 1 λ i D T Π 0 = tr 1 2 ξ 2 T Π 0 tr ξ 2 D T i = 1 3 Π i 1 λ i D T Π 0 .
Since T Π i = λ i Π i ( i = 0 , 1 , 2 , 3 ), the first and second terms of (20) are reduced to
the first term : tr 1 2 ξ 2 T Π 0 = tr 1 2 ξ 2 Π 0 = 1 2 ξ 2 ,
the second term : tr ξ 2 D T i = 1 3 Π i 1 λ i D T Π 0 = tr ξ 2 i = 1 3 λ i 1 λ i D Π i D Π 0 .
Let us continue the computation of the second term as follows. Due to the commutativity of the trace operation, it is shown that
tr ξ 2 i = 1 3 λ i 1 λ i D Π i D Π 0 = tr ξ 2 i = 1 3 λ i 1 λ i Π i D Π 0 D = tr ξ 2 2 i = 1 3 λ i 1 λ i Π i 1 0 0 1 1 0 0 1 .
Note that by setting T = T Π 0 , we have
i = 1 3 λ i 1 λ i Π i = ( 1 T ) 1 T .
Then let us compute ( 1 T ) 1 T as follows. In this case, with q = 1 p , T is expressed as T = P P ¯ + Q Q ¯ + q ( e 2 i k P Q ¯ + e 2 i k Q P ¯ ) , and thus we have
T = T Π 0 = | a | 2 1 2 a b ¯ a ¯ b | b | 2 1 2 e 2 i l q a ¯ b e 2 i l q | a | 2 e 2 i ( l σ ) q b 2 e 2 i l q a ¯ b e 2 i l q a b ¯ e 2 i ( l σ ) q b ¯ 2 e 2 i l q | a | 2 e 2 i l q a b ¯ | b | 2 1 2 a b ¯ a ¯ b | a | 2 1 2
by utilizing the unitarity of the matrix C. Here, e i σ , e i δ , and l are defined as a = | a | e i σ , e i δ = a d b c , and l = k + σ δ / 2 . By performing calculations using cofactor expansion, the following result is obtained:
( 1 T ) 1 , 1 1 = ( 1 T ) 4 , 4 1 = 1 2 | b | 2 ( 1 q 2 ) × 3 2 | a | 2 1 + q 2 ( | a | 2 | b | 2 ) 2 q | a | 2 cos 2 l + 2 q | a | 2 | b | 2 ( cos 2 l q ) , ( 1 T ) 1 , 2 1 = ( 1 T ) 2 , 1 1 = 1 2 | b | 2 ( 1 q 2 ) ( 1 e 2 i l q ) a b ¯ , ( 1 T ) 1 , 3 1 = ( 1 T ) 3 , 1 1 = 1 2 | b | 2 ( 1 q 2 ) ( 1 e 2 i l q ) a ¯ b , ( 1 T ) 1 , 4 1 = ( 1 T ) 4 , 1 1 = 1 2 | b | 2 ( 1 q 2 ) × 1 2 | a | 2 1 + q 2 ( | a | 2 | b | 2 ) 2 q | a | 2 cos 2 l + 2 q | a | 2 | b | 2 ( cos 2 l q ) .
Therefore, simplifying slightly, we obtain the following formula:
( 1 T ) 1 T 1 , 1 = ( 1 T ) 1 T 1 , 4 = ( 1 T ) 1 T 4 , 1 = ( 1 T ) 1 T 4 , 4 = 1 2 | b | 2 ( 1 q 2 ) 1 2 ( q 2 1 ) + | a | 2 ( 1 q cos 2 l ) .
Put r = | a | 2 / | b | 2 . The above formula simplifies the expression of the second term by
the second term = tr ξ 2 2 ( 1 T ) 1 T 1 0 0 1 1 0 0 1 = ξ 2 2 | b | 2 ( 1 q 2 ) q 2 1 + 2 | a | 2 ( 1 q cos 2 l ) .
Inserting the first term (21) and the second term (23) into (20), we obtain
λ ( 2 ) = 1 2 ξ 2 ξ 2 2 | b | 2 ( 1 q 2 ) q 2 1 + 2 | a | 2 ( 1 q cos 2 l ) = r ( 1 + q 2 2 q cos 2 l ) 2 ( 1 q 2 ) ξ 2 .
The eigenvalues of H ^ p that are close to 1 can be analyzed as follows by inserting (19) and (24) into (18):
λ ϵ = 1 ϵ 2 r 2 1 + q 2 2 q cos 2 l 1 q 2 ξ 2 + O ϵ 3 .
Now by using Lemmas 1–3, let us finish the proof of Theorem 1.

4.3. Proof of Theorem 1

Proof. 
Since the initial state is defined by ρ 0 ( x , y ) I 2 , note that the initial state in the Fourier space, ρ 0 ( k , l ) , is given by
ρ 0 ( k , l ) = 1 2 ( | L L + | R R )
for any k , l [ 0 , 2 π ) . Then using Lemmas 1, the characteristic function can be expressed as follows:
E [ e i ξ X t / t ] = ( L L | + R R | ) 0 2 π ρ t ( ξ / t k , k ) d k 2 π = ( L L | + R R | ) 0 2 π H p t ( ξ / t k , k ) ρ 0 ( ξ / t k , k ) d k 2 π 0 2 π e 1 2 r ( 1 + q 2 2 q cos 2 l ) 1 q 2 ξ 2 d l 2 π ( t )
Here in the last equation, we used Lemmas 2, 3 and the fact that eigenvalues other than those in the neighborhood of 1 approach zero in the limit of t due to the Riemann–Lebesgue lemma. By Lemma 3, for the eigenvalues splitting from 1 by the perturbation ϵ , the second term proportional to ϵ vanishes, while the third term proportional to ϵ retains a value. To obtain a non-trivial convergence in the limit, we set ϵ by ϵ = 1 / t . Next, by setting u = r ( 1 + q 2 2 q cos 2 l ) / ( 1 q 2 ) and performing substitution integral,
0 2 π e 1 2 r ( 1 + q 2 2 q cos 2 l ) 1 q 2 ξ 2 d l 2 π = 1 q 1 + q r 1 + q 1 q r 1 π u 1 q 1 + q r u 1 + q 1 q r e u ξ 2 2 d u .
The term e s ξ 2 2 represents the form of the Fourier transform of a normal distribution, so the final form of the characteristic function in the limit is as follows:
1 q 1 + q r 1 + q 1 q r 1 π u 1 q 1 + q r u 1 + q 1 q r e u ξ 2 2 d u = e i ξ x e x 2 2 u 2 π u 1 1 q 1 + q r , 1 + q 1 q r ( u ) π u 1 q 1 + q r u 1 + q 1 q r d u d x .
In other words, the limit of the characteristic function represents the Fourier transform of the product of a normal distribution and an inverse scale factor. Here, s denotes the variance of the normal distribution, and the distribution of s follows the arcsine distribution. The resulting limit distribution corresponds to the mean of this arcsine distribution. This completes the proof. □

5. Summary and Discussion

In this study, we constructed a model that interpolates between the quantum walk and the random walk on a one-dimensional lattice using a single parameter p [ 0 , 1 ] . We found that the walk spreads diffusively with respect to the time step, and the limiting distribution converges to a normal variance mixture with the arcsine law depending on the parameter p.
Our limit theorem shows discontinuity with respect to the parameter p at p = 0 . Then future challenges include cases where the parameter p is very close to zero. For example, the problem under the setting of the parameter p = γ / s with some positive real value γ and the final time of the walk s may be interesting. Because such a setting produces a Poisson occurrence until the final time s of the decoherence for s , the probability that “the number of occurrence of L R W during the time step s is k” can be described by e γ γ k / k ! for s . Indeed we obtain the following expression for the characteristic function of X s / s with s .
Proposition 3.
Let s be the final time step and set p = γ / s with some positive real number γ > 0 . Put θ ( k ) , α ( k ) and β ( k ) for k [ 0 , 2 π ) by
cos θ ( k ) = | a | cos k , α ( k ) = | a | sin k / sin θ ( k ) , β ( k ) = { 1 α ( k ) 2 } / 2 .
Then we have
lim t E [ e i ξ X s / s ] = 1 2 0 2 π e β ( k ) γ + β ( k ) 2 γ 2 α ( k ) 2 ξ 2 1 + β ( k ) 2 γ 2 α ( k ) 2 ξ 2 β ( k ) γ d k 2 π + 1 2 0 2 π e β ( k ) γ β ( k ) 2 γ 2 α ( k ) 2 ξ 2 1 β ( k ) 2 γ 2 α ( k ) 2 ξ 2 β ( k ) γ d k 2 π .
Proof. 
The proof is given in Appendix A. □
Remark 1.
If we put γ = 0 in the integral of the LHS in (25), which means p = 0 (quantum walk), then
lim s E [ e i ξ X s / s ] = 1 2 0 2 π e i ξ α ( k ) d k 2 π + 0 2 π e i ξ α ( k ) d k 2 π = e i ξ u 1 ( | a | , | a | ) ( u ) π ( 1 s 2 ) | a | 2 u 2 d u .
This is consistent with the limit theorem for the pure quantum walk [16]. On the other hand, if γ , which may correspond to p = c ( > 0 ) , then
lim s E [ e i ξ X s / s ] = 1 ,
which means that the limit density function of X s ( p ) / s is δ 0 ( x ) . This is consistent with the “diffusive” spreading for the interpolating walk with a constant p in Theorem 1.
Although the expression of Proposition 3 looks suggestive, we could not find a great interpretation of the expression. Thus it remains an open problem. The limit behavior of the interpolating walk with the parameter p = 1 / s α , 0 < α < 1 is also a future problem.
The introduction of stochasticity may influence not only the limit distribution but also the recurrence behavior of the walk in a non-trivial way. Our limit theorem implies that the scaling order of our walk is discontinuous with respect to the parameter p at p = 0 . On the other hand, according to the results of [14], the recurrence probability of their model with a parameter θ [ 0 , π / 2 ] is continuous over p [ 0 , 1 ] . Note that the model in [14] intersects with our model at θ = π / 4 . We expect a monotone increase in the recurrence probabilities with p. In contrast with our intuition, a local minimum value exists at p ( 0 , 1 ) in the recurrence probability with an appropriate parameter θ . The continuous quantum stochastic walk on the line [19] shows that the scaling order of the moment is also discontinuous with respect to p [ 0 , 1 ] , but interestingly, the discontinuity appears not at p = 0 but at p = 1 , which contrasts with our discontinuous place in the scaling of the limit theorem. More detailed analytical investigations of these intriguing behaviors are left for future work.
Additionally, while we constructed an interpolation model between persistent random walks and quantum walks on a one-dimensional lattice in this study, considering interpolation models on more general graphs under the construction method proposed by [8] and analyzing their limiting distributions also remain tasks for future research. We hope that in the near future, our observation can contribute the construction and analysis of a discrete-time version of the quantum maze problem which is explored in the continuous-time stochastic quantum walk model in [20].

Author Contributions

Conceptualization, E.S.; formal analysis, S.Y.; investigation, H.S.; validation, T.Y. and R.H.; writing, E.S. and S.Y.; supervision, E.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Japan Society for the Promotion of Science (JSPS), grant numbers 24K06863, 24KJ0864, 23KJ0384, and 22H05197. The APC was covered by the Institutional Open Access Program (IOAP) discount and voucher, and the authors incurred no APC.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The simulation results presented in this study are contained within the article. No additional data are available.

Acknowledgments

H.S. acknowledges financial support from the Grant-in-Aid of JSPS Fellows JSPS KAKENHI (Grant No. JP24KJ0864). T.Y. acknowledges financial support from the Grant-in-Aid of JSPS Fellows JSPS KAKENHI (Grant No. JP23KJ0384). R.H. acknowledges financial support from the Grant-in-Aid of Transformative Research Areas JSPS KAKENHI (Grant No. JP22H05197). E.S. acknowledges financial support from the Grant-in-Aid of Scientific Research (C) JSPS KAKENHI (Grant No. 24K06863).

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proof of Proposition 3

Proof. 
Put a = | a | e i σ , a d b c = e i δ . We divide the proof into the following 3 steps.
  • Step 1: First let us rewrite the time evolution operator in the Fourier space H ^ p ( ξ / t k , k ) in Lemma 1 as follows so that the Kato perturbation theory [18] can be applied.
    H ^ p ( ξ / t k , k ) = e i ( ξ / t ) P P ¯ + e i ( ξ / t ) Q Q ¯ + ( 1 p ) ( e i ( ξ / t 2 k ) P Q ¯ + e i ( ξ / t 2 k ) Q P ¯ ) = T + 1 t T ( 1 ) + O 1 t 2 ,
    where
    T = ( e i k P + e i k Q ) ( e i k P ¯ + e i k Q ¯ ) ,
    T ( 1 ) = D ( ξ , γ ) T ,
    and
    D ( ξ , γ ) = i ξ 1 0 0 1 I γ 1 0 0 0 0 0 0 1 + 0 0 0 1 1 0 0 0 .
    The eigenvalues of the non-perturbed unitary matrix T are described by
    spec ( T ) = { 1 , 1 , e ± 2 i θ ( ) } .
    Let λ ± ( ϵ ) be the eigenvalue of T ( ϵ ) which split from the non-perturbed eigenvalue 1 of T. The eigenvalues of H ^ p that are close to 1 can be expanded as follows because 1 is a semi-simple eigenvalue of T:
    λ ± ϵ = 1 + ϵ λ ± ( 1 ) + O ϵ 2 .
    Here, according to [18], λ ± ( 1 ) spec ( T ˜ ( 1 ) | Ran ( Π ) ) , where T ˜ ( 1 ) = Π T ( 1 ) Π and Π is the eigenprojection associated with the eigenvalue 1 of T. The eigenprojection Π can be expressed by using ϕ + φ and ϕ φ + , which are the eigenvectors corresponding to the eigenvalue of λ = 1 of T, that is,
    Π = | ϕ + , φ ϕ + , φ | + | ϕ , φ + ϕ , φ + | .
    Note that | ϕ ± and | φ ± are the eigenvectors of the unitary matrices e i k P + e i k Q and e i k P ¯ + e i k Q ¯ whose concrete expressions are
    | ϕ ± = 1 2 2 | a | cos ( ± θ ( l ) l ) b e ± i θ ( l ) e i ( σ l ) a ker ( e i δ / 2 e ± i θ ( l ) ( e i k P + e i k Q ) ) , | φ ± = 1 2 2 | a | cos ( ± θ ( l ) + l ) b ¯ e ± i θ ( l ) e i ( σ l ) a ¯ ker ( e i δ / 2 e ± i θ ( l ) ( e i k P ¯ + e i k Q ¯ ) ) ,
    where l = k + σ δ / 2 .
  • Step 2: Secondly, let us obtain the closed form of λ ± ( 1 ) . To this end, let us see that T ˜ ( 1 ) | Ran ( Π ) can be essentially reduced to the following 2-dimensional matrix M ( l ; ξ ; γ ) by
    T ˜ ( 1 ) = | ϕ + , φ | ϕ , φ + M ( l ; ξ ; γ ) | ϕ + , φ | ϕ , φ + * ,
    where
    M ( l ; ξ ; γ ) : = i α ( l ) ξ β ( l ) γ β ( l ) γ β ( l ) γ i α ( l ) ξ β ( l ) γ
    in the following. By using (A1)–(A3), and (A5), we have
    Π T ( 1 ) Π = Π D ( ξ , γ ) T Π = Π D ( ξ , γ ) Π = i ξ Π 1 0 0 1 I Π γ Π 1 0 0 0 0 0 0 1 Π γ Π 0 0 0 1 1 0 0 0 Π = ( i α ( l ) ξ β ( l ) γ ) | ϕ + , φ ϕ + , φ | + ( i α ( l ) ξ β ( l ) γ ) | ϕ , φ + ϕ , φ + | + β ( l ) γ ( | ϕ + , φ ϕ , φ + | + | ϕ , φ + ϕ + , φ | ) = | ϕ + , φ | ϕ , φ + i α ( l ) ξ β ( l ) γ β ( l ) γ β ( l ) γ i α ( l ) ξ β ( l ) γ ϕ + , φ | ϕ , φ + | * .
    Here we used the following computational results in the fourth equality:
    α ( l ) = ϕ ± , 1 0 0 1 ϕ ± , β ( l ) = ϕ ± , 1 0 0 0 ϕ ± φ , 0 0 0 1 φ + ϕ ± , 0 0 0 1 ϕ ± φ , 1 0 0 0 φ = ϕ ± , 1 0 0 0 ϕ φ , 0 0 0 1 φ ± ϕ ± , 0 0 0 1 ϕ φ , 1 0 0 0 φ ± .
    Therefore, since the 2-dimensional matrix M ( l ; ξ ; γ ) is isomorphic to T ˜ ( 1 ) | Ran ( Π ) , the eigenvalues of M ( l ; ξ ; γ ) coincide with λ ± ( 1 ) . Then we have
    λ ± ( 1 ) = β ( l ) γ ± { β ( l ) } 2 γ 2 { α ( l ) } 2 ξ 2 ,
    with the eigenprojections
    Π ± = 1 2 1 i α ( l ) ξ ± { β ( l ) } 2 γ 2 { α ( l ) } 2 ξ 2 β ( l ) γ i α ( l ) ξ ± { β ( l ) } 2 γ 2 { α ( l ) } 2 ξ 2 β ( l ) γ 1 .
  • Step 3: Finally, let us complete the proof by using (A6) and (A7). Let Π ± ( ϵ ) be the eigenprojection of the eigenvalues λ ± ( ϵ ) defined in (A4), respectively. Recall the integral expression of Lemma 1 for the characteristic function of X t ( p ) . Since the contribution to the characteristic function of the eigenvalues in the expression of the integral form Lemma 1 other than λ ± ( ϵ ) can be estimated by O ( 1 / t ) in the limit of t by the Riemann–Lebesgue lemma, it is sufficient to consider H ^ p ( ξ / t k , k ) restricted to the eigenspaces of λ ± ( ϵ ) with ϵ = 1 / t as follows:
    H ^ p t ( ξ / t k , k ) | Ran ( Π ± ( 1 / t ) ) = 1 + 1 t λ + + O 1 t 2 t | ϕ + , φ | ϕ , φ + Π + + O 1 t ϕ + , φ | ϕ , φ + | + 1 + 1 t λ + O 1 t 2 t | ϕ + , φ | ϕ , φ + Π + O 1 t ϕ + , φ | ϕ , φ + | e λ + | ϕ + , φ | ϕ , φ + Π + ϕ + , φ | ϕ , φ + | + e λ | ϕ + , φ | ϕ , φ + Π ϕ + , φ | ϕ , φ + | ( t ) .
    Since we set ρ 0 satisfying
    ρ 0 ( ξ / t k , k ) = 1 2 ( | L L + | R R ) ,
    the characteristic function can be expressed as follows:
    E [ e i ξ X t / t ] = ( L L | + R R | ) 0 2 π ρ t ( ξ / t k , k ) d k 2 π = ( L L | + R R | ) 0 2 π H p t ( ξ / t k , k ) ρ 0 ( ξ / t k , k ) d k 2 π 1 2 0 2 π e λ + ( L L | + R R | ) | ϕ + , φ | ϕ , φ + Π + ϕ + , φ | ϕ , φ + | ( | L L + | R R ) d l 2 π + 1 2 0 2 π e λ ( L L | + R R | ) | ϕ + , φ | ϕ , φ + Π ϕ + , φ | ϕ , φ + | ( | L L + | R R ) d l 2 π ( t ) .
    Inserting the expressions of Π ± in (A7) and using the following facts
    ( L L | + R R | ) | ϕ ± , φ ϕ , φ ± | ( | L L + | R R ) = ( L L | + R R | ) | ϕ ± , φ ϕ ± , φ | ( | L L + | R R ) = 1 ,
    we obtain the desired conclusion:
    E [ e i ξ X t / t ] 1 2 0 2 π e λ + 1 + β ( l ) 2 γ 2 { α ( l ) } 2 ξ 2 β ( l ) γ d l 2 π + 1 2 0 2 π e λ 1 β ( l ) 2 γ 2 { α ( l ) } 2 ξ 2 β ( l ) γ d l 2 π ( t ) .

References

  1. Ambainis, A.; Bach, E.; Nayak, A.; Vishwanath, A.; Watrous, J. One-dimensional quantum walks. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Crete, Greece, 6–8 July 2001; pp. 37–49. [Google Scholar]
  2. Kendon, V. Decoherence in quantum walks—A review. Math. Struct. in Comp. Sci. 2006, 17, 1169–1220. [Google Scholar] [CrossRef]
  3. Konno, N. Quantum Walks. In Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2008; Volume 1954, pp. 309–452. [Google Scholar]
  4. Meyer, D.A. From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 1996, 85, 551–574. [Google Scholar] [CrossRef]
  5. Portugal, R. Quantum Walk and Search Algorithm, 2nd ed.; Springer Nature: Cham, Switzerland, 2018. [Google Scholar]
  6. Balakrishnan, V.; Chaturvedi, S. Persistent diffusion on a line. Phys. Stat. Mech. Its Appl. 1988, 148, 581–596. [Google Scholar] [CrossRef]
  7. Konno, N. Limit theorems and absorption problems for one-dimensional correlated random walks. Stoch. Model. 2009, 25, 28–49. [Google Scholar] [CrossRef]
  8. Schuhmacher, P.K.; Govia, L.C.G.; Taketani, B.G.; Wilhelm, F.K. Quantum simulation of a discrete-time quantum stochastic walk. Lett. J. Explor. Front. Phys. 2021, 133, 50003. [Google Scholar] [CrossRef]
  9. Whitfield, J.D.; Rodríguez-Rosario, C.A.; AspuruGuzik, A. Quantum stochastic walks: A generalization of classical random walks and quantum walks. Phys. Rev. A 2010, 81, 022323. [Google Scholar] [CrossRef]
  10. Hall, P.; Heybe, C.C. Martingale Limit Theory and Its Application; Probability and Mathematical Statistics; Academic Press: Cambridge, MA, USA, 1980. [Google Scholar]
  11. Konno, N.; Matsue, K.; Segawa, E. A crossover between open quantum random walks to quantum walks. J. Stat. Phys. 2023, 190, 202. [Google Scholar] [CrossRef]
  12. Brun, T.A.; Carteret, H.A.; Ambainis, A. Quantum random walks with decoherent coins. Phys. Rev. A 2003, 67, 032304. [Google Scholar] [CrossRef]
  13. Ahlbrecht, A.; Vogts, H.; Werner, A.H.; Werner, R.F. Asymptotic evolution of quantum walks with random coin. J. Math. Phys. 2011, 52, 042201. [Google Scholar] [CrossRef]
  14. Štefănák, M.; Potoĕk, V.; Yalçınkaya, I.; Gábris, A.; Jex, I. Recurrence in discrete-time quantum stochastic walks. arXiv 2015, arXiv:2501.08674. [Google Scholar]
  15. Kronrod, A.S. Nodes and Weights of Quadrature Formulas: Sixteen-Place Tables; Consultants Bureau: New York, NY, USA, 1965. [Google Scholar]
  16. Konno, N. Quantum random walks in one dimension. Quantum Inf. Process. 2002, 1, 345–354. [Google Scholar] [CrossRef]
  17. Attal, S.; Petruccione, F.; Sabot, C.; Sinayskiy, I. Open quantum random walks. J. Stat. Phys. 2012, 147, 832852. [Google Scholar] [CrossRef]
  18. Kato, T. A Short Introduction to Perturbation Theory for Linear Operator; Springer: New York, NY, USA, 1982. [Google Scholar]
  19. Domino, K.; Glos, A.; Ostaszewski, M.; Pawela, Ł.; Sadowski, P. Properties of quantum stochastic walks from the asymptotic scaling exponent. Quantum Inf. Comput. 2018, 18, 181–197. [Google Scholar] [CrossRef]
  20. Caruso, F.; Crespi, A.; Ciriolo, A.G.; Sciarrino, F.; Osellame, R. Fast escape of a quantum walker from an integrated photonic maze. Nat. Commun. 2016, 7, 11682. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Probability distribution μ t ( p ) of the interpolating walks with a = b = c = d = 1 / 2 at the final time s = 100 . The parameters p of the four panels are set to (a) 1 / 100 , (b) 1 / 10 , (c) 1 / 2 , and (d) 9 / 10 , respectively. Note that the values only on the positions labeled with even numbers are plotted; the ones on the odd-numbered positions are zero.
Figure 1. Probability distribution μ t ( p ) of the interpolating walks with a = b = c = d = 1 / 2 at the final time s = 100 . The parameters p of the four panels are set to (a) 1 / 100 , (b) 1 / 10 , (c) 1 / 2 , and (d) 9 / 10 , respectively. Note that the values only on the positions labeled with even numbers are plotted; the ones on the odd-numbered positions are zero.
Entropy 27 00670 g001
Figure 2. Comparison between f t ( x ) and f * ( x ) : We set t = 100 , p = 1 / 2 and a = b = c = d = 1 / 2 . The blue step function shows f t ( x ) with t = 100 , while the orange curve shows the limit density function f * ( x ) .
Figure 2. Comparison between f t ( x ) and f * ( x ) : We set t = 100 , p = 1 / 2 and a = b = c = d = 1 / 2 . The blue step function shows f t ( x ) with t = 100 , while the orange curve shows the limit density function f * ( x ) .
Entropy 27 00670 g002
Figure 3. The numerical simulation of the distribution μ s ( λ / s ) with the parameter p = λ / s at the final time s 1 . We set λ = 1 , s = 10 3 and a = b = c = d = 1 / 2 .
Figure 3. The numerical simulation of the distribution μ s ( λ / s ) with the parameter p = λ / s at the final time s 1 . We set λ = 1 , s = 10 3 and a = b = c = d = 1 / 2 .
Entropy 27 00670 g003
Figure 4. The recursion (3).
Figure 4. The recursion (3).
Entropy 27 00670 g004
Figure 5. The recursion (4).
Figure 5. The recursion (4).
Entropy 27 00670 g005
Figure 6. The recursion (7).
Figure 6. The recursion (7).
Entropy 27 00670 g006
Figure 7. The recursion (8).
Figure 7. The recursion (8).
Entropy 27 00670 g007
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yoshino, S.; Shiratori, H.; Yamagami, T.; Horisaki, R.; Segawa, E. Normal Variance Mixture with Arcsine Law of an Interpolating Walk Between Persistent Random Walk and Quantum Walk. Entropy 2025, 27, 670. https://doi.org/10.3390/e27070670

AMA Style

Yoshino S, Shiratori H, Yamagami T, Horisaki R, Segawa E. Normal Variance Mixture with Arcsine Law of an Interpolating Walk Between Persistent Random Walk and Quantum Walk. Entropy. 2025; 27(7):670. https://doi.org/10.3390/e27070670

Chicago/Turabian Style

Yoshino, Saori, Honoka Shiratori, Tomoki Yamagami, Ryoichi Horisaki, and Etsuo Segawa. 2025. "Normal Variance Mixture with Arcsine Law of an Interpolating Walk Between Persistent Random Walk and Quantum Walk" Entropy 27, no. 7: 670. https://doi.org/10.3390/e27070670

APA Style

Yoshino, S., Shiratori, H., Yamagami, T., Horisaki, R., & Segawa, E. (2025). Normal Variance Mixture with Arcsine Law of an Interpolating Walk Between Persistent Random Walk and Quantum Walk. Entropy, 27(7), 670. https://doi.org/10.3390/e27070670

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop