§1, Weyl relations and Fourier inversion/Parseval
ProvedQAlgorithms.Papers.Independent.Bridge50.P05.weylCalculusLet , , and . In the specified orthonormal basis let , where and . Write . All spaces are finite dimensional. The norm is the Hilbert–Schmidt norm, and is the maximal output norm. A map in is complex linear, Weyl covariant and satisfies ; it need not be positive or completely positive. Its computed symbol is . Put and . At , explicitly set and . Write .
For every operator and all , the positive-clock Weyl calculus gives
Thus the Weyl operators are an orthogonal operator basis with the displayed inversion and Parseval formulas. All phase arithmetic is understood modulo .
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P05
noncomputable section
namespace QAlgorithms.Papers.Independent.Bridge50.P05
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Information100.P34 (cyclicPhase weyl dephasing)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Gap48.P36 (WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Claimed50.P48
(nu superopTensor UniversalMultiplicative rowKraus indexedKrausDilation)
open QAlgorithms.Papers.Independent.Information100.P67 (complementaryChannel)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {d : ℕ} [NeZero d]
/-- Section 1, PDF pp.2--3, (1.3)--(1.7),(1.10): positive-clock Weyl
relations, trace orthogonality, inversion, Parseval and the conjugated adjoint relation. -/
theorem weylCalculus (X : Op (ZMod d)) :
(∀ z v : WeylLabel d, W z * W v = cyclicPhase d (z.2 * v.1) • W (z + v)) ∧
(∀ z v : WeylLabel d, W z * W v =
cyclicPhase d (v.1 * z.2 - v.2 * z.1) • (W v * W z)) ∧
(∀ z : WeylLabel d, (W z)ᴴ = cyclicPhase d (z.2 * z.1) • W (-z)) ∧
(∀ z v : WeylLabel d, (W z * (W v)ᴴ).trace = if z = v then (d : ℂ) else 0) ∧
X = ∑ z, weylFourierCoefficient X z • W z ∧
X.trace = (d : ℂ) * weylFourierCoefficient X 0 ∧
(Xᴴ * X).trace = (((d : ℝ) * ∑ z, ‖weylFourierCoefficient X z‖ ^ 2 : ℝ) : ℂ) ∧
(∀ z : WeylLabel d, conj (weylFourierCoefficient X z) =
cyclicPhase d (-(z.2 * z.1)) * weylFourierCoefficient Xᴴ (-z)) := by sorry
end QAlgorithms.Papers.Independent.Bridge50.P05
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonzero natural number and every complex matrix indexed by , define , , , , and , where is the standard residue representative. The statement asserts all of the following identities, with every label operation performed in :
The real quantity on the right of the identity for is embedded into . No Hermiticity or normalization is assumed of , and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.