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

Perfect State Transfer from a Localised Two-Excitation State to a Dicke State via Static Spin-Network Hamiltonians

Soumyojyoti Dutta

quant-phSubmitted Sep 9, 2026• Announced Sep 10, 2026• 0 citations
v1 · Sep 9, 2026v2 · Sep 20, 2026
arXivHTMLPDF

Abstract

I construct a family of time-independent, excitation-preserving spin Hamiltonians that realises perfect state transfer from a localised two-excitation state to the symmetric two-excitation Dicke state, for every system size $N \ge 4$. The Hamiltonian has the physical form $H = \sum_{i<j} J_{ij} (σ_i^+ σ_j^- + σ_j^+ σ_i^-) + \sum_i ε_i n_i$ with real couplings, and satisfies $e^{-iHt} |110\cdots0\rangle = e^{iφ} |D_N^{(2)}\rangle$ at a finite time. The construction exploits an $S_{N-2}$ permutation symmetry acting on the initially unoccupied spins, which reduces the dynamics to a four-dimensional invariant subspace. Requiring $(|ψ_0\rangle + |D_N^{(2)}\rangle)/2$ to be a zero eigenvector determines the on-site energies in closed form and leaves three coupling parameters free. The remaining inverse spectral problem reduces to two polynomial equations in two dimensionless coupling ratios; eliminating one ratio yields a degree-six reciprocal polynomial, which the substitution $z = x + x^{-1}$ converts to a cubic. For the spectral family $(-n,-1,1)$, with $n$ an odd integer, an explicit factorisation of the leading coefficient together with a boundary evaluation at $z=-2$ shows that for every $N \ge 4$ an odd $n$ can be chosen large enough that a real root with $z < -2$ exists; a subresultant argument supplies a real lift of that root to the original system. The existence proof is entirely symbolic and does not rely on numerical optimisation; direct propagation is used only as independent validation. The result is a constrained analogue of perfect state transfer: unlike the general real-state problem, where an unconstrained real symmetric matrix suffices, here the Hamiltonian is required to arise from an excitation-preserving spin-network form.

Comments
7pages, 3 figures

Related papers

Perfect state transfer over distance-regular spin networks

M. A. Jafarizadeh, Rahime Sufiani

Christandl et al. have noted that the $d$-dimensional hypercube can be projected to a linear chain with $d+1$ sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and $d$-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.

arXiv:0709.0755•Physical Review A•Feb 13, 2008•44 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

How to construct spin chains with perfect state transfer

Luc Vinet, Alexei S. Zhedanov

A method to systematically construct the $XX$ quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST) is shown. Sets of orthogonal polynomials (OPs) are in correspondence with such systems. The key observation is that for any admissible one-excitation energy spectrum, the weight function of the associated OPs is uniquely prescribed. This entails the complete characterization of these PST models with the mirror-symmetry property arising as a corollary. A simple and efficient algorithm to obtain the corresponding Hamiltonians is presented. A model connected to a special case of the symmetric $q$-Racah polynomials is offered. An explanation of how additional models with PST can be derived from a parent system by removing energy levels from the one-excitation spectrum of the latter is given. This is achieved through Christoffel transformations and is also completely constructive in regards to the Hamiltonians.

arXiv:1110.6474•Physical Review A•Jan 23, 2012•92 citations

Perfect state transfer under matrix powers: parity and spectral arithmetic

Xingkun Song

For a real symmetric matrix $H$ and distinct vertices $a,b$, we classify exponents $k$ for which $H^k$ has perfect state transfer (PST) from $a$ to $b$. If their supported eigenvalues are integer multiples of a common positive number, every odd exponent reduces to $H$ and every positive even exponent reduces to $H^2$. We determine the minimum transfer times using a greatest common divisor of supported spectral differences. For rational symmetric matrices, symmetry of the source vertex support about zero implies the odd-power equivalence without a commensurability assumption; this includes all bipartite graphs. If the source vertex supports zero, PST under one positive even power implies PST under every positive even power. For a symmetric three-point quadratic spectrum whose outer projection signs agree and differ from the central sign, a nonzero rational shift leaves exactly one PST exponent. We classify all adjacency powers of hypercubes, cycles, and Johnson graphs, and all adjacency squares of paths. In particular, the adjacency matrix of $P_7$ has PST from vertex $2$ to vertex $6$ only at exponent $2$.

math.COCross-listedarXiv:2609.18018•Sep 17, 2026

Perfect state transfer in a spin chain without mirror symmetry

Gabriel Coutinho, Luc Vinet, Hanmeng Zhan +1 more

Abstract We introduce an analytical XX spin chain with asymmetrical transport properties. It has an even number N + 1 of sites labeled by . It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first site to the next to last one. In fact, PST of one-excitation states takes place between the even sites: , ; while states localized at a single odd site undergo fractional revival (FR) over odd sites only. Perfect return is witnessed at double the PST/FR time. The couplings and local magnetic fields are related to the recurrence coefficients of the dual −1 Hahn polynomials.

arXiv:1903.04707•Journal of Physics A Mathematical and Theoretical•Sep 24, 2019•4 citations

Spectral Fusion for Identifying Early State Exclusion in Symmetric Quantum Spin Chains

Mia Escobar, Valentin Garcia, Anastasiia Minenkova

Perfect state transfer (PST) in one-dimensional quantum spin chains provides a natural setting in which quantum information transport can be analyzed using spectral methods. In the single-excitation subspace, the dynamics of a chain with nearest-neighbor interactions are governed by a Jacobi matrix, allowing questions of state transfer to be formulated in terms of eigenvalue distributions and symmetry properties of eigenvectors. In this work, we investigate the phenomenon of \emph{early state exclusion} (ESE), whereby the overlap of the time-evolved state with the initial state vanishes at a time strictly earlier than the first occurrence of perfect state transfer. Building on earlier constructions of Hamiltonians exhibiting PST with and without ESE, we provide explicit Jacobi matrix realizations for arbitrary odd-length chains and establish general conditions under which ESE occurs or does not occur. We propose the process of \emph{spectral fusion} (SF) to build infinite families of such Hamiltonians. These results broaden the known class of spin chains displaying early state exclusion and further clarify the role of spectral structure of the Hamiltonians.

quant-pharXiv:2606.04353•Jun 4, 2026•0 citations
I construct a family of time-independent, excitation-preserving spin Hamiltonians that realises perfect state transfer from a localised two-excitation state to the symmetric two-excitation Dicke state, for every system size N≥4N \ge 4N≥4. The Hamiltonian has the physical form H=∑i<jJij(σi+σj−+σj+σi−)+∑iεiniH = \sum_{i<j} J_{ij} (σ_i^+ σ_j^- + σ_j^+ σ_i^-) + \sum_i ε_i n_iH=∑i<j​Jij​(σi+​σj−​+σj+​σi−​)+∑i​εi​ni​ with real couplings, and satisfies e−iHt∣110⋯0⟩=eiφ∣DN(2)⟩e^{-iHt} |110\cdots0\rangle = e^{iφ} |D_N^{(2)}\ranglee−iHt∣110⋯0⟩=eiφ∣DN(2)​⟩ at a finite time. The construction exploits an SN−2S_{N-2}SN−2​ permutation symmetry acting on the initially unoccupied spins, which reduces the dynamics to a four-dimensional invariant subspace. Requiring (∣ψ0⟩+∣DN(2)⟩)/2(|ψ_0\rangle + |D_N^{(2)}\rangle)/2(∣ψ0​⟩+∣DN(2)​⟩)/2 to be a zero eigenvector determines the on-site energies in closed form and leaves three coupling parameters free. The remaining inverse spectral problem reduces to two polynomial equations in two dimensionless coupling ratios; eliminating one ratio yields a degree-six reciprocal polynomial, which the substitution z=x+x−1z = x + x^{-1}z=x+x−1 converts to a cubic. For the spectral family (−n,−1,1)(-n,-1,1)(−n,−1,1), with nnn an odd integer, an explicit factorisation of the leading coefficient together with a boundary evaluation at z=−2z=-2z=−2 shows that for every N≥4N \ge 4N≥4 an odd nnn can be chosen large enough that a real root with z<−2z < -2z<−2 exists; a subresultant argument supplies a real lift of that root to the original system. The existence proof is entirely symbolic and does not rely on numerical optimisation; direct propagation is used only as independent validation. The result is a constrained analogue of perfect state transfer: unlike the general real-state problem, where an unconstrained real symmetric matrix suffices, here the Hamiltonian is required to arise from an excitation-preserving spin-network form.
Christandl et al. have noted that the ddd-dimensional hypercube can be projected to a linear chain with d+1d+1d+1 sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and ddd-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.
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.
A method to systematically construct the XXXXXX quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST) is shown. Sets of orthogonal polynomials (OPs) are in correspondence with such systems. The key observation is that for any admissible one-excitation energy spectrum, the weight function of the associated OPs is uniquely prescribed. This entails the complete characterization of these PST models with the mirror-symmetry property arising as a corollary. A simple and efficient algorithm to obtain the corresponding Hamiltonians is presented. A model connected to a special case of the symmetric qqq-Racah polynomials is offered. An explanation of how additional models with PST can be derived from a parent system by removing energy levels from the one-excitation spectrum of the latter is given. This is achieved through Christoffel transformations and is also completely constructive in regards to the Hamiltonians.
For a real symmetric matrix HHH and distinct vertices a,ba,ba,b, we classify exponents kkk for which HkH^kHk has perfect state transfer (PST) from aaa to bbb. If their supported eigenvalues are integer multiples of a common positive number, every odd exponent reduces to HHH and every positive even exponent reduces to H2H^2H2. We determine the minimum transfer times using a greatest common divisor of supported spectral differences. For rational symmetric matrices, symmetry of the source vertex support about zero implies the odd-power equivalence without a commensurability assumption; this includes all bipartite graphs. If the source vertex supports zero, PST under one positive even power implies PST under every positive even power. For a symmetric three-point quadratic spectrum whose outer projection signs agree and differ from the central sign, a nonzero rational shift leaves exactly one PST exponent. We classify all adjacency powers of hypercubes, cycles, and Johnson graphs, and all adjacency squares of paths. In particular, the adjacency matrix of P7P_7P7​ has PST from vertex 222 to vertex 666 only at exponent 222.
Abstract We introduce an analytical XX spin chain with asymmetrical transport properties. It has an even number N + 1 of sites labeled by . It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first site to the next to last one. In fact, PST of one-excitation states takes place between the even sites: , ; while states localized at a single odd site undergo fractional revival (FR) over odd sites only. Perfect return is witnessed at double the PST/FR time. The couplings and local magnetic fields are related to the recurrence coefficients of the dual −1 Hahn polynomials.
Perfect state transfer (PST) in one-dimensional quantum spin chains provides a natural setting in which quantum information transport can be analyzed using spectral methods. In the single-excitation subspace, the dynamics of a chain with nearest-neighbor interactions are governed by a Jacobi matrix, allowing questions of state transfer to be formulated in terms of eigenvalue distributions and symmetry properties of eigenvectors. In this work, we investigate the phenomenon of \emph{early state exclusion} (ESE), whereby the overlap of the time-evolved state with the initial state vanishes at a time strictly earlier than the first occurrence of perfect state transfer. Building on earlier constructions of Hamiltonians exhibiting PST with and without ESE, we provide explicit Jacobi matrix realizations for arbitrary odd-length chains and establish general conditions under which ESE occurs or does not occur. We propose the process of \emph{spectral fusion} (SF) to build infinite families of such Hamiltonians. These results broaden the known class of spin chains displaying early state exclusion and further clarify the role of spectral structure of the Hamiltonians.