The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index.
Encoding a magic state with beyond break-even fidelity
Open accessPublished version of a preprint
Abstract
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise 1–8 . We can complete a universal set of logic gates by producing special resources called magic states 9–11 . It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing 12 , namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.
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





![Extended Data Fig. 2 Small codes. We describe how to encode these codes into higher distance codes. (left) The error-detecting code prepared in the main text. We refer to this code as the [[4, 2, 2]] code to distinguish it from the [[4, 1, 2]] code shown to the right of the figure. The [[4, 2, 2]] code has stabilizer generators SX = X1X2X3X4 and SZ = Z1Z2Z3Z4 and logical operators X¯A=X1X2, Z¯A=Z1Z3, X¯B=X1X3 and Z¯B=Z1Z2 for logical operators indexed A and B. (right). The [[4, 1, 2]] code is an error detecting code that encodes a single logical qubit. It is closely related to the error detecting code shown (left). It has stabilizer generators SX = X1X2X3X4, ST^Z=Z1Z2 and SB^Z=Z3Z4, and logical operators X¯=X1X2, Z¯=Z1Z3.](https://figures.cochat.ai/paper-figures/b8a170d2d28a439fb540888163789411/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-6.jpg)
![Extended Data Fig. 3 Injecting an encoded magic state into the surface code. The magic state is initially encoded on a [[4, 1, 2]] code. (left) The standard surface code with physical qubits on the vertices of a square lattice and standard Pauli-X and Pauli-Z type stabilizers marked by lattice faces. Supports for the logical Pauli-X and Pauli-Z operators are shown in green and blue, respectively. (right) We show the initial state that is injected into the surface code. The [[4, 1, 2]] code is shown in red in the bottom-left corner. The remaining qubits of the surface code lattice are prepared in a product state, where blue (green) qubits are prepared in the ∣0⟩v (∣+⟩v) state. We show the code deformation stabilizers, i.e. Sdef.=Sinit.∩Sfin., shaded on the right lattice.](https://figures.cochat.ai/paper-figures/0e1b74472a074cda9c335112fd7c8ced/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-7.jpg)
![Extended Data Fig. 4 Injecting an encoded state into the heavy-hex code. The injected state is initially encoded on the [[4, 1, 2]] code. (left) A lattice with qubits on the vertices. We show the support of a single Pauli-Z gauge check and a Pauli-X stabilizer operator. The support of the Pauli-Z gauge check is shown in dark gray. The Pauli-X stabilizer operator is shaded grey towards the top of the lattice. We also show the support of a Pauli-X- and Pauli-Z-type stabilizer in green and blue, respectively. (right) The stabilizer group for Sinit.. The [[4, 1, 2]] code is outlined in red in the bottom-left corner of the lattice. The other qubits are initialized in a product state with blue (green) qubits initialized in the ∣0⟩ (∣+⟩) state. Stabilizer operators Sdef.=Sinit.∩Sfin. are shaded in the figure.](https://figures.cochat.ai/paper-figures/7af56c3a078a40c386a3643db9b9952f/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-8.jpg)
![Extended Data Fig. 5 Injecting an encoded two-qubit state into the color code. The state is initially encoded with the [[4, 2, 2]] code. A qubit is supported on each of the vertices of the lattice. We initialize the system Sinit. such that the [[4, 2, 2]] code, shaded in red, is supported on a weight-four face in the bottom left corner of the lattice. The other qubits are prepared in Bell pairs on the highlighted blue and green edge terms. As such, we shade the faces of Sdef. where both a Pauli-X and Pauli-Z stabilizer is supported. The support of the logical operators on the left and bottom boundaries are highlighted in blue and green, respectively.](https://figures.cochat.ai/paper-figures/e36c2c0d3eaf41268ac7e565c67f9604/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-9.jpg)
![Extended Data Fig. 6 Preparing a CZ state over two [[4, 1, 2]]-codes. At step 1 the codes are prepared. The [[4, 2, 2]] code that encodes the two-qubit CZ-state is represented by the red square where its four qubits lie at the vertices of the square. This preparation is described in the main text. The code is prepared adjacent to a [[4, 1, 2]]-code that is initialized in an eigenstate of the ∣+⟩ state. The qubits in the figure are indexed according to the qubit-map shown in Extended Data Fig. 7. At step 2 the qubits are transported in order to perform a logical parity measurement in step 3 using the heavy-hex lattice geometry. Note that the qubit indices have changed. This step can be performed with swaps, for instance, as shown in Extended Data Fig. 7(top). At step 3 a logical parity measurement is made. It can be performed in a fault-tolerant manner using qubits 5, 10, and 16, as shown in the green box in Extended Data Fig. 7(bottom). We complete the operation by measuring the logical operator Z¯2 in step 4. This weight-two measurement can be repeated in two locations on the [[4, 2, 2]] code such that a single measurement error can be detected. This final measurement projects the [[4, 2, 2]] code onto the [[4, 1, 2]]-code by reassigning the Z¯B logical operators as stabilizers of the system.](https://figures.cochat.ai/paper-figures/fb862f853d7f48b5be985d7ab9cbbaba/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-10.jpg)
![Extended Data Fig. 7 Mapping the encoding onto the heavy-hexagonal lattice geometry. We encode the CZ-state onto two copies of the [[4, 1, 2]]-code. (top) We prepare the encoded CZ-state as defined in the main text using the qubits outlined in the purple box. We additionally prepare a [[4, 1, 2]]-code in the logical ∣+⟩ state using the qubits outlined in the orange box. To perform step 3, as shown in Extended Data Fig. 6, we first move the codes, as in step 2. This can be performed using swap gates between adjacent qubits. Swap gates are performed, first, between pairs of qubits marked by a blue arrow, and then between pairs of qubits marked with green arrows. Each set of swap gates, the blue set and the green set, can be performed in parallel. Completing the swap operations moves the codes over the qubit map. We show the locations of the codes after the swap operations by outlining their supporting qubits with a purple and orange box, respectively, in the bottom figure. In their new locations, the logical parity measurement of step 3 can be performed using ancillary qubits 5,10 and 16, outlined in the green box in the bottom figure. At the final step we facilitate the measurement of Z4Z6 and Z15Z17 using ancillary qubits 5 and 16, respectively.](https://figures.cochat.ai/paper-figures/eccd215df71a49998a83779b52023bff/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-11.jpg)

![Extended Data Fig. 9 Combining readout-error mitigation with state tomography methods. (a) State infidelity for the standard (orange) vs. error-suppressed (blue) schemes using different tomographic methods; error-bars represent 1σ std. dev. from bootstrapping. On the x-axis, a state is reconstructed with either logical tomography (Logical) or physical tomography after logical projection (Physical); tomography assumes either ideal projectors, as in the main text, or noisy POVMs representing uncorrelated, local readout errors (RO) on terminal data qubit measurements. Raw physical tomography (Raw Phys.) refers to the state on four physical qubits prior to logical projection. Red dotted (green dot-dashed) lines show lowest (average) state infidelities of the two-qubit unencoded magic state prepared with RO mitigation. With RO mitigation, logical tomography outperforms the min. unencoded state supporting conclusions in the main text. (b)-(e) Heatmap of state infidelity vs. avg. measurement error, p ≡ P(1∣0), q ≡ P(0∣1). Experimental tomography data is fit to noisy POVMs using a parameterized A-matrix, A ≔ [[1 − p, q], [p, 1 − q]], where p, q are constant for all qubits and time. Experimental readout calibrations data are averaged over time and qubits, and correspond to a single state infidelity in (b)-(e) (black dots). These state infidelities (black dots) do not coincide with local minima (red stars) or even high-fidelity regions. (f)-(g) Readout calibration measurements of p, q vs. time for all four data qubits over several days; average rates (black solid) are used in (b)-(e) for state fidelities marked by black dots.](https://figures.cochat.ai/paper-figures/4d5be64f775a429fb1fb0f033dd6f0cc/encoding-a-magic-state-with-beyond-break-even-fidelity-figure-13.jpg)
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 check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Although many platforms have demonstrated different features of quantum error correction14–20, no quantum processor has definitively shown below-threshold performance.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [19]
Experimental — accuracy not yet measured
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
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
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×
“We distil magic states to complete a universal set of fault-tolerant logic gates that is needed for large-scale quantum computing with low-density parity-check code architectures 13–18 .”
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
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103 · cited 1×
“To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise 1–8 .”
Deterministic quantum teleportation of atomic qubits
Barrett, M. D., Chiaverini, J., Schaetz, T., Britton, J., Itano, W. M., Jost, J. D., Knill, E., Langer, C., Leibfried, D., Ozeri, R., et al. (2004) · Nature · doi:10.1038/nature02608 · Cited by 975
Extending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
Deterministic quantum teleportation with atoms
Riebe, M., Häffner, H., Roos, C. F., Hänsel, W., Benhelm, J., Lancaster, G. P. T., Körber, T. W., Becher, C., Schmidt-Kaler, F., James, D. F. V., et al. (2004) · Nature · doi:10.1038/nature02570 · Cited by 925
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
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
Research works printed but not linked: 5
- Meier, A. M., Eastin, B. & Knill, E. Magic-state distillation with the four-qubit code. Quantum Inf. Comput. 13, 195–209 (2013).
- Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quantum Info. Comput. 14, 1338–1372 (2014).
- Yoder, T. J., Takagi, R. & Chuang, I. L. Universal fault-tolerant gates on concatenated stabilizer codes. Phys. Rev. X 6, 031039 (2016).
- Brown, B. J., Laubscher, K., Kesselring, M. S. & Wootton, J. R. Poking holes and cutting corners to achieve Clifford gates with the surface code. Phys. Rev. X 7, 021029 (2017).
- Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology (1997).
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“[18] and PyMatching [19].”
IBM quantum computers: evolution, performance, and future directions
AbuGhanem, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07047-7 · Cited by 336
Experimental demonstration of logical magic state distillation
Rodriguez, P. S., Robinson, J. M., Jepsen, N., He, Z., Duckering, C., Zhao, C., Wu, K.-H., Campo, J., Bagnall, K. R., Kwon, M., et al. (2025) · Nature · doi:10.1038/s41586-025-09367-3 · Cited by 238
Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C. J., Lishman, J., Gacon, J., Martiel, S., Nation, P. D., Bishop, L. S., Cross, A. W., et al. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2405.08810 · Cited by 208
Self-citationBenchmarking quantum computers
Proctor, T. J., Young, K. C., Baczewski, A., & Blume-Kohout, R. (2025) · Nature Reviews Physics · doi:10.1038/s42254-024-00796-z · Cited by 180
Metadata
- Authors
- Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., Cross, A. W., Takita, M., & Brown, B. J.
- Affiliations
- IBM Research - Almaden (US)
- IBM Research - Thomas J. Watson Research Center (US)
- IBM (Germany) (DE)
- IBM Research - Zurich (CH)
- Corresponding author
- Brown, Benjamin J.
- ORCID
- Venue
- Nature
- Published
- 2024-01-10
- Volume
- 625
- Issue
- 7994
- Pages
- 259-263
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- PMC
- PMC10781628
- OpenAlex
- W4390707737
- Cited by
- 115
- References
- 71
- Citations by year
- 2026: 28 · 2025: 59 · 2024: 27
- FWCI
- 16.79
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature (publishedVersion, cc-by)
- Research Square (acceptedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion, other-oa)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (51NF40, 180604)
- Intelligence Advanced Research Projects Activity (W911NF-16-1-0114)
- Army Research Office (W911NF-21-1-, W911NF-21-1-0002, W911NF-16-1-0114, W911NF-16-1-, W911NF)
- 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
- magic state distillation, superconducting qubits, fault-tolerant quantum computing, error correction, adaptive circuits, mid-circuit measurement, universal quantum gates
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: Encoding a magic state with beyond break-even fidelity. https://app.cochat.ai/papers/10.1038/s41586-023-06846-3
- The paper
- Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., Cross, A. W., Takita, M., & Brown, B. J. (2024). Encoding a magic state with beyond break-even fidelity. Nature. https://doi.org/10.1038/s41586-023-06846-3
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.