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

Quantum Probabilistic Spaces on Graphs for Topological Evolutions

Radhakrishnan Balu

We start with the consideration of fusion rules of anyonic particles evolving on a 2D surface and the a hypergroup comes with it to construct entangled quantum Markov chains. The fusion rules induce an association scheme with Krein parameters and their duals the intersection numbers. One useful way to think of the schemes as regular graphs encoding the paths of possible quantum walks (automorphisms). We consider braid B3 that describes the unitary dynamics of the anyons as the automorphism subgroup of the graphs. The dynamics induced by the fusions (and the adjoint splitting operations) may be viewed as the chain evolving on a growing graph and the braiding as automorphisms on a fixed graph. In our quantum probability framework infinite iterations of the unitaries, which can encode algorithmic content for quantum simulations, can describe asymptotics elegantly if the particles are allowed to evolve coherently for a longer period. We will define quantum states on the Bose-Mesner algebra which is also a von Neumann algebra as well as a Frobenius algebra to build the quantum Markov chains providing another perspective to topological computation.

arXiv:2005.08951•May 16, 2020•2 citations

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•1 citation

Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras

M. A. Jafarizadeh, S. Salimi

The continuous-time quantum walk on the underlying graphs of association schemes has been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose–Mesner and Terwilliger algebras. It is shown that the Terwilliger algebra stratifies the graph into a ( d + 1) disjoint union of strata which is different from the stratification based on distance, except for distance regular graphs. In underlying graphs of association schemes, the probability amplitudes and average probabilities are given in terms of dual eigenvalues of association schemes, such that the amplitudes of observing the continuous-time quantum walk on all sites belonging to a given stratum are the same, therefore there are at most ( d + 1) different observing probabilities. The importance of association scheme in continuous-time quantum walk is shown by some worked out examples such as arbitrary finite group association schemes followed by symmetric S n , Dihedral D 2 m and cyclic groups. At the end it is shown that the highest irreducible representations of Terwilliger algebras pave the way to use the spectral distributions method of Jafarizadeh and Salimi (2005 Preprint quant-ph/0510174) in studying quantum walk on some rather important graphs called distance regular graphs.

arXiv:quant-ph/0603139•Journal of Physics A Mathematical and General•Oct 4, 2006•29 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 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 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
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 start with the consideration of fusion rules of anyonic particles evolving on a 2D surface and the a hypergroup comes with it to construct entangled quantum Markov chains. The fusion rules induce an association scheme with Krein parameters and their duals the intersection numbers. One useful way to think of the schemes as regular graphs encoding the paths of possible quantum walks (automorphisms). We consider braid B3 that describes the unitary dynamics of the anyons as the automorphism subgroup of the graphs. The dynamics induced by the fusions (and the adjoint splitting operations) may be viewed as the chain evolving on a growing graph and the braiding as automorphisms on a fixed graph. In our quantum probability framework infinite iterations of the unitaries, which can encode algorithmic content for quantum simulations, can describe asymptotics elegantly if the particles are allowed to evolve coherently for a longer period. We will define quantum states on the Bose-Mesner algebra which is also a von Neumann algebra as well as a Frobenius algebra to build the quantum Markov chains providing another perspective to topological computation.
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.
The continuous-time quantum walk on the underlying graphs of association schemes has been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose–Mesner and Terwilliger algebras. It is shown that the Terwilliger algebra stratifies the graph into a ( d + 1) disjoint union of strata which is different from the stratification based on distance, except for distance regular graphs. In underlying graphs of association schemes, the probability amplitudes and average probabilities are given in terms of dual eigenvalues of association schemes, such that the amplitudes of observing the continuous-time quantum walk on all sites belonging to a given stratum are the same, therefore there are at most ( d + 1) different observing probabilities. The importance of association scheme in continuous-time quantum walk is shown by some worked out examples such as arbitrary finite group association schemes followed by symmetric S n , Dihedral D 2 m and cyclic groups. At the end it is shown that the highest irreducible representations of Terwilliger algebras pave the way to use the spectral distributions method of Jafarizadeh and Salimi (2005 Preprint quant-ph/0510174) in studying quantum walk on some rather important graphs called distance regular graphs.
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.