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

Perfect state transfer in NEPS of complete graphs

Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou

Published Oct 14, 2020• 18 citations
arXivHTMLPDF
DOI
10.1016/j.dam.2020.09.024

Related papers

Perfect state transfer on NEPS of the path on three vertices

Hiranmoy Pal, Bikash Bhattacharjya

arXiv:1501.00914•Discrete Mathematics•Nov 11, 2015•19 citations

Perfect state transfer on oriented graphs

Chris D. Godsil, Sabrina Lato

arXiv:2002.04666•Linear Algebra and its Applications•Jul 2, 2020•13 citations

Perfect state transfer in cubelike graphs

Wang-Chi Cheung, Chris D. Godsil

arXiv:1010.4721•Linear Algebra and its Applications•May 20, 2011•79 citations

Perfect state transfer in integral circulant graphs

Milan Bašić, Marko D. Petković, Dragan Stevanović

Applied Mathematics Letters•Feb 27, 2009•67 citations

Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs

M. Štefaňák, S. Skoupý

arXiv:1610.03633•Quantum Information Processing•Feb 2, 2017•46 citations

QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS

Ricardo Javier Angeles-Canul, Rachael M. Norton, Michael Opperman +3 more

This paper studies quantum perfect state transfer on weighted graphs. We prove that the join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al.1 where the regular graph is a complete graph with or without a missing edge. In contrast, we prove that the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. As a corollary, unlike for complete graphs, adding weights in complete bipartite graphs does not produce perfect state transfer. We also observe that any Hamming graph has perfect state transfer between each pair of its vertices. The result is a corollary of a closure property on weighted Cartesian products of perfect state transfer graphs. Moreover, on a hypercube, we show that perfect state transfer occurs between uniform superpositions on pairs of arbitrary subcubes, thus generalizing results of Bernasconi et al.2 and Moore and Russell.3

International Journal of Quantum Information•Dec 1, 2009•25 citations
This paper studies quantum perfect state transfer on weighted graphs. We prove that the join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al.1 where the regular graph is a complete graph with or without a missing edge. In contrast, we prove that the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. As a corollary, unlike for complete graphs, adding weights in complete bipartite graphs does not produce perfect state transfer. We also observe that any Hamming graph has perfect state transfer between each pair of its vertices. The result is a corollary of a closure property on weighted Cartesian products of perfect state transfer graphs. Moreover, on a hypercube, we show that perfect state transfer occurs between uniform superpositions on pairs of arbitrary subcubes, thus generalizing results of Bernasconi et al.2 and Moore and Russell.3