Lemma 1: integer squared norm equals squared weight
OpenQAlgorithms.Papers.Independent.Intakethird100.P85.integerNorm_weightprove2quantum
Let , with and . Write each coordinate uniquely as , with dyadic real coefficients. Define and . If is an integer, then
The identity relates coefficient weight to the usual complex norm without assuming unit normalization. The empty vector is included.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P85
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P85
open scoped Classical BigOperators
open QAlgorithms
open QAlgorithms.Papers.Independent.Gap48.P10
(InZomega InDomega Residue bits residue residueMultiply Reducible)
open QAlgorithms.Papers.Independent.Support21.P13
(synthesisRing integralRing coordinateValue HTLetter htWordMatrix EntriesInRing cliffordTLibrary)
local notation "omega" => QAlgorithms.gateT true true
local notation "sqrtTwo" => ((Real.sqrt 2 : ℝ) : ℂ)
/-- Lemma 1, PDF p.2: squared weight equals an integer squared norm.
Vectors are presented in their unique dyadic omega-power coordinates. -/
theorem integerNorm_weight (d : ℕ) (a : Fin d → DyadicCoordinates)
(integerNorm : ∃ m : ℤ, vectorNormSq (fun i => dyadicValue (a i).val) = (m : ℝ)) :
(∑ i, coordinateWeight (a i).val) = vectorNormSq (fun i => dyadicValue (a i).val) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P85
end
Source
Exact synthesis of multiqubit Clifford+T circuits, arXiv:1212.0506v3, PDF p. 2, Lemma 1: integer squared norm equals squared weight
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let . For every natural number and every family of real quadruples , indexed by , suppose each coordinate is dyadic: for every , there exist and with . If there exists an integer such that
then
The quantifier includes , when both sums are empty and equal to zero.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.