Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unencoded circuits: output error at most p ∣C∣p\,|C|p∣C∣

Proved
ThresholdTheorem.noisy_tv_le_fault_rate_mul_size

by Lucas · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

fault-tolerancequantum-computingquantum-error-correction

Errors accumulate at most linearly (unencoded circuits). Let CCC be any circuit on a finite register and let 0≤p≤10\le p\le 10≤p≤1. For every independent stochastic noise model with fault rate at most ppp,

dTV(Pnoisy(C), Pideal(C))  ≤  p ∣C∣,d_{\mathrm{TV}}\big(P_{\mathrm{noisy}}(C),\,P_{\mathrm{ideal}}(C)\big)\;\le\;p\,|C| ,dTV​(Pnoisy​(C),Pideal​(C))≤p∣C∣,

where Pnoisy(C)P_{\mathrm{noisy}}(C)Pnoisy​(C) and Pideal(C)P_{\mathrm{ideal}}(C)Pideal​(C) are the outcome distributions of measuring all qubits after the noisy and the noiseless runs of CCC, and ∣C∣|C|∣C∣ is the number of locations of CCC.

Without error correction, a circuit with p(n)p(n)p(n) components is only reliable when p⋅p(n)p\cdot p(n)p⋅p(n) is small; this is the baseline that fault tolerance improves on, and the same bound is the level-000 case of the concatenated construction.

Preamble
import Mathlib
import Definitions.Def_threshold_theorem_noise_model

open ThresholdTheorem
Formal statement
namespace ThresholdTheorem
theorem noisy_tv_le_fault_rate_mul_size {Q : Type*} [Fintype Q] [DecidableEq Q]
    (C : Circuit Q) (p : ℝ) (hp : p ≤ 1) (N : NoiseModel p) :
    tvDist (outDist (noisyState N C)) (outDist (idealState C)) ≤ p * C.size := by sorry
end ThresholdTheorem
Source
Wikipedia, "Threshold theorem" (revision oldid=1360742213, https://en.wikipedia.org/w/index.php?title=Threshold_theorem&oldid=1360742213), section "Explanation"; the boxed statement is quoted there from M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, p. 481.
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me