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

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.

Annalen der Physik•May 1, 2026•0 citations

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

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.

arXiv:2204.05034•Apr 11, 2022•0 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.

arXiv:1605.05260•The Electronic Journal of Combinatorics•May 19, 2017•23 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.

arXiv:2301.01473•Jan 4, 2023•2 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.

arXiv:2108.07590•RAIRO - Operations Research•Apr 11, 2025•2 citations
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.
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.
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.
The neighborhood corona G⋆HG \star HG⋆H is the graph obtained by taking one copy GGG and ∣G∣|G|∣G∣ copies of HHH, and joining each vertex of the jjjth copy of HHH to all neighbors of vjv_{j}vj​ in GGG. 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⋆HG \star HG⋆H admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.
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 GGG and HHH, the Frucht-Harary corona product G∘HG \circ HG∘H is obtained by taking ∣G∣|G|∣G∣ copies of the cone K1+HK_{1} + HK1​+H and by identifying the conical vertices according to GGG. Our work explores conditions under which the corona G∘HG \circ HG∘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 HHH, perfect state transfer occurs from vertex aaa to vertex bbb if the (b,a)(b,a)(b,a)-entry of the unitary matrix exp⁡(−iHt)\exp(-iHt)exp(−iHt) has unit magnitude for some time ttt. 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 ±i\pm i±i), the oriented 333-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 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.