Journal article · 2026 · Open access

Fault-tolerant execution of error-corrected quantum algorithms

Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas, Pablo Andres-Martinez, Tianyi Hao, Dylan Herman, Yuwei Jin, Karl Mayer, Chris N. Self, David Amaro, Ciarán Ryan-Anderson, Ruslan Shaydulin

Physical Review X · Published 9 October 2026 · DOI 10.1103/gnq3-c2df

Open full textCite this paper

In brief

“Fault-tolerant execution of error-corrected quantum algorithms” is a 2026 journal article by Michael A. Perlin and 11 co-authors, published in Physical Review X. OpenAlex counts 20 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Physical Review X.

Citations
20
Most cited in
2026 (19)
Field-weighted impact
26.72
References
96
Authors
12

Abstract

Scaling up quantum algorithms to tackle high-impact problems in science and industry requires quantum error correction and fault tolerance. While progress has been made in experimentally realizing error-corrected primitives, the end-to-end execution of logical quantum algorithms using only fault-tolerant (FT) components has remained out of reach. We demonstrate the FT and error-corrected execution of two quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA) and the Harrow-Hassidim-Lloyd (HHL) algorithm applied to the Poisson equation, on Quantinuum H2 and Helios trapped-ion quantum processors using the $[[7,1,3]]$ Steane code. For QAOA circuits on 5 and 6 logical qubits, we show performance improvements from increasing the number of QAOA layers and the number of $T$ gates used to approximate logical rotations, despite increased physical circuit complexity. We further show that QAOA circuits with up to 8 logical qubits and 9 logical $T$ gates perform similarly to unencoded circuits. For the largest QAOA circuits we run, with 12 logical (97 physical) qubits and 2132 physical two-qubit gates, we still observe better-than-random performance. Finally, we show that adding active QEC cycles and increasing the repeat-until-success limit of state preparation subroutines can improve the performance of a quantum algorithm, thereby demonstrating critical capabilities of scalable FT quantum computation. Our results are enabled by an FT logical $T$ gate implementation with an infidelity of $\sim 2.6(4)\times10^{-3}$ and dynamic circuits with measurement-dependent feedback. Our work demonstrates near-break-even performance of complex, error-corrected algorithmic quantum circuits using only FT components.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Perlin, M. A., He, Z., Armenakas, A. A., Andres-Martinez, P., Hao, T., Herman, D., Jin, Y., Mayer, K., Self, C. N., Amaro, D., Ryan-Anderson, C., & Shaydulin, R. (2026). Fault-tolerant execution of error-corrected quantum algorithms. Physical Review X. https://doi.org/10.1103/gnq3-c2df

MLA 9

Perlin, Michael A., et al. “Fault-tolerant execution of error-corrected quantum algorithms.” Physical Review X, 2026. https://doi.org/10.1103/gnq3-c2df.

Chicago

Perlin, Michael A., Zichang He, Anthony Alexiades Armenakas, Pablo Andres-Martinez, Tianyi Hao, Dylan Herman, Yuwei Jin, et al. 2026. “Fault-tolerant execution of error-corrected quantum algorithms.” Physical Review X. https://doi.org/10.1103/gnq3-c2df.

Harvard

Perlin, M. A. et al. (2026) ‘Fault-tolerant execution of error-corrected quantum algorithms’, Physical Review X. doi:10.1103/gnq3-c2df.

IEEE

M. A. Perlin et al., “Fault-tolerant execution of error-corrected quantum algorithms,” Physical Review X, 2026, doi: 10.1103/gnq3-c2df.

BibTeX

@article{perlin2026fault,
  title     = {{Fault-tolerant execution of error-corrected quantum algorithms}},
  author    = {Perlin, Michael A. and He, Zichang and Armenakas, Anthony Alexiades and Andres-Martinez, Pablo and Hao, Tianyi and Herman, Dylan and Jin, Yuwei and Mayer, Karl and Self, Chris N. and Amaro, David and Ryan-Anderson, Ciarán and Shaydulin, Ruslan},
  journal   = {Physical Review X},
  year      = {2026},
  doi       = {10.1103/gnq3-c2df},
  url       = {https://doi.org/10.1103/gnq3-c2df}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture

  • fault-tolerant quantum computing
  • quantum error correction
  • Steane code
  • quantum approximate optimization algorithm
  • Harrow-Hassidim-Lloyd algorithm
  • Poisson equation
  • logical qubits
  • trapped-ion quantum computer

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Perlin, M. A., He, Z., Armenakas, A. A., Andres-Martinez, P., Hao, T., Herman, D., Jin, Y., Mayer, K., Self, C. N., Amaro, D., Ryan-Anderson, C., & Shaydulin, R. (2026). Fault-tolerant execution of error-corrected quantum algorithms. Physical Review X. https://doi.org/10.1103/gnq3-c2df

How many times has this paper been cited?

20 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Physical Review X: sign in and open the full text from this page.

Who wrote this paper?

Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas, Pablo Andres-Martinez, Tianyi Hao, Dylan Herman, Yuwei Jin, Karl Mayer, Chris N. Self, David Amaro, Ciarán Ryan-Anderson, Ruslan Shaydulin.

What is the DOI of this paper?

10.1103/gnq3-c2df, permanently at https://doi.org/10.1103/gnq3-c2df. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.