Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix G1: mixed samples with one pure anchor

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.mixed_samples_pure_anchor

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let a finite nonempty family of density operators ρk\rho_kρk​ generate all operators on the span of their supports, and assume the fixed anchor is exactly ρa=∣ϕ⟩⟨ϕ∣\rho_a=|\phi\rangle\langle\phi|ρa​=∣ϕ⟩⟨ϕ∣. Independently choose kkk uniformly and ttt uniformly on [0,1][0,1][0,1], and use W(k,t)=T(k,t)HT(a,π)W(k,t)=T(k,t)HT(a,\pi)W(k,t)=T(k,t)HT(a,π) with T(k,t)T(k,t)T(k,t) the controlled e−itρke^{-it\rho_k}e−itρk​. Define W\mathcal WW by the actual partial trace and entrywise integral. The integrands are continuous and integrable on the interval and every finite-history unit cube. Then

W(∣ϕ⟩⟨ϕ∣)=∣ϕ⟩⟨ϕ∣,lim⁡T→∞∥WT(ρ)−∣ϕ⟩⟨ϕ∣∥1=0.\mathcal W(|\phi\rangle\langle\phi|)=|\phi\rangle\langle\phi|,\qquad\lim_{T\to\infty}\|\mathcal W^T(\rho)-|\phi\rangle\langle\phi|\|_1=0.W(∣ϕ⟩⟨ϕ∣)=∣ϕ⟩⟨ϕ∣,T→∞lim​∥WT(ρ)−∣ϕ⟩⟨ϕ∣∥1​=0.

The anchor is the unique supported fixed density operator. Using exact output records UρkU†U\rho_kU^\daggerUρk​U† and the corresponding reverse history, the integral-defined emulator converges uniformly on supported density operators to UρU†U\rho U^\daggerUρU†. This is the exactly pure-anchor construction, without an unquantified near-purity extension.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
Formal statement
noncomputable section

open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator

attribute [local instance] Classical.propDecidable

open MeasureTheory Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P67

variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
  [Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
  [Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]

/-- PDF p.28, G1: the EXACTLY pure anchor is the unique supported fixed state of
the continuous uniform-time channel. Its convergence permits supported-input emulation;
continuity/integrability of the displayed body is asserted, not assumed. -/
theorem mixed_samples_pure_anchor [Nonempty K] (S : K → Matrix I I ℂ) (a : K)
    (hS : ∀ k, IsDensityMatrix (S k)) (hgen : Generates S)
    (phi : EuclideanSpace ℂ I) (hphi : IsState phi) (hanchor : S a = pureDensity phi) :
    (∀ (rho : Matrix I I ℂ) (k : K), Continuous (fun t : ℝ =>
      traceRight (densityConjugation (mixedGate S a k t) (Matrix.kronecker rho (pureDensity minusVector))))) ∧
    (∀ (rho : Matrix I I ℂ) (k : K) (i j : I), IntegrableOn (fun t : ℝ =>
      traceRight (densityConjugation (mixedGate S a k t)
        (Matrix.kronecker rho (pureDensity minusVector))) i j) (Set.Icc 0 1)) ∧
    (∀ (rho : Matrix I I ℂ) (U : Matrix.unitaryGroup I ℂ) (T : ℕ) (h : Fin T → K) (i j : I),
      IntegrableOn (fun ts : Fin T → ℝ => mixedHistoryOutput S a phi (U : Matrix I I ℂ) rho h ts i j)
        (Set.pi Set.univ (fun _ : Fin T => Set.Icc (0 : ℝ) 1))) ∧
    mixedSampleErasureChannel S a (pureDensity phi) = pureDensity phi ∧
    (∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
      mixedSampleErasureChannel S a rho = rho → rho = pureDensity phi) ∧
    (∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
      Tendsto (fun T : ℕ => traceNorm ((mixedSampleErasureChannel S a)^[T] rho - pureDensity phi)) atTop (nhds 0)) ∧
    (∀ (U : Matrix.unitaryGroup I ℂ) (eps : ℝ), 0 < eps → ∃ N : ℕ, ∀ T ≥ N,
      ∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
      traceDistance (mixedEmulate S a phi (U : Matrix I I ℂ) T rho) (densityConjugation (U : Matrix I I ℂ) rho) ≤ eps) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P67

end
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 28, Appendix G1: mixed samples with one pure anchor
Read-back

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

Let I,KI,KI,K be finite index types with decidable equality, with KKK nonempty, and fix a∈Ka\in Ka∈K. Let every SkS_kSk​ be a positive semidefinite matrix on CI\mathbb C^ICI of trace 111, let Π\PiΠ be the functional-calculus value of x↦1x≠0x\mapsto\mathbf1_{x\ne0}x↦1x=0​ on ∑kSk\sum_kS_k∑k​Sk​, and assume that the complex span of all nonempty products Sk1⋯SksS_{k_1}\cdots S_{k_s}Sk1​​⋯Sks​​ is {X:ΠXΠ=X}\{X:\Pi X\Pi=X\}{X:ΠXΠ=X}. Let ϕ∈CI\phi\in\mathbb C^Iϕ∈CI have norm 111, and assume Sa=ϕϕ†S_a=\phi\phi^\daggerSa​=ϕϕ†. Write C(V)=1I⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣C(V)=1_I\otimes|0\rangle\langle0|+V\otimes|1\rangle\langle1|C(V)=1I​⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣, H=2−1/2(111−1)H=2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), η=(∣0⟩−∣1⟩)/2\eta=(|0\rangle-|1\rangle)/\sqrt2η=(∣0⟩−∣1⟩)/2​, and

Ek(s)=C(e−isSk)(1I⊗H)C(e−iπSa),Fρ,k(s)=Tr⁡anc ⁣[Ek(s)(ρ⊗ηη†)Ek(s)†],A(ρ)=1∣K∣∑k∫01Fρ,k(s) ds,E_k(s)=C(e^{-isS_k})(1_I\otimes H)C(e^{-i\pi S_a}), \qquad F_{\rho,k}(s)=\operatorname{Tr}_{\mathrm{anc}}\!\left[ E_k(s)(\rho\otimes\eta\eta^\dagger)E_k(s)^\dagger \right], \qquad \mathcal A(\rho)=\frac1{|K|}\sum_k\int_0^1F_{\rho,k}(s)\,ds,Ek​(s)=C(e−isSk​)(1I​⊗H)C(e−iπSa​),Fρ,k​(s)=Tranc​[Ek​(s)(ρ⊗ηη†)Ek​(s)†],A(ρ)=∣K∣1​k∑​∫01​Fρ,k​(s)ds,

where matrix integrals are taken entrywise with respect to Lebesgue measure. For h∈KTh\in K^Th∈KT and s∈[0,1]Ts\in[0,1]^Ts∈[0,1]T, let Vh,sV_{h,s}Vh,s​ apply Ehj(sj)E_{h_j}(s_j)Ehj​​(sj​) successively to the system and ancilla jjj, put ηT=η⊗T\eta_T=\eta^{\otimes T}ηT​=η⊗T, Xh,s=Vh,s(ρ⊗ηTηT†)Vh,s†X_{h,s}=V_{h,s}(\rho\otimes\eta_T\eta_T^\dagger)V_{h,s}^\daggerXh,s​=Vh,s​(ρ⊗ηT​ηT†​)Vh,s†​, and Vh,sU=(U⊗1)Vh,s(U†⊗1)V^{U}_{h,s}=(U\otimes1)V_{h,s}(U^\dagger\otimes1)Vh,sU​=(U⊗1)Vh,s​(U†⊗1), and define

Gρ,U,h(s)=Tr⁡anc ⁣[(Vh,sU)†(Uϕϕ†U†⊗Tr⁡IXh,s)Vh,sU],MU,T(ρ)=1∣K∣T∑h∈KT∫[0,1]TGρ,U,h(s) ds.G_{\rho,U,h}(s)= \operatorname{Tr}_{\mathrm{anc}}\!\left[ (V^U_{h,s})^\dagger \left(U\phi\phi^\dagger U^\dagger\otimes\operatorname{Tr}_{I}X_{h,s}\right) V^U_{h,s} \right], \qquad \mathcal M_{U,T}(\rho)=\frac1{|K|^T}\sum_{h\in K^T}\int_{[0,1]^T}G_{\rho,U,h}(s)\,ds.Gρ,U,h​(s)=Tranc​[(Vh,sU​)†(Uϕϕ†U†⊗TrI​Xh,s​)Vh,sU​],MU,T​(ρ)=∣K∣T1​h∈KT∑​∫[0,1]T​Gρ,U,h​(s)ds.

The assertion is that Fρ,kF_{\rho,k}Fρ,k​ is continuous for every complex matrix ρ\rhoρ and every kkk; that each entry of Fρ,kF_{\rho,k}Fρ,k​ is integrable on [0,1][0,1][0,1] for every ρ,k\rho,kρ,k; and that each entry of Gρ,U,hG_{\rho,U,h}Gρ,U,h​ is integrable on [0,1]T[0,1]^T[0,1]T for every complex matrix ρ\rhoρ, every unitary UUU, every natural number TTT, and every history h∈KTh\in K^Th∈KT. It also asserts A(ϕϕ†)=ϕϕ†\mathcal A(\phi\phi^\dagger)=\phi\phi^\daggerA(ϕϕ†)=ϕϕ†; for every positive semidefinite ρ\rhoρ of trace 111 with ΠρΠ=ρ\Pi\rho\Pi=\rhoΠρΠ=ρ, the implication A(ρ)=ρ⇒ρ=ϕϕ†\mathcal A(\rho)=\rho\Rightarrow\rho=\phi\phi^\daggerA(ρ)=ρ⇒ρ=ϕϕ†; for every such ρ\rhoρ,

Re⁡tr⁡(A T(ρ)−ϕϕ†)†(A T(ρ)−ϕϕ†)⟶0(T→∞),\operatorname{Re}\operatorname{tr} \sqrt{(\mathcal A^{\,T}(\rho)-\phi\phi^\dagger)^\dagger (\mathcal A^{\,T}(\rho)-\phi\phi^\dagger)} \longrightarrow0\quad(T\to\infty),Retr(AT(ρ)−ϕϕ†)†(AT(ρ)−ϕϕ†)​⟶0(T→∞),

where A T\mathcal A^{\,T}AT means TTT-fold composition; and, for every unitary UUU and every ε>0\varepsilon>0ε>0, the existence of a natural number NNN such that, for every T≥NT\ge NT≥N and every such ρ\rhoρ,

12Re⁡tr⁡(MU,T(ρ)−UρU†)†(MU,T(ρ)−UρU†)≤ε.\tfrac12\operatorname{Re}\operatorname{tr} \sqrt{(\mathcal M_{U,T}(\rho)-U\rho U^\dagger)^\dagger (\mathcal M_{U,T}(\rho)-U\rho U^\dagger)} \le\varepsilon.21​Retr(MU,T​(ρ)−UρU†)†(MU,T​(ρ)−UρU†)​≤ε.

The definitions and integrability assertions include T=0T=0T=0, using empty products and the zero-dimensional integration domain; no assumption ∣K∣≥2|K|\ge2∣K∣≥2 is imposed.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me