Theorem 5
OpenQAlgorithms.Papers.Independent.Gap20.P19.rankTwoQubitClassificationAll 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.
Write , where and . These normalized operators give the Bloch map (85); they correct the transposition in printed (39).
For a qubit channel with ,
where means independent unitary conjugations on input and output. Moreover, every with is antidegradable.
This gives the rank-two classification, including the equality boundary.
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 5, PDF p.14, with (39) corrected to the CPTP map (85).
Rank two is explicit; the antidegradability clause includes equality. -/
theorem rankTwoQubitClassification (Phi : Superop Bool Bool)
(hPhi : IsChannel Phi) (hrank : (choi Phi).rank = 2) :
((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsDegradable witness) ↔ ∃ u v : ℝ, |Real.sin v| ≤ |Real.cos u| ∧
RectangularUnitaryConjugate Phi (rankTwoQubitMap u v)) ∧
(∀ u v : ℝ, |Real.cos u| ≤ |Real.sin v| → (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (rankTwoQubitMap u v) ∧ 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 a map on complex matrices indexed by , admitting a finite Kraus representation with , and assume its Choi matrix has rank ; here the Choi matrix has entries . For real , define , where, in the order ,
The statement asserts both of the following: there exist a natural number , an isometry , and a finite Kraus channel from the receiver to the environment such that and for every matrix , if and only if there exist real and qubit unitaries such that and for every ; and, for every real satisfying , there exist a natural number , an isometry with receiver map , and a finite Kraus channel from the environment to the receiver satisfying for every . A finite Kraus channel means a map with . Both inequalities are non-strict, and neither conclusion requires its witnessing dilation to be minimal.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.