Zero optimized coherent information at n uses
OpenQAlgorithms.Papers.Independent.Intakenext100.P70.zeroAtNLet the main input and output be equal positive finite-dimensional registers in fixed computational bases, and let be a completely positive trace-preserving PPT-binding channel between them, meaning that its Choi matrix has positive partial transpose on the output. Let , , and
Define exactly as in (S15): the retained binary switch chooses between and , with erasure of the entire main register and a separate flag. Then
The maximum is over all joint density inputs, including entangled inputs and coherent switch inputs. The endpoint is included in this lemma; when the hypothesis forces .
The result supplies the finite-block obstruction independently of the special Choi-state construction.
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 3, PDF pp.8--9, S40--S43: the exact optimized coherent information
of n uses is zero, for any finite equal-port PPT-binding Gamma. Here the closed p=1 endpoint
is valid; kappa=0 forces p=1. All entangled n-use inputs are included. -/
theorem zeroAtN {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(Gamma : Superop I I) (hGamma : CubittPPTBinding Gamma)
(n : ℕ) (hn : 0 < n) (kappa p : ℝ)
(hk0 : 0 ≤ kappa) (hk1 : kappa ≤ 1)
(hp0 : cubittErasureThreshold n kappa ≤ p) (hp1 : p ≤ 1) :
cubittBlockInformation (cubittNoisySwitch Gamma kappa p) n = 0 := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P70
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any nonempty finite type equipped with decidable equality, write , and let be a function from complex matrices to complex matrices. Assume that has a finite Kraus representation: for some natural number and matrices ,
Also assume that the matrix
has positive semidefinite output partial transpose, meaning that the matrix with entry at row , column , is positive semidefinite. For every natural number and real numbers satisfying
define a map from matrices on to matrices on by
and define , from matrices on to matrices on , by discarding off-diagonal switch blocks and applying to the true block and to the false block: if , then
For a matrix , put , using continuous functional calculus. For every positive semidefinite, trace-one matrix on the input of a map , define and
Here applies to each block indexed by the unchanged reference coordinates, and is the tensor map obtained by applying independently in each coordinate, equivalently by expanding the input in matrix units and tensoring their images. The conclusion is the exact equality
The case is excluded; the permitted endpoint forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.