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:2109.10934 · Quantum Information Processing

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

Radhakrishnan Balu

Published May 1, 2022• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-022-03522-9

Related papers

Factoring discrete-time quantum walks on distance regular graphs into continuous-time quantum walks

Hanmeng Zhan

arXiv:2008.01224•Linear Algebra and its Applications•Apr 28, 2022•1 citation

Combinatorial necessary conditions for regular graphs to induce periodic quantum walks

Sho Kubota

arXiv:2106.00166•Linear Algebra and its Applications•May 22, 2023•3 citations

Quantum Random Walks of Non-Interacting Bosons on Strongly Regular Graphs

Kenneth Rudinger, John King Gamble, M. Wellons +5 more

Bulletin of the American Physical Society•Mar 24, 2011•0 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

Quantum Walks on Finite Graphs

Renato Portugal

Springer eBooks•Jan 1, 2013•0 citations

Open quantum walks on graphs

Stéphane Attal, Francesco Petruccione, Ilya Sinayskiy

arXiv:1401.3305•Physics Letters A•Mar 21, 2012•72 citations
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.