Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Bravyi, Sergey, Browne, Dan, Calpin, Padraic, Campbell, Earl, Gosset, David, Howard, Mark · 2019 · Quantum

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2019-09-02-181

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 2 State injection gadgets for single-qubit T gate and general multi-qubit phase gate V . A correction unitary V X j V † is required whenever measurement j registers a '1' outcome. If all corrections are Clifford then gadgets can be deployed with no additional resource requirements.
Figure 2 State injection gadgets for single-qubit T gate and general multi-qubit phase gate V . A correction unitary V X j V † is required whenever measurement j registers a '1' outcome. If all corrections are Clifford then gadgets can be deployed with no additional resource requirements.CC-BY · From the PDF
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 .
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 .CC-BY · From the PDF
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.
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.CC-BY · From the PDF
Image 4
CC-BY · From the PDF
Image 5
CC-BY · From the PDF
(b) Simulation time for Hidden Shift circuits using the Sum-over-Cliffords method from 4.1.
(b) Simulation time for Hidden Shift circuits using the Sum-over-Cliffords method from 4.1.CC-BY · From the PDF
(d) Simulated output, ˆ s , versus the true shift string, s , for the case T SoC with 16 Toffoli gates (i.e corresponding to the open rectangle on the right of 5c).
(d) Simulated output, ˆ s , versus the true shift string, s , for the case T SoC with 16 Toffoli gates (i.e corresponding to the open rectangle on the right of 5c).CC-BY · From the PDF
Figure 6 The exact stabilizer rank (numerically found) for n copies of a single qubit state: for the T state and for generic single qubit states.
Figure 6 The exact stabilizer rank (numerically found) for n copies of a single qubit state: for the T state and for generic single qubit states.CC-BY · From the PDF
Figure 7 The color indicates the value of ξ for single-qubit states in the first octant of the Bloch sphere. This function controls the upper bound on the approximate stabilizer rank as in Eq. (162) .
Figure 7 The color indicates the value of ξ for single-qubit states in the first octant of the Bloch sphere. This function controls the upper bound on the approximate stabilizer rank as in Eq. (162) .CC-BY · From the PDF
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.
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.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 45 references

Research works printed but not linked: 2

  1. Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev. Interactive proofs for quantum computations. arXiv preprint arXiv:1704.04487, 2017. · arXiv
  2. 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

See all 303

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
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.