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

Laplacian pretty good edge state transfer in paths

Wang, Wei, Xiaogang Liu, Jing Wang

Published Sep 10, 2022• 1 citation
arXivHTMLPDF

Abstract

In this paper, we first give a necessary and sufficient condition for a graph to have Laplacian pretty good pair state transfer. As an application of such result, we give a complete characterization of Laplacian pretty good edge state transfer in paths.
DOI
10.48550/arxiv.2209.04630

Related papers

Laplacian Pair State Transfer on Edge Coronas

Akash Kalita, Bikash Bhattacharjya

Let $G$ be a graph with edge set $E(G) = \{e_1, \ldots, e_m\}$, and let $\mathcal{H} = (H_1, \ldots, H_m)$ be an $m$-tuple of graphs. The edge corona $G\diamond\mathcal{H}$ is obtained from the disjoint union of $G,H_1,\ldots,H_m$ by joining both end vertices of each edge $e_j$ to every vertex of $H_j$ for $1\leq j\leq m$. In this paper, we investigate Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on edge coronas. We establish necessary and sufficient conditions for the existence of Laplacian perfect pair state transfer. We also derive sufficient conditions for the non-existence of Laplacian perfect pair state transfer. Further, we identify conditions under which the absence of Laplacian perfect pair state transfer guarantees the existence of Laplacian pretty good pair state transfer. Additionally, we develop constructions based on Cartesian product and tensor product to obtain a few more infinite families of edge coronas admitting Laplacian pretty good pair state transfer. Finally, we investigate the existence of Laplacian pretty good pair state transfer on the edge corona of complete graphs.

arXiv:2611.00866•Oct 31, 2026•0 citations

Laplacian state transfer in edge coronas

Yipeng Li, Xiaogang Liu, Shenggui Zhang

Characterizing which graphs have Laplaican perfect state transfer or Laplacian pretty good state transfer is an interesting and desirable problem. In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in edge coronas. We give sufficient conditions for edge coronas to not have Laplacian perfect state transfer as well as sufficient conditions for edge coronas to have Laplacian perfect state transfer. Additionally, we also give sufficient conditions for edge coronas to have Laplacian pretty good state transfer.

Linear and Multilinear Algebra•Apr 7, 2020•9 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

Pretty Good State Transfer and Minimal Polynomials

Christopher M. van Bommel

We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.

arXiv:2010.06779•Oct 14, 2020•9 citations

Pretty good plus state transfer in cycles

Sarojini Mohapatra, Hiranmoy Pal

We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.

math.COCross-listedarXiv:2603.17595•Mar 19, 2026

A complete characterization of pretty good state transfer on paths

Christopher M. van Bommel

We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.

Quantum Information and Computation•Jun 1, 2019•18 citations
Let GGG be a graph with edge set E(G)={e1,…,em}E(G) = \{e_1, \ldots, e_m\}E(G)={e1​,…,em​}, and let H=(H1,…,Hm)\mathcal{H} = (H_1, \ldots, H_m)H=(H1​,…,Hm​) be an mmm-tuple of graphs. The edge corona G⋄HG\diamond\mathcal{H}G⋄H is obtained from the disjoint union of G,H1,…,HmG,H_1,\ldots,H_mG,H1​,…,Hm​ by joining both end vertices of each edge eje_jej​ to every vertex of HjH_jHj​ for 1≤j≤m1\leq j\leq m1≤j≤m. In this paper, we investigate Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on edge coronas. We establish necessary and sufficient conditions for the existence of Laplacian perfect pair state transfer. We also derive sufficient conditions for the non-existence of Laplacian perfect pair state transfer. Further, we identify conditions under which the absence of Laplacian perfect pair state transfer guarantees the existence of Laplacian pretty good pair state transfer. Additionally, we develop constructions based on Cartesian product and tensor product to obtain a few more infinite families of edge coronas admitting Laplacian pretty good pair state transfer. Finally, we investigate the existence of Laplacian pretty good pair state transfer on the edge corona of complete graphs.
Characterizing which graphs have Laplaican perfect state transfer or Laplacian pretty good state transfer is an interesting and desirable problem. In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in edge coronas. We give sufficient conditions for edge coronas to not have Laplacian perfect state transfer as well as sufficient conditions for edge coronas to have Laplacian perfect state transfer. Additionally, we also give sufficient conditions for edge coronas to have Laplacian pretty good state transfer.
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.