Entangled vectors and the three explicit random purification maps
DefinitionRandomDimReduction_Channel_Supplement_PurificationFor a finite orthonormal basis , let , without normalization. A purification of is a unit vector on whose partial trace over is . The canonical regrouping sends to , and reindexes tensor operators accordingly.
For an operator map , its reference-first Choi matrix has blocks . With the published reduction map , not , put
Let . The other two explicit maps are
where is the published kernel projector. No positivity, normalization or purification guarantee is imposed by these definitions. The target average independently conjugates a fixed purification by , takes its -fold tensor power and regroups the registers, then integrates over normalized Haar .
These definitions implement Eqs. (4)–(6) literally and supply the registers for Lemma 2.1 and Theorem 3.1.
import Definitions.Def_RandomDimReduction_Channel_Moment
set_option autoImplicit false
noncomputable section
open Matrix MeasureTheory
open scoped Kronecker Matrix ComplexConjugate Matrix.Norms.Elementwise
namespace RandomDimReduction.Channel.Supplement
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Unnormalized maximally entangled vector, §2.1, p.5. -/
def gamma (a : Type) [DecidableEq a] : a × a → ℂ :=
fun ij => if ij.1 = ij.2 then 1 else 0
/-- The canonical regrouping (A ⊗ B)^n ≃ A^n ⊗ B^n. -/
def regroup {a b : Type} (n : ℕ) :
(Fin n → a × b) ≃ ((Fin n → a) × (Fin n → b)) where
toFun x := (fun t => (x t).1, fun t => (x t).2)
invFun x := fun t => (x.1 t, x.2 t)
left_inv _ := rfl
right_inv _ := rfl
/-- Reindex an operator into the grouped tensor registers. -/
def groupOperator {a b : Type} (n : ℕ) (X : Op (Fin n → a × b)) :
Op ((Fin n → a) × (Fin n → b)) :=
fun i j => X ((regroup n).symm i) ((regroup n).symm j)
/-- Unnormalized reference-first Choi operator; §2.1, p.6. -/
def choi {a b : Type} [DecidableEq a] (N : Op a → Op b) : Op (a × b) :=
fun i j => N (Matrix.single i.1 j.1 1) i.2 j.2
/-- Eq.(4): ordinary left multiplication, with neither transpose nor sandwich. -/
def purification (n k d : ℕ) (X : Op (Word n d)) : Op (Word n d × Word n k) :=
choi (reduction n k d) * (X ⊗ₖ (1 : Op (Word n k)))
/-- The permutation twirl of §3.1, p.8. -/
def permutationTwirl (n d : ℕ) (X : Op (Word n d)) : Op (Word n d) :=
((Nat.factorial n : ℂ)⁻¹) • ∑ p : Equiv.Perm (Fin n),
MixedCloning.Optimal.permMatrix n p * X * (MixedCloning.Optimal.permMatrix n p)ᴴ
/-- P^CP = P ∘ T_Sn, defined on the full operator algebra. -/
def purificationCP (n k d : ℕ) (X : Op (Word n d)) : Op (Word n d × Word n k) :=
purification n k d (permutationTwirl n d X)
/-- Eq.(5), with the full output dimension k^n d^n in the denominator. -/
def purificationCPTP (n k d : ℕ) (X : Op (Word n d)) : Op (Word n d × Word n k) :=
purificationCP n k d X +
((kernelProjector n k d * X).trace / ((k ^ n * d ^ n : ℕ) : ℂ)) • 1
/-- A unit vector with the specified data marginal, without selecting a purification. -/
def IsPurification {d k : ℕ} (rho : Op (Fin d))
(phi : EuclideanSpace ℂ (Fin d × Fin k)) : Prop :=
‖phi‖ = 1 ∧ WildeQIT.partialTraceRight (MixedCloning.Optimal.pure phi) = rho
/-- One Haar unitary on the purifying register, shared across all n copies; Eq.(6). -/
def randomPurificationAverage {d k : ℕ} (n : ℕ)
(phi : EuclideanSpace ℂ (Fin d × Fin k)) : Op (Word n d × Word n k) :=
∫ V : Matrix.unitaryGroup (Fin k) ℂ,
groupOperator n (tensor n
(((1 : Op (Fin d)) ⊗ₖ (V : Op (Fin k))) *
MixedCloning.Optimal.pure phi *
(((1 : Op (Fin d)) ⊗ₖ (V : Op (Fin k))))ᴴ))
∂MixedCloning.Optimal.haar k
end RandomDimReduction.Channel.Supplement