Theorem 1
ProvedQAlgorithms.Papers.Independent.Gap20.P19.pureOutputDichotomyAll Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.
Let map every normalized pure state to a pure state. Then either
and is degradable; or there is a fixed unit vector with for every operator , and is antidegradable. The alternatives need not be disjoint when .
This identifies all pure-state-preserving channels.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P19
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker
open Filter Topology
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
maximumCoherentInformation dilationPower)
open QAlgorithms.Papers.Independent.Claimed50.P48
(MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)
open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)
open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P69 (choi)
open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E F R K A2 B2 E2 : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype E] [DecidableEq E] [Nonempty E]
variable [Fintype F] [DecidableEq F] [Nonempty F]
variable [Fintype R] [DecidableEq R] [Nonempty R]
variable [Fintype K] [DecidableEq K]
variable [Fintype A2] [DecidableEq A2] [Nonempty A2]
variable [Fintype B2] [DecidableEq B2] [Nonempty B2]
variable [Fintype E2] [DecidableEq E2] [Nonempty E2]
/-- Theorem 1, PDF pp.7–8. The fixed-pure-output alternative includes
one-dimensional input; no nonconstant-channel assumption is imposed. -/
theorem pureOutputDichotomy [Nonempty A] [Nonempty B]
(Phi : Superop A B) (hPhi : IsChannel Phi)
(hpure : ∀ psi : EuclideanSpace ℂ A, IsState psi → IsPure (Phi (pureDensity psi))) :
(Fintype.card A ≤ Fintype.card B ∧
(∃ U : Matrix B A ℂ, IsIsometry U ∧ Phi = conjSuperop U) ∧
(∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsDegradable witness) ∧ (choi Phi).rank = 1) ∨
(∃ phi : EuclideanSpace ℂ B, IsState phi ∧
(∀ rho, Phi rho = rho.trace • pureDensity phi) ∧ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsAntidegradable witness)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite index types with decidable equality, and let be a function from complex matrices to complex matrices that is a channel: there exist finitely many matrices with and for every matrix . Suppose that for every vector of Euclidean norm one, equals for some norm-one vector . Then at least one of the following alternatives holds: either , there exists with and for all , there exist a natural number and a matrix with , for all , and a channel from to the environment satisfying for all , and the Choi matrix with entries has rank one; or there exists a norm-one vector such that for every matrix , together with a natural number , an isometry realizing by tracing out its environment, and a channel from that environment to satisfying for every . Here every asserted channel has a finite Kraus representation with the same completeness condition above; the two alternatives are not asserted to be mutually exclusive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.