⚛️ quantum physics

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

This paper presents a symbolic construction of time-independent, excitation-preserving spin Hamiltonians that achieve perfect state transfer from a localized two-excitation state to a symmetric Dicke state for any system size $N \ge 4$ , utilizing a subresultant argument to prove existence without numerical optimization.

Original authors: Soumyojyoti Dutta

Published 2026-09-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Soumyojyoti Dutta

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the quiet, invisible world of quantum physics, researchers study how tiny particles called spins behave when linked together in a network. Imagine a row of these spins, each capable of holding a specific amount of energy, known as an excitation. A central goal in this field is to move a specific pattern of energy from one end of a chain to another with absolute precision, a feat known as perfect state transfer. This is not merely about moving energy; it is about moving a specific quantum shape, a delicate arrangement of information, without it getting lost or blurred along the way. For decades, scientists have known how to move simple, single units of energy perfectly. However, when the energy involves two units at once, the rules change. The challenge becomes finding a fixed set of connections between the spins that can take a very specific, lopsided starting arrangement and transform it into a perfectly balanced, symmetrical final state, all without changing the connections or the timing of the process.

A researcher at the A. P. Shah Institute of Technology has now solved this specific puzzle for systems containing four or more spins. The work demonstrates that it is possible to design a static machine—a network of spins with fixed connections and energies—that takes a state where two excitations are stuck together on just two specific sites and moves them to a state where they are spread out equally across the entire network. This final state is known as a Dicke state, a highly symmetrical configuration where the system looks the same no matter which two sites you check. The starting point, by contrast, is highly localized and asymmetrical. The researcher proved that a machine built with specific, unchanging rules can perform this transformation perfectly at a precise moment in time.

The solution relies on a clever use of symmetry. In a large network of spins, most of the sites start out empty. The researcher realized that if the connections between these empty sites are made identical, the complex behavior of the entire system can be reduced to a much simpler problem involving only four key states. This reduction is the key to unlocking the solution. By treating the two occupied sites as unique and distinct, while treating all the empty sites as a uniform group, the problem becomes manageable. The researcher then set up a mathematical condition where the starting state and the target state are linked in a specific way: their average must be a state that does not change at all under the influence of the machine. This condition forces the machine to have a zero-energy state that acts as a pivot point for the transfer.

With this pivot point established, the remaining task was to tune the machine so that the other possible states oscillate at just the right speeds to arrive at the target state at the exact same moment. This required solving a complex set of equations to find the right ratios between the different connection strengths. The researcher showed that for any system size of four spins or more, there is always a set of numbers that works. These numbers are not random; they are derived from a specific pattern of integers that can be chosen to be large enough to guarantee a solution exists. The proof is entirely mathematical and symbolic, meaning it relies on logical deduction rather than computer guessing or trial-and-error optimization.

To confirm the theory, the researcher tested the design on systems ranging from four spins up to one hundred and two spins, and even checked a system with five hundred and two spins. In every single case, the calculated connections worked perfectly. When the machine was simulated, the starting state evolved into the target state with a precision so high that the difference was smaller than one part in ten trillion. This level of accuracy confirms that the theoretical design works exactly as predicted. The researcher also noted that the connections required are not simple or local; the spins need to be connected to many others in the network, and the empty sites must be linked to each other, not just to the occupied ones. This distinguishes the solution from simpler models where connections are only between neighbors.

The work also clarifies what this achievement is not. It does not solve the problem for three or more excitations; the mathematical method used here breaks down when more than two units of energy are involved. It also does not claim to be the fastest possible way to move the state, nor does it claim to be the simplest design. The focus was strictly on proving that such a machine exists and can be constructed with fixed, unchanging rules. The result stands as a constrained version of a broader problem: while it is known that one can always find a machine to move any two states, this paper proves that it is possible to do so even when the machine is restricted to the physical laws of spin networks that preserve the number of excitations.

This discovery adds a new piece to the understanding of how quantum information can be manipulated. It shows that even when the starting and ending states look very different—one clumped together, the other spread out—there is a hidden symmetry that allows a fixed, static system to bridge the gap. The researcher did not rely on numerical optimization, which often gets stuck in local solutions, but instead followed a path of exact algebraic reasoning. This ensures that the solution is robust and real, not just a lucky guess found by a computer. The findings suggest that with the right engineering, we can build quantum networks that perform complex transformations with absolute certainty, provided we stay within the limits of two excitations. For systems with more excitations, the door remains open, but for the two-excitation case, the path is now clear.

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

Problem Statement
The paper addresses the problem of Perfect State Transfer (PST) within engineered quantum spin networks. Specifically, it investigates whether a time-independent, excitation-preserving Hamiltonian can evolve a localized two-excitation state, $|\psi_0\rangle = |110\dots0\rangle$ , into the fully symmetric two-excitation Dicke state, $|D^{(2)}_N\rangle$ , at a finite time $t$ .

While general existence results for PST between arbitrary real pure states are known (via unconstrained real symmetric matrices), these solutions typically yield dense matrices that lack the physical structure of spin networks. The specific physical constraint here is that the Hamiltonian must take the form:
$H = \sum_{i<j} J_{ij}(\sigma^+_i \sigma^-_j + \sigma^+_j \sigma^-_i) + \sum_i \epsilon_i n_i$
where $J_{ij}$ are real couplings and $\epsilon_i$ are on-site energies. The challenge is to satisfy the transfer condition $e^{-iHt}|\psi_0\rangle = e^{i\phi}|D^{(2)}_N\rangle$ while adhering to this excitation-preserving hopping structure and the specific symmetry constraints of the initial and target states.

Methodology
The author employs a constructive, symbolic approach that reduces the high-dimensional problem to a solvable algebraic system:

Symmetry Reduction: The dynamics are restricted to the two-excitation sector. By imposing an $S_{N-2}$ permutation symmetry on the initially unoccupied spins (sites $2$ to $N-1$ ), the problem is reduced to a four-dimensional invariant subspace. The basis states are defined by the occupancy of the two distinguished sites (0 and 1) and the symmetric distribution of excitations among the remaining $M = N-2$ sites.
Spectral Formulation: The transfer condition is translated into spectral requirements. The author constructs a vector $x_+ = \frac{1}{2}(|\psi_0\rangle + |D^{(2)}_N\rangle)$ and requires it to be a zero eigenvector of the effective Hamiltonian ( $Hx_+ = 0$ ). The remaining three eigenvalues are fixed to a specific spectral family $\{-n\pi, -\pi, \pi\}$ , where $n$ is an odd integer. This spectral choice ensures that the time evolution operator flips the sign of the orthogonal component $x_-$ , achieving the transfer.
Inverse Spectral Problem:
- Stage I: The condition $Hx_+ = 0$ is used to express the diagonal elements (on-site energies) in terms of the coupling parameters, leaving three coupling ratios ( $x = q/p$ , $y = a/p$ ) free. This step is shown to be physically realizable for any $N \ge 4$ .
- Stage II: The requirement that the non-zero eigenvalues match the target spectrum leads to two polynomial equations in the dimensionless ratios $x$ and $y$ .
- Algebraic Reduction: Eliminating $y$ yields a degree-six reciprocal polynomial $P(x)$ . Using the substitution $z = x + x^{-1}$ , this is reduced to a cubic polynomial $Q(z)$ .
Existence Proof: The author proves the existence of a real solution by analyzing the signs of the leading coefficient of $Q(z)$ and its value at the boundary $z = -2$ (corresponding to $x = -1$ ). By selecting a sufficiently large odd integer $n$ , the leading coefficient becomes negative while the boundary value remains negative, guaranteeing a real root $z^* < -2$ via the Intermediate Value Theorem. A subresultant argument ensures this root can be lifted to a valid solution for the original system.

Key Results

Theorem 1: For every system size $N \ge 4$ , there exists a real, time-independent, excitation-number-preserving Hamiltonian with $S_{N-2}$ symmetry that achieves perfect state transfer from $|110\dots0\rangle$ to $|D^{(2)}_N\rangle$ .
Explicit Construction: The paper provides a closed-form method to determine the on-site energies and coupling constants. The solution involves choosing a specific odd integer $n$ (typically small, e.g., 3, 5, 7, 9) and solving the resulting algebraic equations.
Numerical Validation: The symbolic construction was verified for $N$ ranging from 4 to 102 (and $N=502$ ). In all cases, the constructed Hamiltonians achieved transfer fidelities at machine precision ( $\sim 10^{-14}$ to $10^{-15}$ ), confirming the symbolic derivation without relying on numerical optimization.

Significance and Claims
The paper claims to solve a constrained version of the PST problem that general spectral theorems do not address. Its primary contributions are:

Physical Realizability: It demonstrates that perfect transfer between a localized state and a symmetric Dicke state is possible using a Hamiltonian with the specific "excitation-preserving" structure required by spin networks, rather than a generic dense matrix.
Symbolic Existence: The proof is entirely symbolic and algebraic, relying on polynomial factorization and root analysis rather than numerical optimization or heuristic search.
Distinction from Existing Models: The work distinguishes itself from Krawtchouk and $SU(2)$ chain constructions. In those models, both initial and target states lie within a fully symmetric representation. Here, the initial state is localized (breaking full symmetry), and the transfer relies on the residual $S_{N-2}$ symmetry of the unoccupied sites.
Limitations: The author explicitly notes that the construction is limited to the two-excitation sector ( $k=2$ ). The mechanism does not extend to $k \ge 3$ due to a mismatch between the number of available parameters and the required spectral constraints. The paper does not claim optimality regarding transfer time or parameter minimality, nor does it propose an experimental implementation or a method for distributing these states over quantum networks.

In conclusion, the paper establishes that a static, engineered spin network can perfectly transfer a localized two-excitation state to a Dicke state for any $N \ge 4$ , providing a rigorous, non-optimization-based proof of existence.

More like this