§A.4: unitary representations and purifications of the channel state
ProvedQAlgorithms.Papers.Independent.Support50.P41.dilationPurificationsLet be a complex-linear CPTP map on dimension , its unnormalized input-first Choi operator, and a nonzero finite environment. Applying any pure-environment unitary representation to normalized produces a unit vector with
Conversely, every such normalized purification and every unit initial environment vector admit a unitary representation whose output on is exactly . This supplies both constructions; the full unitary need not be unique on the unused orthogonal complement.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.35--36: both constructions between dilations and channel-state purifications, without full-unitary bijectivity. -/
theorem dilationPurifications {d e : ℕ} [NeZero d] [NeZero e]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
(∀ (U : Matrix.unitaryGroup (Fin d × Fin e) ℂ) (eta : EuclideanSpace ℂ (Fin e)),
IsState eta → (∀ X, Phi X = dilationChannel U eta X) →
IsState (dilationChoiVector U eta) ∧
traceRight (pureDensity (dilationChoiVector U eta)) = ((d : ℂ)⁻¹) • choi Phi) ∧
(∀ (v : EuclideanSpace ℂ ((Fin d × Fin d) × Fin e)), IsState v →
traceRight (pureDensity v) = ((d : ℂ)⁻¹) • choi Phi →
∀ eta : EuclideanSpace ℂ (Fin e), IsState eta →
∃ U : Matrix.unitaryGroup (Fin d × Fin e) ℂ,
(∀ X, Phi X = dilationChannel U eta X) ∧ dilationChoiVector U eta = v) := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive integers and every complex-linear map , assume that preserves trace on every complex matrix and is completely positive, meaning that applying it to each block preserves positive semidefiniteness for every finite ancillary dimension, including zero. Define . For a unitary matrix on and a vector , define
where and . Two assertions hold. First, for every such , if and for every complex matrix , then and
Second, for every vector of norm one satisfying this same marginal identity with in place of , and for every of norm one, there exists a unitary such that for every complex matrix and exactly. This second assertion is conditional on the existence of the stated vector in the specified environment dimension .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.