Random Purification Theorem Overview

• Random Purification Theorem is a unifying concept in quantum information that employs randomization and symmetry averaging to convert mixed states into asymptotically pure forms.
• It underpins diverse methods including Haar-averaged purifications in tensor networks, SWAP-test protocols for qubits, and ergodic measurement updates in quantum trajectories.
• These techniques have practical implications in quantum metrology, state tomography, and divergence theory by simplifying complex mixed-state structures through symmetry-guided randomness.

Searching arXiv for the term across the provided and related papers to ground the article in current literature. The expression Random Purification Theorem does not denote a single universally fixed statement. In recent quantum-information and mathematical-physics literature, it labels several distinct but structurally related results about obtaining purified, asymptotically pure, or effectively pure descriptions of mixed-state data through randomization, symmetry averaging, or repeated measurements. These include an inequality relating entanglement of purification and Rényi reflected entropy in random tensor networks (Akers et al., 2023), a random SWAP-test protocol that matches ideal Schur sampling after $\mathcal O(n\ln n)$ tests (Brahmachari et al., 7 Aug 2025), an if-and-only-if characterization of asymptotic purification of quantum trajectories via the absence of random dark subspaces (Ekblad et al., 2024), and a family of random purification channels that map $n$ copies of a mixed state to $n$ copies of a uniformly random purification, with extensions to arbitrary symmetry algebras, passive Gaussian bosons, and multi-parameter metrology (Walter et al., 17 Dec 2025).

1. Terminological scope and common mathematical structure

In finite-dimensional quantum information, the basic random-purification construction fixes a standard purification

$$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$

where $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$, and defines a CPTP map

$$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$

such that

$$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$

so the output is a Haar-uniform mixture of $n$ i.i.d. purifications of $\sigma$ (Walter et al., 17 Dec 2025). A streamlined construction introduces

$$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$

and then sets

$n$0

making complete positivity, trace preservation, and permutation covariance explicit (Girardi et al., 28 Nov 2025).

A broader precursor appears in general probabilistic theories. There the Random-Purification Theorem gives the exact expected local purity

$n$1

under transitivity, irreducibility, local tomography, and the existence of a composite classical subsystem (Müller et al., 2011). In quantum theory this reproduces typical entanglement of random pure states; in classical theory it reproduces coin-tossing. This suggests a common motif across the later theorems: randomization over reversible transformations or measurement histories converts difficult mixed-state structure into a form governed by symmetry, sector decomposition, or purity monotonicity.

2. Entanglement of purification in random tensor networks

For a bipartite mixed state $n$2 on $n$3, the entanglement of purification is

$n$4

where $n$5. For integer $n$6, the $n$7-th Rényi reflected entropy is defined through the canonical purification $n$8 by

$n$9

The central inequality is

$n$0

with the strongest stated case

$n$1

In large-bond-dimension random tensor networks one also has the geometric upper bound

$n$2

while the reflected entropy satisfies

$n$3

in the $n$4 limit (Akers et al., 2023).

The proof of the lower bound proceeds through a Rényi generalization

$n$5

a cyclic-twist representation

$n$6

and a modular-operator insertion followed by Cauchy–Schwarz. The resulting estimate is

$n$7

and minimizing over purifications yields $n$8.

In random tensor networks, the reflected entropy at integer $n$9 concentrates on a replica-domain-wall “triway cut” functional,

$$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$0

At $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$1 all three domain-wall tensions become equal to $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$2, and in many networks the optimal configuration coincides with the $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$3 configuration, so that

$$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$4

Combining this with $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$5 and $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$6 gives

$$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$7

for those typical large-$$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$8 random tensor networks. The 1TN example exhibits agreement except for a small “triangular” window where a nontrivial $$|\psi_\rho^{\mathrm{std}}\rangle := (\sqrt{\rho}\otimes I)|\Gamma\rangle,$$9-domain persists at $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$0, while in the 2TN example one gets $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$1 in the regime $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$2 (Akers et al., 2023).

A common misconception is to read this as a universal proof that $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$3 for all holographic or tensor-network states. The stated result is narrower: the general inequality is $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$4 for integer $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$5, and the equality $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$6 is concluded in large-$$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$7 RTNs when the $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$8 reflected-entropy geometry is governed by the same minimal-cut configuration as the $$|\Gamma\rangle=\sum_{i=1}^d |i\rangle\otimes |i\rangle$$9 limit. The paper explicitly notes that the argument does not directly extend to continuous $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$0 or non-integer reflected entropies, and identifies a proof of the stronger inequality $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$1 as an open direction (Akers et al., 2023).

3. Random SWAP-test purification and Schur-optimal qubit fidelity

A different Random Purification Theorem concerns qubit purification from noisy copies of an unknown pure state. The input is

$$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$2

and the protocol maintains an active set $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$3, an exhausted set $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$4 of singlet pairs, and an angular-momentum register $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$5 initialized to $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$6. At each round $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$7, one selects uniformly at random a pair $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$8 of distinct qubits from $$\mathcal R_{n,d}:L((\mathbb C^d)^{\otimes n})\to L((\mathbb C^d\otimes\mathbb C^d)^{\otimes n})$$9, performs a two-qubit SWAP test with outcomes

$$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$0

and, upon detecting the singlet, removes $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$1 from $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$2, appends them to $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$3, and decrements the register $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$4 (Brahmachari et al., 7 Aug 2025).

For any permutationally-invariant $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$5-qubit state $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$6, if $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$7 denotes the protocol output after $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$8 rounds and $$\mathcal R_{n,d}[\sigma^{\otimes n}] = \int_{U\in U(d)} (I\otimes U)^{\otimes n} |\psi_\sigma^{\mathrm{std}}\rangle\langle\psi_\sigma^{\mathrm{std}}|^{\otimes n} (I\otimes U^\dagger)^{\otimes n}\,dU = \mathbb E_{U\sim\mathrm{Haar}}\bigl(|\psi_\sigma^U\rangle\langle\psi_\sigma^U|\bigr)^{\otimes n},$$9 denotes ideal Schur sampling, then for all $n$0,

$n$1

Equivalently, to achieve total-variation error $n$2, it suffices to take

$n$3

The theorem is accompanied by an exact fidelity formula. Writing

$n$4

with ideal sector fidelity

$n$5

the actual average output fidelity is

$n$6

As $n$7, $n$8, recovering the optimum $n$9, and more quantitatively,

$\sigma$0

The threshold behavior is controlled by the detection-probability lemma. If the current register value is $\sigma$1 but the true sector is $\sigma$2, a uniformly chosen SWAP test on the remaining $\sigma$3 qubits detects a new singlet with probability

$\sigma$4

Hence the mean time to descend from $\sigma$5 to $\sigma$6 is $\sigma$7, and the total expected number of tests to detect all $\sigma$8 singlets is

$\sigma$9

A Chernoff-tail bound for sums of geometric random variables then yields the exponential overshoot estimate $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$0. The practical interpretation given in the paper is that $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$1 elementary two-qubit SWAP tests and classical bookkeeping suffice to match the fidelity of the full Schur transform, and more generally to realize weak Schur sampling and unitary Schur sampling with error $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$2 after only $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$3 tests (Brahmachari et al., 7 Aug 2025).

4. Asymptotic purification of random quantum trajectories

In the measurement-theoretic usage, the Random Purification Theorem is an equivalence theorem for repeated random generalized measurements in a stationary ergodic environment. One fixes a finite-dimensional Hilbert space $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$4, a probability space $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$5 with measure-preserving ergodic shift $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$6, and measurable measurement operators

$$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$7

satisfying

$$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$8

Starting from $$R_n = \int_{U\in\mathcal U(d)} d\mu_{\rm Haar}(U)\; (1_{A^n}\otimes U^{\otimes n})\,\Gamma_{AB}^{\otimes n}\,(1_{A^n}\otimes (U^\dagger)^{\otimes n}),$$9, the trajectory updates as

$n$00

with conditional outcome probabilities

$n$01

Thus $n$02 is a time-inhomogeneous Markov chain in a random environment (Ekblad et al., 2024).

The obstruction to purification is a measurable correspondence $n$03 of fixed positive dimension satisfying, for each $n$04 and almost every $n$05,

$n$06

and

$n$07

Such a family is a random dark subspace. Equivalently, any normalized state supported in $n$08 yields outcome probabilities $n$09 independent of the particular state within that subspace. The theorem states that asymptotic purification,

$n$10

existing and being pure for $n$11-almost every $n$12 and almost every randomized outcome sequence, is equivalent to the absence of nontrivial random dark subspaces (Ekblad et al., 2024).

The proof is organized through the purity process

$n$13

One has

$n$14

with strict inequality unless $n$15 is supported in some dark-subspace fiber. Hence $n$16 is a bounded submartingale and converges almost surely. Limit supports define a measurable subspace correspondence $n$17, and passing to the limit in the update map shows that this correspondence obeys the invariance and information-free conditions. Ergodicity then yields the dichotomy: a nontrivial random dark subspace permits the chain to stall below purity $n$18, while the absence of such subspaces forces $n$19.

The examples clarify the criterion. For random projective measurements in Haar-distributed bases of $n$20, there is no nonzero invariant subspace common to every random basis, so the state purifies almost surely. For a fixed-basis noisy qubit measurement with

$n$21

the one-dimensional spaces spanned by $n$22 and $n$23 are dark, and the trajectory does not purify to a unique pure state. A common source of confusion is that one-dimensional dark spaces are still “nontrivial” in the theorem’s sense; the obstruction is positive dimension, not necessarily dimension greater than one (Ekblad et al., 2024).

5. Random purification channels, symmetry algebras, and Gaussian variants

The random purification channel has been generalized from the i.i.d. $n$24-symmetric setting to arbitrary symmetry algebras. Let $n$25 be any $n$26-subalgebra, equivalently the commutant $n$27 of some closed subgroup $n$28, with commutant $n$29. There exists a CPTP map

$n$30

such that for all $n$31,

$n$32

where $n$33 is any closed unitary subgroup with $n$34. The output is supported on the $n$35-symmetric subspace, and if one can efficiently block-diagonalize $n$36 and implement its Fourier transform, then $n$37 is efficiently implementable (Walter et al., 17 Dec 2025).

This abstract theorem recovers the original $n$38 result, gives a concise proof via commutants and transpose-twirls, and yields fermionic and bosonic Gaussian instantiations. For fermionic Gaussian states $n$39 on $n$40, there is a channel

$n$41

such that

$n$42

For gauge-invariant bosonic Gaussian states, the corresponding block-diagonal CPTP map twirls over passive Gaussian unitaries and produces $n$43 copies of a random passive-Gaussian purification (Walter et al., 17 Dec 2025).

A complementary construction specializes directly to passive Gaussian bosons. For an unknown $n$44-mode passive Gaussian state $n$45, one writes $n$46 with $n$47, and defines the standard purification

$n$48

This purification is Gaussian and satisfies

$n$49

For each $n$50, one introduces

$n$51

and defines

$n$52

The series converges strongly and defines a completely-positive trace-preserving map. When $n$53 with $n$54 passive Gaussian,

$n$55

so the channel prepares $n$56 copies of a Haar-random passive Gaussian purification of $n$57 (Mele et al., 18 Dec 2025).

The simplified finite-dimensional construction also extends beyond i.i.d. inputs. If $n$58 is permutation-symmetric, then

$n$59

where $n$60 is any fixed symmetric purification of $n$61. Thus any symmetric state is transformed into a uniform convex mixture of symmetric purifications, all related by the same product unitary on the purifying system (Girardi et al., 28 Nov 2025). This corrects the narrower impression that random purification channels apply only to strictly i.i.d. inputs.

6. Applications, operational consequences, and open boundaries

The most direct operational applications lie in estimation, tomography, and divergence theory. In multi-parameter quantum metrology, one introduces an environment $n$62 of dimension $n$63, nuisance parameters $n$64, and the canonical purification

$n$65

The random purification channel is

$n$66

With this channel followed by only individual measurements, one can construct estimators satisfying

$n$67

The key identities are

$n$68

so purification converts the mixed-state problem into a pure-state problem with nuisance parameters on the environment. The achievability proof uses a two-stage scheme: classical shadows for rough estimation and then locally optimal pure-state measurements, with Matrix-Hoeffding concentration controlling the first stage (Zhou, 5 May 2026).

In learning-theoretic settings, the channel has found applications to state tomography, channel learning, and Shannon-theory proofs (Mele et al., 18 Dec 2025). For fermionic Gaussian states, random purification yields a tomography protocol with sample complexity

$n$69

and a pure-Gaussianity property test using

$n$70

copies (Walter et al., 17 Dec 2025). In divergence theory, the simplified channel gives a one-line proof of a strengthened Uhlmann theorem for any quantum divergence satisfying data processing and a weak quasi-concavity condition, and it identifies a universal family of nearly-optimal extensions obtained by applying a fixed random-purification procedure to $n$71 (Girardi et al., 28 Nov 2025).

Across these lines of work, the main limitations are explicit. In the random-tensor-network setting, the proof of $n$72 is carried out for integer $n$73, not for non-integer $n$74 or directly at $n$75, and the stronger inequality $n$76 remains open (Akers et al., 2023). In the SWAP-test setting, optimality is stated relative to Schur sampling and depends on a sharp threshold near $n$77, rather than constant-depth purification (Brahmachari et al., 7 Aug 2025). In the trajectory setting, purification is contingent on the absence of random dark subspaces, so repeated measurements do not generically force a unique pure limit (Ekblad et al., 2024).

Taken together, these results establish random purification as a unifying technical paradigm rather than a single theorem: Haar averaging over purifying degrees of freedom, sector-resolving random local tests, ergodic measurement updates, and commutant-algebra constructions all serve to replace mixed-state optimization by structured pure-state or asymptotically pure descriptions. The precise theorem depends on context, but the recurring content is the same: purification becomes tractable when randomness aligns with symmetry, sector decomposition, or monotone purity growth.