The first shield share is close to a perfect private bit
OpenQAlgorithms.Papers.Independent.Intakenext100.P70.firstShareApproximationLet and be integers. Set and , and construct the normalized state in (S18) on the qubit key and the shield shares. Write
There is a perfect private bit such that
Here is the full trace norm. A perfect private bit is a normalized state obtained by applying a key-controlled twisting unitary to a Bell pair on tensored with an arbitrary shield density matrix.
This approximation concerns the computed first-share marginal and does not require the PPT condition (S19).
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 2, PDF pp.7--8: the S20 first-share marginal is close to a perfect
private bit. No PPT hypothesis is needed. The proof covers m>5 quantitatively; for positive
m<=5 its stated bound exceeds 2, the universal full trace-distance bound. -/
theorem firstShareApproximation (N m d : ℕ) (hN : 0 < N) (hm : 0 < m) (hd : 2 ≤ d) :
let P := cubittApproximationParameters N m d
∃ rho : Op ((Bool × CubittShare P.r P.m P.d) × (Bool × CubittShare P.r P.m P.d)),
CubittPerfectPbit rho ∧ traceNorm (cubittFirstShareState P hN - rho) ≤ cubittApproximationBound m := 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 all natural numbers with , , and , set , , , and ; thus the parameter tuple is . Define matrices on pairs of -valued indices by
For and , define
Let be the matrix on whose entry with row and column is
where all factors use . For and an array on the indices other than , let have value at and agree with elsewhere, and define
Then there exists a positive semidefinite, trace-one matrix on , together with a positive semidefinite, trace-one matrix on and unitaries on for every pair of Booleans, such that
When , each sum over arrays on the remaining indices has exactly one term.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.