Section 2.3 — existence of the random purification channel
OpenMixedCloning.Optimal.rpc_existsFix integers , and . Let be copies of and copies of . There exists a quantum channel (a linear, completely positive, trace-preserving map, given by a normalized Kraus family)
with the following property. For every state on of rank at most , and every unit vector with ,
where is the normalized Haar measure on the unitary group .
This is the random purification channel of Tang, Wright and Zhandry, as stated in Section 2.3 of the source. It maps copies of a mixed state of rank at most to copies of a consistent but Haar-random purification on . It is the first stage of the purify–clone–trace (PCT) cloner and is exactly the second clause of Theorem 1.
Formalization Note The specification is the platform predicate IsRPC d r n R. The displayed identity is required for every purification in , not just for one fixed choice, matching the source, where may be any fixed purification of . Tensor registers are ordered as , and the case is included, where the empty tensor power is one-dimensional.
Differences from the source:
- restriction: any → ; reason: matches the parameter range of Theorem 1, whose second clause this statement is; Section 2.3 itself imposes no upper bound on
- generalization: copies → every ; reason: for both sides are the trivial one-dimensional state, matching clause 2 of Theorem 1
- encoding: the action for one fixed purification → the same identity for every unit purification in ; reason: the source allows any fixed purification, so the channel must satisfy the identity for each choice
import Definitions.Def_MixedCloning_Optimal_Model noncomputable section open Matrix MeasureTheory open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Section 2.3 (PDF p.12), citing Tang–Wright–Zhandry [TWZ25]: for every number of
copies `n` there is a random purification channel `RPC^{(d,r,n)}`, i.e. a channel whose
action on every `ρ^{⊗n}` with `rank ρ ≤ r` is the Haar average of `n` copies of a random
purification of `ρ` in `ℂ^d ⊗ ℂ^r` (the specification `IsRPC`). -/
theorem rpc_exists (d r n : ℕ) (hd : 1 ≤ d) (hr : 1 ≤ r) (hrd : r ≤ d) :
∃ R : QAlgorithms.Superop (Word (Fin d) n) (Word (Fin d × Fin r) n), IsRPC d r n R := by sorry
end MixedCloning.Optimal