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:0808.0510 · Physical Review A

Quantum networks on cubelike graphs

Anna Bernasconi, Chris D. Godsil, Simone Severini B

Published Nov 12, 2008• 88 citations
arXivHTMLPDF

Abstract

Cubelike graphs are the Cayley graphs of the elementary Abelian group ${\mathbb{Z}}_{2}^{n}$ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes the results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].

DOI
10.1103/physreva.78.052320

Related papers

Perfect state transfer of a qudit over underlying networks of group association schemes

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +1 more

As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group $Z_2^n$. In Refs. \cite{PST,psd}, respectively, PST of a qubit over distance regular spin networks and optimal state transfer (ST) of a $d$-level quantum state (qudit) over pseudo distance regular networks were discussed, where the networks considered there were not in general related with a certain finite group. In this paper, PST of a qudit over antipodes of more general networks called underlying networks of association schemes, is investigated. In particular, we consider the underlying networks of group association schemes in order to employ the group properties (such as irreducible characters) and use the algebraic structure of these networks (such as Bose-Mesner algebra) in order to give an explicit analytical formula for coupling constants in the Hamiltonians so that the state of a particular qudit initially encoded on one site will perfectly evolve to the opposite site without any dynamical control. It is shown that the only necessary condition in order to PST over these networks be achieved is that the centers of the corresponding groups be non-trivial. Therefore, PST over the underlying networks of the group association schemes over all the groups with non-trivial centers such as the abelian groups, the dihedral group $D_{2n}$ with even $n$, the Clifford group CL(n) and all of the $p$-groups can be achieved.

arXiv:0901.4504•Journal of Statistical Mechanics Theory and Experiment•Apr 6, 2009•5 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

Perfect State Transfer in Weighted Cubelike Graphs

Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha

A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk is governed by the unitary operator $\mathcal{U}(t) = e^{iAt}$, where $A$ is the adjacency matrix of the graph. An important notion in the quantum random walk is the transfer of a quantum state from one vertex to another. If the fidelity of the transfer is unity, we call it a perfect state transfer. Many graph families have been shown to admit PST or periodicity, including cubelike graphs. These graphs are unweighted. In this paper, we generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs. We characterize the weights for which they admit PST or show periodicity, both at time $t=\fracπ{2}$.

arXiv:2109.12607•Sep 26, 2021•1 citation

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•9 citations

Quantum Cayley networks of the hypercube

Christopher Facer, Jason Twamley, James D. Cresser

We develop the work of Christandl et al. [Phys. Rev. A 71, 032312 (2005)], to show how a $d$-hypercube homogenous network can be dressed by additional links to perfectly route quantum information between any given input and output nodes in a duration that is independent of the routing chosen and, surprisingly, the size of the network.

arXiv:0706.3821•Physical Review A•Jan 29, 2008•32 citations

A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite group exhibiting perfect state transfer has valency $1$, $2$, or $4$. For valency $4$, we prove that an abelian Cayley graph $\operatorname{Cay}(Γ,S)$ exhibits perfect state transfer if and only if $S=\{a,-a,a+h,-a+h\}$, where $h$ has order $2$, and $4\nmid |Γ|/2$. Combining this characterization with the valency-one and valency-two cases, we explicitly determine all pairs $(Γ,S)$ for which $\operatorname{Cay}(Γ,S)$ exhibits perfect state transfer. Our results extend the classification of circulant graphs of valency at most four obtained by Kubota and Yoshino [Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks, \emph{J. Comb. Theory Ser. A.}, 216 (2025) 106064] to Cayley graphs over arbitrary finite abelian groups and to all valencies.

math.COCross-listedarXiv:2610.21946•Oct 16, 2026•0 citations
Cubelike graphs are the Cayley graphs of the elementary Abelian group Z2n{\mathbb{Z}}_{2}^{n}Z2n​ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes the results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].
As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group Z2nZ_2^nZ2n​. In Refs. \cite{PST,psd}, respectively, PST of a qubit over distance regular spin networks and optimal state transfer (ST) of a ddd-level quantum state (qudit) over pseudo distance regular networks were discussed, where the networks considered there were not in general related with a certain finite group. In this paper, PST of a qudit over antipodes of more general networks called underlying networks of association schemes, is investigated. In particular, we consider the underlying networks of group association schemes in order to employ the group properties (such as irreducible characters) and use the algebraic structure of these networks (such as Bose-Mesner algebra) in order to give an explicit analytical formula for coupling constants in the Hamiltonians so that the state of a particular qudit initially encoded on one site will perfectly evolve to the opposite site without any dynamical control. It is shown that the only necessary condition in order to PST over these networks be achieved is that the centers of the corresponding groups be non-trivial. Therefore, PST over the underlying networks of the group association schemes over all the groups with non-trivial centers such as the abelian groups, the dihedral group D2nD_{2n}D2n​ with even nnn, the Clifford group CL(n) and all of the ppp-groups can be achieved.
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.
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk is governed by the unitary operator U(t)=eiAt\mathcal{U}(t) = e^{iAt}U(t)=eiAt, where AAA is the adjacency matrix of the graph. An important notion in the quantum random walk is the transfer of a quantum state from one vertex to another. If the fidelity of the transfer is unity, we call it a perfect state transfer. Many graph families have been shown to admit PST or periodicity, including cubelike graphs. These graphs are unweighted. In this paper, we generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs. We characterize the weights for which they admit PST or show periodicity, both at time t=π2t=\fracπ{2}t=2π​.
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.
We develop the work of Christandl et al. [Phys. Rev. A 71, 032312 (2005)], to show how a ddd-hypercube homogenous network can be dressed by additional links to perfectly route quantum information between any given input and output nodes in a duration that is independent of the routing chosen and, surprisingly, the size of the network.
We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite group exhibiting perfect state transfer has valency 111, 222, or 444. For valency 444, we prove that an abelian Cayley graph Cay⁡(Γ,S)\operatorname{Cay}(Γ,S)Cay(Γ,S) exhibits perfect state transfer if and only if S={a,−a,a+h,−a+h}S=\{a,-a,a+h,-a+h\}S={a,−a,a+h,−a+h}, where hhh has order 222, and 4∤∣Γ∣/24\nmid |Γ|/24∤∣Γ∣/2. Combining this characterization with the valency-one and valency-two cases, we explicitly determine all pairs (Γ,S)(Γ,S)(Γ,S) for which Cay⁡(Γ,S)\operatorname{Cay}(Γ,S)Cay(Γ,S) exhibits perfect state transfer. Our results extend the classification of circulant graphs of valency at most four obtained by Kubota and Yoshino [Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks, \emph{J. Comb. Theory Ser. A.}, 216 (2025) 106064] to Cayley graphs over arbitrary finite abelian groups and to all valencies.