REVIEW 18 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
Stim: a fast stabilizer circuit simulator
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.
Forward citations
Cited by 18 Pith papers
-
High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
Radial codes from lifted products of quasi-cyclic codes give [[2r²s, 2(r-1)², ≤2s]] quantum LDPC codes whose simulations show comparable circuit-level performance to surface codes at roughly 1/5 the qubit count with s...
-
The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop
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.
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
-
The dynamic 4.8.8 Floquet code
A dynamic measurement circuit for the 4.8.8 Floquet code preserves full spatial distance and reaches per-round thresholds up to 0.512% under circuit-level depolarizing noise, outperforming standard ancilla-based circuits.
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulati...
-
LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
-
Simulating quantum circuits with a neural statebank
A compact neural statebank based on autoregressive Transformers simulates 34-qubit quantum circuits with ~0.01 infidelity using 0.3 million parameters, outperforming tested approximate simulators.
-
Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft achieves fast exact simulation of near-Clifford quantum circuits via dynamic active subspaces, delivering orders-of-magnitude speedups and the first full end-to-end simulations of magic state cultivation over h...
-
CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling
CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical er...
-
Co-Designing Error Mitigation and Error Detection for Logical Qubits
Optimized QED intervals plus steady-state extraction enable PEC+QED to deliver 2-11x lower error than PEC alone on Iceberg codes for QAOA.
-
Constant depth magic state cultivation with Clifford measurements by gauging
Gauging enables constant-depth logical XS dagger measurements for color-code magic state cultivation, achieving 10^{-12} logical error rates at 0.05% physical error for distance-7 codes while retaining over 1% of shot...
-
Syndrome aware mitigation of logical errors
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.
-
Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction
An exact positive-probability decomposition of thermal relaxation noise into Clifford gates and resets exists for T2 ≤ T1, with a negativity-free approximation that outperforms Pauli twirling for T2 > T1.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above...
-
The limits of erasure-based postselection for quantum error mitigation
Postselection on erasure qubits fully mitigates erasure noise in QFT for erasure-check error rates below 3% and enables dual-rail systems to exceed noise floors unreachable by single-rail at kiloquop scale.
-
PauLIB: A High-Performance Library for Processing Pauli Strings
PauLIB implements a compact bit-packed symplectic representation and SoA layout for Pauli strings, delivering 14x–21,000x speedups and 7.3x memory reduction versus existing Python frameworks at 500 qubits.
-
Soft information decoding with superconducting qubits
Soft decoding with analog measurement data raises repetition-code thresholds by 25% and reduces error rates up to 30x on superconducting qubits, with one byte per shot sufficient for near-optimal performance.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.