The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Simulation of quantum circuits by low-rank stabilizer decompositions
Open accessAbstract
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of s t a b i l i z e r rank , which for a pure state ψ is defined to be the smallest integer χ such that ψ is a superposition of χ stabilizer states. Here we develop a comprehensive mathematical theory of the stabilizer rank and the related approximate stabilizer rank. We also present a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art. A new feature is the capability to simulate circuits composed of Clifford gates and arbitrary diagonal gates, extending the reach of a previous algorithm specialized to the Clifford+T gate set. We implemented the new simulation methods and used them to simulate quantum algorithms with 40-50 qubits and over 60 non-Clifford gates, without resorting to high-performance computers. We report a simulation of the Quantum Approximate Optimization Algorithm in which we process superpositions of χ ∼ 10 6 stabilizer states and sample from the full n -bit output distribution, improving on previous simulations which used ∼ 10 3 stabilizer states and sampled only from single-qubit marginals. We also simulated instances of the Hidden Shift algorithm with circuits including up to 64 T gates or 16 CCZ gates; these simulations showcase the performance gains available by optimizing the decomposition of a circuit's non-Clifford components.
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
Figures

![Figure 3 The expected value of the cost function E ( β, γ ) computed using the Monte Carlo method by Van den Nest [55]. We consider a randomly generated instance of the Max E3LIN2 problem with n = 50 qubits and degree D = 4 .](https://figures.cochat.ai/paper-figures/bac90871a4ad4adba2e6425ade93920a/simulation-of-quantum-circuits-by-low-rank-stabilizer-decompositions-figure-3.png)
![Figure 4 Classical simulation of the QAOA algorithm: ( a ) Comparison between E ( γ ) and its estimate E sim ( γ ) obtained using the sum-over-Cliffords/Metropolis simulator. We consider a randomly generated instance of the problem with n = 50 qubits and degree D = 4 . For each data point 10 4 Metropolis steps were performed to approach the steady distribution P ( z ) . The estimate E sim ( γ ) was obtained by averaging the cost function C ( z ) over a subsequent s = 4 · 10 4 samples x from the output distribution of the simulator. Error bars represent the statistical error estimated using the MATLAB code due to Wolff [58] (for estimating errors in Markov chain Monte Carlo data) ( b ) The number of stabilizer states k used by the sum-over-Cliffords simulator was chosen as in Eq. (19) with δ = 0 . 05 for pink data points and δ = 0 . 15 for blue data points.](https://figures.cochat.ai/paper-figures/d1655f1355224605ab2a24bdc47f1e27/simulation-of-quantum-circuits-by-low-rank-stabilizer-decompositions-figure-4.png)






![Figure 8 The approximate stabilizer rank of | θ ⊗ n 〉 is upper bounded as χ δ ( θ ⊗ n ) ≤ δ -2 ξ ( θ ) n , where ξ ( θ ) = (cos( θ/ 2) + tan( π/ 8) sin( θ/ 2)) 2 is attained by the stabilizer decomposition from Eq. (163) . The red line shows the function ξ ( θ ) for θ ∈ [0 , π/ 4] and the blue line shows the function g ( θ ) = 2 h 2 (cos 2 ( θ/ 2)) where h 2 is the binary entropy. Our upper bound on the approximate stabilizer rank of θ ⊗ n performs better that obtained by a naive expansion in the 0 , 1 basis whenever the red line lies below the blue line.](https://figures.cochat.ai/paper-figures/2fdfb368958d401e9536e184366cb621/simulation-of-quantum-circuits-by-low-rank-stabilizer-decompositions-figure-8.png)
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Simulation of such logical circuits is challenging because of the high connectivity (rendering tensor networks inefficient) and large numbers of non-Cliffords50.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [50]
The cited source says what the claim attributes to it.
In the citing paper
“state-of-the-art Clifford + T simulators can handle roughly 16 CCZ gates50.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [50]
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830 · cited 1×
“As a main application of our simulation algorithms we envision verification of noisy intermediatesize quantum circuits [49] in the regime when a brute-force classical simulation may be impractical [3, 35, 44].”
MethodProbability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 1×
“[28]).”
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 2×
“It is known that stabilizer operations augmented with preparation of certain single-qubit “magic states” become computationally universal [12].”
BackgroundSelf-citationImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 4×
“i noise models [27] only requires quantum circuits composed of Cliord gates and Pauli measurements{which can be easily simulated classically for thousands of qubits using the Gottesman-Knill theorem [2,6]. Furthermore, it is known that Cliord circuits can be promoted to universal quantum computation when provided with…”
BackgroundMethodInfluentialQiskit: 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
Qiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562111 · Cited by 1,314
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 1×
“Several tensor-based simulators have been developed [17, 39, 48] for geometrically local shallow quantum circuits that include only nearest-neighbor gates on a 2D grid of qubits [9].”
Background
Research works printed but not linked: 2
- Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev. Interactive proofs for quantum computations. arXiv preprint arXiv:1704.04487, 2017. · arXiv
- David Gross, Sepehr Nezami, and Michael Walter. Schur-Weyl duality for the Clifford group with applications: Property testing, a robust Hudson theorem, and de Finetti representations. arXiv preprint arXiv:1712.08628, 2017. · 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
“Simulation of such logical circuits is challenging because of the high connectivity (rendering tensor networks inefficient) and large numbers of non-Cliffords 50 .”
BackgroundEvidence for the utility of quantum computing before fault tolerance
Kim, Y., Eddins, A., Anand, S., Wei, K. X., van den Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06096-3 · Cited by 1,050
“On the other hand, the classical simulations may also be improved by methods besides the pure-state tensor networks considered here, such as Heisenberg operator evolution methods, which have recently been applied to non-Clifford simulations 38 .”
MethodStim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
“This is far beyond the limit of existing classical algorithms that can simulate Clifford+ T circuits with about 50 T -gates 84,85 .”
BackgroundSelf-citationQulacs: a fast and versatile quantum circuit simulator for research purpose
Suzuki, Y., Kawase, Y., Masumura, Y., Hiraga, Y., Nakadai, M., Chen, J., Nakanishi, K. M., Mitarai, K., Imai, R., Tamiya, S., et al. (2021) · Quantum · doi:10.22331/q-2021-10-06-559 · Cited by 295
Metadata
- Authors
- Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M.
- Affiliations
- IBM (United States) (US)
- University College London (GB)
- University of Sheffield (GB)
- Venue
- Quantum
- Published
- 2019-09-02
- Volume
- 3
- Pages
- 181
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2885845431
- Cited by
- 302
- References
- 45
- Citations by year
- 2026: 46 · 2025: 90 · 2024: 47 · 2023: 34 · 2022: 38 · 2021: 24 · 2020: 13 · 2019: 10
- FWCI
- 9.69
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- ARAN (University of Galway Research Repository) (Ollscoil na Gaillimhe – University of Galway) (acceptedVersion, cc-by-nc-nd)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- ARAN (University of Galway Research Repository) (Ollscoil na Gaillimhe – University of Galway) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- Engineering and Physical Sciences Research Council (M013243/1, EP/M013243/1, EP/M024261/1, EP/L015242/, EP/L015242/1)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- stabilizer states, classical simulation of quantum circuits, non-Clifford gates, Clifford gates, quantum approximate optimization algorithm, T-gate, CCZ gate
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: Simulation of quantum circuits by low-rank stabilizer decompositions. https://app.cochat.ai/papers/10.22331/q-2019-09-02-181
- The paper
- Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019). Simulation of quantum circuits by low-rank stabilizer decompositions. Quantum. https://doi.org/10.22331/q-2019-09-02-181
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.