Three majority rounds double a centered acceptance bias
ProvedShiQMACenteredGap.biasIter_dyadicamplificationqmaquantum-complexity
For every initial centered bias between and , and every natural number , applying the majority-of-three bias update times raises the bias to at least the smaller of and . Thus three rounds double the bias until it reaches a fixed constant.
Preamble
import Definitions.Def_ShiQMACenteredGap import Theorems.Thm_ShiQMACenteredGap_biasIter_growth set_option autoImplicit false /-- Three majority rounds suffice for each factor of two in the initial inverse bias. -/
Formal statement
theorem ShiQMACenteredGap.biasIter_dyadic {d : ℝ}
(hd : 0 ≤ d) (hd' : d ≤ 1 / 2) (r : Nat) :
min (1 / 6) ((2 : ℝ) ^ r * d) ≤
ShiQMACenteredGap.biasIter d (3 * r) := by
sorrySource
Yueheng Shi, QMA amplification Lean source, https://github.com/shiy1022/qma-amplification-lean/blob/83191f2e3fdc36033c8a99e8f9af6625d2cda2b0/proofs/AMPUNI-centered-gap.lean#L88-L95; Marriott and Watrous, Quantum Arthur–Merlin Games (2005), Section 3, https://cs.uwaterloo.ca/~watrous/Papers/QuantumArthurMerlinGames.pdf