Stim: a fast stabilizer circuit simulator
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
This paper presents “Stim", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 million gates, 1 million measurements) in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz. Stim uses a stabilizer tableau representation, similar to Aaronson and Gottesman's CHP simulator, but with three main improvements. First, Stim improves the asymptotic complexity of deterministic measurement from quadratic to linear by tracking the i n v e r s e of the circuit's stabilizer tableau. Second, Stim improves the constant factors of the algorithm by using a cache-friendly data layout and 256 bit wide SIMD instructions. Third, Stim only uses expensive stabilizer tableau simulation to create an initial reference sample. Further samples are collected in bulk by using that sample as a reference for batches of Pauli frames propagating through the circuit.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 2×
“Figure 8: Delay until first sample on nested 7-to-1 S state distillation circuits [10].”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 7×
“I compared Stim’s performance to Aaronson and Gottesman’s chp simulator [1], IBM’s Qiskit simulator (qiskit method=‘stabilizer’) [9], Google’s Cirq simulator (cirq.”
BackgroundResultInfluentialQiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hernández, F. J., Carballo-Franquis, J., Chen, A., Chen, C.-F., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562110 · Cited by 1,434
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 2×
“Instead, the noise can be accumulated into a Pauli frame stored alongside the simulation [23].”
BackgroundMethodNIELSEN, J. (1993) · Usability Engineering · doi:10.1016/b978-0-08-052029-2.50009-7 · Cited by 934
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753 · cited 2×
“Fourth, the surface code is chock full of measurements and, basically, historically, the cost of measurements in stabilizer simulators started at Θ(n3) [13], improved to Θ(n2) [1], and then stayed there.”
BackgroundSurface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598 · cited 2×
“Figure 1: Delay until one thousandth sample on d × d × d surface code memory circuits [15].”
BackgroundOperator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486 · cited 1×
“Figure 3: Delay until first sample on d×d×d Bacon-Shor code memory circuits [4].”
BackgroundHudson’s theorem for finite-dimensional quantum systems
Gross, D. (2006) · Journal of Mathematical Physics · doi:10.1063/1.2393152 · Cited by 336 · cited 1×
“Second, describing an arbitrary n-qubit stabilizer state takes at least (1)2n 2 bits [14, 22, 18].”
BackgroundSimulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
Research works printed but not linked: 1
- Sergey Bravyi and Dmitri Maslov. Hadamard-free circuits expose the structure of the clifford group. arXiv preprint arXiv:2003.09412, 2020. URL https://arxiv.org/abs/2003.09412. · arXiv
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“We start by constructing a decoding hypergraph based on a description of the logical algorithm, which describes how each physical error mechanism (for example, a Pauli-error channel after a two-qubit gate) propagates onto the measured stabilizers 76,81 .”
BackgroundMethodSparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
“While there has been progress in the development of open-source software packages for decoding surface codes [Hig22; Tuc20], these tools are much slower than stabilizer circuit simulators [Gid21], and have therefore been a bottleneck in surface code simulations.”
Self-citationPyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
“Matching graphs can also be automatically constructed from syndrome extraction circuits, by using Stim to construct a detector error model [27], which can then be converted to a PyMatching matching graph [38].”
MethodConstant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Xu, Q., Ataides, J. P. B., Pattison, C. A., Raveendran, N., Bluvstein, D., Wurtz, J., Vasic, B. V., Lukin, M. D., Jiang, L., & Zhou, H. (2024) · Nature Physics · doi:10.1038/s41567-024-02479-z · Cited by 412
“We next supplement this theoretical understanding with numerical simulations of HGP and LP codes at practically relevant instance sizes 37 , and we find competitive thresholds and LFRs for both codes.”
The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors
Stefanazzi, L., Treptow, K., Wilcer, N., Stoughton, C., Bradford, C., Uemura, S., Zorzetti, S., Montella, S., Cancelo, G. I., Sussman, S., et al. (2022) · Review of Scientific Instruments · doi:10.1063/5.0076249 · Cited by 234
Metadata
- Authors
- Gidney, C.
- Affiliations
- Google (United States) (US)
- Corresponding author
- Gidney, Craig
- Venue
- Quantum
- Published
- 2021-07-06
- Volume
- 5
- Pages
- 497
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W3135510046
- Cited by
- 415
- References
- 19
- Citations by year
- 2026: 109 · 2025: 169 · 2024: 68 · 2023: 49 · 2022: 17 · 2021: 3
- FWCI
- 12.00
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- STIM, quantum circuit simulation, stabilizer circuits, surface code, measurement simulation, SIMD acceleration, quantum error correction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stim: a fast stabilizer circuit simulator. https://app.cochat.ai/papers/10.22331/q-2021-07-06-497
- The paper
- Gidney, C. (2021). Stim: a fast stabilizer circuit simulator. Quantum. https://doi.org/10.22331/q-2021-07-06-497
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.