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:1902.08664

Quantum structures from association schemes

Radhakrishnan Balu

Published Feb 22, 2019• 4 citations
arXivHTMLPDF

Abstract

Starting from an association scheme induced by a finite group and the corresponding Bose-Mesner algebra we construct quantum Markov chains (QMC), their entangled versions, and interacting Fock spaces (IFS) using the quantum probabilistic approach. Our constructions are based on the intersection numbers and their duals Krien parameters of the schemes with examples focused on regular (distance-regular and distance-transitive) graphs.

DOI
10.48550/arxiv.1902.08664

Related papers

Subfactors from regular graphs induced by association schemes

Radhakrishnan Balu

We clarify the relations between the mathematical structures that enable fashioning quantum walks on regular graphs and their realizations in anyonic systems. Our protagonist is association schemes that may be synthesized from type-II matrices which have a canonical construction of subfactors. This way we set up quantum walks on growing distance-regular graphs induced by association schemes via interacting Fock spaces and relate them to anyon systems described by subfactors. We discuss in detail a large family of graphs that may be treated within this approach. Classification of association schemes and realizable anyon systems are complex combinatorial problems and we tackle a part of it with a quantum walk application based approach.

arXiv:2201.07310•Jan 18, 2022•0 citations

QUANTUM MARKOV CHAINS AND ISING MODEL ON CAYLEY TREE

Luigi Accardi, Farrukh Maksutovich Mukhamedov, Mansoor Khajibaevich Saburov

In the present paper wes tudy forward Quantum Markov Chains (QMC)associated with Ising model on Cayley tree of order k. Using the tree structure of graphs, we give a construction of Quantum Markov Chains on a Cayley tree. By means of such construction we prove the existance of a phase transition for the Ising model on a Cayley tree of order k in QMC scheme. By the phase transition we mean the existance of two not quasi equivelant QMC for the given family of interaction operators.

QP-PQ, quantum probability and white noise analysis•Mar 1, 2013•0 citations

Quantum stabilizer codes from Abelian and non-Abelian groups association schemes

Avaz Naghipour, M. A. Jafarizadeh, S. Shahmorad

A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed by bases for the regular representation from U6n, T4n, V8n and dihedral D2n groups. By using Abelian group association schemes followed by cyclic groups and non-Abelian group association schemes a list of binary stabilizer codes up to 40 qubits is given in tables 4, 5 and 10. Moreover, several binary stabilizer codes of minimum distances 5, 7 and 8 with good quantum parameters is presented. The preference of this method specially for Abelian group association schemes is that one can construct any binary quantum stabilizer code with any distance by using the commutative structure of association schemes.

arXiv:1407.6228•International Journal of Quantum Information•Apr 1, 2015•10 citations

QUANTUM MARKOV FIELDS ON GRAPHS

Luigi Accardi, Hiromichi Ohno, Farrukh Maksutovich Mukhamedov

We introduce generalized quantum Markov states and generalized d-Markov chains which extend the notion quantum Markov chains on spin systems to that on C*-algebras defined by general graphs. As examples of generalized d-Markov chains, we construct the entangled Markov fields on tree graphs. The concrete examples of generalized d-Markov chains on Cayley trees are also investigated.

arXiv:0911.1667•Infinite Dimensional Analysis Quantum Probability and Related Topics•Jun 1, 2010•35 citations

Clustering property for quantum Markov chains on the comb graph

Abdessatar Souissi, El Gheteb Soueidi, Mohamed Rhaima

Quantum Markov chains (QMCs) on graphs and trees were investigated in connection with many important models arising from quantum statistical mechanics and quantum information. These quantum states generate many important properties such as quantum phase transition and clustering properties. In the present paper, we propose a construction of QMCs associated with an $ XX $-Ising model over the comb graph $ \mathbb N\rhd_0 \mathbb Z $. Mainly, we prove that the QMC associated with the disordered phase, enjoys a clustering property.

AIMS Mathematics•Jan 1, 2023•6 citations

Infinite dimensional entangled Markov chains

Francesco Fidaleo

We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint correlations arises from the corresponding classical formula by replacing the usual matrix multiplication by the Schur multiplication. In this way, we provide nontrivial examples of entangled Markov chains on $\bar{\cup_{J\subset Z} \bar{\otimes}_{J}F}^{C^{*}}$, $F$ being any infinite dimensional type $I$ factor, $J$ a finite interval of $Z$, and the bar the von Neumann tensor product between von Neumann algebras. We then have new nontrivial examples of quantum random walks which could play a rôle in quantum information theory. In view of applications to quantum statistical mechanics too, we see that the ergodic type of an entangled Markov chain is completely determined by the corresponding ergodic type of the underlying classical chain, provided that the latter admits an invariant probability distribution. This result parallels the corresponding one relative to the finite dimensional case. Finally, starting from random walks on discrete ICC groups, we exhibit examples of quantum Markov processes based on type $II_1$ von Neumann factors.

arXiv:math/0411202•Nov 9, 2004•0 citations
Starting from an association scheme induced by a finite group and the corresponding Bose-Mesner algebra we construct quantum Markov chains (QMC), their entangled versions, and interacting Fock spaces (IFS) using the quantum probabilistic approach. Our constructions are based on the intersection numbers and their duals Krien parameters of the schemes with examples focused on regular (distance-regular and distance-transitive) graphs.
We clarify the relations between the mathematical structures that enable fashioning quantum walks on regular graphs and their realizations in anyonic systems. Our protagonist is association schemes that may be synthesized from type-II matrices which have a canonical construction of subfactors. This way we set up quantum walks on growing distance-regular graphs induced by association schemes via interacting Fock spaces and relate them to anyon systems described by subfactors. We discuss in detail a large family of graphs that may be treated within this approach. Classification of association schemes and realizable anyon systems are complex combinatorial problems and we tackle a part of it with a quantum walk application based approach.
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed by bases for the regular representation from U6n, T4n, V8n and dihedral D2n groups. By using Abelian group association schemes followed by cyclic groups and non-Abelian group association schemes a list of binary stabilizer codes up to 40 qubits is given in tables 4, 5 and 10. Moreover, several binary stabilizer codes of minimum distances 5, 7 and 8 with good quantum parameters is presented. The preference of this method specially for Abelian group association schemes is that one can construct any binary quantum stabilizer code with any distance by using the commutative structure of association schemes.
Quantum Markov chains (QMCs) on graphs and trees were investigated in connection with many important models arising from quantum statistical mechanics and quantum information. These quantum states generate many important properties such as quantum phase transition and clustering properties. In the present paper, we propose a construction of QMCs associated with an $ XX $-Ising model over the comb graph $ \mathbb N\rhd_0 \mathbb Z $. Mainly, we prove that the QMC associated with the disordered phase, enjoys a clustering property.
We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint correlations arises from the corresponding classical formula by replacing the usual matrix multiplication by the Schur multiplication. In this way, we provide nontrivial examples of entangled Markov chains on ∪J⊂Z⊗ˉJFˉC∗\bar{\cup_{J\subset Z} \bar{\otimes}_{J}F}^{C^{*}}∪J⊂Z​⊗ˉ​J​Fˉ​C∗, FFF being any infinite dimensional type III factor, JJJ a finite interval of ZZZ, and the bar the von Neumann tensor product between von Neumann algebras. We then have new nontrivial examples of quantum random walks which could play a rôle in quantum information theory. In view of applications to quantum statistical mechanics too, we see that the ergodic type of an entangled Markov chain is completely determined by the corresponding ergodic type of the underlying classical chain, provided that the latter admits an invariant probability distribution. This result parallels the corresponding one relative to the finite dimensional case. Finally, starting from random walks on discrete ICC groups, we exhibit examples of quantum Markov processes based on type II1II_1II1​ von Neumann factors.