Counting Shots to Certify a Logical Error Rate: The Statistical Budget Behind a Suppression Claim
A logical error rate is not measured the way a length is measured. It is inferred from counting failures in a finite number of trials, and the count's statistics dictate how many trials a claim costs. This paper prices certification. To measure a logical error rate at the level of one part in a million to ten per cent relative precision at ninety-five per cent confidence requires about 3.8e8 independent trials, in which about 384 failures are expected to occur; the failures, not the trials, are the information. The same arithmetic at 1.00e-3 needs only 3.8e5 trials, which is why early demonstrations certify easily and mature claims become campaigns. The paper extends the budget to suppression-factor estimation, where two rates must be counted and their uncertainties combine, and to the wall-clock cost of certification campaigns on slow platforms, where a statistically adequate run can take longer than the hardware stays calibrated. Verification is a consumable, and this paper adds it to the machine's budget.
Authors
- William Alexander Aldred (ORCID: https://orcid.org/0009-0000-1215-577X)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24245281
- Primary Topic
- Software Testing and Debugging Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00