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:2506.02530

Strongly regular and strongly walk-regular graphs that admit perfect state transfer

Sho Kubota, Hiroto Sekido, Harunobu Yata, Kiyoto Yoshino

Published Jun 3, 2025• 0 citations
arXivHTMLPDF

Abstract

We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of strongly regular graphs that admit perfect state transfer. The only such graphs are the complete bipartite graph $K_{2,2}$ and the complete tripartite graph $K_{2,2,2}$. We then show that, if a connected strongly walk-regular graph that is not a strongly regular graph admits perfect state transfer, then its spectrum must be of the form $\{[k]^1, [\frac{k}{2}]^α, [0]^β, [-\frac{k}{2}]^γ\}$, and we enumerate all feasible spectra of this form up to $k=20$ with the help of a computer. These results are obtained using techniques from algebraic number theory and spectral graph theory, particularly through the analysis of eigenvalues and eigenprojections of a normalized adjacency matrix. While the setting is in quantum walks, the core discussion is developed entirely within the framework of spectral graph theory.

DOI
10.48550/arxiv.2506.02530

Related papers

Quantum State Transfer in Graphs

Gabriel Coutinho

Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum walk in X. We say that X admits perfect state transfer from a vertex u to a vertex v if there is a time t such that \n| exp(i t A)_(u,v) | = 1. \n \nThe main problem we study in this thesis is that of determining which simple graphs admit perfect state transfer. For some classes of graphs the problem is solved. For example, a path on n vertices admits perfect state transfer if and only if n=2 or n=3. However, the general problem of determining all graphs that admit perfect state transfer is substantially hard. \n \nIn this thesis, we focus on some special cases. We provide necessary and sufficient conditions for a distance-regular graph to admit perfect state transfer. In particular, we provide a detailed account of which distance-regular graphs of diameter three do so. \n \nA graph is said to be spectrally extremal if the number of distinct eigenvalues is equal to the diameter plus one. Distance-regular graphs are examples of such graphs. We study perfect state transfer in spectrally extremal graphs and explore rich connections to the topic of orthogonal polynomials. We characterize perfect state transfer in such graphs. \n \nWe also provide a general framework in which perfect state transfer in graph products can be studied. We use this to determine when direct products and double covers of graphs admit perfect state transfer. As a consequence, we provide many new examples of simple graphs admitting perfect state transfer. We also provide some advances in the understanding of perfect state transfer in Cayley graphs for the groups (Z_2)^d and Z_n. \n \nFinally, we consider the problem of determining which trees admit perfect state transfer. We show more generally that, except for the path on two vertices, if a connected bipartite graph contains a unique perfect matching, then it cannot admit perfect state transfer. We also consider this problem in the context of another model of quantum walks determined by the matrix exp(i t L), where L is the Laplacian matrix of the graph. In particular, we show that no tree on an odd number of vertices admits perfect state transfer according to this model.

•Aug 13, 2014•34 citations

Quantum pure state transfer

Hermie Monterde

Quantum spin systems carry information in the form of quantum states, and the propagation of these quantum states is described by a quantum walk. In order to construct an operational quantum computer, the task of reliably transmitting quantum states from one part of a quantum computer to another must be accomplished. Quantum walks are known to be powerful tools in achieving this task. Pure states are quantum states represented by unit complex vectors. In this thesis, we use algebraic and combinatorial techniques to develop the theory of perfect state transfer on pure states in quantum walks, with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a spin network. We prove basic results about eigenvalue supports, periodicity, and strong cospectrality on pure states. We investigate a special type of strong cospectrality called m-strong cospectrality, and show that m-strongly cospectral pure states admit desirable quantum state transfer properties. Several characterisations of perfect state transfer are also given, one for general pure states, one for m-strongly pure states, and another one for real pure states. These characterisations give rise to algebraic and analytic properties of pure states admitting perfect state transfer. Moreover, we determine all complete graphs, complete bipartite graphs, cycles, and paths that admit perfect state transfer between m-strongly pure states. Constructions of infinite families of graphs admitting perfect state transfer are also given. We also characterise perfect state transfer between vertex states in joins and blowup graphs. We determine when the join operation preserves or induces perfect state transfer in the resulting graph. We also use blow-up graphs to construct new families of regular graphs with perfect state transfer. We use these two graph operations to demonstrate that graphs with perfect state transfer can be constructed from graphs that do not exhibit such a property. Finally, we investigate perfect state transfer on s-pair states – pure states that represent entanglement between two vertices. We establish combinatorial and spectral properties of s-pair states with perfect state transfer, and characterise its existence in complete graphs, complete bipartite graphs, paths and distance-regular graphs. Further, we construct infinite families of graphs with s-pair state transfer.

•Aug 14, 2025•0 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

Perfect state transfer in Grover walks on association schemes and distance-regular graphs

Koushik Bhakta, Bikash Bhattacharjya

This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter $2$ and diameter $3$, as well as integral distance-regular graphs.

arXiv:2506.07439•Jun 9, 2025•0 citations

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

Grover walks on unitary Cayley graphs and integral regular graphs

Koushik Bhakta, Bikash Bhattacharjya

The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if $\gcd(u - v, n) = 1$. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley graphs. We characterize all periodic unitary Cayley graphs. We prove that periodicity is a necessary condition for occurrence of perfect state transfer on a vertex-transitive graph. Also, we provide a necessary and sufficient condition for the occurrence of perfect state transfer on circulant graphs. Using these, we prove that only four graphs in the class of unitary Cayley graphs exhibit perfect state transfer. Also, we provide a spectral characterization of the periodicity of Grover walks on integral regular graphs.

arXiv:2405.01020•May 2, 2024•0 citations
We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of strongly regular graphs that admit perfect state transfer. The only such graphs are the complete bipartite graph K2,2K_{2,2}K2,2​ and the complete tripartite graph K2,2,2K_{2,2,2}K2,2,2​. We then show that, if a connected strongly walk-regular graph that is not a strongly regular graph admits perfect state transfer, then its spectrum must be of the form {[k]1,[k2]α,[0]β,[−k2]γ}\{[k]^1, [\frac{k}{2}]^α, [0]^β, [-\frac{k}{2}]^γ\}{[k]1,[2k​]α,[0]β,[−2k​]γ}, and we enumerate all feasible spectra of this form up to k=20k=20k=20 with the help of a computer. These results are obtained using techniques from algebraic number theory and spectral graph theory, particularly through the analysis of eigenvalues and eigenprojections of a normalized adjacency matrix. While the setting is in quantum walks, the core discussion is developed entirely within the framework of spectral graph theory.
Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum walk in X. We say that X admits perfect state transfer from a vertex u to a vertex v if there is a time t such that \n| exp(i t A)_(u,v) | = 1. \n \nThe main problem we study in this thesis is that of determining which simple graphs admit perfect state transfer. For some classes of graphs the problem is solved. For example, a path on n vertices admits perfect state transfer if and only if n=2 or n=3. However, the general problem of determining all graphs that admit perfect state transfer is substantially hard. \n \nIn this thesis, we focus on some special cases. We provide necessary and sufficient conditions for a distance-regular graph to admit perfect state transfer. In particular, we provide a detailed account of which distance-regular graphs of diameter three do so. \n \nA graph is said to be spectrally extremal if the number of distinct eigenvalues is equal to the diameter plus one. Distance-regular graphs are examples of such graphs. We study perfect state transfer in spectrally extremal graphs and explore rich connections to the topic of orthogonal polynomials. We characterize perfect state transfer in such graphs. \n \nWe also provide a general framework in which perfect state transfer in graph products can be studied. We use this to determine when direct products and double covers of graphs admit perfect state transfer. As a consequence, we provide many new examples of simple graphs admitting perfect state transfer. We also provide some advances in the understanding of perfect state transfer in Cayley graphs for the groups (Z_2)^d and Z_n. \n \nFinally, we consider the problem of determining which trees admit perfect state transfer. We show more generally that, except for the path on two vertices, if a connected bipartite graph contains a unique perfect matching, then it cannot admit perfect state transfer. We also consider this problem in the context of another model of quantum walks determined by the matrix exp(i t L), where L is the Laplacian matrix of the graph. In particular, we show that no tree on an odd number of vertices admits perfect state transfer according to this model.
Quantum spin systems carry information in the form of quantum states, and the propagation of these quantum states is described by a quantum walk. In order to construct an operational quantum computer, the task of reliably transmitting quantum states from one part of a quantum computer to another must be accomplished. Quantum walks are known to be powerful tools in achieving this task. Pure states are quantum states represented by unit complex vectors. In this thesis, we use algebraic and combinatorial techniques to develop the theory of perfect state transfer on pure states in quantum walks, with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a spin network. We prove basic results about eigenvalue supports, periodicity, and strong cospectrality on pure states. We investigate a special type of strong cospectrality called m-strong cospectrality, and show that m-strongly cospectral pure states admit desirable quantum state transfer properties. Several characterisations of perfect state transfer are also given, one for general pure states, one for m-strongly pure states, and another one for real pure states. These characterisations give rise to algebraic and analytic properties of pure states admitting perfect state transfer. Moreover, we determine all complete graphs, complete bipartite graphs, cycles, and paths that admit perfect state transfer between m-strongly pure states. Constructions of infinite families of graphs admitting perfect state transfer are also given. We also characterise perfect state transfer between vertex states in joins and blowup graphs. We determine when the join operation preserves or induces perfect state transfer in the resulting graph. We also use blow-up graphs to construct new families of regular graphs with perfect state transfer. We use these two graph operations to demonstrate that graphs with perfect state transfer can be constructed from graphs that do not exhibit such a property. Finally, we investigate perfect state transfer on s-pair states – pure states that represent entanglement between two vertices. We establish combinatorial and spectral properties of s-pair states with perfect state transfer, and characterise its existence in complete graphs, complete bipartite graphs, paths and distance-regular graphs. Further, we construct infinite families of graphs with s-pair state transfer.
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.
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter 222 and diameter 333, as well as integral distance-regular graphs.
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.
The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices uuu and vvv are adjacent if gcd⁡(u−v,n)=1\gcd(u - v, n) = 1gcd(u−v,n)=1. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley graphs. We characterize all periodic unitary Cayley graphs. We prove that periodicity is a necessary condition for occurrence of perfect state transfer on a vertex-transitive graph. Also, we provide a necessary and sufficient condition for the occurrence of perfect state transfer on circulant graphs. Using these, we prove that only four graphs in the class of unitary Cayley graphs exhibit perfect state transfer. Also, we provide a spectral characterization of the periodicity of Grover walks on integral regular graphs.