Pith. sign in

REVIEW 5 cited by

Stim: a fast stabilizer circuit simulator

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.02202 v3 pith:3ZW2CH4N submitted 2021-03-03 quant-ph

classification quant-ph
keywords stimcircuitstabilizersimulatortableaufastimprovesmillion
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 {\em inverse} 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop

    quant-ph 2026-07 conditional novelty 7.0 of 10 partial

    In windowed quantum decoding, a wrong speculative boundary guess stays inside one window, and the predict-verify-recover loop removes the serial stall with negligible penalty.

  2. Improved belief propagation is sufficient for real-time decoding of quantum memory

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.

  3. Syndrome aware mitigation of logical errors

    quant-ph 2025-12 conditional novelty 6.0 of 10

    Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.

  4. STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation

    quant-ph 2025-07 conditional novelty 6.0 of 10

    STABSim is a GPU-accelerated Clifford tableau simulator with new measurement handling, exact T1/T2 noise sampling in a common regime, and a fast Clifford+T to PBC transpiler.

  5. Correcting a noisy quantum computer using a quantum computer

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A variational quantum circuit, trained on syndrome data, decodes surface codes with accuracy close to minimum-weight perfect matching in classical simulation.

Pith tools