Next Article in Journal
Fermatean Fuzzy Fairly Aggregation Operators with Multi-Criteria Decision-Making
Next Article in Special Issue
The Magnificent Realm of Affine Quantization: Valid Results for Particles, Fields, and Gravity
Previous Article in Journal
Representations of Generalized Loop Planar Galilean Conformal Algebras W(Γ)
Previous Article in Special Issue
Quasi-Magical Fermion Numbers and Thermal Many-Body Dynamics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks

by
Abdessatar Souissi
1,*,
Tarek Hamdi
2,
Farrukh Mukhamedov
3,4,5,* and
Amenallah Andolsi
6
1
Department of Accounting, College of Business Management, Qassim University, Ar Rass 58611, Saudi Arabia
2
Department of Management Information Systems, College of Business Management, Qassim University, Ar Rass 58611, Saudi Arabia
3
School of Mathematics& Natural Sciences, New Uzbekistan University, 54, Mustaqillik Ave., Tashkent 100007, Uzbekistan
4
School of Engineering, Central Asian University, 264, National Park Street, Barkamol MFY, Yangiabad Village, Qibray Sistrict, Tashkent Region 111221, Uzbekistan
5
Department of Mathematical Sciences, College of Science, United Arab Emirates University, Al-Ain 15551, United Arab Emirates
6
Nuclear Physics and High Energy Physics Research Unit, Faculty of Sciences of Tunis, University of Tunis El Manar, Tunis 2092, Tunisia
*
Authors to whom correspondence should be addressed.
Axioms 2023, 12(9), 864; https://doi.org/10.3390/axioms12090864
Submission received: 17 July 2023 / Revised: 1 September 2023 / Accepted: 6 September 2023 / Published: 7 September 2023
(This article belongs to the Special Issue Advances in Quantum Theory and Quantum Computing)

Abstract

:
Quantum Markov chains (QMCs) and open quantum random walks (OQRWs) represent different quantum extensions of the classical Markov chain framework. QMCs stand as a more profound layer within the realm of Markovian dynamics. The exploration of both QMCs and OQRWs has been a predominant focus over the past decade. Recently, a significant connection between QMCs and OQRWs has been forged, yielding valuable applications. This bridge is particularly impactful when studying QMCs on tree structures, where it intersects with the realm of phase transitions in models naturally arising from quantum statistical mechanics. Furthermore, it aids in elucidating statistical properties, such as recurrence and clustering. The objective of this paper centers around delving into the intricate structure of QMCs on Cayley trees in relation to OQRWs. The foundational elements of this class of QMCs are built upon using classical probability measures that encompass the hierarchical nature of Cayley trees. This exploration unveils the pivotal role that the dynamics of OQRWs play in shaping the behavior of the Markov chains under consideration. Moreover, the analysis extends to their classical counterparts. The findings are further underscored by the examination of notable examples, contributing to a comprehensive understanding of the outcomes.

1. Introduction

QMCs were introduced by L. Accardi in [1,2], and subsequently, they have been studied by many authors in the 1D case [3,4,5,6,7,8]. Important applications of QMCs have been investigated [7,9,10,11,12]. Namely, significant use cases of Markov chains in modeling collaborative interactions for detecting proteins within biological systems have been explored in prior studies, as evidenced by research, such as [13,14,15,16,17].
Motivated by the theory of Dobrushin’s Markov random fields [18], several extensions of QMCs to graphs and trees have been suggested [19,20]. Namely, a quantum phase transitions approach to QMCs on Cayley trees has been investigated [21,22]. Quantum Markov states (QMSs) [3] are particular QMCs. The tree extension of QMSs has been described in detail [23].
Over the past few decades, quantum random walks [24,25,26,27,28,29,30,31] have been extensively studied due to their usefulness as powerful tools for constructing quantum algorithms. From a probabilistic perspective, open quantum random walks (OQRWs) [32,33,34,35,36,37] represent a natural and direct extension of classical Markov chains, exhibiting many interesting statistical and physical properties.
Recently, a significant connection between QMCs and OQRWs has been established [38,39,40]. In [41], the study focused on investigating QMCs on trees associated with OQRWs in relation to phase transition phenomena. Moreover, a mean entropy formulae for the associated tree-indexed QMS has been calculated (see also [42,43]). In addition, the concept of stopping rules for QMCs on trees has been explored in [44,45]. Additionally, in [46], the recurrence problem for a specific class of QMCs on trees was studied with a connection to phase transitions in an Ising-type model. In [47], the notion of recurrence was associated with QMCs on trees in conjunction with OQRWs.
In this paper, we explore a new class of quantum Markov chains (QMCs) on the semi-infinite Cayley tree of order. We express their correlations using classical probability measures that are not Markovian. For each density matrix ρ , a probability measure P ρ is naturally assigned to the space of trajectories Λ V as follows:
P ρ ( i u 1 , i u 2 , , i u m ) = 1 ( ρ u 1 ) B i u m 1 i u m B i u 2 i u 3 B i u 1 i u 2 ρ u 1 B i u 1 i u 2 * B i u 2 i u 3 * B i u m 1 i u m *
for specific edge-paths u 1 u 2 u m in the Cayley tree.
The obtained characterization of a QMC extends the results of previous works [41,47,48]. We point out that the hierarchical structure of the Cayley tree is essentially used in expressing the considered QMCs, as well as in defining the associated classical probability measure.
It should be emphasized that this work opens up possibilities for further investigations on OQRWs. Potential future research directions include exploring the action of symmetry groups on general QMCs on Cayley trees, studying phase transitions, investigating recurrence in the sense of [47], examining ergodic properties, and exploring entropy for the class of QMCs studied in this paper. These topics will be the focus of forthcoming studies.
The structure of this paper is outlined as follows. After the preliminary Section 2, we proceed to Section 3 where we introduce QMCs on trees. Section 4 presents a structure theorem for generalized QMCs associated with OQRWs. Finally, Section 5 is dedicated to expressing the classical probability measures associated with the QMCs under consideration. Section 6 is devoted to some illustrative examples.

2. Preliminaries on Trees

By Γ + k = ( V , E ) ( k N ), we denote the semi-infinite regular tree (Cayley tree) of order k. The vertex o V represents its root. The nearest-neighbor nodes u , v V are denoted as u v if and only if < u , v > E . A path on the tree is a finite list of pairwise distinct vertices u 1 u 2 u m , where m is referred to as the length of the path. The distance d ( u , v ) between two vertices u , v V is defined as the length of the unique path joining them.
A coordinate structure (see Figure 1) is naturally assigned to Γ + k : each vertex x W m is identified with an n-tuple x ( 1 , , m ) , where j { 1 , , k } for 1 j n . The root o is represented as ( o ) . The elements of the nth level W n can be listed as follows:
W n = { ( 1 , 2 , , n ) ; j = 1 , 2 , , k }
Put
Λ n = j = 1 n W j ; Λ [ m , n ] = j = m n W j
To each vertex u = ( 1 , 2 , , n ) W n , we associate the unique path joining it to the root o as follows:
o u 1 = ( 1 ) u 2 = ( 1 , 2 ) u n 1 = ( 1 , 2 , , n 1 ) u
The direct successors set of u is defined by
S ( u ) = v W n + 1 : u v = ( u , ) : = 1 , 2 , , k
For u = ( 1 , 2 , , m ) W m , we define
u u = ( 1 , 2 , , n , 1 , 2 , , m ) W n + m
In particular, u o = u . Let V u be the set of vertices v whose unique path joining v to o contains u = ( 1 , 2 , , n ) . In other words,
V u = v = u u : u V ;
Let V u ; n = V u Λ n . The sub-tree Γ + ; u k = ( V x , E x ) , with vertex set V x , is isomorphic to Γ + k . Define
α u ( u ) : = u u
The map α u defines a graph isomorphism [49] from Γ + k into Γ + ; u k .

3. Quantum Markov Chains on Trees

For each u V , let A u be a C * -algebra of observables on the site u with unit 1 I u . Define A Λ n = u Λ n A u for each n. We then have the embedding
A Λ n A Λ n 1 I W n + 1 A Λ n + 1
where for each bounded region F V , we have 1 I F = u F 1 I u . The local algebra associated with the increasing net { A Λ n } n 0 is denoted as
A V , loc = n N A Λ n
and the associated quasi-local algebra is given by
A V = A V , loc ¯ C *
For further details about quasi-local algebras, we refer to [50].
The set of states of a C * -algebra A is denoted as S ( A ) . Consider unital C * -algebras C and B , where C is a subset of B , and B is a subset of A . It is important to note the following definitions:
  • A quasi-conditional expectation [51] is a linear map E : A B that is completely positive and identity-preserving, satisfying the condition E ( c a ) = c E ( a ) for all a A and c C .
  • A (Markov) transition expectation is a linear map between two unitary C * -algebras that is completely positive and identity-preserving.
For a specific transition expectation denoted by E W n from A Λ [ n , n + 1 ] to A W n , the map defined as
E Λ n = id A Λ n 1 E W n
is a transition expectation with respect to the triplet A Λ n 1 A Λ n A Λ n + 1 .
The hierarchical structure of the Cayley tree is evident from the following equation:
W n + 1 = u W n S ( u )
This equation allows us to consider local transition expectations (see [23]), denoted by E u , from A { u } S ( u ) into A u . We then define the map
E n : = u W n E u
which provides a transition expectation from A Λ [ n , n + 1 ] into A W n .
Definition 1.
A (backward) quantum Markov chain (QMC) on A V is characterized by the triplet ( ϕ o , ( E n ) n 0 , ( h n ) n ) , where we have the following:
  • ϕ o S ( A o ) is the initial state;
  • For each n, the map E n is a transition expectation from A Λ [ n , n + 1 ] into A W n ;
  • For each n, h n A W n , + is a positive boundary condition.
The limit
φ ( a ) : = lim n ϕ 0 E Λ 0 E Λ 1 E Λ n ( h n + 1 1 / 2 a h n + 1 1 / 2 )
exists in the weak-*-topology for each a A V and defines a state φ on A V , where E Λ k is the quasi-conditional expectation given by (5) for every k N . In this case, the state φ defined by (8) is also referred to as a quantum Markov chain (QMC). The triplet ( ϕ o , E , h ) is called the tree-homogeneous QMC on A V .
Remark 1.
The definition above introduces quantum Markov chains on trees as a triplet that generalizes the definitions considered in [22] by incorporating boundary conditions. Additionally, it extends the recent unified definition of quantum Markov chains in the one-dimensional case [5] to trees.
Let A be a unital C * -algebra with identity 1 I . For each u V , we define A u = A . The graph isomorphism α u ˜ given by (4) can be extended to an isomorphism from A V to A V u as follows:
α u ˜ x Λ n a x = x Λ n a x ( α u ( x ) ) = y Λ u ; n a α u 1 ( y ) ( y )
Here, for each a A , we define α u ˜ ( a ) : = a ( u ) = v V { u } 1 I v a , which means that a appears as the u-th component of the infinite tensor product. The notation α u 1 represents the inverse isomorphism of α u , mapping Λ u ; n to Λ n . Finally, let α u ˜ 1 be the inverse isomorphism from A V u to A V [48].

4. Main Result

Consider a connected graph with a countable vertex set Λ . Let H and K be two separable Hilbert spaces. We define { | i , i Λ } as an orthonormal basis of K indexed by the graph Λ . Furthermore, let A = B ( H K ) .
For each vertex x V , we associate the C * -algebra of observable A x = α x ˜ ( A ) . Additionally, for each pair ( i , j ) Λ 2 , the transition from the state vector | j to the state vector | i is represented by an operator B j i B ( H ) , satisfying the following:
i Λ B j i * B j i = 1 I B ( H ) .
Consider the density operator ρ B ( H K ) of the form
ρ = i Λ ρ i | i i | ; ρ 1 B ( H ) + .
In the sequel, for the sake of simplicity of the calculations, it is assumed that ρ i 0 for all i Λ (see [39], Remark 4.5 for other kinds of initial states).
Let us consider the following:
M j i = B j i | i j | B ( H K )
Following [39,41], one defines
A j i : = 1 Tr ( ρ j ) 1 / 2 ρ j 1 / 2 | i j | , i , j Λ
For each u V , we set
K j i : = α o ˜ ( M j i * ) v S ( o ) A j i ( v ) A { o } S ( o )
Consider the symmetric group S k + 1 , which consists of permutations on the set { 0 , 1 , , k } . Each permutation σ S k + 1 defines an automorphism, denoted by σ , on A { o } S ( o ) . This automorphism can be represented as a linear extension of the following mapping:
σ : a ( o , 0 ) a ( o , 1 ) a ( o , k ) a ( o , σ ( 0 ) ) a ( o , σ ( 1 ) ) a ( o , σ ( k ) )
Lemma 1.
Let σ S k + 1 . The map defined by
E σ ( a ) = ( i , j ) Λ 2 Tr o ] K j i σ ( a ) K j i * , a A { o } S ( o )
is a Markov transition expectation from A { o } S ( o ) into A o . Moreover,
E σ a ( o , 0 ) a ( o , 1 ) a ( o , k ) = ( i , j ) Λ 3 = 1 k φ j ( a ( u , σ ( ) ) ) M j i * a ( o , σ ( 0 ) ) M j i
for every a ( o , i ) A ( o , i ) , i = 0 , 1 , , k . Here,
φ j ( b ) : = 1 Tr ( ρ j ) Tr ρ j | j j | b ; b B ( H ) B ( K )
Proof. 
The map σ is completely positive from A { o } S ( o ) into itself. Moreover, the Kraus map K : = i , j K j i · K j i * and the partial trace Tr o ] are completely positive. Then,
E σ = Tr o ] K σ
is a composition of completely positive maps.
Let a = a ( o , 0 ) a ( o , 1 ) a ( o , k ) ; according to (13), (11), and (15), one has
E σ ( a ) = ( i , j ) Λ 2 Tr u ] K j i a ( o , σ ( 0 ) ) a ( o , σ ( 1 ) ) a ( o , σ ( k ) ) K j i * = Tr u ] ( i , j ) Λ 2 K j i a ( i , j ) Λ 2 K j i * = ( i , j ) Λ 2 M j i * a ( o , σ ( 0 ) ) M j i = 1 k Tr ( A j i a ( o , σ ( ) ) A j i * ) .
From (12) for each { 1 , , k } , one has
Tr ( A j i a ( o , ) A j i * ) = Tr A j i * A j i a ( o , ) = 1 Tr ( ρ j ) Tr ρ j | j i | a ( u , )
This leads to (16). On the other hand, because φ j ( 1 I ) = 1
E σ ( 1 I A { o } S ( o ) ) = ( i , j ) Λ 2 M j i * M j i = (11) ( i , j ) Λ 2 B j i * | j i | B j i | i j | = ( i , j ) Λ 2 B j i * B j i | j j | = i Λ B j i * B j i 1 I B ( K ) = (10) 1 I A o .
Therefore, E σ is a Markov transition expectation. This finishes the proof. □
For each u V , we consider the shifted transition expectation
E u σ = α u ˜ E σ α u ˜ 1
from A { u } S ( u ) into A u . For m N and ( i 1 , i 2 , , i m ) Λ m , one defines
B ( i 1 , i 2 , , i m ) = B i m 1 i m B i m 2 i m 1 B i 2 i 3 B i 1 i 2
The subsequent probability measure encompasses the open OQRW dynamics, taking into account the hierarchical structure of the Cayley trees via edge-paths.
P ρ i 1 ( i 1 , i 2 , , i m ) : = 1 Tr ( ρ i 1 ) Tr B ( i 1 , i 2 , , i m ) ρ i 1 B * ( i 1 , i 2 , , i m )
For each { 1 , 2 , , k } , we introduce the following subsets of vertices:
W m ; = x = ( 1 , , m ) W m : 1 , , m 1 { 1 , 2 , , k } and m =
Λ n ; : = m = 1 n W m ;
Denote
( x , ( m ) ) : = ( x , , , m times )
In particular, for x = o , we denote ( o , ( m ) ) simply as ( ( m ) ) . For each x Λ n , we denote the largest integer m x ; n such that ( x , ( m x ; n ) ) Λ . Specifically, if x W j for some j n , then m x ; n = n j . Please refer to Figure 2 for an illustration of the elements of Λ n ; 2 in the case of the Cayley tree with order 3.
The set of vertices in which the coordinates do not incorporate as an element is defined by
N : = v = ( 1 , 2 , , m ) : m N , i , i = 1 , 2 , , m
In particular, for each n N , we denote
N n ; = Λ n N
For every u Λ , we set
N u ; : = α u ( N ) = { u v : v N } ; N u ; n ; : = N u ; Λ n
Theorem 1.
Let σ S k + 1 such that : = σ ( 0 ) 0 . In the notations of (12), (11), and Lemma 1, if ϕ o is a state on A o , the triple ( ϕ o , E σ , h = 1 I o ) defines quantum Markov chains φ σ on A V . Moreover, for each n and a = u Λ n a u :
φ σ ( a ) = i o Λ ( i t ) t Λ Λ n ; ϕ o M ( i o , i ( ) , , i ( ) ( n ) ) φ i o ( a o ) x N n ; φ i o ( a x )
u Λ n , v N u ; n ; P ρ i u i u , i ( v , ) P ρ i u i u , i ( v , ) , , i ( v , ( m v ; n ) ) φ i u ( a v ) φ i u ( a u )
where
M ( i , i ( ) , , i ( ) ( n ) ) = B * ( i , i ( ) , , i ( ) ( n ) ) B ( i , i ( ) , , i ( ) ( n ) ) | i i |
Proof. 
Let us first prove the existence of the limit (8) for
E Λ n = i d A Λ n 1 E n ; E n = u W n E u σ
and h n = 1 I W n . Let n 0 N . For a = a o a W 1 a W n A Λ n and m > n , one has
E Λ m σ ( a 1 I Λ m + 1 Λ m ) = a E m ( 1 I W m 1 I W m + 1 ) = a 1 I Λ m Λ n
It follows that
φ m σ ( a ) : = φ o E Λ 0 σ E Λ 1 σ E Λ m σ ( a ) = φ o E Λ 0 σ E Λ 1 σ E Λ m 1 σ ( a ) = φ o E Λ 0 σ E Λ 1 σ E Λ n σ ( a )
Then, the strongly finite limit defined by (8) exists and gives rise to a positive functional φ σ . Based on Lemma 1, the map E n is completely positive and implements a quantum channel with intermediate purification (CPIP). Therefore, φ σ ( ϕ o , E σ , 1 I o ) represents a quantum Markov chain (QMC) on A V . Furthermore, we obtain the following:
φ σ ( a ) = φ o E 0 a W 0 E n 1 a W n 1 E n a W n 1 I W n + 1
One has
φ j u i , j M j i * a v M j i = 1 Tr ( ρ j u ) Tr i , j ρ j u | j u j u | M j i * a v M j i = 1 Tr ( ρ j u ) Tr i , j M j i ρ j u | j u j u | M j i * a v = (11) 1 Tr ( ρ j u ) Tr i B j u i ρ j u B j u i * | i i | a v
We are going to show by induction on p that
E n p a W n p E n p + 1 a W n p + 1 E n a W n 1 I = u W n p ( i u Λ ( i v ) Λ V u Λ n ; M ( i u , i ( u , ) , , i ( u , ( ) ( m u ; n ) ) ) φ i u ( a u ) x N u ; n ; φ i u ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) )
Starting with the case p = 1 . For u W n 1 and v S ( u ) . Let u W n 1 and v W n , and for each b A , one has
f v ( b ) : = E v σ b 1 I ( v , 1 ) 1 I ( v , k ) = (16) i , j M j i * M j i φ j ( b ) = (10) j 1 I B ( H ) | j j | φ j ( b ) .
One can see that φ j ( f v ( a v ) ) = φ j ( a v ) . Then,
E u σ a u v S ( u ) E v σ a v 1 I = (16) E u σ a u v S ( u ) f v ( a v )
= i u , j u M j u i u * f ( a ( u , 0 ) ) M j u i u φ j u ( a u ) v S ( u ) { ( u , ) } φ j u ( a v ) .
One has
M j u i u * f ( a ( u , ) ) M j u i u = M j u i u * j 1 I B ( H ) | j j | M j u i u = j B j u i u * B j u i u | j u j u | δ j , i u = B j u i u * B j u i u | j u j u | .
It follows that
E u σ a u v S ( u ) E v σ a v 1 I = i , j B j i * B j i | j j | φ j ( a u ) φ i ( a ( u , ) ) v S ( u ) { ( u , ) } φ j ( a v ) .
It follows that
E n a n 1 E n ( a W n 1 I ) = u W n 1 E u σ a u v S ( u ) E v σ a v 1 I
= u W n 1 i , j B j i * B j i | j j | φ j ( a u ) φ i ( a ( u , ) ) v S ( u ) { ( u , ) } φ j ( a v ) .
Let us suppose that the induction hypothesis stated in (25) is valid for a specific value of p. In this case, it implies that
E n p a W n p E n p + 1 a W n p + 1 E n a W n 1 I = u W n p A u ,
where
A u : = i u Λ ( i v ) Λ V u Λ n ; M ( i u , i ( u , ) , , i ( u , ( ) ( m u ; n ) ) ) φ i u ( a u ) x N u ; n ; φ i u ( a x )
v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) .
From the induction hypothesis (25), one finds
E n p 1 a W n p 1 E n p a W n p E n p + 1 a W n p + 1 E n a W n 1 I = t W n p 1 E t σ a t u S ( t ) A u = (18) i t , j t M i t j t * A ( t , ) M i t j t φ i t ( a t ) u S ( ( t , ) { ( t , ) } φ i t ( A u ) .
One has
M i t j t * A ( t , ) M i t j t = i ( t , ) ( i u ) Λ V ( t , ) Λ n B i t j t * B ( i ( t , ) , , ( t , ( ) m t ; n ) ) * B ( i ( t , ) , , ( t , ( ) m t ; n ) ) B i t j t | i t i t | δ j t , i ( t , ) φ i ( t , ) ( a ( t , ) ) x N ( t , ) ; n ; φ i ( t , ) ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) = (19) i ( t , ) ( i u ) Λ V ( t , ) Λ n M ( i t , i ( t , ) , , ( t , ( ) m t ; n ) ) δ j t , i ( t , ) φ i ( t , ) ( a ( t , ) ) x N ( t , ) ; n ; φ i ( t , ) ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) )
and
φ j ( A u ) = i u Λ ( i v ) Λ V u Λ n ; φ j u ( M ( i u , i ( u , ) , , i ( u , ( ) ( m u ; n ) ) ) ) φ i u ( a u ) x N u ; n ; φ i u ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) = (20) i u Λ ( i v ) Λ V u Λ n ; P ρ i u ( i u , i ( u , ) , , i ( u , ( ) ( m u ; n ) ) ) δ i t , i u φ i u ( a u ) x N u ; n ; φ i u ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) = (23) i u Λ ( i v ) Λ V u Λ n ; P ρ i t ( i t , i ( u , ) , , i ( u , ( ) ( m u ; n ) ) ) φ i t ( a u ) x N u ; n ; φ i t ( a x ) v V u Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) .
Summing up, one gets
E n p 1 a W n p 1 E n p a W n p E n p + 1 a W n p + 1 E n a W n 1 I = t W n p 1 ( i t Λ ( i v ) Λ V t Λ n ; M ( i t , i ( t , ) , , i ( t , ( ) ( m t ; n ) ) ) φ i t ( a t ) x N t ; n ; φ i t ( a x ) v V t Λ n , φ i v ( a v ) w N v ; n ; P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) ) .
This proves that (25) holds for any integer p n . In particular, for p = n , one obtains the expression of
E 0 a W 0 E 1 a W 1 E n a W n 1 I = i o Λ ( i v ) Λ Λ n ; ( M ( i o , i ( o , ) , , i ( o , ( ) ( n ) ) ) φ i o ( a o ) x N n ; φ i o ( a x ) v Λ n , φ i v ( a v ) w N v , n , P ρ i v i v , i ( w , ) P ρ i v i v , i ( w , ) , , i ( w , ( m w ; n ) ) φ i v ( a w ) ) .
By applying the initial state ϕ o to the expression above, we obtain (22). This step concludes the proof. □
Remark 2.
In the notation of Theorem 1, the case σ ( 0 ) = 0 has been studied in [41]. In that situation, the QMC φ is represented by
φ ( i d ) ( a ) = ϕ 0 i j M j i * a v M j i v S ( u ) ψ j ( a v ) .
For any localized element a = u Λ n a u , here
ψ j ( b ) = 1 Tr ( ρ j ) i Λ Tr B j i ρ j B j i * | i i | b .
Meanwhile, the case σ ( 0 ) 0 leads to the QMC given by (22) which has a much more sophisticated structure.
Remark 3.
The equation (22) reveals that the essential constituents of the QMC φ σ are formed by the probability measures (1). Consequently, the correlations of the QMC under study are governed by the OQRW dynamics. In the subsequent section, we will observe that this substantial reliance of the QMC on the OQRW dynamics is further demonstrated by focusing on a diagonal subalgebra.

5. Classical Probability Associated with OQRW

In this section, we examine the classical probability measures associated with the quantum Markov chains described in Theorem 1. Consider the set Ω = Λ V equipped with the cylindrical σ -algebra F . Let e = { | i } i Λ denote an orthonormal basis for K . We define D e as the diagonal subalgebra of B ( K ) spanned by the projections | i i | .
Given a state φ on A V , we associate a classical probability measure μ φ on ( Ω , F ) , which operates on atomic events ( i x ) x Λ n as follows.
μ φ ( i x ) x Λ n ) = φ x Λ n ( 1 I H | i x i x | ) ( x )
From (17) and (11), one finds
φ j 1 I H | i i | = δ i , j .
The classical probability μ φ ( i d ) associated with the QMC φ ( i d ) given by (26) is the following:
μ φ ( i d ) ( i x ) x Λ n = ϕ o M i o ( 1 I H | i o i o | u Λ [ 1 , n ] φ i u 1 I H | i u i u | δ i o , i u = ϕ o ( 1 I H | i o i o | ) u Λ [ 1 , n ] δ i o , i u .
Let σ S k + 1 and let φ ( σ ) be the QMC given by (22). The probability measure μ φ ( σ ) associated with φ ( σ ) is given by
μ φ ( σ ) ( i x ) x Λ n = ϕ o B * ( i o , i ( ) , , i ( ) ( n ) ) B ( i o , i ( ) , , i ( ) ( n ) ) | i o i o | x N n ; δ i x , i o
u Λ n ; v N u ; n ; P ρ i v i u , i ( v , ) P ρ i v i u , i ( v , ) , , i ( v , ( m v ; n ) ) δ i v , i u .
Remark 4.
The distinction between the two QMCs φ ( i d ) and φ ( σ ) becomes evident in the expressions of their corresponding classical probability measures μ φ ( i d ) and μ φ ( σ ) . Specifically, when restricted to the cylinder Λ Λ n , the distribution μ φ ( i d ) focuses solely on the atomic events ( i x ) x Λ n where i x = i o for every x Λ n . On the other hand, the distribution μ φ ( σ ) assigns probabilities to all atoms ( i x ) x Λ n that satisfy the condition
x Λ n ; , y N x ; n ; , i x = i y
as depicted in Figure 2.

6. Application to OQRW on Z p

In this section, we consider Λ = Z p : = Z / p Z = 0 ¯ , 1 ¯ , , p 1 ¯ , where p > 0 is an integer. Let H = C 2 and K be an infinite-dimensional Hilbert space with an orthonormal basis ( | i ) i Λ . We assume that B , C B ( H ) satisfy B * B + C * C = 1 I . We define
B j ¯ i ¯ = B , if i ¯ = j + 1 ¯ ; C , if i ¯ = j 1 ¯ ; 0 , otherwise .
In the following, we will represent i ¯ as i for simplicity. We will maintain the same notations as in the previous sections and focus on the case where k = 2 , specifically the Cayley tree Γ + 2 . Let = 2 . The set Λ n ; 2 consists of the vertices in the form u = ( 1 , 2 , , j , 2 ) , where j { 1 , , n 1 } and 1 , 2 , , j { 1 , 2 } . It can be observed that | Λ n ; 2 | = 2 n 1 . As a result, it divides the set Λ n .

6.1. Example 1

Let us consider H as the complex vector space of dimension 2, denoted by C 2 . Let
B = 1 0 0 0 , C = 0 1 0 0
be the transition operators. By performing a straightforward computation, we can establish that B and C satisfy the equation B * B + C * C = 1 I . By utilizing the identities B 2 = B , B C = C , and C 2 = C B = 0 , it becomes evident that the only indices ( i 1 , i 2 , , i m ) Λ m , where m N , for which the quantity
B ( i 1 , i 2 , , i m ) = B i m 1 i m B i m 2 i m 1 B i 2 i 3 B i 1 i 2
is non-zero correspond to i k + 1 = i k + 1 for all k 2 , , m 1 .
More specifically, for each i Λ , we have
B ( i , i + 1 , , i + m ) = B B ( i , i 1 , i , i + 1 , , i + m 2 ) = C
For ( i 1 , i 2 , , i m ) Λ m ( i , i + 1 , , i + m ) , ( i , i 1 , i , i + 1 , , i + m 2 ) ; , i Λ , we have B ( i 1 , i 2 , , i m ) = 0 .
Consider the density
ρ = i Λ ρ i | i i |
where ρ i = ρ i , 11 ρ i , 12 ρ i , 21 ρ i , 22 M 2 ( C ) B ( H ) . It follows that the probability (20) satisfies
P ρ i 1 ( i 1 , i 2 , , i m ) = 1 Tr ( ρ i 1 ) Tr B ( i 1 , i 2 , , i m ) ρ i 1 B * ( i 1 , i 2 , , i m )
which is given by
P ρ i 1 ( i 1 , i 2 , , i m ) = Tr ( B ρ i 1 B ) Tr ( ρ i 1 ) , if i k + 1 = i k + 1 , k { 1 , , m 1 } ; Tr ( C ρ i 1 C * ) Tr ( ρ i 1 ) , if i 2 = i 1 1 and i k + 1 = i k + 1 , k { 2 , , m 1 } ; 0 , otherwise . = ρ i 1 , 11 ρ i 1 , 11 + ρ i 1 , 22 , if i k + 1 = i k + 1 , k { 1 , , m 1 } ; ρ i 1 , 22 ρ i 1 , 11 + ρ i 1 , 22 , if i 2 = i 1 1 and i k + 1 = i k + 1 , k { 2 , , m 1 } ; 0 , otherwise .

6.2. Example 2

Take as above H = C 2 and consider the transition operators
B = 0 0 1 0 , C = 0 1 0 0 .
A simple calculation shows that B and C satisfy the identity B * B + C * C = 1 I . Using the identities, B 2 = C 2 = 0 , and
B C = 0 0 0 1 , C B = 1 0 0 0 .
We can easily deduce that the only non-zero words formed by picking letters from the alphabet { B , C } are of the form
( B C ) k B = B , ( B C ) k = B C , ( C B ) k = C B and ( C B ) k C = C .
This leads us to consider two distinct cases, depending on whether m is even or odd. If m is odd, we have
B ( i 1 , i 2 , , i m ) = B , i 1 = i 3 = = i m and i 2 = i 4 = = i m 1 = i 1 + 1 C , i 1 = i 3 = = i m and i 2 = i 4 = = i m 1 = i 1 1 0 , otherwise .
Then, using B * = C , we obtain
P ρ ( i 1 , i 2 , , i m ) = Tr ( B ρ C ) Tr ( ρ ) , i 1 = i 3 = = i m and i 2 = i 4 = = i m 1 = i 1 + 1 Tr ( C ρ B ) Tr ( ρ ) , i 1 = i 3 = = i m and i 2 = i 4 = = i m 1 = i 1 1 0 , otherwise .
If m is even, we have
B ( i 1 , i 2 , , i m ) = B C , i 1 = i 3 = = i m 1 and i 2 = i 4 = = i m = i 1 + 1 C B , i 1 = i 3 = = i m 1 and i 2 = i 4 = = i m = i 1 1 0 , otherwise .
and
P ρ ( i 1 , i 2 , , i m ) = Tr ( B C ρ C B ) Tr ( ρ ) , i 1 = i 3 = = i m 1 and i 2 = i 4 = = i m = i 1 + 1 Tr ( C B ρ B C ) Tr ( ρ ) , i 1 = i 3 = = i m 1 and i 2 = i 4 = = i m = i 1 1 0 , otherwise .

7. Discussion

The complete understanding of the structure of general quantum Markov chain systems (QMCSs) associated with open quantum random walks (OQRWs) has been achieved. Contrary to the previous works, the correlation functions of the present QMCSs are heavily influenced by the dynamics of OQRWs. The probability measures defining these sequences establish potentially non-Markovian dynamics, which presents a significant avenue for future research. Exploring the entropy of this class of QMCSs and investigating their diagonalizability also pose intriguing questions for further exploration. Nevertheless, considering the recent advancements in this field, numerous other pertinent challenges are now approachable, including topics such as phase transitions, recurrence, clustering, and ergodic properties.

Author Contributions

Conceptualization, A.S. and F.M.; Methodology, A.S. and T.H.; Software, A.A. and T.H.; Validation, T.H.; Formal analysis, A.A.; Investigation, A.S., T.H., F.M. and A.A.; Data curation, T.H. and A.A. All authors have read and agreed to the published version of the manuscript.

Funding

The authors gratefully acknowledge Qassim University, represented by the Deanship of Scientific Research, for the financial support for this research under the number (cba-2020-1-3-I-10173) during the academic year 1442 AH/2020 AD.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Accardi, L. Noncommutative Markov chains. In Proceedings of the International School of Mathematical Physics, Camerino, Italy, 30 September–12 October 1974; pp. 268–295. [Google Scholar]
  2. Accardi, L. On noncommutative Markov property. Funct. Anal. Appl. 1975, 8, 1–8. [Google Scholar] [CrossRef]
  3. Accardi, L.; Frigerio, A. Markovian cocycles. Proc. R. Ir. Acad. 1983, 83A, 251–263. [Google Scholar]
  4. Accardi, L.; Khrennikov, A.; Ohya, M. Quantum Markov Model for Data from Shafir—Tversky Experiments in Cognitive Psychology. Open Syst. Inf. Dyn. 2009, 16, 371–385. [Google Scholar] [CrossRef]
  5. Accardi, L.; Souissi, A.; Soueidy, E.G. Quantum Markov chains: A unification approach. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 2020, 23, 2050016. [Google Scholar] [CrossRef]
  6. Gudder, S. Quantum Markov chains. J. Math. Phys. 2008, 49, 072105. [Google Scholar] [CrossRef]
  7. Lardizabal, C.F. A quantization procedure based on completely positive maps and Markov operators. Quantum Inf. Process. 2013, 12, 1033–1051. [Google Scholar] [CrossRef]
  8. Liu, C.; Petulante, N. On Limiting distributions of quantum Markov chains. Int. J. Math. Math. Sci. 2011, 2011, 740816. [Google Scholar] [CrossRef]
  9. Dhahri, A.; Fagnola, F. Potential theory for quantum Markov states and other quantum Markov chains. Anal. Math. Phys. 2023, 13, 31. [Google Scholar] [CrossRef]
  10. Fannes, M.; Nachtergaele, B.; Werner, R.F. Finitely correlated states on quantum spin chains. Commun. Math. Phys. 1992, 144, 443–490. [Google Scholar] [CrossRef]
  11. Feng, Y.; Yu, N.; Ying, M. Model checking quantum Markov chains. J. Comput. Syst. Sci. 2013, 79, 1181–1198. [Google Scholar] [CrossRef]
  12. Kümmerer, B. Quantum Markov processes and applications in physics. In Quantum Independent Increment Processes II; Lecture Notes in Mathematics; Springer: Berlin, Germany, 2006; Volume 1866, pp. 259–330. [Google Scholar]
  13. Abundo, M.; Accardi, L.; Rosato, N. A Markovian model for cooperative interactions in proteins. Math. Models Methods Appl. Sci. 1995, 6, 5. [Google Scholar] [CrossRef]
  14. Abundo, M.; Accardi, L.; Finazzi; Agrò, A.; Mei, G.; Rosato, N. A stochastic model for the sigmoidal behaviour of cooperative biological systems. Biophys. Chem. 1996, 58, 313–323. [Google Scholar] [CrossRef] [PubMed]
  15. Abundo, M.; Accardi, L.; Stella, L.; Rosato, N. A stochastic model for the cooperative relaxation of proteins, based on a hierarchy of interactions between amino acid residues. Math. Models Methods Appl. Sci. 1998, 8, 327–358. [Google Scholar] [CrossRef]
  16. Accardi, L.; Abundo, M. A stochastic model for the cooperative behaviour of biological systems. Amino Acids 1999, 17, 120–121. [Google Scholar]
  17. Accardi, L.; Abundo, M.; Rosato, N.; Stella, L. Analysing protein energy data by a stochastic model for cooperative interactions: Comparison and characterization of cooperativity. J. Math. Biol. 2002, 44, 341–359. [Google Scholar]
  18. Dobrushin, R.L. The description of a random field by means of conditional probabilities and conditions of its regularity. Theor. Probab. Appl. 1968, 13, 197–224. [Google Scholar] [CrossRef]
  19. Accardi, L.; Fidaleo, F. Quantum Markov fields. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 2003, 6, 123–138. [Google Scholar] [CrossRef]
  20. Liebscher, V. Markovianity of quantum random fields. In Quantum Probability and Infinite-Dimensional Analysis, Proceedings of the Burg Conference, Burg, Germany, 15–20 March 2001; Freudenberg, W., Ed.; QP-PQ Series; World Scientific: Singapore, 2003; Volume 15, pp. 151–159. [Google Scholar]
  21. Accardi, L.; Mukhamedov, F.; Saburov, M. On Quantum Markov Chains on Cayley tree II: Phase transitions for the associated chain with XY -model on the Cayley tree of order three. Ann. Henri Poincare 2011, 12, 1109–1144. [Google Scholar] [CrossRef]
  22. Mukhamedov, F.; Barhoumi, A.; Souissi, A. Phase transitions for quantum Markov chains associated with Ising type models on a Cayley tree. J. Stat. Phys. 2016, 163, 544–567. [Google Scholar] [CrossRef]
  23. Mukhamedov, F.; Souissi, A. Quantum Markov States on Cayley trees. J. Math. Anal. Appl. 2019, 473, 313–333. [Google Scholar] [CrossRef]
  24. Kempe, J. Quantum random walks: An introductory overview. Contemp. Phys. 2003, 44, 307–327. [Google Scholar] [CrossRef]
  25. Kitagawa, T. Topological phenomena in quantum walks: Elementary introduction to the physics of topological phases. Quantum Inf. Process. 2012, 11, 1107–1148. [Google Scholar] [CrossRef]
  26. Konno, N.; Yoo, H.J. Limit theorems for open quantum random walks. J. Stat. Phys. 2013, 150, 299–319. [Google Scholar] [CrossRef]
  27. Konno, N. A new type of limit theorems for one-dimensional quantum random walks. J. Math. Soc. Jpn. 2005, 57, 1179–1195. [Google Scholar] [CrossRef]
  28. Ohno, H. Unitary equivalent classes of one-dimensional quantum walks. Quantum Inf. Process. 2016, 15, 3599–3617. [Google Scholar] [CrossRef]
  29. Portugal, R. Quantum Walks and Search Algorithms; Springer: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  30. Venegas-Andraca, S.E. Quantum walks: A comprehensive review. Quantum Inf. Process. 2012, 11, 1015–1106. [Google Scholar] [CrossRef]
  31. Accardi, L.; Watson, G.S. Quantum random walks. In Quantum Probability and Applications IV, Proceedings of the Year of Quantum Probability, Rome, Italy, 1987; Accardi, L., von Waldenfels, W., Eds.; LNM; 1989; Springer: Berlin/Heidelberg, Germany; Volume 1396, pp. 73–88.
  32. Lardizabal, C.F.; Souza, R.R. On a class of quantum channels, open random walks and recurrence. J. Stat. Phys. 2015, 159, 772–796. [Google Scholar] [CrossRef]
  33. Attal, S.; Petruccione, F.; Sabot, C.; Sinayskiy, I. Open Quantum Random Walks. J. Stat. Phys. 2012, 147, 832–852. [Google Scholar] [CrossRef]
  34. Carbone, R.; Pautrat, Y. Homogeneous open quantum random walks on a lattice. J. Stat. Phys. 2015, 160, 1125–1152. [Google Scholar] [CrossRef]
  35. Carbone, R.; Pautrat, Y. Open quantum random walks: Reducibility, period, ergodic properties. Ann. Henri Poincaré 2016, 17, 99–135. [Google Scholar] [CrossRef]
  36. Goolam Hossen, Y.H.; Sinayskiy, I.; Petruccione, F. Non-reversal Open Quantum Walks. Open Syst. Inf. Dyn. 2018, 25, 1850017. [Google Scholar] [CrossRef]
  37. Machida, T. Phase transition of an open quantum walk. Int. J. Quantum Inf. 2021, 19, 2150028. [Google Scholar] [CrossRef]
  38. Dhahri, A.; Ko, C.K.; Yoo, H.J. Quantum Markov chains associated with open quantum random walks. J. Stat. Phys. 2019, 176, 1272–1295. [Google Scholar] [CrossRef]
  39. Dhahri, A.; Mukhamedov, F. Open quantum random walks, quantum Markov chains and recurrence. Rev. Math. Phys. 2019, 31, 1950020. [Google Scholar] [CrossRef]
  40. Ko, C.K.; Yoo, H.J. Quantum Markov chains associated with unitary quantum walks. J. Stoch. Anal. 2020, 1, 4. [Google Scholar] [CrossRef]
  41. Mukhamedov, F.; Souissi, A.; Hamdi, T. Open quantum random walks and quantum Markov chains on trees I: Phase transitions. Open Syst. Inf. Dyn. 2022, 29, 2250003. [Google Scholar] [CrossRef]
  42. Accardi, L.; Ohya, M.; Watanabe, N. Dynamical entropy through quantum Markov chains. Open Syst. Inf. Dyn. 1997, 4, 71–87. [Google Scholar] [CrossRef]
  43. Ohmura, K.; Watanabe, N. Quantum dynamical mutual entropy based on AOW entropy. Open Syst. Inf. Dyn. 2019, 26, 1950009. [Google Scholar] [CrossRef]
  44. Accardi, L.; Koroluk, D. Stopping times for quantum Markov chains. J. Theor. Probab. 1992, 5, 521–535. [Google Scholar] [CrossRef]
  45. Souissi, A. On Stopping Rules for Tree-indexed Quantum Markov chains. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 2023, 2250030. [Google Scholar] [CrossRef]
  46. Barhoumi, A.; Souissi, A. Recurrence of a class of quantum Markov chains on trees. Chaos Solitons Fractals 2022, 164, 112644. [Google Scholar] [CrossRef]
  47. Mukhamedov, F.; Souissi, A.; Hamdi, T.; Andolsi, A. Open quantum random walks and quantum Markov Chains on trees II: The recurrence. Quantum Inf. Process. 2023, 22, 232. [Google Scholar] [CrossRef]
  48. Souissi, A.; Mukhamedov, F.; Barhoumi, A. Tree-Homogeneous Quantum Markov Chains. Int. J. Theor. Phys. 2023, 62, 19. [Google Scholar] [CrossRef]
  49. McKay, B.D.; Piperno, A. Practical graph isomorphism, II. J. Symb. Comput. 2014, 60, 94–112. [Google Scholar] [CrossRef]
  50. Bratteli, O.; Robinson, D.W. Operator Algebras and Quantum Statistical Mechanics I; Springer: New York, NY, USA, 1987. [Google Scholar]
  51. Accardi, L.; Cecchini, C. Conditional expectations in von Neumann algebras and a Theorem of Takesaki. J. Funct. Anal. 1982, 45, 245–273. [Google Scholar] [CrossRef]
Figure 1. Coordinate structure on Γ + 2 .
Figure 1. Coordinate structure on Γ + 2 .
Axioms 12 00864 g001
Figure 2. Coordinate structure on Γ + 3 with highlight of elements of Λ m ; 0 with 0 = 2 .
Figure 2. Coordinate structure on Γ + 3 with highlight of elements of Λ m ; 0 with 0 = 2 .
Axioms 12 00864 g002
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

Souissi, A.; Hamdi, T.; Mukhamedov, F.; Andolsi, A. On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks. Axioms 2023, 12, 864. https://doi.org/10.3390/axioms12090864

AMA Style

Souissi A, Hamdi T, Mukhamedov F, Andolsi A. On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks. Axioms. 2023; 12(9):864. https://doi.org/10.3390/axioms12090864

Chicago/Turabian Style

Souissi, Abdessatar, Tarek Hamdi, Farrukh Mukhamedov, and Amenallah Andolsi. 2023. "On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks" Axioms 12, no. 9: 864. https://doi.org/10.3390/axioms12090864

APA Style

Souissi, A., Hamdi, T., Mukhamedov, F., & Andolsi, A. (2023). On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks. Axioms, 12(9), 864. https://doi.org/10.3390/axioms12090864

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