Error-corrected gates on an encoded qubit
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
To reach their full potential, quantum computers need to be resilient to noise and decoherence. In such a fault-tolerant quantum computer, errors must be corrected in real time to prevent them from propagating between components1,2. This requirement is especially pertinent while applying quantum gates, where the interaction between components can cause errors to spread quickly throughout the system. However, the large overhead involved in most fault-tolerant architectures2,3 makes implementing these systems a daunting task, motivating the search for hardware-efficient alternatives4,5. Here, we present a gate enacted by an ancilla transmon on a cavity-encoded logical qubit that is fault-tolerant to ancilla decoherence and compatible with logical error correction. We maintain the purity of the encoded qubit by correcting ancilla-induced errors in real time, yielding a reduction of the logical gate error by a factor of two in the presence of naturally occurring decoherence. We also demonstrate a sixfold suppression of the gate error with increased ancilla relaxation errors and a fourfold suppression with increased ancilla dephasing errors. The results demonstrate that bosonic logical qubits can be controlled by error-prone ancilla qubits without inheriting the ancilla’s inferior performance. As such, error-corrected ancilla-enabled gates are an important step towards fault-tolerant processing of bosonic qubits. Error-corrected quantum gates that can tolerate dominant errors during the execution of quantum operations have been demonstrated. Substantial improvement of the gate fidelity sheds light on fault-tolerant universal quantum computation.
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
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
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
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
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
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
Self-citationRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Encoding a qubit in a trapped-ion mechanical oscillator
Flühmann, C., Nguyen, T. L., Marinelli, M., Negnevitsky, V., Mehta, K., & Home, J. P. (2019) · Nature · doi:10.1038/s41586-019-0960-6 · Cited by 394
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
Cited by
Circuit quantum electrodynamics
Blais, A., Grimsmo, A. L., Girvin, S. M., & Wallraff, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025005 · Cited by 1,931
Beating the break-even point with a discrete-variable-encoded logical qubit
Ni, Z., Li, S., Deng, X., Cai, Y., Zhang, L., Wang, W., Yang, Z.-B., Yu, H., Yan, F., Liu, S., et al. (2023) · Nature · doi:10.1038/s41586-023-05784-4 · Cited by 176
Error correction of a logical grid state qubit by dissipative pumping
de Neeve, B., Nguyen, T.-L., Behrle, T., & Home, J. P. (2022) · Nature Physics · doi:10.1038/s41567-021-01487-7 · Cited by 152
Model-Free Quantum Control with Reinforcement Learning
Sivak, V. V., Eickbusch, A., Liu, H., Royer, B., Tsioutsios, I., & Devoret, M. H. (2022) · Physical Review X · doi:10.1103/physrevx.12.011059 · Cited by 130
“Recently, it was demonstrated that SNAP can be made first-order path independent with respect to ancilla qubit decay [72,73].”
Hardware-efficient quantum error correction via concatenated bosonic qubits
Putterman, H., Noh, K., Hann, C. T., MacCabe, G. S., Aghaeimeibodi, S., Patel, R. N., Lee, M., Jones, W. M., Moradinejad, H., Rodriguez, R., et al. (2025) · Nature · doi:10.1038/s41586-025-08642-7 · Cited by 108
Self-citation
Metadata
- Authors
- Reinhold, P., Rosenblum, S., Ma, W.-L., Frunzio, L., Jiang, L., & Schoelkopf, R. J.
- Venue
- Nature Physics
- Published
- 2020-06-08
- Volume
- 16
- Issue
- 8
- Pages
- 822-826
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W3033935884
- Cited by
- 90
- References
- 11
- FWCI
- 4.64
- Type
- journal article
- Language
- en
- Open access
- green
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: Error-corrected gates on an encoded qubit. https://app.cochat.ai/papers/10.1038/s41567-020-0931-8
- The paper
- Reinhold, P., Rosenblum, S., Ma, W.-L., Frunzio, L., Jiang, L., & Schoelkopf, R. J. (2020). Error-corrected gates on an encoded qubit. Nature Physics. https://doi.org/10.1038/s41567-020-0931-8
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.