The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Open accessAbstract
We present magic state factory constructions for producing | C C Z ⟩ states and | T ⟩ states. For the | C C Z ⟩ factory we apply the surface code lattice surgery construction techniques described in \cite{fowler2018} to the fault-tolerant Toffoli \cite{jones2013, eastin2013distilling}. The resulting factory has a footprint of 12 d × 6 d (where d is the code distance) and produces one | C C Z ⟩ every 5.5 d surface code cycles. Our | T ⟩ state factory uses the | C C Z ⟩ factory's output and a catalyst | T ⟩ state to exactly transform one | C C Z ⟩ state into two | T ⟩ states. It has a footprint 25 % smaller than the factory in \cite{fowler2018} but outputs | T ⟩ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case θ = 22.5 ∘ produces a particularly efficient circuit for producing | T ⟩ states. Compared to using the 12 d × 8 d × 6.5 d | T ⟩ factory of \cite{fowler2018}, our | C C Z ⟩ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm \cite{shor1994} and the chemistry algorithm of Babbush et al. \cite{babbush2018}. Assuming a physical gate error rate of 10 − 3 , our CCZ factory can produce ∼ 10 10 states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to ∼ 10 12 by increasing the factory footprint ∼ 20 % .
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 4 Comparison of the to-scale diagram style from [15] with the exaggerated-spacing diagram style used by this paper. The to-scale diagram style emphasizes how things fit together and is ideal when reasoning geometrically. The exaggerated-spacing diagram style emphasize how things connect together and is ideal when reasoning topologically. An even more abstract diagram style for lattice surgery is the ZX calculus [10]. In Figure 9 we show how translate a topological diagram into a ZX calculus graph.](https://figures.cochat.ai/paper-figures/18a3b558f03b4d1ba4247345ea271d25/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-4.png)
![Figure 5 Quantum circuit for the 8 | T 〉 28 ϵ 2 → | CCZ 〉 factory. A rewrite of figure 3 from [21]. The box with blue circles in the top right is a state display from the online simulator Quirk, with each circle representing an amplitude (the radius of the colored circle indicates the amplitude's magnitude, and the angle of the line rooted at the center of the circle indicates the phase). The state display is showing that the output state is a | CCZ 〉 state. The small circled pluses in the circuit are X-axis controls (equivalent to a normal control surrounded by Hadamard gates); whenever one of these controls directly precedes a measurement the measurement corresponds to a Pauli product measurement. The post-selection operation represents the classical control software determining if the an error was detected; if it fails the output must be discarded. Pauli operations and classically-controlled Pauli operations appear here, but not in Figure 8, because they are performed entirely within classical control software. The circuit can be opened in Quirk by following this link. Discerning readers can follow the link and edit the circuit in order to confirm that adding a single Z error by any T gate is caught by the post-selection, and also that all possible pairs of Z errors escape detection.](https://figures.cochat.ai/paper-figures/5783162c4d294ae991a9ba8431a7079f/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-5.png)


![Figure 8 3D topological diagram for our construction of the 8 | T 〉 28 ϵ 2 → | CCZ 〉 factory. The spacing between qubits has been increased to make it possible to see the internal structure. White (black) surfaces correspond to boundaries where chains of Z (X) errors can terminate. Corresponds to the time slices from Figure 7. Time increases from bottom to top. The vertical poles correspond to qubits from Figure 5. Red boxes indicate connection points for noisy | T 1 〉 states produced by a level 1 T factory. The green boxes atop the columns are performing either an X or Y basis measurement at half code distance, as described in [15], by including or omitting an S gate performed using twists [6]. Using half code distance is acceptable because, at the location in the factory where these operations are performed (i.e. after the T injections), individual errors are detected as distillation failures. The labels along the right hand side indicate the stabilizer measurements occurring at each time. The red/blue coloring of labels matches the red/blue coloring of Figure 7. Note that inserting the | T 1 〉 state has a depth of 1.5, unlike the other steps which have depth 1. Each horizontal bar linking several vertical poles is a stabilizer measurement of a product of logical X observables. The groups of three qubits highlighted orange and exiting left are the | CCZ 〉 states being output (note that the middle pole of each | CCZ 〉 state is rotated with respect to the others, with white on top instead of black on top). The two instances of the factory that are shown differ slightly. Their qubits have been permuted so that each factory's top layer fits into a void at the bottom of the following factory, saving a layer of depth.](https://figures.cochat.ai/paper-figures/2e9d8564b05e47079ea3fea3e5fe801f/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-8.png)
![Figure 9 A substitution procedure (left) for translating our 3D topological diagrams into (nearly) the ZX calculus [10], as well as an example translation of one of the CCZ factories from Figure 8 (right). We use black (white) nodes instead of green (red) nodes (the usual notation for the ZX calculus) so that the node colors match the boundary colors in the 3D topological diagrams. Pieces with two ports are translated into edges or degree-2 nodes of either color. Pieces with three or more ports are translated into a node of matching color. The Z ⊗ Z measurement of a qubit vs a | T 〉 state followed by measuring the qubit in the X or Y basis depending on the outcome of the parity measurement is translated into a (non-standard) red node. The red node can be expanded into a proper ZX calculus construction, but we do not attempt to do so. The ZX calculus graph is more amenable to verification than the 3D diagram. The reverse translation, from ZX calculus graph to 3D topological diagram, is often more difficult.](https://figures.cochat.ai/paper-figures/303582b81e6243a4badd6ff49669a751/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-9.png)




![Figure 14 Generalized phase catalysis circuit. Given a Z θ | + 〉 catalyst, two Z θ operations can be applied via stabilizer gates, one AND computation gate (notation from [17]), and one Z 2 θ gate.](https://figures.cochat.ai/paper-figures/9547b2630a7843cfbb106bae689d318e/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-14.png)
![Figure 15 Using a catalyst | √ T 〉 state to create 2 additional | √ T 〉 states using cheap stabilizer operations, one T gate, and one AND computation. Has a T-cost of 5 [21, 17], implying the T-cost of a √ T state is at most 2 . 5 .](https://figures.cochat.ai/paper-figures/7cdd9238a2864a77b0f16c058d8d1eb4/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-15.png)
![Figure 16 3D topological diagram of a re-arrangement of the level 1 T factory from [15]. Quantities are quoted in units of d/ 2 instead of d because the factory is performed at half code distance. Improves the depth from 13 d/ 2 to 12 . 5 d/ 2 , increasing the output rate by roughly 4%, which ensures four level 1 T factories is sufficient to feed our T-catalyzed factory. There are two variants of the factory: the one shown with an output on the left (A) and the one shown with an output on the right (B). The qubits of A and B have been permuted so that their first stabilizer measurement involves qubits that are all on the same side, allowing the stabilizer measurement to be performed without using a central bar. The second measurement of B (the first measurement using the central bar) is over the back 8 qubits and the last measurement of A is over the front 8 qubits. This allows B to be lowered by half of d/ 2 , so that B rests on the level 0 | T 〉 injections to the right of A. The transition back from B to A cannot be lowered quite as far, because the top of B would intersect the first central bar used in A. Overall this optimization saves 0 . 5 d/ 2 depth relative to the interleaving technique used in [15].](https://figures.cochat.ai/paper-figures/1657229066e14f35a685f95167e62dc7/efficient-magic-state-factories-with-a-catalyzed-mml-math-xmlns-mml-http-www-w3-figure-16.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.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“…based on the surface code (a likely component of future error corrected quantum computers due to the surface code’s comparatively high threshold and planar connectivity requirements [3, 11, 29, 30, 13]), the cost of a quantum algorithm is well approximated by the number of non-Clifford operations.”
BackgroundSelf-citationGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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×
“com distillation [5], and the cost of state distillation is large.”
BackgroundMethodClassical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598 · cited 3×
“Over the past decade, thanks to techniques such as block codes [4, 16], bridge compression [14], and many others [19, 8, 9, 25], the cost of magic state distillation has steadily decreased.”
BackgroundMethodSelf-citationA Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
Research works printed but not linked: 2
- Niel de Beaudrap and Dominic Horsman. The zx calculus is a language for surface code lattice surgery. arXiv preprint arXiv:1704.08670, 2017. URL https://arxiv.org/abs/1704.08670. · arXiv
- Yunseong Nam, Yuan Su, and Dmitri Maslov. Approximate quantum fourier transform with o(n log(n)) t gates. arXiv preprint arXiv:1803.04933, 2018. URL https://arxiv.org/abs/1803.04933. · arXiv
Cited by
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Self-citationStim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415
Self-citationA Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033055 · Cited by 252
Metadata
- Authors
- Gidney, C., & Fowler, A. G.
- Affiliations
- Google (United States) (US)
- ORCID
- Fowler, Austin G.
- Venue
- Quantum
- Published
- 2019-04-30
- Volume
- 3
- Pages
- 135
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2952708034
- Cited by
- 152
- References
- 24
- Citations by year
- 2026: 23 · 2025: 33 · 2024: 22 · 2023: 13 · 2022: 15 · 2021: 16 · 2020: 18 · 2019: 11
- FWCI
- 6.96
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- Toffoli gate, surface code, lattice surgery, fault-tolerant quantum computing, quantum chemistry algorithms, Shor's algorithm
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: Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation. https://app.cochat.ai/papers/10.22331/q-2019-04-30-135
- The paper
- Gidney, C., & Fowler, A. G. (2019). Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation. Quantum. https://doi.org/10.22331/q-2019-04-30-135
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.