Appendix G3, Eq.(G11): exact erasure and reconstruction in conjugate bases
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.two_basis_erasureLet , let be an unknown orthonormal basis of the input span, and put . Initialize a -dimensional auxiliary register in . Let be the full controlled spectral exponentials of and , and let be the normalized negative-sign Fourier transform. For every normalized in the input span,
Replacing the erased system by and applying the corresponding output-basis inverse product reconstructs 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 , the same theorem retains the one-sample construction from p.29 footnote 3:
Thus one conjugate sample can be converted into each other conjugate sample using the displayed phase evolution; its sample-access runtime remains separately deferred.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, let be a natural number with , and let be an orthonormal family in . Let satisfy and belong to the complex linear span of this family, and let be a unitary matrix on . Define
For any family in , define the matrices
where and is the matrix exponential. Define by , set , and put
Here matrix action is ordinary multiplication, and the tensor vector has coordinate at . Then all three assertions hold:
and
The case is included; is excluded by the hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.