Independent majority repetition reduces bounded error
Lax253009.MajorityAmplification · concepts/Lax253009/MajorityAmplification.lean · lax-253009
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Three independent executions followed by majority vote transform an error probability into . Three rounds of this construction reduce error at most to at most , using 27 independent executions.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax253009.FiniteProbability |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Independent majority repetition reduces bounded error |
| 6 | type: theorem |
| 7 | --- |
| 8 | Three independent executions followed by majority vote transform an error |
| 9 | probability into . Three rounds of this construction reduce |
| 10 | error at most to at most , using 27 independent executions. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax253009.MajorityAmplification |
| 14 | |
| 15 | open FiniteProbability |
| 16 | |
| 17 | def vote (a b c : Bool) : Bool := (a && b) || (a && c) || (b && c) |
| 18 | |
| 19 | def errorMap (p : ℝ) : ℝ := 3 * p ^ 2 - 2 * p ^ 3 |
| 20 | |
| 21 | axiom majority_error {α : Type} [Fintype α] [Nonempty α] |
| 22 | (answer : α → Bool) (b : Bool) : |
| 23 | probability (fun r : α × α × α ↦ |
| 24 | vote (answer r.1) (answer r.2.1) (answer r.2.2) ≠ b) = |
| 25 | errorMap (probability (fun r ↦ answer r ≠ b)) |
| 26 | |
| 27 | axiom three_rounds (p : ℝ) (hp : 0 ≤ p) (hp' : p ≤ 1 / 3) : |
| 28 | errorMap (errorMap (errorMap p)) ≤ 1 / 12 |
| 29 | |
| 30 | end Lax253009.MajorityAmplification |
| 31 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments