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:1102.4898 · Discrete Mathematics

State transfer on graphs

Chris D. Godsil

Published Aug 4, 2011• 224 citations
arXivHTMLPDF
DOI
10.1016/j.disc.2011.06.032

Related papers

Universal state transfer on graphs

Stephen Cameron, Shannon Fehrenbach, Leah Granger +3 more

arXiv:1310.3885•Linear Algebra and its Applications•May 21, 2014•26 citations

Quantum state transfer in graphs with tails

Pierre-Antoine Bernard, Christino Tamon, Luc Vinet +1 more

arXiv:2211.14704•Linear Algebra and its Applications•Feb 4, 2025•2 citations

Laplacian pair state transfer in Q-graph

Ming Jiang, Xiaogang Liu, Jing Wang

arXiv:2407.14376•Discrete Applied Mathematics•Jun 17, 2025•1 citation

State transfer in strongly regular graphs with an edge perturbation

Chris D. Godsil, Krystal Guo, Mark Kempton +2 more

arXiv:1710.02181•Journal of Combinatorial Theory Series A•Dec 12, 2019•15 citations

Quantum State Transfer on Neighborhood Corona of Two Graphs

Xiaoqin Zhang, Qi Xiong, Gui‐Xian Tian +1 more

arXiv:2204.08722•Bulletin of the Malaysian Mathematical Sciences Society•Nov 22, 2022•5 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
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.