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:2011.07566 · Algebraic Combinatorics

Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups

Peter Sin, Julien Sorci

Published Sep 8, 2022• 8 citations
arXivHTMLPDF

Abstract

We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state transfer and fractional revival. Using partial spreads, we construct Cayley graphs on extraspecial 2 -groups that admit these phenomena. We also show that there is no normal Cayley graph of an extraspecial group that admits instantaneous uniform mixing.

DOI
10.5802/alco.237

Related papers

Perfect state transfer in Grover walks on normal Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

A Cayley graph $\operatorname{Cay}(Γ,S)$ over a finite group $Γ$ is said to be normal if its connection set $S$ is a union of some conjugacy classes of $Γ$. This paper investigates perfect state transfer in Grover walks on normal Cayley graphs. The Grover walk is a widely studied discrete-time quantum walk. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on normal Cayley graphs. As applications, we derive explicit spectral criteria for perfect state transfer on Cayley graphs over abelian groups, dicyclic groups, and dihedral groups. These results yield several infinite families of Cayley graphs exhibiting perfect state transfer. We further obtain simple combinatorial characterizations of the existence of perfect state transfer on Cayley graphs over dihedral and dicyclic groups. Our general characterization also recovers a number of previously known results as special cases. As a further consequence, we obtain a complete characterization of perfect state transfer on unitary Cayley graphs. In particular, we prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.

quant-pharXiv:2607.19309•Jul 22, 2026•0 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•0 citations

Uniform Mixing of Quantum Walks and Association Schemes

Natalie Mullin

In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections between mixing properties and association schemes. \n \nThere are three main goals of this thesis. Our primary goal is to develop the algebraic groundwork necessary to systematically study mixing properties of continuous-time quantum walks on regular graphs. Using these tools we achieve two additional goals: we construct new families of graphs that admit uniform mixing, and we prove that other families of graphs never admit uniform mixing. \n \nWe begin by introducing association schemes and continuous-time quantum walks. Within this framework we develop specific algebraic machinery to tackle the uniform mixing problem. Our main algebraic result shows that if a graph has an irrational eigenvalue, then its transition matrix has at least one transcendental coordinate at all nonzero times. \n \nNext we study algebraic varieties related to uniform mixing to determine information about the coordinates of the corresponding transition matrices. Combining this with our main algebraic result we prove that uniform mixing does not occur on even cycles or prime cycles. However, we show that the probability distribution of a quantum walk on a prime cycle gets arbitrarily close to uniform. \n \nFinally we consider uniform mixing on Cayley graphs of elementary abelian groups. We utilize graph quotients to connect the mixing properties of these graphs to Hamming graphs. This enables us to find new results about uniform mixing on Cayley graphs of certain elementary abelian groups.

•Sep 26, 2013•3 citations

Perfect state transfer in Grover walks on dihedral Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya, Xiwang Cao

The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group $D_n$. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph $\operatorname{Cay}(Γ,S)$ is called normal if $S$ is the union of some conjugacy classes of the group $Γ$; otherwise, it is called non-normal. Most existing studies have been restricted to Cayley graphs over abelian groups. In contrast, we investigate both normal and non-normal cases for Cayley graphs over the non-abelian group $D_n$. By examining the parity of $n$ and the normality of the Cayley graph, we obtain a complete characterization of PST on $\operatorname{Cay}(D_n,S)$. In particular, we establish necessary and sufficient conditions for the occurrence of PST in all possible cases, and prove that PST does not occur for normal Cayley graphs when $n$ is odd. Furthermore, we construct several infinite families of normal and non-normal Cayley graphs $\operatorname{Cay}(D_n,S)$ that exhibit PST, illustrating the application of the main result. Our approach is based on the representation theory of the dihedral group.

math.COCross-listedarXiv:2605.02254•May 5, 2026•0 citations

Fractional revival on abelian Cayley graphs

Xiwang Cao, Gaojun Luo

Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalization of perfect state transfer and periodicity on graphs. In this paper, we propose a sufficient and necessary condition for abelian Cayley graphs having fractional revival between any two distinct vertices. With this characterization, two general constructions of abelian Cayley graphs having fractional revival is presented. Meanwhile, we establish several new families of abelian Cayley graphs admitting fractional revival.

arXiv:2208.05107•Aug 10, 2022•0 citations

Perfect quantum state transfer on Cayley graphs over semi-dihedral groups

Gaojun Luo, Xiwang Cao, Dandan Wang +1 more

Perfect quantum state transfer plays a crucial role in quantum information processing and quantum computation. There has been extensive study of perfect quantum state transfer on Cayley graphs over abelian groups. In this paper, we consider the existence of perfect quantum state transfer on Cayley graphs over semi-dihedral groups which are non-abelian groups. Using the representations of semi-dihedral groups, we provide some necessary and sufficient conditions for Cayley graphs over semi-dihedral groups admitting perfect quantum state transfer. By those conditions, we present examples of perfect quantum state transfer on Cayley graphs over semi-dihedral groups. In addition, we propose results about whether some new Cayley graphs over non-abelian groups admit perfect quantum state transfer.

Linear and Multilinear Algebra•Jul 15, 2021•8 citations
We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state transfer and fractional revival. Using partial spreads, we construct Cayley graphs on extraspecial 2 -groups that admit these phenomena. We also show that there is no normal Cayley graph of an extraspecial group that admits instantaneous uniform mixing.
A Cayley graph Cay⁡(Γ,S)\operatorname{Cay}(Γ,S)Cay(Γ,S) over a finite group ΓΓΓ is said to be normal if its connection set SSS is a union of some conjugacy classes of ΓΓΓ. This paper investigates perfect state transfer in Grover walks on normal Cayley graphs. The Grover walk is a widely studied discrete-time quantum walk. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on normal Cayley graphs. As applications, we derive explicit spectral criteria for perfect state transfer on Cayley graphs over abelian groups, dicyclic groups, and dihedral groups. These results yield several infinite families of Cayley graphs exhibiting perfect state transfer. We further obtain simple combinatorial characterizations of the existence of perfect state transfer on Cayley graphs over dihedral and dicyclic groups. Our general characterization also recovers a number of previously known results as special cases. As a further consequence, we obtain a complete characterization of perfect state transfer on unitary Cayley graphs. In particular, we prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.
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.
In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections between mixing properties and association schemes. \n \nThere are three main goals of this thesis. Our primary goal is to develop the algebraic groundwork necessary to systematically study mixing properties of continuous-time quantum walks on regular graphs. Using these tools we achieve two additional goals: we construct new families of graphs that admit uniform mixing, and we prove that other families of graphs never admit uniform mixing. \n \nWe begin by introducing association schemes and continuous-time quantum walks. Within this framework we develop specific algebraic machinery to tackle the uniform mixing problem. Our main algebraic result shows that if a graph has an irrational eigenvalue, then its transition matrix has at least one transcendental coordinate at all nonzero times. \n \nNext we study algebraic varieties related to uniform mixing to determine information about the coordinates of the corresponding transition matrices. Combining this with our main algebraic result we prove that uniform mixing does not occur on even cycles or prime cycles. However, we show that the probability distribution of a quantum walk on a prime cycle gets arbitrarily close to uniform. \n \nFinally we consider uniform mixing on Cayley graphs of elementary abelian groups. We utilize graph quotients to connect the mixing properties of these graphs to Hamming graphs. This enables us to find new results about uniform mixing on Cayley graphs of certain elementary abelian groups.
The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group DnD_nDn​. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph Cay⁡(Γ,S)\operatorname{Cay}(Γ,S)Cay(Γ,S) is called normal if SSS is the union of some conjugacy classes of the group ΓΓΓ; otherwise, it is called non-normal. Most existing studies have been restricted to Cayley graphs over abelian groups. In contrast, we investigate both normal and non-normal cases for Cayley graphs over the non-abelian group DnD_nDn​. By examining the parity of nnn and the normality of the Cayley graph, we obtain a complete characterization of PST on Cay⁡(Dn,S)\operatorname{Cay}(D_n,S)Cay(Dn​,S). In particular, we establish necessary and sufficient conditions for the occurrence of PST in all possible cases, and prove that PST does not occur for normal Cayley graphs when nnn is odd. Furthermore, we construct several infinite families of normal and non-normal Cayley graphs Cay⁡(Dn,S)\operatorname{Cay}(D_n,S)Cay(Dn​,S) that exhibit PST, illustrating the application of the main result. Our approach is based on the representation theory of the dihedral group.
Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalization of perfect state transfer and periodicity on graphs. In this paper, we propose a sufficient and necessary condition for abelian Cayley graphs having fractional revival between any two distinct vertices. With this characterization, two general constructions of abelian Cayley graphs having fractional revival is presented. Meanwhile, we establish several new families of abelian Cayley graphs admitting fractional revival.
Perfect quantum state transfer plays a crucial role in quantum information processing and quantum computation. There has been extensive study of perfect quantum state transfer on Cayley graphs over abelian groups. In this paper, we consider the existence of perfect quantum state transfer on Cayley graphs over semi-dihedral groups which are non-abelian groups. Using the representations of semi-dihedral groups, we provide some necessary and sufficient conditions for Cayley graphs over semi-dihedral groups admitting perfect quantum state transfer. By those conditions, we present examples of perfect quantum state transfer on Cayley graphs over semi-dihedral groups. In addition, we propose results about whether some new Cayley graphs over non-abelian groups admit perfect quantum state transfer.