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

Optimising Perfect Quantum State Transfer for Timing Insensitivity

Alastair Kay, Sooyeong Kim, Christino Tamon

Published Jul 25, 2025• 3 citations
arXivHTMLPDF

Abstract

When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with perfect accuracy. Here, we study how sensitive perfect state transfer is to that timing. We design engineered spin chains which reduce their sensitivity, proving that this construction is asymptotically optimal. The same construction is applied to the task of creating superpositions, also known as fractional revival.

DOI
10.48550/arxiv.2507.18872

Related papers

Tailoring spin chain dynamics for fractional revivals

Alastair Kay

The production of quantum states required for use in quantum protocols & technologies is studied by developing the tools to re-engineer a perfect state transfer spin chain so that a separable input excitation is output over multiple sites. We concentrate in particular on cases where the excitation is superposed over a small subset of the qubits on the spin chain, known as fractional revivals, demonstrating that spin chains are capable of producing a far greater range of fractional revivals than previously known, at high speed. We also provide a numerical technique for generating chains that produce arbitrary single-excitation states, such as the W state.

arXiv:1609.01397•Quantum•Aug 10, 2017•12 citations

Quantum speed limit for perfect state transfer in one dimension

Man‐Hong Yung

The basic idea of spin-chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian such that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical controls. The minimal possible evolution time represents a speed limit for QST. We prove that the optimal solution is the one simulating the precession of a spin in a static magnetic field. We also argue that, at least for solid-state systems where interactions are local, it is more realistic to characterize the computation power by the couplings than the initial energy.

arXiv:quant-ph/0603179•Physical Review A•Sep 14, 2006•130 citations

PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL

Alastair Kay

We review the subject of perfect state transfer — how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.

arXiv:0903.4274•International Journal of Quantum Information•Jun 1, 2010•348 citations

Combinatorial and algebraic aspects of quantum state transfer

Xiaohong Zhang

Reliably transferring a quantum state from one location to another, as well as generating entangled states, are important tasks to achieve in quantum spin systems. The fidelity or probability of state transfer is a number between 0 and 1 that measures the closeness of two quantum states. Fidelity is used to determine the accuracy of quantum state transfer. There are several interesting phenomena of quantum state transfer defined via fidelity: perfect state transfer, pretty good state transfer, and fractional revival. This thesis contains results about the perfect state transfer property of some special classes of graphs, including Hadamard diagonalizable graphs, weighted paths with loops, as well as switched and partially switched hypercubes. A correspondence between the class of graphs that are diagonalizable by a standard Hadamard matrix and the class of cubelike graphs is given. Sensitivity of fidelity to errors when perfect state transfer occurs is analysed: if a system admits perfect state transfer at some time t, bounds on fidelity of state transfer at t+h for very small h are given, as well as bounds on fidelity of a slightly perturbed system at time t. Finally, Laplacian fractional revival on graphs is considered; in particular the thesis contains a characterization of threshold graphs that admit Laplacian fractional revival.

•Aug 29, 2019•0 citations

Spin chains for robust state transfer: Modified boundary couplings versus completely engineered chains

Analía Zwick, Gonzalo A. Álvarez, Joachim Stolze +1 more

Quantum state transfer in the presence of static disorder and noise is one of the main challenges in building quantum computers. We compare the quantum state transfer properties for two classes of qubit chains under the influence of static disorder. In fully engineered chains all nearest-neighbor couplings are tuned in such a way that a single-qubit state can be transferred perfectly between the ends of the chain, while in chains with modified boundaries only the two couplings between the transmitting and receiving qubits and the remainder of the chain can be optimized. We study how the disorder in the couplings affects the state transfer fidelity depending on the disorder model and strength as well as the chain type and length. We show that the desired level of fidelity and transfer time are important factors in designing a chain. In particular we demonstrate that transfer efficiency comparable or better than that of the most robust engineered systems can also be reached in chains with modified boundaries without the demanding engineering of a large number of couplings.

arXiv:1111.2238•Physical Review A•Jan 19, 2012•69 citations

The Limits of Quantum State Transfer for Field-Free Heisenberg Chains

Alastair Kay

In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of perfect transfer, we consider a range of options for achieving high quality transfer, whether in finite time, or via "pretty good" transfer where one waits long times in the hope of getting arbitrarily close to perfect transfer. In attempting to engineer arbitrarily accurate transfer, we explore a new paradigm that facilitates time estimates for achieving any target accuracy $ε$ for the transfer.

arXiv:1906.06223•Jun 14, 2019•5 citations
When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with perfect accuracy. Here, we study how sensitive perfect state transfer is to that timing. We design engineered spin chains which reduce their sensitivity, proving that this construction is asymptotically optimal. The same construction is applied to the task of creating superpositions, also known as fractional revival.
The production of quantum states required for use in quantum protocols & technologies is studied by developing the tools to re-engineer a perfect state transfer spin chain so that a separable input excitation is output over multiple sites. We concentrate in particular on cases where the excitation is superposed over a small subset of the qubits on the spin chain, known as fractional revivals, demonstrating that spin chains are capable of producing a far greater range of fractional revivals than previously known, at high speed. We also provide a numerical technique for generating chains that produce arbitrary single-excitation states, such as the W state.
The basic idea of spin-chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian such that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical controls. The minimal possible evolution time represents a speed limit for QST. We prove that the optimal solution is the one simulating the precession of a spin in a static magnetic field. We also argue that, at least for solid-state systems where interactions are local, it is more realistic to characterize the computation power by the couplings than the initial energy.
We review the subject of perfect state transfer — how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.
Reliably transferring a quantum state from one location to another, as well as generating entangled states, are important tasks to achieve in quantum spin systems. The fidelity or probability of state transfer is a number between 0 and 1 that measures the closeness of two quantum states. Fidelity is used to determine the accuracy of quantum state transfer. There are several interesting phenomena of quantum state transfer defined via fidelity: perfect state transfer, pretty good state transfer, and fractional revival. This thesis contains results about the perfect state transfer property of some special classes of graphs, including Hadamard diagonalizable graphs, weighted paths with loops, as well as switched and partially switched hypercubes. A correspondence between the class of graphs that are diagonalizable by a standard Hadamard matrix and the class of cubelike graphs is given. Sensitivity of fidelity to errors when perfect state transfer occurs is analysed: if a system admits perfect state transfer at some time t, bounds on fidelity of state transfer at t+h for very small h are given, as well as bounds on fidelity of a slightly perturbed system at time t. Finally, Laplacian fractional revival on graphs is considered; in particular the thesis contains a characterization of threshold graphs that admit Laplacian fractional revival.
Quantum state transfer in the presence of static disorder and noise is one of the main challenges in building quantum computers. We compare the quantum state transfer properties for two classes of qubit chains under the influence of static disorder. In fully engineered chains all nearest-neighbor couplings are tuned in such a way that a single-qubit state can be transferred perfectly between the ends of the chain, while in chains with modified boundaries only the two couplings between the transmitting and receiving qubits and the remainder of the chain can be optimized. We study how the disorder in the couplings affects the state transfer fidelity depending on the disorder model and strength as well as the chain type and length. We show that the desired level of fidelity and transfer time are important factors in designing a chain. In particular we demonstrate that transfer efficiency comparable or better than that of the most robust engineered systems can also be reached in chains with modified boundaries without the demanding engineering of a large number of couplings.
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of perfect transfer, we consider a range of options for achieving high quality transfer, whether in finite time, or via "pretty good" transfer where one waits long times in the hope of getting arbitrarily close to perfect transfer. In attempting to engineer arbitrarily accurate transfer, we explore a new paradigm that facilitates time estimates for achieving any target accuracy εεε for the transfer.