Normalized Choi affine correspondence
OpenQAlgorithms.Papers.Independent.Intakenext100.P18.choi_affineLet , let , where , and let a channel mean a completely positive trace-preserving complex-linear map on matrices. The computed reference-first Choi map and its inverse are
They are inverse bijections between channels and positive trace-one operators with output partial trace . The map preserves every convex combination, so this is an affine correspondence.
This identifies channels with normalized bipartite states having the specified first marginal. It does not assert physical recovery of an arbitrary channel by teleportation.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P18
noncomputable section
open QAlgorithms MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Intakenext100.P18
open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)
open QAlgorithms.Papers.Independent.Support50.P11 (choiState teleportWeyl bellKet)
open QAlgorithms.Papers.Independent.Renew46.P40 (initialJoint)
/-- PDF pp.3--4, (2)--(9): the actual normalized Choi map is an affine
bijection with the displayed computed inverse. The first marginal is I/d.
No claim of physical channel recovery by teleportation is part of this result. -/
theorem choi_affine (d : ℕ) (hd : 0 < d) :
(∀ E : Superop (Fin d) (Fin d), IsChannel E →
IsDensityMatrix (choiState E) ∧
traceRight (choiState E) = ((1 / (d : ℝ) : ℝ) : ℂ) • 1 ∧
choiInverse d (choiState E) = E) ∧
(∀ rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ,
IsDensityMatrix rho → traceRight rho = ((1 / (d : ℝ) : ℝ) : ℂ) • 1 →
IsChannel (choiInverse d rho) ∧ choiState (choiInverse d rho) = rho) ∧
(∀ E G : Superop (Fin d) (Fin d), IsChannel E → IsChannel G →
∀ t : ℝ, 0 ≤ t → t ≤ 1 →
choiState (fun X => (t : ℂ) • E X + ((1 - t : ℝ) : ℂ) • G X) =
(t : ℂ) • choiState E + ((1 - t : ℝ) : ℂ) • choiState G) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P18
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , write for the matrix units on , and define, for any map from complex matrices to themselves,
A channel here means a map admitting a finite Kraus representation for every matrix , with ; a density matrix means a positive semidefinite matrix of trace . Every such channel satisfies that is a density matrix, its partial trace over the second factor is , and . Conversely, every density matrix on whose partial trace over the second factor is satisfies that is a channel and . Moreover, for every pair of channels and every real , including both endpoints,
The quantification includes and excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.