Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section VI.B: protocol Pi is approximately oblivious

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.pi_approximately_oblivious

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let D≥1D\ge1D≥1 and 0<ε≤10<\varepsilon\le10<ε≤1. Protocol Π\PiΠ can be chosen with 1≤K≤(10/ε)2Dlog⁡2(20D/ε)1\le K\le(10/\varepsilon)^2D\log_2(20D/\varepsilon)1≤K≤(10/ε)2Dlog2​(20D/ε) good messages and modified by replacing its failure announcement uniformly with a good message. Denote its actual receiver output by ρψ\rho_\psiρψ​ and its full receiver record by Rψ\mathcal R_\psiRψ​, including message and pre-decoding quantum state. There is one fixed CPTP simulator

T(ρ)=1K∑k∣k⟩⟨k∣⊗Uk‾ρUk⊤T(\rho)=\frac1K\sum_k|k\rangle\langle k|\otimes\overline{U_k}\rho U_k^\topT(ρ)=K1​k∑​∣k⟩⟨k∣⊗Uk​​ρUk⊤​

such that, for every normalized pure target,

12∥ψ−ρψ∥1≤ε,12∥Rψ−T(ρψ)∥1≤ε.\tfrac12\|\psi-\rho_\psi\|_1\le\varepsilon,\qquad \tfrac12\|\mathcal R_\psi-T(\rho_\psi)\|_1\le\varepsilon.21​∥ψ−ρψ​∥1​≤ε,21​∥Rψ​−T(ρψ​)∥1​≤ε.

The unitaries, code, and simulator precede the target. The simulator consumes the actual approximate output, and Alice's private failure flag is not part of the receiver record. This is approximate preparation and approximate obliviousness in Definition 20.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal

open MeasureTheory ProbabilityTheory

namespace QAlgorithms.Papers.Independent.Intakenext100.P54

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)

/-- Section VI.B, PDF pp.12–13: Pi is approximate and approximately oblivious with
parameters (eps,eps). The simulator consumes the actual output, as Definition 20 requires. -/
theorem pi_approximately_oblivious (D : ℕ) (hD : 0 < D)
    (eps : ℝ) (heps : 0 < eps) (hepsOne : eps ≤ 1) :
    ∃ K : ℕ, 0 < K ∧ (K : ℝ) ≤ randomisingBound D eps ∧
      ∃ U : Fin K → Matrix.unitaryGroup (Fin D) ℂ,
        Randomising U eps ∧ IsChannel (piSimulator U) ∧ ∀ psi : RSPVector (Fin D),
          traceNorm (pureDensity psi.val - piApproxOutput U eps psi) / 2 ≤ eps ∧
          traceNorm (piRecord U eps psi - piSimulator U (piApproxOutput U eps psi)) / 2 ≤ eps := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 13, Section VI.B: protocol Pi is approximately oblivious
Read-back

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

For every positive natural number DDD and real 0<ε≤10<\varepsilon\le10<ε≤1, there exist a positive natural number KKK and unitary D×DD\times DD×D matrices (Uk)k<K(U_k)_{k<K}(Uk​)k<K​ such that

K≤(10/ε)2Dlog⁡2(20D/ε).K\le(10/\varepsilon)^2D\log_2(20D/\varepsilon).K≤(10/ε)2Dlog2​(20D/ε).

For every density matrix ρ\rhoρ—meaning ρ\rhoρ is positive semidefinite and Tr⁡ρ=1\operatorname{Tr}\rho=1Trρ=1—the matrix R(ρ)=K−1∑kUkρUk†\mathcal R(\rho)=K^{-1}\sum_kU_k\rho U_k^\daggerR(ρ)=K−1∑k​Uk​ρUk†​ satisfies

R(ρ)−1−εDID⪰0,1+εDID−R(ρ)⪰0.\mathcal R(\rho)-\frac{1-\varepsilon}{D}I_D\succeq0, \qquad \frac{1+\varepsilon}{D}I_D-\mathcal R(\rho)\succeq0.R(ρ)−D1−ε​ID​⪰0,D1+ε​ID​−R(ρ)⪰0.

Moreover, the map S\mathcal SS defined on all D×DD\times DD×D matrices by S(X)((k,u),(ℓ,v))=K−1(Uk‾XUkT)uv\mathcal S(X)((k,u),(\ell,v))=K^{-1}(\overline{U_k}XU_k^T)_{uv}S(X)((k,u),(ℓ,v))=K−1(Uk​​XUkT​)uv​ when k=ℓk=\ellk=ℓ, and 000 otherwise, admits a finite Kraus representation S(X)=∑hChXCh†\mathcal S(X)=\sum_hC_hXC_h^\daggerS(X)=∑h​Ch​XCh†​ with ∑hCh†Ch=ID\sum_hC_h^\dagger C_h=I_D∑h​Ch†​Ch​=ID​. For every unit vector ψ∈CD\psi\in\mathbb C^Dψ∈CD, define

Gk=DK(1+ε)Ukψψ†‾Uk†,F=ID−∑kGk,Rψ=⨁k<K(D−1GkT+(KD)−1FT),G_k=\frac{D}{K(1+\varepsilon)} U_k\overline{\psi\psi^\dagger}U_k^\dagger,\qquad F=I_D-\sum_kG_k,\qquad R_\psi=\bigoplus_{k<K}\left(D^{-1}G_k^T+(KD)^{-1}F^T\right),Gk​=K(1+ε)D​Uk​ψψ†​Uk†​,F=ID​−k∑​Gk​,Rψ​=k<K⨁​(D−1GkT​+(KD)−1FT), Aψ=∑k<KUkT(D−1GkT+(KD)−1FT)(UkT)†.A_\psi=\sum_{k<K}U_k^T \left(D^{-1}G_k^T+(KD)^{-1}F^T\right)(U_k^T)^\dagger.Aψ​=k<K∑​UkT​(D−1GkT​+(KD)−1FT)(UkT​)†.

Then

12∥ψψ†−Aψ∥1≤ε,12∥Rψ−S(Aψ)∥1≤ε,\frac12\|\psi\psi^\dagger-A_\psi\|_1\le\varepsilon, \qquad \frac12\|R_\psi-\mathcal S(A_\psi)\|_1\le\varepsilon,21​∥ψψ†−Aψ​∥1​≤ε,21​∥Rψ​−S(Aψ​)∥1​≤ε,

where ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​, with the square root evaluated by continuous functional calculus. The same KKK and family (Uk)(U_k)(Uk​) work for every ρ\rhoρ and ψ\psiψ; the endpoint ε=1\varepsilon=1ε=1 is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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