RAIRO - Operations Research

Quantum state transfer on edge coronae

Gao-Le Dai, Shu‐Yu Cui, Gui‐Xian Tian, Fen-Fang Ren

Published Sep 29, 2026• 0 citations

Abstract

The edge corona product of a graph $G$ with size $m$ and another graph $H$, usually expressed as $G\diamond H$, is formed by taking one copy of $G$ and $m$ copies of $H$, and then connecting each endpoint of the $i$-th edge of $G$ to each vertex of the $i$-th copy of $H$. This paper investigates perfect state transfer (PST) and pretty good state transfer (PGST) in continuous-time quantum walks on edge corona product of graphs. We establish some sufficient conditions under which this product has no periodic vertices; consequently, PST does not occur. We also exhibit an infinite family of periodic edge corona graphs that do not admit PST, and further give sufficient conditions for the occurrence of PGST on edge corona product of graphs.

DOI: 10.1051/ro/2026110

Related papers

Quantum Walks and Perfect State Transfer on the Corona Graphs Pn∘Cm

Qi Han, Rong Zhang

Annalen der PhysikMay 1, 20260 citations

Signless Laplacian State Transfer on Vertex Complemented Coronae

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

arXiv:2502.14460Feb 20, 20250 citations

Quantum state transfer on Q-graphs

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

arXiv:2108.07590Aug 17, 20210 citations

Quantum State Transfer in Coronas

Ethan Ackelsberg, Zachary Brehm, Ada Chan +2 more

arXiv:1605.05260The Electronic Journal of CombinatoricsMay 19, 201722 citations

State Transfer in Complex Quantum Walks

Antonio Acuaviva, Ada Chan, Eldridge, Summer +5 more

arXiv:2301.01473Jan 4, 20230 citations

Perfect state transfer in neighborhood coronas

Xing-Kun Song

arXiv:2204.05034Apr 11, 20220 citations

RAIRO - Operations Research

Quantum state transfer on edge coronae

Gao-Le Dai, Shu‐Yu Cui, Gui‐Xian Tian, Fen-Fang Ren

Published Sep 29, 2026• 0 citations

Publisher

Abstract

The edge corona product of a graph (G) with size (m) and another graph (H), usually expressed as (G\diamond H), is formed by taking one copy of (G) and (m) copies of (H), and then connecting each endpoint of the (i)-th edge of (G) to each vertex of the (i)-th copy of (H). This paper investigates perfect state transfer (PST) and pretty good state transfer (PGST) in continuous-time quantum walks on edge corona product of graphs. We establish some sufficient conditions under which this product has no periodic vertices; consequently, PST does not occur. We also exhibit an infinite family of periodic edge corona graphs that do not admit PST, and further give sufficient conditions for the occurrence of PGST on edge corona product of graphs.

DOI: 10.1051/ro/2026110

Related papers

Quantum Walks and Perfect State Transfer on the Corona Graphs Pn∘Cm

Qi Han, Rong Zhang

ABSTRACT The efficient implementation of quantum information processing relies on the reliable transfer of quantum states between specified vertices. This paper investigates the time required to achieve perfect state transfer (PST) on corona product graphs . To leverage the high symmetry of such graph structures, we employ a compression method to decompose their state space into several disjoint strata. By designing the coupling strengths between vertices, we analyze the time required for PST from a fixed vertex to vertices within each stratum. Furthermore, while keeping the number of vertices in the base graph fixed, we examine how the time required for PST on the corona product graph varies as the number of vertices in the other graph changes. Finally, we extend the obtained results to the general case where the base graph has an arbitrary number of vertices, thereby providing a complete characterization of the conditions for achieving PST.ABSTRACT The efficient implementation of quantum information processing relies on the reliable transfer of quantum states between specified vertices. This paper investigates the time required to achieve perfect state transfer (PST) on corona product graphs . To leverage the high symmetry of such graph structures, we employ a compression method to decompose their state space into several disjoint strata. By designing the coupling strengths between vertices, we analyze the time required for PST from a fixed vertex to vertices within each stratum. Furthermore, while keeping the number of vertices in the base graph fixed, we examine how the time required for PST on the corona product graph varies as the number of vertices in the other graph changes. Finally, we extend the obtained results to the general case where the base graph has an arbitrary number of vertices, thereby providing a complete characterization of the conditions for achieving PST.

Annalen der PhysikMay 1, 20260 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.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.14460Feb 20, 20250 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.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.07590Aug 17, 20210 citations

Quantum State Transfer in Coronas

Ethan Ackelsberg, Zachary Brehm, Ada Chan +2 more

We study state transfer in quantum walks on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$ , the Frucht-Harary corona product $G \circ H$ is obtained by taking $|G|$ copies of the cone $K_{1} + H$ and by identifying the conical vertices according to $G$ . Our work explores conditions under which the corona $G \circ H$ exhibits state transfer. We also describe new families of graphs with state transfer based on the corona product. Some of these constructions provide a generalization of related known results.We study state transfer in quantum walks on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$, the Frucht-Harary corona product $G \circ H$ is obtained by taking $|G|$ copies of the cone $K_{1} + H$ and by identifying the conical vertices according to $G$. Our work explores conditions under which the corona $G \circ H$ exhibits state transfer. We also describe new families of graphs with state transfer based on the corona product. Some of these constructions provide a generalization of related known results.

arXiv:1605.05260The Electronic Journal of CombinatoricsMay 19, 201722 citations

State Transfer in Complex Quantum Walks

Antonio Acuaviva, Ada Chan, Eldridge, Summer +5 more

Given a graph with Hermitian adjacency matrix $H$ , perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$ -entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$ . This phenomenon is relevant for information transmission in quantum spin networks and is known to be monogamous under real symmetric matrices. We prove the following results: 1. For oriented graphs (whose nonzero weights are $\pm i$ ), the oriented $3$ -cycle and the oriented edge are the only graphs where perfect state transfer occurs between every pair of vertices. This settles a conjecture of Cameron et al. On the other hand, we construct an infinite family of oriented graphs with perfect state transfer between any pair of vertices on a subset of size four. 2. There are infinite families of Hermitian graphs with one-way perfect state transfer, where perfect state transfer occurs without periodicity. In contrast, perfect state transfer implies periodicity whenever the adjacency matrix has algebraic entries (as shown by Godsil). 3. There are infinite families with non-monogamous pretty good state transfer in rooted graph products. In particular, we generalize known results on double stars (due to Fan and Godsil) and on paths with loops (due to Kempton, Lippner and Yau). The latter extends the experimental observation of quantum transport (made by Zimborás et al.) and shows non-monogamous pretty good state transfer can occur amongst distant vertices.Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for information transmission in quantum spin networks and is known to be monogamous under real symmetric matrices. We prove the following results: 1. For oriented graphs (whose nonzero weights are $\pm i$), the oriented $3$-cycle and the oriented edge are the only graphs where perfect state transfer occurs between every pair of vertices. This settles a conjecture of Cameron et al. On the other hand, we construct an infinite family of oriented graphs with perfect state transfer between any pair of vertices on a subset of size four. 2. There are infinite families of Hermitian graphs with one-way perfect state transfer, where perfect state transfer occurs without periodicity. In contrast, perfect state transfer implies periodicity whenever the adjacency matrix has algebraic entries (as shown by Godsil). 3. There are infinite families with non-monogamous pretty good state transfer in rooted graph products. In particular, we generalize known results on double stars (due to Fan and Godsil) and on paths with loops (due to Kempton, Lippner and Yau). The latter extends the experimental observation of quantum transport (made by Zimborás et al.) and shows non-monogamous pretty good state transfer can occur amongst distant vertices.

arXiv:2301.01473Jan 4, 20230 citations

Perfect state transfer in neighborhood coronas

Xing-Kun Song

The neighborhood corona $G \star H$ is the graph obtained by taking one copy $G$ and $|G|$ copies of $H$ , and joining each vertex of the $j$ th copy of $H$ to all neighbors of $v_{j}$ in $G$ . In this paper, we study the state transfer of neighborhood coronas related to the adjacency matrix. Concretely, we provide some necessary conditions under which the neighborhood corona $G \star H$ admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.The neighborhood corona $G \star H$ is the graph obtained by taking one copy $G$ and $|G|$ copies of $H$, and joining each vertex of the $j$th copy of $H$ to all neighbors of $v_{j}$ in $G$. In this paper, we study the state transfer of neighborhood coronas related to the adjacency matrix. Concretely, we provide some necessary conditions under which the neighborhood corona $G \star H$ admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.

arXiv:2204.05034Apr 11, 20220 citations

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.

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.

We study state transfer in quantum walks on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs

G

and

H

, the Frucht-Harary corona product

G \circ H

is obtained by taking

|G|

copies of the cone

K_{1} + H

and by identifying the conical vertices according to

G

. Our work explores conditions under which the corona

G \circ H

exhibits state transfer. We also describe new families of graphs with state transfer based on the corona product. Some of these constructions provide a generalization of related known results.

Given a graph with Hermitian adjacency matrix

H

, perfect state transfer occurs from vertex

a

to vertex

b

if the

(b,a)

-entry of the unitary matrix

\exp(-iHt)

has unit magnitude for some time

t

. This phenomenon is relevant for information transmission in quantum spin networks and is known to be monogamous under real symmetric matrices. We prove the following results: 1. For oriented graphs (whose nonzero weights are

\pm i

), the oriented

3

-cycle and the oriented edge are the only graphs where perfect state transfer occurs between every pair of vertices. This settles a conjecture of Cameron et al. On the other hand, we construct an infinite family of oriented graphs with perfect state transfer between any pair of vertices on a subset of size four. 2. There are infinite families of Hermitian graphs with one-way perfect state transfer, where perfect state transfer occurs without periodicity. In contrast, perfect state transfer implies periodicity whenever the adjacency matrix has algebraic entries (as shown by Godsil). 3. There are infinite families with non-monogamous pretty good state transfer in rooted graph products. In particular, we generalize known results on double stars (due to Fan and Godsil) and on paths with loops (due to Kempton, Lippner and Yau). The latter extends the experimental observation of quantum transport (made by Zimborás et al.) and shows non-monogamous pretty good state transfer can occur amongst distant vertices.

The neighborhood corona

G \star H

is the graph obtained by taking one copy

G

and

|G|

copies of

H

, and joining each vertex of the

j

th copy of

H

to all neighbors of

v_{j}

G

. In this paper, we study the state transfer of neighborhood coronas related to the adjacency matrix. Concretely, we provide some necessary conditions under which the neighborhood corona

G \star H

admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.