Corpus ID: 237605509

Quantum walks on regular graphs with realizations in a system of anyons

@inproceedings{Balu2021QuantumWO,
  title={Quantum walks on regular graphs with realizations in a system of anyons},
  author={Radhakrishnan Balu},
  year={2021}
}
  • R. Balu
  • Published 22 September 2021
  • Physics, Mathematics
We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular and distance-transitive). The construction is valid for growing graphs and the interacting Fock space is well defined asymptotically for the growing graph. To realize the quantum walks defined on the spaces in terms of anyons we switch to the dual view of the association schemes and identify the corresponding modular tensor categories from the Bose-Mesner algebra… Expand

Figures from this paper

References

SHOWING 1-10 OF 19 REFERENCES
Quantum Probabilistic Spaces on Graphs for Topological Evolutions
  • R. Balu
  • Computer Science, Physics
  • 2020
TLDR
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 walks: a comprehensive review
TLDR
This paper has reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks. Expand
Quantum speed-up of Markov chain based algorithms
  • M. Szegedy
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
TLDR
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
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
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
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
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
Quantum phases of matter on a 256-atom programmable quantum simulator.
TLDR
This work demonstrates a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms, featuring strong interactions controlled by coherent atomic excitation into Rydberg states, and realizes a quantum spin model with tunable interactions for system sizes ranging from 64 to 256 qubits. Expand
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
...
1
2
...