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

Pretty good plus state transfer in cycles

Sarojini Mohapatra, Hiranmoy Pal

math.COquant-phSubmitted Mar 18, 2026• Announced Mar 19, 2026
arXivHTMLPDF

Abstract

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.

Related papers

Pretty good quantum fractional revival in paths and cycles

Ada Chan, Whitney Drazen, Or Eisenberg +2 more

We initiate the study of pretty good quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of pretty good fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give complete characterizations of when pretty good fractional revival can occur in paths and in cycles.

Algebraic Combinatorics•Jan 4, 2022•2 citations

Fractional revival in complementary prisms of graphs

Sarojini Mohapatra, Hiranmoy Pal

The complementary prism $G\overline{G}$ of a graph $G$ is obtained from the disjoint union of $G$ and its complement $\overline{G}$ by adding an edge between each vertex $a$ in $G$ and its copy $a'$ in $\overline{G}.$ This paper explores a general framework for studying fractional revival with respect to real symmetric matrices with a block structure. The framework is then used to show that, for a fixed state $\mathbf{u}$ in $G$ orthogonal to the all-one vector, the complementary prism $G\overline{G}$ exhibits fractional revival from the state $[\mathbf{u},\mathbf{0}]^T$ with respect to the adjacency, Laplacian, and signless Laplacian matrices. We further characterize perfect pair state transfer in the complementary prism of a complete graph and establish the existence of perfect pair and plus state transfer in the complementary prism of a complete bipartite graph.

math.COCross-listedarXiv:2609.12725•Sep 14, 2026

Approximate quantum fractional revival in paths and cycles

Ada Chan, Whitney Drazen, Or Eisenberg +2 more

We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycles.

arXiv:2005.00492•May 1, 2020•2 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

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

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
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 initiate the study of pretty good quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of pretty good fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give complete characterizations of when pretty good fractional revival can occur in paths and in cycles.
The complementary prism GG‾G\overline{G}GG of a graph GGG is obtained from the disjoint union of GGG and its complement G‾\overline{G}G by adding an edge between each vertex aaa in GGG and its copy a′a'a′ in G‾.\overline{G}.G. This paper explores a general framework for studying fractional revival with respect to real symmetric matrices with a block structure. The framework is then used to show that, for a fixed state u\mathbf{u}u in GGG orthogonal to the all-one vector, the complementary prism GG‾G\overline{G}GG exhibits fractional revival from the state [u,0]T[\mathbf{u},\mathbf{0}]^T[u,0]T with respect to the adjacency, Laplacian, and signless Laplacian matrices. We further characterize perfect pair state transfer in the complementary prism of a complete graph and establish the existence of perfect pair and plus state transfer in the complementary prism of a complete bipartite graph.
We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycles.
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.