Lemma 5: gate precision and computation error
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.computation_errorSuppose unitary operations compute a promised function with worst-case error at most , using clean initial work and a specified output register. Replace each operation by a unitary within phase-sensitive operator distance . For every promised input,
The bound is retained even when its right side is nonpositive or the resulting error exceeds one half.
Only the output register is measured, and both operation lists are specified on the actual computer memory.
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 5: gate errors imply a worst-case success bound on every valid
input, including when the resulting upper bound on error exceeds one half or one. -/
theorem computation_error {n m w L : ℕ}
(U V : Fin L → Matrix (Qubits (n + w)) (Qubits (n + w)) ℂ)
(out : Fin m ↪ Fin (n + w)) (N : Set (Qubits n)) (F : Qubits n → Qubits m)
(epsilon delta : ℝ) (he : 0 ≤ epsilon) (hehalf : epsilon < 1 / 2) (hd : 0 ≤ delta)
(hU : ∀ j, U j ∈ Matrix.unitaryGroup (Qubits (n + w)) ℂ)
(hV : ∀ j, V j ∈ Matrix.unitaryGroup (Qubits (n + w)) ℂ)
(herror : Computes (orderedProd U) out N F epsilon)
(happrox : ∀ j, specNorm (V j - U j) ≤ delta) :
Computes (orderedProd V) out N F (epsilon + 2 * (L : ℝ) * delta) := 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 arbitrary natural numbers; let , for , be unitary complex matrices indexed by bit strings of length ; let be an injection; let ; let ; and let real numbers satisfy and . Write and , with empty products equal to the identity. Suppose for every , where this is the Euclidean operator norm, and suppose for every ,
Then for every ,
Here is the coordinate vector with the ancillary bits false, and matrix action is ordinary matrix-vector multiplication. The conclusion does not require . The statement includes zero lengths and , and its conditions and conclusion concerning inputs are vacuous when is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.