§A.2: channel outputs recovered by contracting the Choi operator
ProvedQAlgorithms.Papers.Independent.Support50.P41.choiRelativeOutputLet be a complex-linear CPTP map on dimension , and let be a unit vector. Form the unnormalized input-first Choi operator , where . If in the paired reference basis, then
This recovers channel output from the Choi operator without a missing factor of .
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.32--33: pure-state output by contraction of the unnormalized input-first Choi operator. -/
theorem choiRelativeOutput {d : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace)
(v : EuclideanSpace ℂ (Fin d)) (hv : IsState v) :
Phi (pureDensity v) = relativeOperator (indexState v) (choi Phi) := 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 positive integer , let be complex-linear and completely positive in the explicit sense that, for every natural number , including , applying to each block of any positive semidefinite matrix indexed by produces a positive semidefinite matrix; assume also that for every matrix . For every with , define , define , where has its sole nonzero entry in position , and define . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.