§8: persistence of the strict gap for nearby mixtures
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.pauli_gap_neighborhoodLet sum to one, with
In output:environment order on , put
Write for , , and , where and . Entanglement is measured across the two displayed parties.
Define
Assume the strict condition .
There is , depending on these fixed weights, such that
This is persistence of the strict gap along the one-parameter mixture line named in the source.
Here is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. is the asymptotic EPR preparation rate under deterministic two-way LOCC, and is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
namespace QAlgorithms.Papers.Independent.Intakenext100.P60
open scoped Matrix ComplexConjugate ComplexOrder TensorProduct
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)
open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)
open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)
/-- PDF p.15: continuity gives a neighborhood within the explicitly named mixture
line, not within the full state space. The preceding strict condition (20) is retained. -/
theorem pauli_gap_neighborhood (p : Fin 4 → ℝ) (hp : PauliAdmissible p)
(hgap : GapCriterion p) :
∃ delta > (0 : ℝ), ∀ s ∈ Set.Icc (0 : ℝ) 1, |s - 1 / 2| < delta →
twoWayDistillable (pauliMixture p s) ≤
Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p s))) ∧
Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p s))) <
formationCostBits (pauliMixture p s) ∧
formationCostBits (pauliMixture p s) = binEntropy2 (p 0 + p 3) ∧
twoWayDistillable (pauliMixture p s) < formationCostBits (pauliMixture p s) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let satisfy
Set , and assume the strict polynomial inequality
Define
on . For matrices, use and . Here denotes the real infimum of real for which every admits integers and a finite local protocol with
Each local basis is first relabelled by its fixed equivalence to an initial segment of natural numbers; is the grouped -fold tensor power with the fixed relabellings to local dimensions , and is the similarly grouped -fold tensor power of the projector onto , with . A finite local protocol is generated recursively from identities by local Kraus operations satisfying , outcome-dependent finite continuations, and summation of their outputs. The infimum allows every real , without an explicit nonnegativity condition. Also, is the real supremum of all such that, for every , all sufficiently large positive integers admit and such a protocol satisfying
There exists a real such that every with satisfies
The weights need not be strictly positive, and the quantified interval for includes either endpoint whenever it satisfies the stated strict distance condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.