Theorem 2: classification of pure-state-preserving channels
ProvedQAlgorithms.Papers.Independent.Support50.P01.pureStatePreserving_classificationLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. Suppose every unit vector has output equal to the projector onto some unit vector of . Then at least one of the following alternatives holds:
Here is the unnormalized Choi matrix. The alternatives need not be exclusive when the input dimension is one.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF p.12, Theorem 2: exhaustive, nonexclusive classification of pure-state-preserving channels. -/
theorem pureStatePreserving_classification (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : Uᴴ * U = 1)
(hpure : ∀ psi : EuclideanSpace ℂ (Fin a), ‖psi‖ = 1 →
∃ phi : EuclideanSpace ℂ (Fin b), ‖phi‖ = 1 ∧
receiverChannel U (pureDensity psi) = pureDensity phi) :
(a≤b ∧ (∃ V : Matrix (Fin b) (Fin a) ℂ, Vᴴ * V = 1 ∧
∀ X, receiverChannel U X = V * X * Vᴴ) ∧
(outputFirstChoi (receiverChannel U)).rank = 1 ∧ ConjugateDegradable U) ∨
(∃ phi : EuclideanSpace ℂ (Fin b), ‖phi‖ = 1 ∧
(∀ X, receiverChannel U X = X.trace • pureDensity phi) ∧ ConjugateAntidegradable U) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers, and let satisfy . Write and . Suppose that for every unit vector , there exists a unit vector such that , where . Then at least one of the following alternatives holds:
or there is a unit vector such that for every , and there exists satisfying for every . Here is the matrix indexed by with entries , each map must have a finite Kraus representation with on its input space, and denotes ordinary transpose. All identities quantified over concern arbitrary complex matrices. The alternatives are joined by an inclusive “or.”
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.