Corpus ID: 119338214

Quantum structures from association schemes.

  title={Quantum structures from association schemes.},
  author={Radhakrishnan Balu and Joseph W. Iverson},
  journal={arXiv: Mathematical Physics},
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. 
1 Citations

Figures from this paper

Quantum Probabilistic Spaces on Graphs for Topological Evolutions
  • R. Balu
  • Computer Science, Physics
  • 2020
This work starts 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 providing another perspective to topological computation. Expand


Entangled Markov chains
Motivated by the problem of finding a satisfactory quantum generalization of the classical random walks, we construct a new class of quantum Markov chains which are at the same time purely generatedExpand
Quantum speed-up of Markov chain based algorithms
  • M. Szegedy
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted. Expand
Quantum Probability and Spectral Analysis of Graphs
Quantum Probability and Orthogonal Polynomials.- Adjacency Matrices.- Distance-Regular Graphs.- Homogeneous Trees.- Hamming Graphs.- Johnson Graphs.- Regular Graphs.- Comb Graphs and Star Graphs.-Expand
Localization of the Grover Walks on Spidernets and Free Meixner Laws
A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-timeExpand
Probability distributions for Markov chain based quantum walks
We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite stateExpand
Finitely Correlated Pure States
This paper is a report on joint work with Mark Fannes and Bruno Nachtergaele on a class of states on one-dimensional quantum spin systems, called “finitely correlated”. These states can beExpand
The hyperring of adèle classes
Abstract Text We show that the theory of hyperrings, due to M. Krasner, supplies a perfect framework to understand the algebraic structure of the adele class space H K = A K / K × of a global field KExpand
Identification of the theory of orthogonal polynomials in d-indeterminates with the theory of 3-diagonal symmetric interacting Fock spaces on ℂd
The identification mentioned in the title allows a formulation of the multidimensional Favard lemma different from the ones currently used in the literature and which parallels the originalExpand
Randomized Algorithms
These notes describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms and describe some basic principles which typically underly the construction of randomized algorithms. Expand