Fault-Tolerant Execution of Error-Corrected Quantum Algorithms
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 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 five and six 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 eight logical qubits and nine 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 quantum error correction 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 a FT logical T -gate implementation with an infidelity of 2.7 ( 4 ) × 10 − 3 and dynamic circuits with measurement-dependent feedback. Our work demonstrates near-breakeven performance of complex, error-corrected algorithmic quantum circuits using only FT components.
Authors
- Michael A. Perlin (ORCID: https://orcid.org/0000-0002-9316-1596)
- Anthony Alexiades Armenakas
- David Amaro (ORCID: https://orcid.org/0000-0001-7853-9581)
- Zichang He (ORCID: https://orcid.org/0000-0002-1723-6568)
- Ciarán Ryan-Anderson (ORCID: https://orcid.org/0009-0000-2678-2926)
- Chris N. Self (ORCID: https://orcid.org/0000-0002-1648-6725)
- Dylan Herman (ORCID: https://orcid.org/0000-0002-8721-7848)
- Ruslan Shaydulin (ORCID: https://orcid.org/0000-0002-8657-2848)
- Yuwei Jin (ORCID: https://orcid.org/0000-0002-8646-0387)
- Pablo Andres-Martinez
- Karl Mayer
- Tianyi Hao
Institutions
- JPMorgan Chase & Co (United States) (US)
- Quantinuum (United Kingdom) (GB)
- Quantinuum (United States) (US)
Publication Details
- Journal
- Physical Review X
- Published
- 2026-11-19
- DOI
- https://doi.org/10.1103/gnq3-c2df
- Citations
- 21
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 19.36