Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Advertisement

Nature Communications
  • View all journals
  • Search
  • My Account Login
  • Content Explore content
  • About the journal
  • Publish with us
  • Sign up for alerts
  • RSS feed
  1. nature
  2. nature communications
  3. articles
  4. article
Demonstration of high-fidelity entangled logical qubits using transmons
Download PDF
Download PDF
  • Article
  • Open access
  • Published: 27 February 2026

Demonstration of high-fidelity entangled logical qubits using transmons

  • Arian Vezvaee  ORCID: orcid.org/0000-0001-7691-28641,2,3,
  • Vinay Tripathi2,4 nAff8,
  • Mario Morford-Oberst  ORCID: orcid.org/0009-0000-7102-37341,2,
  • Friederike Butt  ORCID: orcid.org/0009-0007-8954-12745,6,
  • Victor Kasatkin1,2 &
  • …
  • Daniel A. Lidar  ORCID: orcid.org/0000-0002-1671-15151,2,3,4,7 

Nature Communications , Article number:  (2026) Cite this article

We are providing an unedited version of this manuscript to give early access to its findings. Before final publication, the manuscript will undergo further editing. Please note there may be errors present which affect the content, and all legal disclaimers apply.

Subjects

  • Quantum information
  • Qubits
  • Theoretical physics

Abstract

Quantum error correction (QEC) codes are necessary to fault-tolerantly operate quantum computers. However, every such code is inherently limited by its inability to detect logical errors. Here, we propose and implement a method that leverages dynamical decoupling (DD) to drastically suppress logical errors. The key to achieving this is to use the normalizer elements of the QEC code as DD pulses, which we refer to as normalizer dynamical decoupling (NDD). The resulting hybrid QEC-NDD strategy is in principle capable of handling arbitrary weight errors. We test an error detecting version of this strategy using IBM transmon devices and the [[4, 2, 2]] code, demonstrating performance that significantly exceeds the capabilities of using either this code or DD in isolation. We present a method that allows for the detection of logical errors affecting logically encoded Bell states, which, in this case, arise primarily from crosstalk among physical qubits. Building on this, we experimentally demonstrate high-fidelity entangled logical qubits. The fidelities we achieve are beyond-breakeven, i.e., they significantly exceed the corresponding fidelities of unprotected entangled qubits in the same setting.

Data availability

All data are available from the corresponding authors upon request.

Code availability

Qiskit experiments and analysis codes that support the findings of this study are available from the corresponding authors upon request.

References

  1. Shor, P. W. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, R2493 (1995).

    Google Scholar 

  2. Steane, A. M. Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793 (1996).

    Google Scholar 

  3. Calderbank, A. R. & Shor, P. W. Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098 (1996).

    Google Scholar 

  4. Aharonov, D. and Ben-Or, M., Fault tolerant quantum computation with constant error. In Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), 176. https://doi.org/10.1137/S0097539799359385 (ACM, 1997).

  5. Gottesman, D. Theory of fault-tolerant quantum computation. Phys. Rev. A 57, 127 (1998).

    Google Scholar 

  6. Knill, E., Laflamme, R. & Zurek, W. H. Resilient quantum computation. Science 279, 342 (1998).

    Google Scholar 

  7. Lidar, D. & Brun, T. (eds) Quantum Error Correction http://www.cambridge.org/9780521897877 (Cambridge University Press, 2013).

  8. Campbell, E. T., Terhal, B. M. & Vuillot, C. Roads towards fault-tolerant universal quantum computation. Nature 549, 172 EP (2017).

    Google Scholar 

  9. Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M. & Gambetta, J. M. Experimental demonstration of fault-tolerant state preparation with superconducting qubits. Phys. Rev. Lett. 119, 180501 (2017).

    Google Scholar 

  10. Harper, R. & Flammia, S. T. Fault-tolerant logical gates in the IBM quantum experience. Phys. Rev. Lett. 122, 080504 (2019).

    Google Scholar 

  11. Linke, N. M. et al. Fault-tolerant quantum error detection. Sci. Adv. 3, e1701074 (2017).

    Google Scholar 

  12. Krinner, S. et al. Realizing repeated quantum error correction in a distance-three surface code. Nature 605, 669 (2022).

    Google Scholar 

  13. Google Quantum AI and collaborators. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676 (2023).

  14. Bluvstein, D. et al. Logical quantum processor based on reconfigurable atom arrays. Nature 626, 58 (2023).

    Google Scholar 

  15. Postler, L. et al. Demonstration of fault-tolerant Steane quantum error correction. PRX Quantum 5, 030326 (2024).

    Google Scholar 

  16. Google Quantum AI and collaborators. Quantum error correction below the surface code threshold. Nature 638, 920 (2024).

  17. Reiher, M., Wiebe, N., Svore, K. M., Wecker, D. & Troyer, M. Elucidating reaction mechanisms on quantum computers. Proc. Nat. Acad. Sci. USA 114, 7555–7560 (2017).

  18. Gidney, C. How to factor 2048 bit RSA integers with less than a million noisy qubits. Preprint at https://doi.org/10.48550/arXiv.2505.1591 (2025).

  19. Dalzell, A. M. et al. Quantum Algorithms: A Survey of Applications and End-to-End Complexities. (Cambridge University Press, 2025). https://doi.org/10.1017/9781009639651.

  20. Preskill, J. Sufficient condition on noise correlations for scalable quantum computing. Quant. Inf. Comput. 13, 181 (2013).

    Google Scholar 

  21. Clader, B. D. et al. Impact of correlations and heavy tails on quantum error correction. Phys. Rev. A 103, 052428 (2021).

    Google Scholar 

  22. Knill, E. & Laflamme, R. Concatenated Quantum Codes. Preprint at https://doi.org/10.48550/arXiv.quant-ph/9608012 (1996).

  23. Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452 (2002).

    Google Scholar 

  24. Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).

    Google Scholar 

  25. Bombin, H. & Martin-Delgado, M. A. Topological quantum distillation. Phys. Rev. Lett. 97, 180501 (2006).

    Google Scholar 

  26. Breuckmann, N. P. & Eberhardt, J. N. Quantum low-density parity-check codes. PRX Quantum 2, 040101 (2021).

    Google Scholar 

  27. Viola, L., Knill, E. & Lloyd, S. Dynamical decoupling of open quantum systems. Phys. Rev. Lett. 82, 2417 (1999).

    Google Scholar 

  28. Tripathi, V. et al. Qudit dynamical decoupling on a superconducting quantum processor. Phys. Rev. Lett. 134, 050601 (2025).

    Google Scholar 

  29. Souza, A. M. Process tomography of robust dynamical decoupling with superconducting qubits. Quantum Inf. Process. 20, https://doi.org/10.1007/s11128-021-03176-z (2021).

  30. Rahman, A., Egger, D. J. & Arenz, C. Learning how to dynamically decouple by optimizing rotational gates. Phys. Rev. Appl. 22, 054074 (2024).

    Google Scholar 

  31. Jurcevic, P. et al. Demonstration of quantum volume 64 on a superconducting quantum computing system. Quantum Sci. Technol. 6, 025020 (2021).

    Google Scholar 

  32. Bäumer, E. et al. Efficient long-range entanglement using dynamic circuits. PRX Quantum 5, 030339 (2024).

    Google Scholar 

  33. Pokharel, B. & Lidar, D. A. Demonstration of algorithmic quantum speedup. Phys. Rev. Lett. 130, 210602 (2023).

    Google Scholar 

  34. Singkanipa, P., Kasatkin, V., Zhou, Z., Quiroz, G. & Lidar, D. A. Demonstration of algorithmic quantum speedup for an abelian hidden subgroup problem. Phys. Rev. X 15, 021082 (2025).

    Google Scholar 

  35. Ng, H. K., Lidar, D. A. & Preskill, J. Combining dynamical decoupling with fault-tolerant quantum computation. Phys. Rev. A 84, 012305 (2011).

    Google Scholar 

  36. Paz-Silva, G. A. & Lidar, D. A., Optimally combining dynamical decoupling and quantum error correction. Sci. Rep. 3, https://doi.org/10.1038/srep01530 (2013).

  37. Vezvaee, A., Benito, C., Morford-Oberst, M., Bermudez, A. & Lidar, D. A. Surface code scaling on heavy-hex superconducting quantum processors. Preprint at https://doi.org/10.48550/arXiv.2510.18847 (2025).

  38. Goto, H., Ho, Y. & Kanao, T. Measurement-free fault-tolerant logical-zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array. Phys. Rev. Res. 5, 043137 (2023).

    Google Scholar 

  39. Han, J.-X., Zhang, J., Xue, G.-M., Yu, H. & Long, G. Protecting logical qubits with dynamical decoupling. Phys. Rev. Applied 24, 024003 (2025).

  40. Quiroz, G. & Lidar, D. A. Optimized dynamical decoupling via genetic algorithms. Phys. Rev. A 88, 052306 (2013).

    Google Scholar 

  41. Genov, G. T., Schraft, D., Vitanov, N. V. & Halfmann, T. Arbitrarily accurate pulse sequences for robust dynamical decoupling. Phys. Rev. Lett. 118, 133202 (2017).

    Google Scholar 

  42. Tripathi, V. et al. Suppression of crosstalk in superconducting qubits using dynamical decoupling. Phys. Rev. Appl. 18, 024068 (2022).

    Google Scholar 

  43. Zhou, Z., Sitler, R., Oda, Y., Schultz, K. & Quiroz, G. Quantum crosstalk robust quantum control. Phys. Rev. Lett. 131, 210802 (2023).

    Google Scholar 

  44. Reichardt, B. W. et al. Fault-tolerant quantum computation with a neutral atom processor. Preprint at https://doi.org/10.48550/arXiv.2411.11822 (2025).

  45. Gupta, R. S. et al. Encoding a magic state with beyond break-even fidelity. Nature 625, 259–263 (2024).

    Google Scholar 

  46. Pokharel, B. & Lidar, D. Better-than-classical Grover search via quantum error detection and suppression. npj Quantum Inf. 10, 23 (2024).

  47. Zanardi, P. Symmetrizing evolutions. Phys. Lett. A 258, 77 (1999).

    Google Scholar 

  48. Maudsley, A. A. Modified carr-purcell-meiboom-gill sequence for nmr fourier imaging applications. J. Magn. Reson. (1969) 69, 488 (1986).

    Google Scholar 

  49. Khodjasteh, K. & Lidar, D. A. Fault-tolerant quantum dynamical decoupling. Phys. Rev. Lett. 95, 180501 (2005).

    Google Scholar 

  50. Szczygielski, K. & Alicki, R. Markovian theory of dynamical decoupling by periodic control. Phys. Rev. A 92, 022349 (2015).

    Google Scholar 

  51. Addis, C., Ciccarello, F., Cascio, M., Palma, G. M. & Maniscalco, S. Dynamical decoupling efficiency versus quantum non-markovianity. N. J. Phys. 17, 123004 (2015).

    Google Scholar 

  52. Arenz, C., Burgarth, D., Facchi, P. & Hillier, R., Dynamical decoupling of unbounded Hamiltonians. J. Math. Phys. 59, 032203 (2018).

  53. Mozgunov, E. & Lidar, D. Completely positive master equation for arbitrary driving and small level spacing. Quantum 4, 227 (2020).

    Google Scholar 

  54. Khodjasteh, K. & Lidar, D. A. Quantum computing in the presence of spontaneous emission by a combined dynamical decoupling and quantum-error-correction strategy. Phys. Rev. A 68, 022322 (2003).

    Google Scholar 

  55. Zanardi, P., Lidar, D. A. & Lloyd, S. Quantum tensor product structures are observable induced. Phys. Rev. Lett. 92, 060402 (2004).

    Google Scholar 

  56. Viola, L., Knill, E. & Lloyd, S. Dynamical generation of noiseless quantum subsystems. Phys. Rev. Lett. 85, 3520 (2000).

    Google Scholar 

  57. Zanardi, P. Stabilizing quantum information. Phys. Rev. A 63, 012301 (2000).

    Google Scholar 

  58. Quiroz, G. & Lidar, D. A. High-fidelity adiabatic quantum computation via dynamical decoupling. Phys. Rev. A 86, 042333 (2012).

    Google Scholar 

  59. Vezvaee, A., Tripathi, V., Kowsari, D., Levenson-Falk, E. & Lidar, D. A. Virtual-z gates and symmetric gate compilation. PRX Quantum 6, 020348 (2025).

    Google Scholar 

  60. Uhrig, G. S. Keeping a quantum bit alive by optimized π-pulse sequences. Phys. Rev. Lett. 98, 100504 (2007).

    Google Scholar 

  61. Wang, Z.-Y. & Liu, R.-B. Protection of quantum systems by nested dynamical decoupling. Phys. Rev. A 83, 022306 (2011).

    Google Scholar 

  62. Blais, A., Grimsmo, A. L., Girvin, S. M. & Wallraff, A. Circuit quantum electrodynamics. Rev. Mod. Phys. 93, 025005 (2021).

    Google Scholar 

  63. Zhang, J. et al. Demonstrating a universal logical gate set in error-detecting surface codes on a superconducting quantum processor. npj Quantum Inf. 11, 177 (2025).

  64. Hetényi, B. & Wootton, J. R. Creating entangled logical qubits in the heavy-hex lattice with topological codes. PRX Quantum 5, 040334 (2024).

    Google Scholar 

  65. Wei, K. X. et al. Hamiltonian engineering with multicolor drives for fast entangling gates and quantum crosstalk cancellation. Phys. Rev. Lett. 129, 060501 (2022).

    Google Scholar 

  66. Gottesman, D. Class of quantum error-correcting codes saturating the quantum hamming bound. Phys. Rev. A 54, 1862 (1996).

    Google Scholar 

  67. Vaidman, L., Goldenberg, L. & Wiesner, S. Error prevention scheme with four particles. Phys. Rev. A 54, R1745 (1996).

    Google Scholar 

  68. McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M. & Gambetta, J. M. Efficient z gates for quantum computing. Phys. Rev. A 96, 022330 (2017).

    Google Scholar 

  69. James, D. F. V., Kwiat, P. G., Munro, W. J. & White, A. G. Measurement of qubits. Phys. Rev. A 64, 052312 (2001).

    Google Scholar 

  70. Stehlik, J. et al. Tunable coupling architecture for fixed-frequency transmon superconducting qubits. Phys. Rev. Lett. 127, 080505 (2021).

    Google Scholar 

Download references

Acknowledgements

This material is based upon work supported by, or in part by, the Intelligence Advanced Research Projects Activity (IARPA), under the Entangled Logical Qubits program through Cooperative Agreement Number W911NF23-2-0216, by the U.S. Army Research Laboratory and the U.S. Army Research Office under contract/grant number W911NF2310255, and by the Defense Advanced Research Projects Agency under Agreement HR00112230006. The views, opinions and/or findings expressed are those of the author(s) and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government. This research was conducted using IBM Quantum Systems provided through the University of Southern California’s IBM Quantum Innovation Center. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team.

Author information

Author notes
  1. Vinay Tripathi

    Present address: IBM Quantum, Yorktown Heights, NY, USA

Authors and Affiliations

  1. Department of Electrical & Computer Engineering, University of Southern California, Los Angeles, CA, USA

    Arian Vezvaee, Mario Morford-Oberst, Victor Kasatkin & Daniel A. Lidar

  2. Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA, USA

    Arian Vezvaee, Vinay Tripathi, Mario Morford-Oberst, Victor Kasatkin & Daniel A. Lidar

  3. Quantum Elements Inc., Thousand Oaks, CA, USA

    Arian Vezvaee & Daniel A. Lidar

  4. Department of Physics & Astronomy, University of Southern California, Los Angeles, CA, USA

    Vinay Tripathi & Daniel A. Lidar

  5. Institute for Quantum Information, RWTH Aachen University, Aachen, Germany

    Friederike Butt

  6. Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich, Jülich, Germany

    Friederike Butt

  7. Department of Chemistry, University of Southern California, Los Angeles, CA, USA

    Daniel A. Lidar

Authors
  1. Arian Vezvaee
    View author publications

    Search author on:PubMed Google Scholar

  2. Vinay Tripathi
    View author publications

    Search author on:PubMed Google Scholar

  3. Mario Morford-Oberst
    View author publications

    Search author on:PubMed Google Scholar

  4. Friederike Butt
    View author publications

    Search author on:PubMed Google Scholar

  5. Victor Kasatkin
    View author publications

    Search author on:PubMed Google Scholar

  6. Daniel A. Lidar
    View author publications

    Search author on:PubMed Google Scholar

Contributions

A.V. and D.A.L. conceived the project. A.V. designed and performed the experiments. A.V., V.T., M.M.-O., and D.A.L. analyzed the data and results. V.T. designed the robust structure of sequences. M.M.-O., V.K., F.B., and D.A.L. designed and constructed the definitions and proofs of the theorems. All authors contributed to the writing of the manuscript.

Corresponding authors

Correspondence to Arian Vezvaee or Daniel A. Lidar.

Ethics declarations

Competing interests

The authors declare no competing interests.

Peer review

Peer review information

Nature Communications thanks Bence Hetényi and the other anonymous reviewers for their contribution to the peer review of this work. A peer review file is available.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

Transparent Peer Review File

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vezvaee, A., Tripathi, V., Morford-Oberst, M. et al. Demonstration of high-fidelity entangled logical qubits using transmons. Nat Commun (2026). https://doi.org/10.1038/s41467-026-70011-3

Download citation

  • Received: 08 July 2025

  • Accepted: 12 February 2026

  • Published: 27 February 2026

  • DOI: https://doi.org/10.1038/s41467-026-70011-3

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Download PDF

Advertisement

Explore content

  • Research articles
  • Reviews & Analysis
  • News & Comment
  • Videos
  • Collections
  • Subjects
  • Follow us on Facebook
  • Follow us on X
  • Sign up for alerts
  • RSS feed

About the journal

  • Aims & Scope
  • Editors
  • Journal Information
  • Open Access Fees and Funding
  • Calls for Papers
  • Editorial Values Statement
  • Journal Metrics
  • Editors' Highlights
  • Contact
  • Editorial policies
  • Top Articles

Publish with us

  • For authors
  • For Reviewers
  • Language editing services
  • Open access funding
  • Submit manuscript

Search

Advanced search

Quick links

  • Explore articles by subject
  • Find a job
  • Guide to authors
  • Editorial policies

Nature Communications (Nat Commun)

ISSN 2041-1723 (online)

nature.com sitemap

About Nature Portfolio

  • About us
  • Press releases
  • Press office
  • Contact us

Discover content

  • Journals A-Z
  • Articles by subject
  • protocols.io
  • Nature Index

Publishing policies

  • Nature portfolio policies
  • Open access

Author & Researcher services

  • Reprints & permissions
  • Research data
  • Language editing
  • Scientific editing
  • Nature Masterclasses
  • Research Solutions

Libraries & institutions

  • Librarian service & tools
  • Librarian portal
  • Open research
  • Recommend to library

Advertising & partnerships

  • Advertising
  • Partnerships & Services
  • Media kits
  • Branded content

Professional development

  • Nature Awards
  • Nature Careers
  • Nature Conferences

Regional websites

  • Nature Africa
  • Nature China
  • Nature India
  • Nature Japan
  • Nature Middle East
  • Privacy Policy
  • Use of cookies
  • Legal notice
  • Accessibility statement
  • Terms & Conditions
  • Your US state privacy rights
Springer Nature

© 2026 Springer Nature Limited

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing