QUANTUM-COMPUTING CLAIM READING RECORD — September 7, 2026
Guide: https://yenra.com/quantum-computers/
Use one record per paper or demonstration. Keep measured results separate from
models, projections, and marketing summaries. This is a reading aid, not a score.

Paper title / authors / direct URL / publication date:
Correction or updated-version date checked:
Actual task: memory, logical operation, algorithm, or other:
Input/problem size / output / success criterion:
Physical qubits / logical qubits / auxiliary resources:
Code / decoder / real-time or offline decoding:
Circuit depth / operations / repetitions / unsuccessful-run treatment:
Error value / denominator (gate, cycle, time, whole experiment) / uncertainty:
Classical preparation / control / decoding / processing resources:
Classical baseline algorithm / hardware / accuracy / date:
Measured comparison versus estimated comparison:
End-to-end time versus quantum-subroutine time:
What the evidence demonstrates:
What remains unperformed or assumed:
Reproduction data/code / limitations / next source to check:

Illustrative independent-error model only:
1,000 operations, failure probability 0.001 each, any failure unacceptable:
(1 - 0.001)^1000 = about 36.8% probability of no failures.
At 0.00001 per operation: about 99.0%.
Real quantum noise/correction is more structured; these are not device forecasts.

Source examples:
https://www.nist.gov/publications/quantum-computing-realistically-noisy-devices
https://www.nature.com/articles/s41586-024-08449-y
https://quantum.cloud.ibm.com/learning/en/courses/basics-of-quantum-information/single-systems/introduction