Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix G3, Eq.(G11): exact erasure and reconstruction in conjugate bases

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.two_basis_erasure

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

prove2quantum

Let d≥1d\ge1d≥1, let θ0,…,θd−1\theta_0,\ldots,\theta_{d-1}θ0​,…,θd−1​ be an unknown orthonormal basis of the input span, and put αj=d−1/2∑ke2πikj/dθk\alpha_j=d^{-1/2}\sum_k e^{2\pi i kj/d}\theta_kαj​=d−1/2∑k​e2πikj/dθk​. Initialize a ddd-dimensional auxiliary register in ∣Γ⟩=d−1/2∑t∣t⟩|\Gamma\rangle=d^{-1/2}\sum_t|t\rangle∣Γ⟩=d−1/2∑t​∣t⟩. Let VP,VQV_P,V_QVP​,VQ​ be the full controlled spectral exponentials of P=∑kk∣θk⟩⟨θk∣P=\sum_k k|\theta_k\rangle\langle\theta_k|P=∑k​k∣θk​⟩⟨θk​∣ and Q=∑jj∣αj⟩⟨αj∣Q=\sum_j j|\alpha_j\rangle\langle\alpha_j|Q=∑j​j∣αj​⟩⟨αj​∣, and let F−F_-F−​ be the normalized negative-sign Fourier transform. For every normalized ψ=∑kψkθk\psi=\sum_k\psi_k\theta_kψ=∑k​ψk​θk​ in the input span,

VQ(I⊗F−)VP(∣ψ⟩∣Γ⟩)=∣θ0⟩⊗∑kψk∣k⟩.V_Q(I\otimes F_-)V_P(|\psi\rangle|\Gamma\rangle)=|\theta_0\rangle\otimes\sum_k\psi_k|k\rangle.VQ​(I⊗F−​)VP​(∣ψ⟩∣Γ⟩)=∣θ0​⟩⊗k∑​ψk​∣k⟩.

Replacing the erased system by Uθ0U\theta_0Uθ0​ and applying the corresponding output-basis inverse product reconstructs Uψ⊗ΓU\psi\otimes\GammaUψ⊗Γ exactly. The exponentials act as identity outside the sample span. This is an exact circuit identity, separate from sample-access runtime claims.

For every pair of conjugate-basis labels j,ℓj,\ellj,ℓ, the same theorem retains the one-sample construction from p.29 footnote 3:

ei(2π(ℓ−j)/d)Pαj=αℓ.e^{i(2\pi(\ell-j)/d)P}\alpha_j=\alpha_\ell.ei(2π(ℓ−j)/d)Pαj​=αℓ​.

Thus one conjugate sample can be converted into each other conjugate sample using the displayed phase evolution; its sample-access runtime remains separately deferred.

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 pp.29–30, G11 and p.29 footnote 3: exact erasure, reconstruction, and
conversion of one Fourier-conjugate sample into every other conjugate sample.
Printed G7 omits normalization and has the wrong ket index; normalized G6 and G11
fix the normalized negative-sign DFT. The reconstruction sentence after G11 already
prints V_P_out-dagger (I tensor F_a-dagger) V_Q_out-dagger; the reverse product
retains those printed adjoints. Only G7 normalization and its ket index are corrected.
Full exponentials extend by identity off the span. -/
theorem two_basis_erasure {d : ℕ} (hd : 1 ≤ d) (theta : Fin d → EuclideanSpace ℂ I)
    (htheta : Orthonormal ℂ theta) (psi : EuclideanSpace ℂ I) (hpsi : IsState psi)
    (hsupport : psi ∈ Submodule.span ℂ (Set.range theta)) (U : Matrix.unitaryGroup I ℂ) :
    let alpha := conjugateBasis theta
    let coords : EuclideanSpace ℂ (Fin d) := WithLp.toLp 2 fun k => inner ℂ (theta k) psi
    let erase := basisPhase alpha * Matrix.kronecker (1 : Matrix I I ℂ) (negativeFourier d) * basisPhase theta
    let thetaout := fun k => act (U : Matrix I I ℂ) (theta k)
    let alphaout := conjugateBasis thetaout
    act erase (tensorVec psi (uniformAddress d)) = tensorVec (theta ⟨0, by omega⟩) coords ∧
    act ((basisPhase thetaout)ᴴ * Matrix.kronecker (1 : Matrix I I ℂ) (negativeFourier d)ᴴ *
      (basisPhase alphaout)ᴴ) (tensorVec (thetaout ⟨0, by omega⟩) coords) =
      tensorVec (act (U : Matrix I I ℂ) psi) (uniformAddress d) ∧
    (∀ j l : Fin d,
      act (positivePhaseEvolution (∑ k : Fin d, (k.val : ℂ) • pureDensity (theta k))
        (2 * Real.pi * ((l.val : ℝ) - (j.val : ℝ)) / d)) (alpha j) = alpha l) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P67

end
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 29, Appendix G3, Eq.(G11): exact erasure and reconstruction in conjugate bases
Read-back

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

Let III be a finite index type with decidable equality, let ddd be a natural number with 1≤d1\le d1≤d, and let (θk)k=0d−1(\theta_k)_{k=0}^{d-1}(θk​)k=0d−1​ be an orthonormal family in CI\mathbb C^ICI. Let ψ∈CI\psi\in\mathbb C^Iψ∈CI satisfy ∥ψ∥=1\|\psi\|=1∥ψ∥=1 and belong to the complex linear span of this family, and let UUU be a unitary matrix on CI\mathbb C^ICI. Define

αj=1d∑k=0d−1e2πikj/dθk,ck=⟨θk,ψ⟩,ur=1d.\alpha_j=\frac1{\sqrt d}\sum_{k=0}^{d-1}e^{2\pi i k j/d}\theta_k, \qquad c_k=\langle\theta_k,\psi\rangle, \qquad u_r=\frac1{\sqrt d}.αj​=d​1​k=0∑d−1​e2πikj/dθk​,ck​=⟨θk​,ψ⟩,ur​=d​1​.

For any family η=(ηk)k=0d−1\eta=(\eta_k)_{k=0}^{d-1}η=(ηk​)k=0d−1​ in CI\mathbb C^ICI, define the matrices

Hη=∑k=0d−1k ∣ηk⟩⟨ηk∣,(Bη)(x,r),(y,s)={[exp⁡(i(2πr/d)Hη)]x,y,r=s,0,r≠s,H_\eta=\sum_{k=0}^{d-1}k\,|\eta_k\rangle\langle\eta_k|, \qquad (B_\eta)_{(x,r),(y,s)} = \begin{cases} \bigl[\exp(i(2\pi r/d)H_\eta)\bigr]_{x,y},&r=s,\\ 0,&r\ne s, \end{cases}Hη​=k=0∑d−1​k∣ηk​⟩⟨ηk​∣,(Bη​)(x,r),(y,s)​={[exp(i(2πr/d)Hη​)]x,y​,0,​r=s,r=s,​

where (∣ηk⟩⟨ηk∣)x,y=ηk(x)ηk(y)‾(|\eta_k\rangle\langle\eta_k|)_{x,y}=\eta_k(x)\overline{\eta_k(y)}(∣ηk​⟩⟨ηk​∣)x,y​=ηk​(x)ηk​(y)​ and exp⁡\expexp is the matrix exponential. Define F−F_-F−​ by (F−)r,s=d−1/2e−2πirs/d(F_-)_{r,s}=d^{-1/2}e^{-2\pi i rs/d}(F−​)r,s​=d−1/2e−2πirs/d, set E=Bα(Id⊗F−)BθE=B_\alpha(\mathrm{Id}\otimes F_-)B_\thetaE=Bα​(Id⊗F−​)Bθ​, and put

θk′=Uθk,αj′=1d∑k=0d−1e2πikj/dθk′.\theta'_k=U\theta_k, \qquad \alpha'_j=\frac1{\sqrt d}\sum_{k=0}^{d-1}e^{2\pi i k j/d}\theta'_k.θk′​=Uθk​,αj′​=d​1​k=0∑d−1​e2πikj/dθk′​.

Here matrix action is ordinary multiplication, and the tensor vector v⊗wv\otimes wv⊗w has coordinate v(x)w(r)v(x)w(r)v(x)w(r) at (x,r)(x,r)(x,r). Then all three assertions hold:

E(ψ⊗u)=θ0⊗c,E(\psi\otimes u)=\theta_0\otimes c,E(ψ⊗u)=θ0​⊗c, Bθ′†(Id⊗F−†)Bα′†(θ0′⊗c)=(Uψ)⊗u,B_{\theta'}^\dagger(\mathrm{Id}\otimes F_-^\dagger)B_{\alpha'}^\dagger (\theta'_0\otimes c) =(U\psi)\otimes u,Bθ′†​(Id⊗F−†​)Bα′†​(θ0′​⊗c)=(Uψ)⊗u,

and

∀j,l∈{0,…,d−1},exp⁡ ⁣(i 2π(l−j)d Hθ)αj=αl.\forall j,l\in\{0,\ldots,d-1\},\qquad \exp\!\left(i\,\frac{2\pi(l-j)}d\,H_\theta\right)\alpha_j=\alpha_l.∀j,l∈{0,…,d−1},exp(id2π(l−j)​Hθ​)αj​=αl​.

The case d=1d=1d=1 is included; d=0d=0d=0 is excluded by the hypothesis.

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