Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every exact nontrivial private state has positive GHZ distillable entanglement

Open
QAlgorithms.Papers.Independent.Gap48.P42.exact_private_states_distillable

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let there be N≥2N\ge2N≥2 parties, a key dimension d≥2d\ge2d≥2, and positive finite local shield dimensions s1,…,sNs_1,\ldots,s_Ns1​,…,sN​. Let ρ\rhoρ be any positive semidefinite trace-one operator on the joint shield, and let U0,…,Ud−1U_0,\ldots,U_{d-1}U0​,…,Ud−1​ be arbitrary unitaries on that whole shield. Party kkk owns its key and shield registers. The exact private state is

Γ=1d∑i,j=0d−1∣i,…,i⟩⟨j,…,j∣⊗UiρUj†.\Gamma=\frac1d\sum_{i,j=0}^{d-1}|i,\ldots,i\rangle\langle j,\ldots,j|\otimes U_i\rho U_j^\dagger.Γ=d1​i,j=0∑d−1​∣i,…,i⟩⟨j,…,j∣⊗Ui​ρUj†​.

Here EDE_DED​ is the supremum of nonnegative asymptotic rates of NNN-party qubit GHZ states obtained by trace-preserving adaptive LOCC, with full trace-norm error tending to zero and rate measured per input copy. Local ancillary systems, disposal and unrestricted two-way classical communication are allowed. The output used to define the rate includes all outcomes.

Then

ED(Γ)>0.E_D(\Gamma)>0.ED​(Γ)>0.

For two parties the target is a Bell pair. This conclusion concerns each fixed exact finite private state; it makes no assertion about approximate private states with growing shields.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
Formal statement
namespace QAlgorithms.Papers.Independent.Gap48.P42

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.1 abstract and II.A--B, pp.2--3: every exact finite private state
with at least two parties and key dimension at least two has strictly positive
asymptotic GHZ distillable entanglement. No approximate-private-state extension. -/
theorem exact_private_states_distillable {N d : ℕ} (hN : 2 ≤ N) (hd : 2 ≤ d)
    (S : Fin N → ℕ) (hS : ∀ k, 0 < S k)
    (rho : Matrix (PartyBasis S) (PartyBasis S) ℂ) (hrho : IsDensityMatrix rho)
    (U : Fin d → Matrix.unitaryGroup (PartyBasis S) ℂ) :
    0 < distillableGHZ (fun k => d * S k) (indexedPrivateDit rho U) := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P42
Source
Quantum states representing perfectly secure bits are always distillable, arXiv:quant-ph/0602176v2, PDF p. 1, Abstract; II.A–B
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every N,d∈NN,d\in\mathbb NN,d∈N with N≥2N\ge2N≥2 and d≥2d\ge2d≥2, every family of positive local dimensions SkS_kSk​ for k<Nk<Nk<N, every positive semidefinite matrix ρ\rhoρ of trace one on BS=∏k<NFin⁡(Sk)\mathcal B_S=\prod_{k<N}\operatorname{Fin}(S_k)BS​=∏k<N​Fin(Sk​), and every family of unitaries UαU_\alphaUα​ on that space for α<d\alpha<dα<d, the following extended nonnegative real supremum is strictly positive. Form a matrix Γ\GammaΓ on local dimensions dSkdS_kdSk​ by identifying each local index with (rk,zk)∈Fin⁡(d)×Fin⁡(Sk)(r_k,z_k)\in\operatorname{Fin}(d)\times\operatorname{Fin}(S_k)(rk​,zk​)∈Fin(d)×Fin(Sk​) through a chosen finite-cardinality equivalence and setting

Γ(r,z),(s,w)=1d∑α,β<d1∀k, rk=α, sk=β (UαρUβ†)z,w.\Gamma_{(r,z),(s,w)} =\frac1d\sum_{\alpha,\beta<d} \mathbf1_{\forall k,\ r_k=\alpha,\ s_k=\beta}\, (U_\alpha\rho U_\beta^\dagger)_{z,w}.Γ(r,z),(s,w)​=d1​α,β<d∑​1∀k, rk​=α, sk​=β​(Uα​ρUβ†​)z,w​.

Take the supremum of max⁡(r,0)\max(r,0)max(r,0) over real r≥0r\ge0r≥0 such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, there exists n0∈Nn_0\in\mathbb Nn0​∈N for which every n≥n0n\ge n_0n≥n0​ with n>0n>0n>0 admits m∈Nm\in\mathbb Nm∈N and a density matrix σ\sigmaσ on local dimensions 2m2^m2m, deterministically obtainable from Γ⊗n\Gamma^{\otimes n}Γ⊗n, with ∥σ−GHZN⊗m∥1≤ε\|\sigma-\mathrm{GHZ}_N^{\otimes m}\|_1\le\varepsilon∥σ−GHZN⊗m​∥1​≤ε and r−δ≤m/nr-\delta\le m/nr−δ≤m/n. Here GHZN=vv†\mathrm{GHZ}_N=vv^\daggerGHZN​=vv†, v(x)=2−1/2(1∀k,xk=0+1∀k,xk=1)v(x)=2^{-1/2}(\mathbf1_{\forall k,x_k=0}+\mathbf1_{\forall k,x_k=1})v(x)=2−1/2(1∀k,xk​=0​+1∀k,xk​=1​), tensor powers are regrouped at each party through chosen finite-cardinality equivalences, and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. Deterministic obtainability uses the relation generated by leaving a state unchanged, finite local Kraus instruments with completeness and branch equations pjρj=∑zAjzρAjz†p_j\rho_j=\sum_z A_{jz}\rho A_{jz}^\daggerpj​ρj​=∑z​Ajz​ρAjz†​, recursive outcome-dependent operations with multiplied probabilities, and forgetting an output list by taking its weighted mixture when its dimensions agree, ending with the single output (1,σ)(1,\sigma)(1,σ). All states in this relation have positive local dimensions and are density matrices. The number mmm may be zero; the conclusion asserts strict positivity of the supremum without specifying a positive numerical lower bound.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me