Theorem 6(i): rank-two qubit EB/conjugate-antidegradable equivalence
OpenQAlgorithms.Papers.Independent.Support50.P01.rankTwo_qubit_equivalenceLet , , 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 and . Then
Singular channels are included; the inverse-channel expressions in the proof are not additional hypotheses. The separate printed mutual-exclusion claim is not asserted.
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 pp.14–15, Theorem 6(i): no inverse-channel hypothesis is imposed.
Part (ii) is separately deferred because complete dephasing refutes it. -/
theorem rankTwo_qubit_equivalence {e : ℕ} (he : 0<e)
(U : Matrix (Fin 2 × Fin e) (Fin 2) ℂ) (hU : Uᴴ * U = 1)
(hrank : (outputFirstChoi (receiverChannel U)).rank = 2) :
EntanglementBreaking (by decide) (by decide) (receiverChannel U) ↔ 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 a natural number and satisfy . Define maps on all complex matrices by and ; explicitly, these partial traces sum respectively the entries over , and over . Assume the matrix indexed by , with entry , has rank exactly , where is the matrix unit. Then the following are equivalent: for every unit vector , the matrix is a finite convex combination , where , , and every is positive semidefinite with trace ; and there exist finitely many matrices satisfying such that, for every complex matrix , . Here applies separately to each block indexed by the first register, and denotes ordinary transpose without conjugation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.