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:2009.09166 · Open Systems & Information Dynamics

Hypergroup Structures of Open Quantum Random Walks on Distance Sets

Yusuke Sawada

Published Dec 1, 2023• 1 citation
arXivHTMLPDF

Abstract

Wildberger introduced the method of constructing a Hermitian discrete hypergroup from a random walk on a graph. In this study, we will apply his method to an open quantum random walk (OQRW) on a distance set and show that any discrete hypergroup that is not necessarily Hermitian can be realized using the OQRW on a distance set. We also investigate the distributions of OQRWs on distance sets in the view point of hypergroups.

DOI
10.1142/s1230161223500191

Related papers

Open Quantum RandomWalks and the Open Quantum Pascal Triangle

Francesco Petruccione, Ilya Sinayskiy

Open Quantum Random Walks (OQRW) were introduced as completely positive maps on an appropriate Hilbert space. The OQRW on the line is shown to give raise to a non-classical Pascal triangle, that stresses the rich dynamical behavior of these walks. Implications and further applications of the OQRW are discussed.

International Conference on Quantum Information•Jan 1, 2011•3 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

Open Quantum Random Walks and Quantum Markov chains on Trees I: Phase transitions

Farrukh Maksutovich Mukhamedov, Abdessatar Souissi, Tarek Hamdi

In the present paper, we construct QMC (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. However, we are going to look at the probability distribution as a Markov field over the Cayley tree. Such kind of consideration allows us to investigate phase transition phenomena associated for OQRW within QMC scheme. Furthermore, we first propose a new construction of QMC on trees, which is an extension of QMC considered in [10]. Using such a construction, we are able to construct QMCs on tress associated with OQRW. Our investigation leads to the detection of the phase transition phenomena within the proposed scheme. This kind of phenomena appears for the first time in this direction. Moreover, mean entropies of QMCs are calculated.

arXiv:2208.03770•Open Systems & Information Dynamics•Mar 1, 2022•15 citations

Open quantum random walks, quantum Markov chains and recurrence

Ameur Dhahri, Farrukh Maksutovich Mukhamedov

In the present paper, we construct QMCs (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. This sheds new light on some properties of the measure [Formula: see text]. As an example, we simply mention that the measure can be considered as a distribution of some functions of certain Markov processes. Furthermore, we study several properties of QMC and associated measures. A new notion of [Formula: see text]-recurrence of QMC is studied, and the relations between the concepts of recurrence introduced in this paper and the existing ones are established.

arXiv:1608.01065•Reviews in Mathematical Physics•Jan 23, 2019•35 citations

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

Abdessatar Souissi, Tarek Hamdi, Farrukh Maksutovich Mukhamedov +1 more

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.

Axioms•Sep 7, 2023•4 citations

Clustering quantum Markov chains on trees associated with open quantum random walks

Luigi Accardi, Amenallah Andolsi, Farrukh Maksutovich Mukhamedov +2 more

In networks, the Markov clustering (MCL) algorithm is one of the most efficient approaches in detecting clustered structures. The MCL algorithm takes as input a stochastic matrix, which depends on the adjacency matrix of the graph network under consideration. Quantum clustering algorithms are proven to be superefficient over the classical ones. Motivated by the idea of a potential clustering algorithm based on quantum Markov chains, we prove a clustering property for quantum Markov chains (QMCs) on Cayley trees associated with open quantum random walks (OQRW).

AIMS Mathematics•Jan 1, 2023•0 citations
Wildberger introduced the method of constructing a Hermitian discrete hypergroup from a random walk on a graph. In this study, we will apply his method to an open quantum random walk (OQRW) on a distance set and show that any discrete hypergroup that is not necessarily Hermitian can be realized using the OQRW on a distance set. We also investigate the distributions of OQRWs on distance sets in the view point of hypergroups.
In the present paper, we construct QMC (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. However, we are going to look at the probability distribution as a Markov field over the Cayley tree. Such kind of consideration allows us to investigate phase transition phenomena associated for OQRW within QMC scheme. Furthermore, we first propose a new construction of QMC on trees, which is an extension of QMC considered in [10]. Using such a construction, we are able to construct QMCs on tress associated with OQRW. Our investigation leads to the detection of the phase transition phenomena within the proposed scheme. This kind of phenomena appears for the first time in this direction. Moreover, mean entropies of QMCs are calculated.
In the present paper, we construct QMCs (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. This sheds new light on some properties of the measure [Formula: see text]. As an example, we simply mention that the measure can be considered as a distribution of some functions of certain Markov processes. Furthermore, we study several properties of QMC and associated measures. A new notion of [Formula: see text]-recurrence of QMC is studied, and the relations between the concepts of recurrence introduced in this paper and the existing ones are established.
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.
In networks, the Markov clustering (MCL) algorithm is one of the most efficient approaches in detecting clustered structures. The MCL algorithm takes as input a stochastic matrix, which depends on the adjacency matrix of the graph network under consideration. Quantum clustering algorithms are proven to be superefficient over the classical ones. Motivated by the idea of a potential clustering algorithm based on quantum Markov chains, we prove a clustering property for quantum Markov chains (QMCs) on Cayley trees associated with open quantum random walks (OQRW).