Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Collective-input mixture bound (5)

Proved
QAlgorithms.Papers.Independent.Support50.P22.collectiveMixture

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

prove2quantum

Let d≥1d\ge1d≥1, n≥0n\ge0n≥0, and K≅HK\cong HK≅H. Let EEE be a finite-dimensional classical-output CPTP QKD map with variable key length and complete public transcript, and let F=S∘EF=S\circ EF=S∘E be its length- and transcript-preserving ideal key replacement. Let ϵˉ≥0\bar\epsilon\ge0ϵˉ≥0. Suppose that for every normalized pure density σHK\sigma_{HK}σHK​,

∥((E−F)⊗id⁡Kn)(σHK⊗n)∥1≤ϵˉ.\|((E-F)\otimes\operatorname{id}_{K^n})(\sigma_{HK}^{\otimes n})\|_1\le\bar\epsilon.∥((E−F)⊗idKn​)(σHK⊗n​)∥1​≤ϵˉ.

Then the maximum over these pure states is attained and, for the mixed Haar extension τHnKn\tau_{H^nK^n}τHnKn​,

∥((E−F)⊗id⁡Kn)(τHnKn)∥1≤max⁡σHK pure∥((E−F)⊗id⁡Kn)(σHK⊗n)∥1≤ϵˉ.\|((E-F)\otimes\operatorname{id}_{K^n})(\tau_{H^nK^n})\|_1 \le\max_{\sigma_{HK}\ \mathrm{pure}} \|((E-F)\otimes\operatorname{id}_{K^n})(\sigma_{HK}^{\otimes n})\|_1 \le\bar\epsilon.∥((E−F)⊗idKn​)(τHnKn​)∥1​≤σHK​ puremax​∥((E−F)⊗idKn​)(σHK⊗n​)∥1​≤ϵˉ.

The maximum ranges over all unit vectors modulo the irrelevant phase of their densities. This transfers the collective-input bound to the mixed extension while retaining the adversary's KnK^nKn register.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P22
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Support50.P22

attribute [local instance] Classical.decEq Classical.propDecidable

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Information100.P69 (diamond)

open QAlgorithms.Papers.Independent.Dependency50.P18 (ClassicalOutput)

attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixMeasurableSpace

attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixBorelSpace

/-- Collective-input mixture bound, equation (5), PDF p.3. A maximizing pure
state is attained and dominates EVERY pure input, retaining the entire max
chain without an empty or unbounded real supremum. This input is the mixed
Haar extension, not its purification with an additional N. -/
theorem collectiveMixture (n d : ℕ) (hd : 0 < d)
    {L C : Type} [Fintype L] [DecidableEq L] [Nonempty L]
    [Fintype C] [DecidableEq C] [Nonempty C]
    (len : L → ℕ)
    (E : Matrix (Copies (Fin d) n) (Copies (Fin d) n) ℂ →ₗ[ℂ]
      Matrix (KeyOut L C len) (KeyOut L C len) ℂ)
    (hE : IsChannel E) (hclass : ClassicalOutput E)
    (epsilonBar : ℝ) (hepsilon : 0 ≤ epsilonBar)
    (hcollective : ∀ phi : EuclideanSpace ℂ (Fin d × Fin d), IsState phi →
      traceNorm (tensorId (E - idealProtocol len E)
        (pairedPower n d (pureDensity phi))) ≤ epsilonBar) :
    ∃ phiMax : EuclideanSpace ℂ (Fin d × Fin d), IsState phiMax ∧
      (∀ phi : EuclideanSpace ℂ (Fin d × Fin d), IsState phi →
        traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phi))) ≤
        traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax)))) ∧
      traceNorm (tensorId (E - idealProtocol len E) (tauPair n d hd)) ≤
        traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax))) ∧
      traceNorm (tensorId (E - idealProtocol len E) (pairedPower n d (pureDensity phiMax))) ≤
        epsilonBar := by sorry

end QAlgorithms.Papers.Independent.Support50.P22

end
Source
Post-selection technique for quantum channels with applications to quantum cryptography, arXiv:0809.3019v1, PDF p. 3, Unnumbered collective-input mixture bound, equation (5)
Read-back

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

Let n,d∈Nn,d\in\mathbb Nn,d∈N with d>0d>0d>0, let L,CL,CL,C be finite nonempty types with decidable equality, and fix ℓ:L→N\ell:L\to\mathbb Nℓ:L→N. Put Hn={0,…,d−1}{0,…,n−1}H_n=\{0,\ldots,d-1\}^{\{0,\ldots,n-1\}}Hn​={0,…,d−1}{0,…,n−1} and let ZZZ consist of (l,((s,t),c))(l,((s,t),c))(l,((s,t),c)), where s,t∈{0,1}ℓ(l)s,t\in\{0,1\}^{\ell(l)}s,t∈{0,1}ℓ(l). Let EEE be a complex linear channel from matrices on HnH_nHn​ to matrices on ZZZ, and assume its output is diagonal for every input matrix. A channel here has a finite Kraus expression E(X)=∑jKjXKj†E(X)=\sum_jK_jXK_j^\daggerE(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Define EidealE_{\mathrm{ideal}}Eideal​ by discarding all output off-diagonal entries and, at fixed l,cl,cl,c, assigning each equal key pair s=ts=ts=t the diagonal value 2−ℓ(l)∑u,vE(X)(l,((u,v),c)),(l,((u,v),c))2^{-\ell(l)}\sum_{u,v}E(X)_{(l,((u,v),c)),(l,((u,v),c))}2−ℓ(l)∑u,v​E(X)(l,((u,v),c)),(l,((u,v),c))​, with zero on unequal keys. For ϕ∈Cd×d\phi\in\mathbb C^{d\times d}ϕ∈Cd×d, define the matrix

Ωϕ((x,r),(y,s))=∏i=0n−1ϕ(xi,ri)ϕ(yi,si)‾\Omega_\phi((x,r),(y,s)) =\prod_{i=0}^{n-1}\phi(x_i,r_i)\overline{\phi(y_i,s_i)}Ωϕ​((x,r),(y,s))=i=0∏n−1​ϕ(xi​,ri​)ϕ(yi​,si​)​

on Hn×HnH_n\times H_nHn​×Hn​, and let Ω‾=∫Ωϕ dνd(ϕ)\overline\Omega=\int\Omega_\phi\,d\nu_d(\phi)Ω=∫Ωϕ​dνd​(ϕ), where νd\nu_dνd​ is the law obtained by reshaping Ve0Ve_0Ve0​, for a Haar-distributed unitary VVV on Cd2\mathbb C^{d^2}Cd2, into a d×dd\times dd×d array. Write

F(ϕ)=∥((E−Eideal)⊗id⁡Hn)(Ωϕ)∥1,∥X∥1=Re⁡Tr⁡X†X,F(\phi)=\|((E-E_{\mathrm{ideal}})\otimes\operatorname{id}_{H_n})(\Omega_\phi)\|_1, \qquad \|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X},F(ϕ)=∥((E−Eideal​)⊗idHn​​)(Ωϕ​)∥1​,∥X∥1​=ReTrX†X​,

where the tensor extension applies the map to the first-register matrix in every fixed second-register block. For a real ϵˉ≥0\bar\epsilon\ge0ϵˉ≥0, assume F(ϕ)≤ϵˉF(\phi)\le\bar\epsilonF(ϕ)≤ϵˉ for every ϕ\phiϕ with ∥ϕ∥=1\|\phi\|=1∥ϕ∥=1. Then there exists a vector ϕmax⁡\phi_{\max}ϕmax​ with ∥ϕmax⁡∥=1\|\phi_{\max}\|=1∥ϕmax​∥=1 such that every unit vector ϕ\phiϕ satisfies F(ϕ)≤F(ϕmax⁡)F(\phi)\le F(\phi_{\max})F(ϕ)≤F(ϕmax​), and

∥((E−Eideal)⊗id⁡Hn)(Ω‾)∥1≤F(ϕmax⁡)≤ϵˉ.\|((E-E_{\mathrm{ideal}})\otimes\operatorname{id}_{H_n})(\overline\Omega)\|_1 \le F(\phi_{\max})\le\bar\epsilon.∥((E−Eideal​)⊗idHn​​)(Ω)∥1​≤F(ϕmax​)≤ϵˉ.

The statement includes n=0n=0n=0, when the products defining Ωϕ\Omega_\phiΩϕ​ are empty products equal to 111; key lengths may also be zero.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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