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

A generalization of quantum pair state transfer

Sooyeong Kim, Hermie Monterde, Bahman Ahmadi, Ada Chan, Stephen J. Kirkland, Sarah Plosker

Published Nov 4, 2024• 7 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04574-9

Related papers

Quantum pair state transfer on isomorphic branches

Hiranmoy Pal, Sarojini Mohapatra

arXiv:2402.07078•Linear Algebra and its Applications•Mar 24, 2026•8 citations

State transfer in Open Quantum Systems

Lorena Ballesteros Ferraz

•Sep 23, 2019•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

State Transfer in Noisy Modular Quantum Networks

Markku Hahto, Jyrki Piilo, Johannes Nokkala

Abstract Quantum state transfer is the act of transferring quantum information from one system in a quantum network to another without physically transporting carriers of quantum information, but instead engineering a Hamiltonian such that the state of the sender is transferred to the receiver through the dynamics of the whole network. A generalization of quantum state transfer called quantum routing concerns simultaneous transfers between multiple pairs in a quantum network, imposing limitations on its structure. This study considers transfer of Gaussian states over noisy quantum networks with modular structure, which have been identified as a suitable platform for quantum routing. Two noise models are compared, affecting either the network topology or the network constituents, studying their effects on both the transfer fidelities and the network properties. The two models are found to affect different features of the network allowing for the identification and quantification of the noise. These features are then used as a guide toward different strategies for the compensation of the noise, and to examine how the compensation strategies perform. The results show that in general, modular networks are more robust to noise than monolithic ones.

arXiv:2407.02145•Advanced Quantum Technologies•Oct 4, 2024•1 citation

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 states transfer between coupled fields

D. Portes, H. Rodrigues, S. B. Duarte +1 more

The European Physical Journal D•May 6, 2008•8 citations
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.
Abstract Quantum state transfer is the act of transferring quantum information from one system in a quantum network to another without physically transporting carriers of quantum information, but instead engineering a Hamiltonian such that the state of the sender is transferred to the receiver through the dynamics of the whole network. A generalization of quantum state transfer called quantum routing concerns simultaneous transfers between multiple pairs in a quantum network, imposing limitations on its structure. This study considers transfer of Gaussian states over noisy quantum networks with modular structure, which have been identified as a suitable platform for quantum routing. Two noise models are compared, affecting either the network topology or the network constituents, studying their effects on both the transfer fidelities and the network properties. The two models are found to affect different features of the network allowing for the identification and quantification of the noise. These features are then used as a guide toward different strategies for the compensation of the noise, and to examine how the compensation strategies perform. The results show that in general, modular networks are more robust to noise than monolithic ones.
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.