This is the authors' abstract. We don't add key points for this paper.
Classical methods to simulate quantum systems are not only a key element of the physicist’s toolkit for studying many-body models but are also increasingly important for verifying and challenging upcoming quantum computers. Pauli propagation has recently emerged as a promising new family of classical algorithms for simulating digital quantum systems. Here we provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation and formulation as a tree-search problem, all the way to its high-level user applications for simulating quantum circuits and dynamics. Utilizing these observations, we present , a software package that can perform rapid Pauli propagation simulation straight out-of-the-box and can be used more generally as a building block for novel simulation algorithms.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Anonymous et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: