Laplacian Perfect Pair State Transfer

• Laplacian perfect pair state transfer is the precise transport of antisymmetric two-vertex states using graph Laplacians, hinging on strong cospectrality and well-defined spectral partitions.
• The method utilizes continuous-time quantum walks and spectral decomposition to overcome obstructions like fixed twin states, enabling controlled state transfer in key graph families such as paths and cycles.
• Perturbative techniques, involution methods, and graph products extend the transfer mechanism, offering practical routes to construct and classify transferable antisymmetric states across diverse graphs.

Laplacian perfect pair state transfer is the exact transport, under a continuous-time quantum walk generated by a graph Laplacian, of an antisymmetric two-vertex state $e_a-e_b$ to another antisymmetric state $e_c-e_d$ up to a unimodular phase. It arose as a generalization of Laplacian perfect state transfer between vertices, replacing localized basis states by pair states and thereby shifting the central objects of study from vertex cospectrality to strong cospectrality of real states, arithmetic constraints on Laplacian eigenvalue support, and structural mechanisms that preserve or obstruct antisymmetric dynamics (Chen et al., 2019, Jiang et al., 2024).

1. Formal definition and state-space viewpoint

Let $G$ be a graph with Laplacian matrix $L$, and let the Laplacian transition matrix be

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

A pair state is the vector $e_a-e_b$, where $e_a$ and $e_b$ are standard basis vectors. Laplacian perfect pair state transfer from $\{a,b\}$ to $\{c,d\}$ at time $e_c-e_d$0 means that there exists a unimodular $e_c-e_d$1 such that

$e_c-e_d$2

Equivalently,

$e_c-e_d$3

up to the normalization convention used in a given paper (Chen et al., 2019, Wang et al., 2022).

The relevant spectral object is not the vertex support of a basis vector but the Laplacian eigenvalue support of the real state $e_c-e_d$4. If

$e_c-e_d$5

is the spectral decomposition, then the support consists of those $e_c-e_d$6 for which $e_c-e_d$7. Perfect pair transfer requires strong cospectrality of the two pair states: for every spectral idempotent $e_c-e_d$8,

$e_c-e_d$9

This is the pair-state analogue of the strong cospectrality condition for vertex transfer (Kim et al., 2024, Kalita et al., 9 Feb 2026).

A basic obstruction is that if a pair state is itself a Laplacian eigenvector, then it is fixed up to phase and does not participate in nontrivial perfect transfer. In particular, fixed pair states occur when the underlying vertices are twins; in that case the antisymmetric state rotates only by a phase under $G$0 and cannot transfer perfectly to a different pair state (Chen et al., 2019, Kim et al., 2024).

2. Spectral criterion and distinctive dynamical features

The general criterion for Laplacian perfect pair state transfer has the same architecture as the vertex criterion, but applied to the support of a real antisymmetric state. If $G$1 is the Laplacian eigenvalue support of $G$2, then perfect pair transfer between $G$3 and $G$4 occurs if and only if three conditions hold: the two states are strongly cospectral; the supported eigenvalues are either all integers or all quadratic integers in a common quadratic field; and the support splits into $G$5 and $G$6 according to a parity rule determined by eigenvalue differences (Chen et al., 2019, Kim et al., 2024).

More precisely, one may choose $G$7 and a square-free $G$8 so that the supported eigenvalues lie in $G$9. Writing

$L$0

the parity of

$L$1

determines whether $L$2 belongs to $L$3 or $L$4, and the optimal transfer time is

$L$5

The same framework is used in later work on total graphs and Q-graphs, where impossibility proofs are obtained by showing that the required support cannot satisfy the strong-cospectral and parity constraints simultaneously (Kalita et al., 9 Feb 2026, Jiang et al., 2024).

Pair-state dynamics also exhibits features absent from vertex transfer. Symmetry and monogamy still hold: if transfer occurs from one pair state to another at a given time, the converse holds at the same time, and a given initial pair can transfer to at most one target pair. However, pair transfer also admits a transitivity phenomenon that cannot occur in vertex state transfer: if $L$6 and $L$7 occur at the same time, then $L$8 occurs at that time as well (Chen et al., 2019).

For bipartite graphs there is an additional correspondence: perfect pair state transfer under the Laplacian is equivalent to perfect plus-state transfer under the unsigned Laplacian when the two states are supported on opposite color classes. This places Laplacian pair transfer within a broader real-state transfer formalism in which antisymmetric and symmetric two-vertex states are intertwined by the graph bipartition (Chen et al., 2019, Kim et al., 2024).

3. Canonical graph families and classification results

The strongest early classifications concern paths and cycles, where pair transfer is much more constrained than general real-state transfer.

Graph family	Laplacian perfect pair state transfer	Representative result
Paths $L$9	Only $U(t)=\exp(itL).$0 and $U(t)=\exp(itL).$1 in the pair-state classification	(Chen et al., 2019)
Cycles $U(t)=\exp(itL).$2	$U(t)=\exp(itL).$3 in one classification; $U(t)=\exp(itL).$4 in the $U(t)=\exp(itL).$5-pair classification	(Chen et al., 2019, Kim et al., 2024)
Complete graphs $U(t)=\exp(itL).$6	None for $U(t)=\exp(itL).$7	(Kim et al., 2024)
Antipodal distance-regular graphs with vertex PST	None except $U(t)=\exp(itL).$8	(Kim et al., 2024)
Complete bipartite graphs $U(t)=\exp(itL).$9	Only specific parameter sets in the complete characterization of pair and plus transfer	(Godsil et al., 12 Feb 2025)

For paths, the pair-state theory identifies $e_a-e_b$0 and $e_a-e_b$1 as the only examples with Laplacian perfect pair state transfer; for $e_a-e_b$2, transfer occurs between the two edge states at time $e_a-e_b$3, and for $e_a-e_b$4, between the end edges at time $e_a-e_b$5 (Chen et al., 2019). This is sharply different from vertex transfer: weighted-path results show that no weighted or unweighted path on $e_a-e_b$6 vertices admits Laplacian perfect state transfer between the end vertices (Kirkland et al., 2017). A plausible implication is that antisymmetric two-vertex states can remain transferable in small path geometries even when vertex-localized transport is already excluded.

On cycles, two reported classifications coexist. "Pair State Transfer" states that $e_a-e_b$7 is the only cycle exhibiting Laplacian perfect pair state transfer (Chen et al., 2019). By contrast, "A generalization of quantum pair state transfer" states that the only cycles admitting any perfect $e_a-e_b$8-pair state transfer are $e_a-e_b$9, $e_a$0, and $e_a$1, and gives explicit Laplacian pair-state instances on $e_a$2 and $e_a$3 (Kim et al., 2024). This suggests that the precise theorem hypotheses and the state family under consideration matter in low-dimensional cycle classifications.

Complete graphs provide a clean obstruction. For $e_a$4 with $e_a$5, no Laplacian perfect pair state transfer occurs because the pair state $e_a$6 is already a Laplacian eigenvector: the twin structure makes it a fixed antisymmetric mode rather than a transferable one (Kim et al., 2024). The same paper extends this rigidity to antipodal distance-regular graphs admitting vertex perfect state transfer, concluding that there is no Laplacian perfect pair state transfer in that class unless the graph is $e_a$7 (Kim et al., 2024).

In the broader real-state framework, complete bipartite graphs admit a complete characterization of pair and plus transfer. The summary of "Perfect state transfer between real pure states" reports that Laplacian pair and plus transfer in $e_a$8 occurs only for $e_a$9, $e_b$0, and $e_b$1 (Godsil et al., 12 Feb 2025).

4. Perturbative and local construction methods

One of the main constructive mechanisms is edge perturbation between twin vertices. If $e_b$2 and $e_b$3 are twins in $e_b$4, let

$e_b$5

For the edge-perturbed graph $e_b$6, the Laplacian becomes $e_b$7, and the transition matrix satisfies

$e_b$8

This explicit factorization yields sufficient conditions under which pair-LPST or pair-LPGST is preserved or created after perturbation (Wang et al., 2022).

The perturbative theorems distinguish three cases. If a pre-existing transferable pair state does not involve the perturbed vertices, transfer is preserved. If it involves one perturbed vertex and one external vertex, transfer is preserved provided $e_b$9. If the initial pair state is periodic, then choosing $\{a,b\}$0 can force transfer from $\{a,b\}$1 to $\{a,b\}$2 at time $\{a,b\}$3 in the perturbed graph (Wang et al., 2022). These results generate concrete families: $\{a,b\}$4 has pair-LPST from $\{a,b\}$5 to $\{a,b\}$6 for all $\{a,b\}$7 at time $\{a,b\}$8, and deleting a matching $\{a,b\}$9 from $\{c,d\}$0 yields analogous transfer for every edge of the matching (Wang et al., 2022).

A more local and modular viewpoint appears in the generalized-cluster framework for real state transfer. There, a cluster $\{c,d\}$1 of structurally equivalent vertices supports an embedded graph $\{c,d\}$2, and pair states orthogonal to the all-ones direction on $\{c,d\}$3 evolve as though the ambient graph were absent. For Laplacian or signless Laplacian dynamics, the construction gives

$\{c,d\}$4

so transfer in $\{c,d\}$5 propagates directly to transfer in the larger graph (Pal, 12 May 2025). Using $\{c,d\}$6, the paper constructs an infinite family of non-regular graphs of maximum valency five that exhibit perfect pair state transfer under the Laplacian, adjacency, and signless Laplacian between the same pair of states at the same time (Pal, 12 May 2025).

These perturbative and local constructions are complementary. Edge perturbation exploits a rank-one antisymmetric mode created by twins, whereas cluster methods isolate an antisymmetric subspace whose dynamics depends only on the induced subgraph. In both cases, the transferable object is a real state with zero sum on the active support.

5. Involutions, half-graphs, and product constructions

Graphs with involutions furnish a systematic reduction of pair transfer to vertex transfer. For the generalized Laplacian

$\{c,d\}$7

the choice $\{c,d\}$8 recovers the usual Laplacian. If $\{c,d\}$9 is a non-trivial involution, then perfect pair state transfer between

$e_c-e_d$00

occurs if and only if there is vertex perfect state transfer between $e_c-e_d$01 and $e_c-e_d$02 in the involution-induced half-graph with Hamiltonian $e_c-e_d$03 (Ojha et al., 22 Apr 2026). This block-diagonal reduction extends to strong cospectrality and pretty good transfer as well (Ojha et al., 22 Apr 2026).

That equivalence is constructive. In the 2026 formulation, almost all simple unweighted planar graphs, and almost all simple unweighted trees, can be modified by assigning loops of weight one to exactly two vertices so that the resulting graph admits pair PST relative to $e_c-e_d$04 (Ojha et al., 22 Apr 2026). A related 2025 involution-based $e_c-e_d$05-Laplacian study likewise derives infinite families of trees with potentials and unicyclic graphs of maximum degree three exhibiting perfect pair state transfer, again by reducing antisymmetric states in the original graph to vertex states in a smaller half-graph (Ojha et al., 25 Sep 2025).

Regular graph products supply another route. For the tensor product $e_c-e_d$06, "Pair state transfer in tensor product and double cover" gives necessary and sufficient conditions for Laplacian perfect pair state transfer when one factor admits perfect state transfer or pair-LPST (Jiang et al., 23 Sep 2025). The resulting arithmetic conditions couple the Laplacian support of a pair state in one factor to phase data from the transfer time in the other. Explicit families include $e_c-e_d$07, which admits pair-LPST for any $e_c-e_d$08, and $e_c-e_d$09, which has pair-LPST at time $e_c-e_d$10 (Jiang et al., 23 Sep 2025).

For double covers $e_c-e_d$11, the same paper characterizes pair-LPST in terms of pair periodicity or pair transfer for the matrices $e_c-e_d$12 and $e_c-e_d$13. One explicit example is $e_c-e_d$14, which admits pair-LPST at time $e_c-e_d$15 (Jiang et al., 23 Sep 2025). These product results expose a recurrent principle: exact antisymmetric transfer survives when the product decomposition preserves a controllable two-phase splitting of the relevant support.

6. Nonexistence theorems and the shift to pretty good transfer

The recent literature on derived regular graphs emphasizes how restrictive exact Laplacian pair transfer is. For Q-graphs of $e_c-e_d$16-regular graphs, if $e_c-e_d$17 is prime or a power of $e_c-e_d$18, then the Q-graph $e_c-e_d$19 does not have Laplacian perfect pair state transfer (Jiang et al., 2024). This covers, in particular, $e_c-e_d$20 and Q-graphs of generalized Petersen graphs in the cases stated in the paper. The same work gives a sufficient condition for pair-LPGST: if $e_c-e_d$21 has pair-LPST and $e_c-e_d$22 is prime, then $e_c-e_d$23 can inherit pair-LPGST under explicit bipartite or non-bipartite hypotheses, and $e_c-e_d$24 is given as an example (Jiang et al., 2024).

For total graphs $e_c-e_d$25 of $e_c-e_d$26-regular graphs, the obstruction is formulated spectrally. If $e_c-e_d$27 and $e_c-e_d$28 is not a Laplacian eigenvalue of $e_c-e_d$29, then $e_c-e_d$30 fails to exhibit Laplacian perfect pair state transfer; if $e_c-e_d$31 with $e_c-e_d$32, then $e_c-e_d$33 also fails to exhibit Laplacian perfect pair state transfer (Kalita et al., 9 Feb 2026). Nevertheless, under mild arithmetic conditions, $e_c-e_d$34 exhibits Laplacian pretty good pair state transfer, and the paper derives infinitely many such total graphs from cocktail party graphs and hypercubes (Kalita et al., 9 Feb 2026).

Derived graph class	Exact pair-LPST	Approximate pair transfer
Q-graph $e_c-e_d$35 of an $e_c-e_d$36-regular graph	No if $e_c-e_d$37 is prime or a power of $e_c-e_d$38	Pair-LPGST under stated inheritance conditions
Total graph $e_c-e_d$39 of an $e_c-e_d$40-regular graph	No if $e_c-e_d$41 and $e_c-e_d$42	Pair-LPGST under mild arithmetic conditions

A consistent pattern emerges. Exact Laplacian pair state transfer is governed by strong cospectrality together with stringent integrality or quadratic-integrality conditions on the supported spectrum. Derived graph operations often introduce square roots or incompatible parity data, destroying those conditions even when the original graph has exact transfer. By contrast, pretty good pair state transfer can persist because Kronecker-type approximation arguments allow quasi-periodic phases to align arbitrarily well, even when exact commensurability fails (Jiang et al., 2024, Kalita et al., 9 Feb 2026).

In that sense, Laplacian perfect pair state transfer occupies a narrow but structurally rich regime: rigid enough to admit sharp classifications and no-go theorems, yet flexible enough to support constructive theories based on twin perturbations, involutions, clusters, and graph products.