§8, equation (20): a polynomial criterion for the formation–distillation gap
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.pauli_gap_criterionLet sum to one, with
In output:environment order on , put
Write for , , and , where and . Entanglement is measured across the two displayed parties.
Define
Writing for partial transpose on the output qubit and for trace norm, the source's criterion is the equivalence
For every admissible distribution, . Consequently, whenever the polynomial condition holds,
The log-negativity bound is the cited input [34]. This criterion includes closed-simplex boundaries and does not assume the source's overbroad auxiliary negative-root claim.
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 pp.14--15, (20): the polynomial condition is equivalent to the strict
log-negativity--cost inequality on the closed simplex. The upper bound on ordinary
distillation is credited to [34], and gives the strict gap when the condition holds.
No universal negative-root assertion is assumed, including at zero weights. -/
theorem pauli_gap_criterion (p : Fin 4 → ℝ) (hp : PauliAdmissible p) :
(Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p (1 / 2)))) <
formationCostBits (pauliMixture p (1 / 2)) ↔ GapCriterion p) ∧
twoWayDistillable (pauliMixture p (1 / 2)) ≤
Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p (1 / 2)))) ∧
(GapCriterion p → twoWayDistillable (pauliMixture p (1 / 2)) <
formationCostBits (pauliMixture p (1 / 2))) := 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 be real numbers satisfying
On , with computational basis , put
For a bipartite matrix , write , and write . Let be the following formation cost: first relabel each local computational basis by the fixed equivalence with the initial segment of natural numbers of the same cardinality, and then take the real infimum of all real such that, for every , there exist integers and a finite local protocol satisfying
Here is the -fold tensor power of the projector onto , is the -fold tensor power with the two parties grouped and relabelled by the fixed equivalences to dimensions , and a finite local protocol is recursively built from identity maps and local Kraus operations satisfying , with an outcome-dependent finite continuation and the branch outputs summed. The case supplies the scalar state ; the infimum defining does not explicitly restrict to be nonnegative. Let be the real supremum of all such that, for every , there is such that every integer with admits an integer and such a finite local protocol with
Define and
The declaration asserts all three statements
Zero entries of are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.