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

Constructing graphs having Laplacian pair state transfer by an edge perturbation

Wei Wang, Xiaogang Liu, Jing Wang

Published Feb 10, 2022• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2202.04957

Related papers

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•8 citations

Laplacian pretty good edge state transfer in paths

Wang, Wei, Xiaogang Liu, Jing Wang

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.

arXiv:2209.04630•Sep 10, 2022•0 citations

Laplacian state transfer in vertex complemented coronas

Qiang Wang, Xiaogang Liu

In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in vertex complemented coronas. We prove that there is no Laplacian perfect state transfer in vertex complemented coronas. In contrast, we give a sufficient condition for vertex complemented coronas to have Laplacian pretty good state transfer.

arXiv:2202.07202•Feb 15, 2022•0 citations

Quantum state transfer on Q-graphs

Xiaoqin Zhang, Shu‐Yu Cui, Gui‐Xian Tian

We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and joining two new vertices which lie on adjacent edges of $G$ by an edge. We show that, if all eigenvalues of a regular graph $G$ are integers, then its $\mathcal{Q}$-graph $\mathcal{Q}(G)$ has no perfect state transfer. In contrast, we also prove that the $\mathcal{Q}$-graph of a regular graph has pretty good state transfer under some mild conditions. Finally, applying the obtained results, we also exhibit many new families of $\mathcal{Q}$-graphs having no perfect state transfer, but admitting pretty good state transfer.

arXiv:2108.07590•Aug 17, 2021•0 citations

Signless Laplacian State Transfer on Vertex Complemented Coronae

Zhu, Ke-Yu, Gui‐Xian Tian, Shu‐Yu Cui

Given a graph $G$ with vertex set $V(G)=\{v_1,v_2,\ldots,v_{n_1}\}$ and a graph $H$ of order $n_2$, the vertex complemented corona, denoted by $G\tilde{\circ}{H}$, is the graph produced by copying $H$ $n_1$ times, with the $i$-th copy of $H$ corresponding to the vertex $v_i$, and then adding edges between any vertex in $V(G)\setminus\{v_{i}\}$ and any vertex of the $i$-th copy of $H$. The present article deals with quantum state transfer of vertex complemented coronae concerning signless Laplacian matrix. Our research investigates conditions in which signless Laplacian perfect state transfer exists or not on vertex complemented coronae. Additionally, we also provide some mild conditions for the class of graphs under consideration that allow signless Laplacian pretty good state transfer.

arXiv:2502.14460•Feb 20, 2025•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.

RAIRO - Operations Research•Apr 11, 2025•2 citations
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.
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 study the existence of quantum state transfer in Q\mathcal{Q}Q-graphs in this paper. The Q\mathcal{Q}Q-graph of a graph GGG, denoted by Q(G)\mathcal{Q}(G)Q(G), is the graph derived from GGG by plugging a new vertex to each edge of GGG and joining two new vertices which lie on adjacent edges of GGG by an edge. We show that, if all eigenvalues of a regular graph GGG are integers, then its Q\mathcal{Q}Q-graph Q(G)\mathcal{Q}(G)Q(G) has no perfect state transfer. In contrast, we also prove that the Q\mathcal{Q}Q-graph of a regular graph has pretty good state transfer under some mild conditions. Finally, applying the obtained results, we also exhibit many new families of Q\mathcal{Q}Q-graphs having no perfect state transfer, but admitting pretty good state transfer.
Given a graph GGG with vertex set V(G)={v1,v2,…,vn1}V(G)=\{v_1,v_2,\ldots,v_{n_1}\}V(G)={v1​,v2​,…,vn1​​} and a graph HHH of order n2n_2n2​, the vertex complemented corona, denoted by G∘~HG\tilde{\circ}{H}G∘~H, is the graph produced by copying HHH n1n_1n1​ times, with the iii-th copy of HHH corresponding to the vertex viv_ivi​, and then adding edges between any vertex in V(G)∖{vi}V(G)\setminus\{v_{i}\}V(G)∖{vi​} and any vertex of the iii-th copy of HHH. The present article deals with quantum state transfer of vertex complemented coronae concerning signless Laplacian matrix. Our research investigates conditions in which signless Laplacian perfect state transfer exists or not on vertex complemented coronae. Additionally, we also provide some mild conditions for the class of graphs under consideration that allow signless Laplacian pretty good state transfer.
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.