Pair State Transfer in Quantum Walks

• Pair state transfer is a quantum walk phenomenon where a two-vertex superposition (e.g., eₐ - e_b) is transferred perfectly under Laplacian or related dynamics.
• The process hinges on spectral techniques such as strong cospectrality and arithmetic eigenvalue conditions to ensure precise phase alignment and perfect propagation.
• It exhibits unique features like transitivity, monogamy, and symmetry-based reductions, fostering advanced graph constructions for controlled state transfer.

Pair state transfer is a family of state-transfer phenomena in continuous-time quantum walks in which the transported object is not necessarily a single vertex state but a two-vertex superposition, most commonly the antisymmetric state $e_a-e_b$. In the graph-theoretic literature, the central setting uses a graph Laplacian $L$ and unitary evolution $U(t)=\exp(itL)$, with perfect pair state transfer occurring when $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$ for some $\tau$ and $|\gamma|=1$ (Chen et al., 2019). Closely related strands study adjacency-generated dynamics $U(t)=\exp(-itA)$, signless-Laplacian dynamics, Hermitian or oriented graphs, and generalized $s$-pair states $e_u+s e_v$, where the pair state and plus state arise as the special cases $s=-1$ and $L$0 (Kim et al., 2024). Across these settings, the theory combines spectral decomposition, strong cospectrality, arithmetic conditions on eigenvalue supports, and graph constructions that either enable or obstruct exact or asymptotic transfer (Chen et al., 2019).

1. Formal framework and variants

For a graph with adjacency matrix $L$1, degree matrix $L$2, Laplacian $L$3, and signless Laplacian $L$4, continuous-time quantum walks are generated by exponentials of one of these Hermitian matrices. In the Laplacian formulation of Chen and Godsil, the pair state associated with vertices $L$5 is $L$6, and perfect pair state transfer (PPST) from $L$7 to $L$8 at time $L$9 means

$U(t)=\exp(itL)$0

with $U(t)=\exp(itL)$1 and $U(t)=\exp(itL)$2 (Chen et al., 2019). The corresponding density-matrix formulation uses

$U(t)=\exp(itL)$3

and PPST is equivalent to $U(t)=\exp(itL)$4 (Chen et al., 2019).

The same paper treats the signless-Laplacian analogue by replacing $U(t)=\exp(itL)$5 with $U(t)=\exp(itL)$6 and $U(t)=\exp(itL)$7 with the plus state $U(t)=\exp(itL)$8 (Chen et al., 2019). More generally, the $U(t)=\exp(itL)$9-pair formalism studies states of the form $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$0 for nonzero $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$1, with perfect $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$2-pair transfer defined by the same phase-equivalence condition under $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$3, $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$4, or $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$5 (Kim et al., 2024). In bipartite graphs, plus-state transfer relative to $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$6 is equivalent to pair-state transfer relative to $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$7, via a signature matrix $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$8 satisfying $U(\tau)(e_a-e_b)=\gamma(e_c-e_d)$9 (Chen et al., 2019).

A nearby, older usage speaks of “pairwise” transfer between a chosen source-target vertex pair. In adjacency-generated walks on Hermitian graphs, this includes perfect and pretty good transfer between vertices, and universal state transfer when transfer occurs between every ordered pair (Cameron et al., 2013). This suggests that the literature uses two related conventions: one centered on antisymmetric or generalized two-vertex states, and one centered on transfer between specified vertex pairs. The former is the standard meaning of “pair state transfer” in the Laplacian literature (Chen et al., 2019).

Framework	Evolution	State type
Adjacency	$\tau$0	vertex states, $\tau$1-pair states
Laplacian	$\tau$2	pair states $\tau$3
Signless Laplacian	$\tau$4	plus states $\tau$5
$\tau$6-Laplacian	$\tau$7	pair, plus, and $\tau$8-pair states

2. Spectral criteria and arithmetic structure

The spectral decomposition

$\tau$9

is the basic analytic tool for PPST (Chen et al., 2019). The eigenvalue support of $|\gamma|=1$0 is the set of Laplacian eigenvalues $|\gamma|=1$1 with $|\gamma|=1$2, and the decisive symmetry notion is strong cospectrality:

$|\gamma|=1$3

If PPST occurs, strong cospectrality is necessary (Chen et al., 2019).

Chen and Godsil give a necessary and sufficient phase-alignment criterion. Writing $|\gamma|=1$4 and $|\gamma|=1$5 for the eigenvalues on which the projections agree or differ by a sign, PPST occurs at time $|\gamma|=1$6 if and only if the pair states are strongly cospectral and, for some $|\gamma|=1$7,

$|\gamma|=1$8

$|\gamma|=1$9

The same paper shows that periodicity of $U(t)=\exp(-itA)$0 is equivalent to the ratio condition

$U(t)=\exp(-itA)$1

and that the support eigenvalues must be either all integers or all quadratic integers in a common field $U(t)=\exp(-itA)$2 (Chen et al., 2019).

The adjacency-based PGST theory sharpens this arithmetic picture through relative minimal polynomials $U(t)=\exp(-itA)$3 and $U(t)=\exp(-itA)$4 attached to $U(t)=\exp(-itA)$5 and $U(t)=\exp(-itA)$6 (Bommel, 2020). In that formulation, PGST occurs if and only if strong cospectrality holds and every integer relation

$U(t)=\exp(-itA)$7

among roots $U(t)=\exp(-itA)$8 of $U(t)=\exp(-itA)$9 and $s$0 of $s$1 satisfies the parity constraint $s$2 (Bommel, 2020). The same work gives sufficient conditions via irreducibility and trace-per-degree equality, and obstruction theorems based on odd-degree factors (Bommel, 2020). For real $s$3-pair states, the same strong-cospectrality and integer-or-quadratic-integer dichotomy reappears in the general transfer theorem of (Kim et al., 2024).

3. Structural phenomena specific to pair states

Pair states exhibit features that do not occur for ordinary vertex transfer. The most striking is transitivity: if PPST occurs at time $s$4 from $s$5 to $s$6 and simultaneously from $s$7 to $s$8, then PPST also occurs at time $s$9 from $e_u+s e_v$0 to $e_u+s e_v$1 (Chen et al., 2019). The proof uses the density-matrix identity

$e_u+s e_v$2

which has no vertex-state analogue (Chen et al., 2019).

At the same time, pair transfer retains a monogamy property: for any fixed pair $e_u+s e_v$3 there is at most one pair $e_u+s e_v$4 with PPST to $e_u+s e_v$5 (Chen et al., 2019). Another distinctive feature is the existence of fixed pair states. The state $e_u+s e_v$6 is fixed, meaning $e_u+s e_v$7 for all $e_u+s e_v$8, if and only if $e_u+s e_v$9 and $s=-1$0 are twins, namely $s=-1$1 (Chen et al., 2019). Fixed pair states cannot exhibit PPST (Chen et al., 2019).

For real symmetric adjacency matrices, universal perfect state transfer between all vertex pairs is impossible (Cameron et al., 2013), but pair-state transfer under Laplacian dynamics is far less rigid. Chen and Godsil report that Laplacian pair PST appears far more frequently than adjacency vertex PST in enumerations up to $s=-1$2 vertices (Chen et al., 2019). This suggests that the antisymmetric two-vertex sector has a substantially richer transfer geometry than the one-vertex sector, even though both are governed by comparable spectral constraints.

A recurrent heuristic identifies edge-state transfer in a graph with vertex PST in its line graph. The 2019 paper notes that this correspondence appears for paths and cycles, with matching times, but does not hold generally beyond these classes (Chen et al., 2019). It therefore functions as a useful guide in special families, not as a general equivalence.

4. Exact classifications on basic graph families

The path and cycle classifications are the canonical starting point. For Laplacian pair state transfer on cycles, $s=-1$3 is the only cycle with PPST; it occurs between opposite edges at time $s=-1$4 (Chen et al., 2019). For paths, $s=-1$5 has PPST if and only if $s=-1$6, with transfer between the two edges of $s=-1$7 at $s=-1$8 and between the two end edges of $s=-1$9 at $L$00 (Chen et al., 2019). By bipartite equivalence, the same list holds for plus-state transfer under the signless Laplacian (Chen et al., 2019).

The generalized $L$01-pair theory yields a different classification on cycles because it encompasses more than antisymmetric edge states. For $L$02, perfect $L$03-pair transfer occurs only in explicit cases on $L$04, $L$05, and $L$06, including $L$07 on $L$08 at $L$09, $L$10 on $L$11 at $L$12, and $L$13 on $L$14 at $L$15 (Kim et al., 2024). This does not contradict the Laplacian pair-state classification, because the underlying state space and Hamiltonians differ (Kim et al., 2024).

Threshold graphs admit an exact Laplacian characterization. A connected threshold graph has LPST if and only if either it is of the exceptional form $L$16, where LPST may occur without Laplacian vertex transfer, or its block sizes satisfy explicit congruence conditions modulo $L$17 (Lima et al., 19 Jan 2026). The same paper proves that, on connected threshold graphs, LPST and Laplacian vertex state transfer are equivalent if and only if the graph is not a join $L$18 with $L$19 (Lima et al., 19 Jan 2026).

For adjacency-based PGST, paths admit a complete classification: PGST on $L$20 between vertices $L$21 and $L$22 occurs precisely when $L$23 and one of three arithmetic conditions on $L$24 holds, namely $L$25, $L$26 with $L$27 an odd prime, or $L$28 with $L$29 odd prime and $L$30 a multiple of $L$31 (Bommel, 2020). Cycles admit PGST if and only if their length is a power of two, and then only between antipodal vertices (Pal et al., 2016).

5. Constructions, reductions, and graph operations

Several later papers convert pair-state transfer into a design principle. For graphs with an involution, the $L$32-Laplacian theory reduces antisymmetric pair-state transfer on the full graph to vertex PST on a smaller “half graph” governed by the minus-sector matrix $L$33 (Ojha et al., 25 Sep 2025). In block form,

$L$34

so transfer between $L$35 and $L$36 is equivalent to vertex PST between $L$37 and $L$38 in the half graph (Ojha et al., 25 Sep 2025). This yields infinite families of trees with potentials and unicyclic graphs of maximum degree three that exhibit perfect pair state transfer (Ojha et al., 25 Sep 2025).

A related locality principle appears for isomorphic branches. If two induced subgraphs $L$39 and $L$40 are isomorphic and attached symmetrically to the rest of the graph, then the antisymmetric pair-state subspace spanned by $L$41 evolves exactly as the adjacency walk on one branch:

$L$42

Consequently, any graph with high-fidelity vertex transfer can be embedded as isomorphic branches of a larger graph to produce high-fidelity pair-state transfer (Pal et al., 2024). This mechanism is used to exhibit pair transfer on paths, cycles, and augmented graphs (Pal et al., 2024).

The generalized-cluster framework of edge-perturbed graphs gives a similar reduction under $L$43, $L$44, and $L$45. If $L$46 is a cluster and $L$47, then

$L$48

so PST in the local graph $L$49 is inherited by the larger graph $L$50 (Pal, 12 May 2025). Using $L$51, the paper constructs an infinite family of non-regular graphs of maximum valency five with perfect pair state transfer under adjacency, Laplacian, and signless Laplacian between the same pair states at the same time (Pal, 12 May 2025).

Product constructions further enlarge the catalogue. For regular graphs, tensor-product and double-cover theorems characterize Laplacian PPST in terms of synchronized PST or pair-PST on the factors, with explicit congruence conditions on spectral supports and transfer phases (Jiang et al., 23 Sep 2025). In particular, $L$52, $L$53, and $L$54 furnish families with LP-PST at $L$55 (Jiang et al., 23 Sep 2025).

6. Global obstructions, universal regimes, and current directions

The strongest negative results concern graph transforms. For the $L$56-graph of an $L$57-regular graph, Laplacian perfect pair state transfer does not occur when $L$58 is prime or a power of $L$59 (Jiang et al., 2024). For total graphs $L$60, if $L$61 is $L$62-regular with $L$63 and $L$64 is not a Laplacian eigenvalue of $L$65, then $L$66 has no Laplacian perfect pair state transfer, although under mild conditions it does exhibit Laplacian pretty good pair state transfer (Kalita et al., 9 Feb 2026). These obstructions are derived from explicit block spectral decompositions and support-pairing arguments (Jiang et al., 2024, Kalita et al., 9 Feb 2026).

At the opposite extreme lies universal transfer. For adjacency walks on Hermitian graphs, universal pretty good or perfect transfer between every pair of vertices forces a flat eigenbasis and distinct eigenvalues, and imposes strong restrictions on the switching automorphism group (Cameron et al., 2013). Oriented graphs are especially rigid: the oriented edge and the oriented $L$67-cycle are the only oriented graphs with universal perfect state transfer between every pair of vertices (Acuaviva et al., 2023). This resolves the oriented universal-PST problem and sharpens the contrast with Laplacian pair-state transfer, where transfer between many antisymmetric states can coexist without universal vertex transfer (Acuaviva et al., 2023).

Two broader directions are active. One is generalization of the state space: $L$68-pair states, plus states, and real pure states unify pair transfer with other two-vertex superpositions (Kim et al., 2024). The other is implementation. In hypercube architectures, one can determine the unique sub-hypercube containing a chosen pair of vertices as antipodes, switch on only the couplings in that sub-hypercube, and achieve perfect transfer at

$L$69

with amplitude $L$70 across a $L$71-dimensional active subcube (Singh et al., 2020). This is a physically motivated use of “pair state transfer” in the source-target sense, and it suggests a plausible engineering implication: controllable symmetry reduction is as important in hardware design as it is in the abstract graph-theoretic constructions.

Open problems recur across the literature. These include classification of non-circulant universal PGST graphs (Cameron et al., 2013), efficient certification of switching equivalence and pair-transfer criteria (Cameron et al., 2013), extension of LP-PGST results on total graphs to edge-edge and mixed pair states (Kalita et al., 9 Feb 2026), and broader characterizations of $L$72-Laplacian pair transfer beyond involution-based constructions (Ojha et al., 25 Sep 2025). The cumulative picture is that pair state transfer is simultaneously more flexible than vertex PST and more algebraically constrained than naive intuition suggests: it thrives on symmetry, strong cospectrality, and controlled arithmetic in the eigenvalue support, but it is sharply limited by parity, integrality, and support-structure obstructions (Chen et al., 2019).