Theorem 4: input and Choi-rank bounds with qubit output
ProvedQAlgorithms.Papers.Independent.Support50.P01.qubitOutput_dimensionBoundsLet , , 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. If and the channel is conjugate degradable, then
The input dimension is not assumed to be two, and no bound is placed on an artificially padded environment.
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.13, Theorem 4: both Choi-rank and input-dimension bounds; input need not be a qubit. -/
theorem qubitOutput_dimensionBounds {e : ℕ} (ha : 0<a) (he : 0<e)
(U : Matrix (Fin 2 × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
(outputFirstChoi (receiverChannel U)).rank ≤ 2 ∧ a≤3 := 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 . Define and . Suppose and that there exists a finite Kraus map , with of size and , such that for every complex matrix , where is ordinary transpose. Then
where is indexed by output-input pairs and has entries . No equality between and this matrix rank is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.