Linear bound on dyadic coin outcomes
ProvedShiQMACenteredGap.coin_outcomes_leamplificationcenteringqmaquantum-complexity
For every positive gap budget q, the coin schedule coinBits(q) has at most 8q possible fair-bit outcomes.
Preamble
import Definitions.Def_ShiQMACenteredGapScalarCentering import Mathlib.Data.Real.Archimedean import Mathlib.Data.Nat.Log set_option autoImplicit false
Formal statement
theorem ShiQMACenteredGap.coin_outcomes_le (q : Nat) (hq : 0 < q) :
2 ^ coinBits q ≤ 8 * q := by
sorrySource