Coherent Permutation Operators

• Coherent permutation operators are unitary operators that rearrange quantum state amplitudes, preserving superposition and relative phases.
• They are applied in diverse areas such as sparse-matrix block encoding, replica entanglement entropy, and PPT bound state constructions, demonstrating broad utility in quantum information processing.
• Representation-theoretic analyses, including Gram matrix eigenvalue bounds, and circuit synthesis methods ensure their practical efficacy and controlled gate complexity in quantum algorithms.

Coherent permutation operators are permutation-based linear operators that act without measurement on a Hilbert space and therefore preserve superposition; in the most explicit circuit-level usage, they are unitary, reversible operations that reorder amplitudes among computational basis states while preserving relative phases and entanglement (Setty, 29 Aug 2025). The literature, however, uses closely related terminology in several distinct ways: as subsystem-permutation unitaries in multipartite quantum information, as cyclic replica permutations in entanglement calculations, as basis-permutation congruences for constructing PPT bound entangled states, and, in a different algebraic sense, through coherent configurations and orbit coherence in permutation-group theory (Harrow, 2023, Castro-Alvaredo et al., 2010, Zhao et al., 2016, Britnell et al., 2012). The common structural element is permutation action, but the meaning of “coherent” varies between operator-level reversibility, algebraic closure, and dynamical recurrence.

1. Definitions and terminological scope

At the operator level, a standard permutation representation on $\mathcal{H}=(\mathbb{C}^d)^{\otimes n}$ is

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$

so the operator permutes subsystems rather than measuring them (Harrow, 2023). In block-encoding constructions, the term coherent permutation operator is used more specifically for unitary amplitude reordering on computational basis states: “coherent denotes unitary (reversible) reordering that preserves superposition and relative phases without measuring or collapsing the quantum state” (Setty, 29 Aug 2025).

Other papers use permutation operators at different granularities. In the bound-entanglement construction of Li and Qiao, $P_{mn}$ swaps the $m$th and $n$th basis elements, and generalized operators $Q_i(c)P_{mn}$ additionally multiply one row or column by a real scalar $c\neq 0,1$ (Zhao et al., 2016). In the replica approach to entanglement entropy, the local operator $\mathcal{T}_i$ cyclically permutes replicas at site $i$,

$$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$

and products of such operators implement the replica symmetry needed for Rényi entropies (Castro-Alvaredo et al., 2010).

Operator family	Defining action	Representative setting
$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$0	Permutes $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$1 subsystems	Approximate orthogonality (Harrow, 2023)
$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$2 / $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$3	Reorders amplitudes coherently	Sparse-matrix block encoding (Setty, 29 Aug 2025)
$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$4	Cyclically permutes replicas at one site	Replica trick and twist fields (Castro-Alvaredo et al., 2010)
$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$5, $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$6	Swaps or reweights basis elements	PPT bound-entangled states (Zhao et al., 2016)

A recurring misconception is that “coherent permutation” always denotes the same notion. The operator-theoretic usage concerns unitary action on superpositions, whereas orbit coherence and coherent configurations refer to closure properties of orbit partitions or adjacency algebras rather than to amplitude-preserving circuit operations (Britnell et al., 2012, Lim et al., 2012).

2. Representation-theoretic structure and approximate orthogonality

Permutation operators on many-body Hilbert spaces are generally not exactly orthogonal in the normalized Hilbert-Schmidt inner product. For the subsystem-permutation representation, the Gram matrix

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$7

with $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$8 and $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$9 the number of cycles, quantifies their overlap (Harrow, 2023). The same work shows that $P_{mn}$0 is positive semidefinite, has trace $P_{mn}$1, and is invertible iff $P_{mn}$2; moreover, for $P_{mn}$3,

$P_{mn}$4

This is stronger than pairwise small overlap. Entrywise, $P_{mn}$5 is small when the permutations differ substantially, and pairwise approximate orthogonality already appears when $P_{mn}$6. Collectively, however, control of arbitrary linear combinations requires $P_{mn}$7; that distinction is one of the central technical points of the analysis (Harrow, 2023).

The spectrum of $P_{mn}$8 is computed via Schur–Weyl duality, and explicit bounds are given for the extremal eigenvalues: $P_{mn}$9 This representation-theoretic control supports applications including random maximally entangled states, Boson sampling, the Eggeling–Werner multipartite data-hiding scheme, LOCC and purity-testing limitations, and random-circuit poly-design arguments (Harrow, 2023). A plausible implication is that coherent permutation operators become an increasingly effective surrogate basis for symmetric operator expansions as the local dimension enters the stable range $m$0 and then the stronger regime $m$1.

3. Coherent amplitude reordering in block encoding

In gate-level quantum algorithms, coherent permutation operators are introduced as a mechanism for amplitude reordering inside sparse-matrix block encoding (Setty, 29 Aug 2025). The target unitary has the standard block form

$m$2

and the implementation problem is to place prepared amplitudes into the positions required by the nonzero structure of $m$3.

The basic primitive is an amplitude swap between basis states $m$4 and $m$5 that differ in one target qubit position $m$6: $m$7 implemented by a generalized multi-controlled $m$8 gate $m$9 (Setty, 29 Aug 2025). More general amplitude permutations are then realized as sequences of such $n$0 operations, defining $n$1 between subsets of basis states. Because the transformation is unitary, it preserves superposition and entanglement during amplitude reordering.

The same framework uses these operators to compress natural compositions of MCX gates. Shift, delete, and insert operations that would otherwise be applied basis state by basis state can be regrouped by first permuting amplitudes into hardware-friendly patterns. The placement problem is cast as a minimum-Hamming-distance bijection

$n$2

subject to $n$3 being a bijection, i.e. a linear assignment problem solvable by the Hungarian method (Setty, 29 Aug 2025). The purpose is to choose control configurations compatible with nearest-neighbor connectivity and shared controls.

The resulting benefit is explicitly described as overcoming the overhead of multi-controlled $n$4 gates, amplitude reordering, and hardware connectivity, and as minimizing the number of permutations while respecting nearest-neighbor constraints (Setty, 29 Aug 2025). The examples include shift and delete operations, zero-padding to enlarge groups to powers of two, and a structured $n$5 sparse matrix. The paper states that the method can minimize the number of MCX gates from exponential, when applied individually, to logarithmic, when grouped. In this sense, coherent permutation operators are not merely relabelings; they are compilation primitives that expose latent regularity in sparse-data layouts.

4. Replica permutations, twist fields, and entanglement entropy

A different but closely related family of coherent permutation operators appears in the replica trick for quantum spin chains. In the replicated Hilbert space, the local operator $n$6 cyclically permutes the replicas at a fixed site, and for a region $n$7 one defines

$n$8

Rényi entropies are then written as expectation values of $n$9 in the replicated ground state (Castro-Alvaredo et al., 2010).

For spin-$Q_i(c)P_{mn}$0, $Q_i(c)P_{mn}$1 admits an explicit elementary-matrix representation,

$Q_i(c)P_{mn}$2

and also an auxiliary-space trace representation (Castro-Alvaredo et al., 2010). These forms make precise that the operator is local on the lattice site but nontrivial in replica space. A key exchange relation,

$Q_i(c)P_{mn}$3

shows how the cyclic permutation acts on local operator insertions.

Infinite or semi-infinite products of the $Q_i(c)P_{mn}$4 become lattice precursors of branch-point twist fields of quantum field theory (Castro-Alvaredo et al., 2010). In the XXZ spin chain as $Q_i(c)P_{mn}$5, this framework yields exact formulas for the reduced-density-matrix eigenvalues and entropies, including

$Q_i(c)P_{mn}$6

with large-$Q_i(c)P_{mn}$7 logarithmic scaling that is reported as not conformal (Castro-Alvaredo et al., 2010). Here coherence is realized as local-unitary implementation of the discrete $Q_i(c)P_{mn}$8 replica symmetry. This suggests that coherent permutation operators can function as exact lattice realizations of symmetry defects rather than only as circuit-reordering gadgets.

5. Permutation-based constructions of quantum states and operators

Permutation operators also serve as constructive tools for bipartite quantum states. In the construction of bound entangled states, a PPT state $Q_i(c)P_{mn}$9 that violates the range criterion can be transformed by

$c\neq 0,1$0

where $c\neq 0,1$1 with $c\neq 0,1$2, to produce a new state that is again PPT and again violates the range criterion (Zhao et al., 2016). The relevant mechanism is congruence transformation together with partial-transpose properties such as $c\neq 0,1$3. The paper further considers acting on a single eigenvector in a spectral decomposition, and checks local-unitary invariants such as $c\neq 0,1$4, $c\neq 0,1$5, and $c\neq 0,1$6 to show non-LU-equivalence of the derived states (Zhao et al., 2016).

A related algebraic construction is given by Mozrzymas, Chruściński, and Sarbicki through sets of Completely Different Permutations (CDPs), where $c\neq 0,1$7 for all $c\neq 0,1$8 implies Frobenius orthogonality of the associated permutation matrices (Mozrzymas et al., 2017). A set of $c\neq 0,1$9 CDPs induces an orthogonal direct-sum decomposition

$\mathcal{T}_i$0

and thereby a class of bipartite operators

$\mathcal{T}_i$1

If the CDPs form an abelian group, partial transpose maps the operator to another CDP operator, which the paper identifies as useful for constructing PPT states (Mozrzymas et al., 2017).

Permutation expansions also underlie a general matrix model,

$\mathcal{T}_i$2

analyzed under bit-flip and phase-flip perturbations (Daskin, 2024). Via Sinkhorn’s theorem, any square matrix can be written as

$\mathcal{T}_i$3

When the coefficients are positive, the dominant eigenvalue is described as resilient to bit-flip errors; for mixed signs, perturbations are larger, although the numerical evidence is reported to remain small when error rates are small (Daskin, 2024). Gershgorin-based bounds such as

$\mathcal{T}_i$4

for bit flips formalize that dependence. Taken together, these lines of work show that coherent permutation operators are not restricted to basis relabeling; they also furnish structured ansätze for PPT constructions, Choi matrices, and matrix encodings for quantum numerical linear algebra.

6. Algebraic coherence: coherent configurations and orbit coherence

In algebraic combinatorics, “coherent” refers to closure properties rather than to unitary preservation of superposition. For permutation codes in the Kendall tau metric, coherent configurations are built from orbitals of a group action on $\mathcal{T}_i$5; their adjacency matrices $\mathcal{T}_i$6 satisfy $\mathcal{T}_i$7, $\mathcal{T}_i$8, transposition closure, and the algebra relation

$\mathcal{T}_i$9

(Lim et al., 2012). For the Kendall tau setting, the longest permutation $i$0 defines a permutation matrix $i$1 with $i$2, $i$3, and $i$4 commuting with the orbital adjacency matrices. The corresponding centralizer algebra is

$i$5

and linear combinations in this algebra are used to derive LP relaxations of SDP upper bounds on permutation-code size (Lim et al., 2012).

Britnell and Wildon introduced orbit coherence for permutation groups by considering

$i$6

the set of orbit partitions of group elements ordered by refinement (Britnell et al., 2012). A group is join-coherent if $i$7 is closed under join and meet-coherent if it is closed under meet. Their central theorem states that the centralizer in $i$8 of any permutation $i$9 is meet-coherent, and, under finiteness conditions on the orbits of $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$0, also join-coherent; in particular, for finite $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$1, the orbit partitions of the centralizer form a lattice (Britnell et al., 2012).

These usages are terminologically adjacent but conceptually separate from coherent amplitude reordering. A coherent configuration is an adjacency-algebra framework for symmetry reduction, and orbit coherence is a lattice property of orbit partitions. Neither notion requires the operator-level statement that superposition and relative phase are preserved without measurement.

7. Circuit synthesis, hierarchy structure, and dynamical generators

Permutation unitaries occupy a sharply constrained position in quantum circuit theory. In the third level of the Clifford hierarchy, every permutation gate in $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$2 is, up to left and right multiplication by Clifford permutations, a product of Toffoli gates in staircase form; semi-Clifford permutation gates are exactly the Clifford-sandwiched mismatch-free products of controlled-$$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$3 gates with bounded numbers of controls (He et al., 2024). The same work proves that the smallest number of qubits supporting a non-semi-Clifford permutation in $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$4 is $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$5, while every such permutation on at most $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$6 qubits is semi-Clifford (He et al., 2024).

With the generating set $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$7, where $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$8 swaps $$\mathcal{T}_i\lvert s_1\,s_2\,\cdots\,s_n\rangle_i=\lvert s_2\,s_3\,\cdots\,s_n\,s_1\rangle_i,$$9 and $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$00 and $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$01 is the $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$02-cycle, permutation complexity in $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$03 is quadratically bounded both above and below (Yu, 2022). There exists an explicit permutation requiring at least

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$04

gates, every permutation admits an implementation using at most

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$05

gates, and almost all permutations have lower bound

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$06

as $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$07 (Yu, 2022). This places a concrete cost on coherent realization of classical reversible permutations as quantum unitaries.

A further dynamical viewpoint asks for Hamiltonians whose exponentials are permutation matrices. For a four-spin Ising chain, the unitary permutation

$$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$08

admits an exact logarithm, and the BCH expansion terminates in a finite expression involving commuting composite permutation operators (Elze, 2020). The same paper interprets perturbations away from the exact coefficients as generating genuine quantum superpositions from an underlying permutation dynamics (Elze, 2020).

Finally, on infinite-dimensional Hilbert spaces, permutation operators $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$09 are unitary and normal, but the structure of periodic points depends on cycle decomposition: $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$10 iff all cycles are finite and uniformly bounded; if all cycles are finite but unbounded, $$P_d(\pi)\lvert i_1,\ldots,i_n\rangle=\lvert i_{\pi^{-1}(1)},\ldots,i_{\pi^{-1}(n)}\rangle,$$11 is a proper dense subspace; if some cycles are infinite, periodic points are not dense (Chuah, 22 Jan 2025). This dynamical classification shows that even when the operator is a unitary permutation, recurrence properties can vary from total periodicity to sparse periodic structure.