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:2211.06928 · Annals of Physics

Quantum Versus Population Dynamics Over Cayley Graphs

Emil V. Prodan

Published Jan 1, 2023• 2 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2023.169430

Related papers

Quantum Walks on Cayley graphs: An information-theoretical approach to quantum fields

Marco Erba

•Jan 1, 2018•0 citations

Quantum decomposition of random walk on Cayley graph of finite group

Yuanbao Kang

Physica A Statistical Mechanics and its Applications•Apr 13, 2016•2 citations

Diffusion and quantum dynamics on graphs

Vsevolod Zhanovich Sakbaev, Oleg Georgievich Smolyanov

Doklady Mathematics•Jul 1, 2013•9 citations

Perfect state transfer and Cayley presentations

Arnbjörg Soffía Árnadóttir, Krystal Guo

We study perfect state transfer on Cayley graphs from the point of view that state transfer is a property of a graph and not of a group. This paper is a bridge between the classical question about isomorphic Cayley graphs of non-isomorphic groups and quantum walks on graphs. We show that a Cayley graph of a group with an abelian subgroup of index two is a Cayley graph of an abelian group under any one of three hypotheses, two drawn from the theory of isomorphic Cayley graphs. A statement of the same kind holds for extraspecial groups: every Cayley graph of an extraspecial $p$-group of order $p^{2n+1}$ with a conjugacy-closed connection set is a Cayley graph of $Z_p^{2n+1}$. From these results we deduce that every explicit construction of perfect state transfer in the six papers we survey, on dihedral, dicyclic, generalized dihedral, $V_{8n}$ and extraspecial $2$-groups, is a non-abelian presentation of an abelian Cayley graph. Moreover, we show that a non-abelian group with an abelian subgroup of index two admits a connected Cayley graph with perfect state transfer if and only if its order is divisible by four. Genuinely non-abelian examples do exist. We prove that, for every odd prime power $q\ge 5$, the $SL(2,q)$ graph of Pantangi and Sin, which they showed to admit perfect state transfer, is a Cayley graph of no abelian group; to our knowledge, this is the first infinite family of Cayley graphs with perfect state transfer provably admitting no abelian Cayley presentation. We also construct an infinite family of Cayley graphs with peak state transfer and determine all regular subgroups of the automorphism group of every member. An appendix records a census of the connected vertex-transitive graphs with perfect state transfer on at most $30$ vertices.

math.COCross-listedarXiv:2608.20476•Aug 24, 2026•1 citation

Cayley graphs and analysis of quantum cost for reversible circuit synthesis

A.C. Ribeiro, Celina M.H. de Figueiredo, Franklin de Lima Marquezino +1 more

We propose the theory of Cayley graphs as a framework to analyse gate counts and quantum costs resulting from reversible circuit synthesis. Several methods have been proposed in the reversible logic synthesis literature by considering different libraries whose gates are associated to the generating sets of certain Cayley graphs. In a Cayley graph, the distance between two vertices corresponds to the optimal circuit size. The lower bound for the diameter of Cayley graphs is also a lower bound for the worst case for any algorithm that uses the corresponding gate library. In this paper, we study two Cayley graphs on the Symmetric Group $S_{2^n}$: the first, denoted by $I_n$, is defined by a generating set associated to generalized Toffoli gates; and the second, the hypercube Cayley graph $H_n$, is defined by a generating set associated to multiple-control Toffoli gates. Those two Cayley graphs have degree $n2^{n-1}$ and order $2^n!$. Maslov, Dueck and Miller proposed a reversible circuit synthesis that we model by the Cayley graph $I_n$. We propose a synthesis algorithm based on the Cayley graph $H_n$ with upper bound of $(n-1)2^{n}+1$ multiple-control Toffoli gates. In addition, the diameter of the Cayley graph $H_n$ gives a lower bound of $n2^{n-1}$.

arXiv:1209.3275•Sep 14, 2012•2 citations

Quantum Markov states on Cayley trees

Farrukh Maksutovich Mukhamedov, Abdessatar Souissi

arXiv:1902.04156•Journal of Mathematical Analysis and Applications•Dec 20, 2018•23 citations
We study perfect state transfer on Cayley graphs from the point of view that state transfer is a property of a graph and not of a group. This paper is a bridge between the classical question about isomorphic Cayley graphs of non-isomorphic groups and quantum walks on graphs. We show that a Cayley graph of a group with an abelian subgroup of index two is a Cayley graph of an abelian group under any one of three hypotheses, two drawn from the theory of isomorphic Cayley graphs. A statement of the same kind holds for extraspecial groups: every Cayley graph of an extraspecial ppp-group of order p2n+1p^{2n+1}p2n+1 with a conjugacy-closed connection set is a Cayley graph of Zp2n+1Z_p^{2n+1}Zp2n+1​. From these results we deduce that every explicit construction of perfect state transfer in the six papers we survey, on dihedral, dicyclic, generalized dihedral, V8nV_{8n}V8n​ and extraspecial 222-groups, is a non-abelian presentation of an abelian Cayley graph. Moreover, we show that a non-abelian group with an abelian subgroup of index two admits a connected Cayley graph with perfect state transfer if and only if its order is divisible by four. Genuinely non-abelian examples do exist. We prove that, for every odd prime power q≥5q\ge 5q≥5, the SL(2,q)SL(2,q)SL(2,q) graph of Pantangi and Sin, which they showed to admit perfect state transfer, is a Cayley graph of no abelian group; to our knowledge, this is the first infinite family of Cayley graphs with perfect state transfer provably admitting no abelian Cayley presentation. We also construct an infinite family of Cayley graphs with peak state transfer and determine all regular subgroups of the automorphism group of every member. An appendix records a census of the connected vertex-transitive graphs with perfect state transfer on at most 303030 vertices.
We propose the theory of Cayley graphs as a framework to analyse gate counts and quantum costs resulting from reversible circuit synthesis. Several methods have been proposed in the reversible logic synthesis literature by considering different libraries whose gates are associated to the generating sets of certain Cayley graphs. In a Cayley graph, the distance between two vertices corresponds to the optimal circuit size. The lower bound for the diameter of Cayley graphs is also a lower bound for the worst case for any algorithm that uses the corresponding gate library. In this paper, we study two Cayley graphs on the Symmetric Group S2nS_{2^n}S2n​: the first, denoted by InI_nIn​, is defined by a generating set associated to generalized Toffoli gates; and the second, the hypercube Cayley graph HnH_nHn​, is defined by a generating set associated to multiple-control Toffoli gates. Those two Cayley graphs have degree n2n−1n2^{n-1}n2n−1 and order 2n!2^n!2n!. Maslov, Dueck and Miller proposed a reversible circuit synthesis that we model by the Cayley graph InI_nIn​. We propose a synthesis algorithm based on the Cayley graph HnH_nHn​ with upper bound of (n−1)2n+1(n-1)2^{n}+1(n−1)2n+1 multiple-control Toffoli gates. In addition, the diameter of the Cayley graph HnH_nHn​ gives a lower bound of n2n−1n2^{n-1}n2n−1.