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:1906.01591 · Quantum Information Processing

Pair state transfer

Qiuting Chen, Chris D. Godsil

Published Aug 31, 2020• 19 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-02829-9

Related papers

Two State Systems

WORLD SCIENTIFIC eBooks•Apr 29, 2014•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 $(s,r)$-state transfer

Stephen Kirkland, Hermie Monterde, Sarah Plosker

Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$, where $r=s$ is either $-1$ (which corresponds to pair state transfer) or $+1$ (which corresponds to plus state transfer), or more recently $r=s$ is taken to be any real number (which corresponds to $s$-pair state transfer). Here, we broaden the investigation of $s$-pair state transfer to \textit{perfect $(s,r)$-state transfer}, which is perfect state transfer from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$ (up to some dilation) where $r,s\in \mathbb C$. We identify infinite families of graphs with perfect $(s,r)$-state transfer and provide characterizations of cases when $|r|= |s|$ and when $|r|\neq |s|$, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time $t$ starting from a given $s$-pair state $\mathbf u$. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect $(s,r)$-state transfer.

quant-pharXiv:2609.10713•Sep 11, 2026•0 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

Other two-state systems

Richard P. Feynman

Basic Books•Jan 1, 2010•0 citations

Two State Systems

WORLD SCIENTIFIC eBooks•Jan 1, 2013•0 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.
Perfect (s,r)(s,r)(s,r)-state transfer
Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from u=ea+seb\mathbf u = \mathbf e_a + s \mathbf e_bu=ea​+seb​ to μ=eα+reβ\mathbf μ=\mathbf e_α + r \mathbf e_βμ=eα​+reβ​, where r=sr=sr=s is either −1-1−1 (which corresponds to pair state transfer) or +1+1+1 (which corresponds to plus state transfer), or more recently r=sr=sr=s is taken to be any real number (which corresponds to sss-pair state transfer). Here, we broaden the investigation of sss-pair state transfer to \textit{perfect (s,r)(s,r)(s,r)-state transfer}, which is perfect state transfer from u=ea+seb\mathbf u = \mathbf e_a + s \mathbf e_bu=ea​+seb​ to μ=eα+reβ\mathbf μ=\mathbf e_α + r \mathbf e_βμ=eα​+reβ​ (up to some dilation) where r,s∈Cr,s\in \mathbb Cr,s∈C. We identify infinite families of graphs with perfect (s,r)(s,r)(s,r)-state transfer and provide characterizations of cases when ∣r∣=∣s∣|r|= |s|∣r∣=∣s∣ and when ∣r∣≠∣s∣|r|\neq |s|∣r∣=∣s∣, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time ttt starting from a given sss-pair state u\mathbf uu. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect (s,r)(s,r)(s,r)-state transfer.