Corrected parameterized main theorem
OpenQAlgorithms.Papers.Independent.Intakenext100.P70.mainTheoremLet be an integer, , and
There exist positive integers , an integer , and a weight with the following properties. Let be qubits, let every and have dimension , and group the shield into shares with factors per share. Define from the normalized Choi state in (S18), and define the retained, measured switch channel
Here erases the entire main register with probability , replacing it by its maximally mixed state and outputting a separate binary flag. The parameters satisfy (S19), is PPT-binding, and is completely positive and trace preserving. With the all-density-input optimization and bit-valued rates defined above,
This gives the constructive family behind the undetectability result.
Source correction. The printed endpoint is excluded, as required by the intersection of parameter ranges in the source's proof.
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)
/-- Methods Theorem, PDF p.3; repeated Supplementary Theorem, p.11.
SOURCE CORRECTION: the printed interval ends at p=1; here p<1, precisely the
intersection of Lemmas 3 and 4 used in its proof. At p=1 every branch is PPT-binding,
so the printed positive-capacity endpoint is false. Gamma is computed from S18. -/
theorem mainTheorem (n : ℕ) (hn : 0 < n) (kappa p : ℝ)
(hk0 : 0 < kappa) (hk1 : kappa < 1 / 2)
(hp0 : cubittErasureThreshold n kappa ≤ p) (hp1 : p < 1) :
∃ P : CubittParameters, CubittValid P ∧ CubittPPTCondition P ∧ CubittPPTBinding (cubittGammaChannel P) ∧
IsChannel (cubittPaperChannel P kappa p) ∧
cubittBlockInformation (cubittPaperChannel P kappa p) n = 0 ∧
0 < cubittBlockInformation (cubittPaperChannel P kappa p) (P.N + 1) ∧
0 < quantumCapacity (cubittPaperChannel P kappa p) := 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 natural number and real numbers satisfying
there exists a record with natural numbers and real such that
To specify the maps appearing in the conclusion, put , , and . For , set
For , let be the product over of the entries of at the row and column , and let be the corresponding product of entries of . Define a matrix on by taking its entry at row and column to be times
Set
For a real , define the whole-erasure map on matrices over by
The paper map , from matrices over to matrices over , discards off-diagonal switch blocks and applies to the true switch block and to the false switch block, retaining the switch value. The conclusions are that both and have finite Kraus representations with , that the output partial transpose of the normalized Choi matrix of is positive semidefinite, and that
Explicitly, the normalized Choi matrix is , and its output partial transpose has entries . For any finite-dimensional channel ,
Here , the identity extension applies the map to each block with fixed reference indices, and the tensor map sends to the matrix with entries . Entropy is , where is applied by continuous functional calculus.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.