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:1710.02181 · Journal of Combinatorial Theory Series A

State transfer in strongly regular graphs with an edge perturbation

Chris D. Godsil, Krystal Guo, Mark Kempton, Gábor Lippner, Florentin Münch

Published Dec 12, 2019• 15 citations
arXivHTMLPDF
DOI
10.1016/j.jcta.2019.105181

Related papers

Laplacian state transfer on graphs with an edge perturbation between twin vertices

Hiranmoy Pal

arXiv:2109.05306•Discrete Mathematics•Mar 8, 2022•5 citations

Perfect edge state transfer on cubelike graphs

Xiwang Cao

arXiv:2003.10624•Quantum Information Processing•Sep 1, 2021•9 citations

Perfect state transfer on distance-regular graphs and association schemes

Gabriel Coutinho, Chris D. Godsil, Krystal Guo +1 more

arXiv:1401.1745•Linear Algebra and its Applications•Apr 4, 2015•71 citations

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

Sho Kubota, Hiroto Sekido, Harunobu Yata +1 more

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.

arXiv:2506.02530•Jun 3, 2025•3 citations

Constructing graphs having Laplacian pair state transfer by an edge perturbation

Wei Wang, Xiaogang Liu, Jing Wang

In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions, we also construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer.

arXiv:2202.04957•Feb 10, 2022•0 citations

Quantum state transfer on 𝒬-graphs

Xiao-Qin Zhang, Shu‐Yu Cui, Gui‐Xian Tian

Given a graph G, the graph 𝒬(G) is obtained by inserting a new vertex into every edge of G, then connecting those inserted vertices on the neighbouring edges in G. We usually refer to 𝒬(G) as the 𝒬-graph of G. This article mainly focuses on the effects of 𝒬-graph operation on quantum state transfer. It is shown that if G is an integral r-regular graph for r ≥ 2, then 𝒬(G) always avoids perfect state transfer. In contrast, we also show that, this 𝒬-graph exists pretty good state transfer under some special circumstances. Subsequently, by applying the results obtained above, we also display many new classes of 𝒬-graphs that avoid perfect state transfer but exist pretty good state transfer.

arXiv:2108.07590•RAIRO - Operations Research•Apr 11, 2025•2 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.
Given a graph G, the graph 𝒬(G) is obtained by inserting a new vertex into every edge of G, then connecting those inserted vertices on the neighbouring edges in G. We usually refer to 𝒬(G) as the 𝒬-graph of G. This article mainly focuses on the effects of 𝒬-graph operation on quantum state transfer. It is shown that if G is an integral r-regular graph for r ≥ 2, then 𝒬(G) always avoids perfect state transfer. In contrast, we also show that, this 𝒬-graph exists pretty good state transfer under some special circumstances. Subsequently, by applying the results obtained above, we also display many new classes of 𝒬-graphs that avoid perfect state transfer but exist pretty good state transfer.