Lemma 3: sum of individual operator errors
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.operator_errors_addLet and be unitary operators on the same finite complex Hilbert space. Let satisfy . Then
The norm is the phase-sensitive operator norm. For , both products are the identity and the bound is zero.
This keeps the source's separate precision for every gate.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
noncomputable section
open scoped Matrix ComplexConjugate Kronecker
namespace QAlgorithms.Papers.Independent.Intakethird100.P03
open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)
attribute [local instance] Classical.propDecidable
/-- PDF p.12, Lemma 3: nonuniform individual precisions add, in the phase-sensitive
L2 operator norm. The empty ordered product is the identity. -/
theorem operator_errors_add {I : Type*} [Fintype I] [DecidableEq I]
(L : ℕ) (U V : Fin L → Matrix I I ℂ) (delta : Fin L → ℝ)
(hU : ∀ j, U j ∈ Matrix.unitaryGroup I ℂ)
(hV : ∀ j, V j ∈ Matrix.unitaryGroup I ℂ)
(hd : ∀ j, 0 ≤ delta j) (happrox : ∀ j, specNorm (V j - U j) ≤ delta j) :
specNorm (orderedProd V - orderedProd U) ≤ ∑ j, delta j := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite type with decidable equality, let be an integer, and let be complex matrices indexed by , with real numbers , for . Suppose every and is unitary, every , and , where is the operator norm induced by the Euclidean norm. Then
The products are taken in decreasing index order. When , both products are the identity and the sum is . The finite index type is allowed to be empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.