A later block has positive coherent information
OpenQAlgorithms.Papers.Independent.Intakenext100.P70.positiveLaterBlockLet and . There exist positive integers , an integer , and a weight that can be chosen with
Construct from the normalized Choi state (S18), and from the measured, retained switch (S15), with whole-register erasure flags as defined on pp.5–6. These choices satisfy the PPT condition
so is PPT-binding; is completely positive and trace preserving. They also give
where the rate divides the maximum coherent information over all joint density inputs by and is measured in bits.
This existential construction makes the finite-block obstruction compatible with positive capacity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P70
namespace QAlgorithms.Papers.Independent.Intakenext100.P70
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P22
(Op coherentInformation singleUseInformation quantumCapacity mixed)
/-- Supplementary Lemma 4, PDF pp.9--10: choose actual S18 parameters satisfying S19
and giving positive optimized coherent information at N+1 uses. The witness choices
q=1/3, d=2*N*r and integer r are the choices used by the proof. -/
theorem positiveLaterBlock (p kappa : ℝ) (hp0 : 0 < p) (hp1 : p < 1)
(hk0 : 0 < kappa) (hk1 : kappa < 1 / 2) :
∃ P : CubittParameters, CubittValid P ∧ P.q = 1 / 3 ∧ P.r = cubittRepetitions P.m ∧
P.d = 2 * P.N * P.r ∧ CubittPPTCondition P ∧ CubittPPTBinding (cubittGammaChannel P) ∧
IsChannel (cubittPaperChannel P kappa p) ∧
0 < cubittBlockInformation (cubittPaperChannel P kappa p) (P.N + 1) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P70
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real numbers with and , there exist natural numbers and a real number such that
and
The maps asserted to have the properties below are defined as follows. Set , , , and . On pairs of -valued indices put
For , define
Define on , with row and column , by
where every factor uses , and put
For any real , define on to have false diagonal block , true diagonal block , and zero off-diagonal blocks. Define on input by setting its off-diagonal switch blocks to zero, applying to the true input block and to the false input block, and retaining the switch label in the output . Then is a channel and its normalized Choi matrix has positive semidefinite output partial transpose: explicitly, for a finite family satisfying , and the matrix with entries
is positive semidefinite. The map is also a channel, meaning that it has a finite Kraus representation satisfying the same trace-preserving identity. Finally, for any map , define
The functional calculus defines the square root and entropy; the identity tensor map applies blockwise on the second register, and applies independently to all coordinates, as determined by expansion in matrix units. The asserted strict positivity is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.