Below-threshold execution of fault-tolerant ripple-carry addition on a trapped-ion quantum computer
Abstract
We deploy a universal fault-tolerant quantum computing (FTQC) architecture based on error-detecting [ [8,3,2] ] and [ [4,2,2] ] codes on Quantinuum's Helios-1 trapped-ion quantum computer. We compile and execute ripple-carry adder (RCA) circuits for classical inputs up to five bits on this architecture. Uncomputing a workspace qubit provides an additional ``algorithmic check'' to detect errors. While available at both the physical and logical levels, this check synergizes with our architecture by increasing the effective fault distance of many circuit locations from two to four. Combining this algorithmic check with the error-detecting codes, we observed only a single logical failure in one-bit addition after burst-error filtering, yielding an estimated logical failure rate of (6.0 ± 5.9) × 10−5. This is well below the (3.5 ± 1.3) × 10−3 failure probability observed for one-bit addition on the same hardware in unencoded form. Two- and three-bit adders also showed performance improvements, while the longer four- and five-bit adders executed just above threshold.
Related
- Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits
- Fault-tolerant execution of error-corrected quantum algorithms
- C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
- Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
- Architecting Instruction Execution for Scalable Fault-Tolerant Quantum Computing
BibTeX
@misc{nelson2026belowthreshold,
title = {{Below-threshold execution of fault-tolerant ripple-carry addition on a trapped-ion quantum computer}},
author = {Jacob S. Nelson and Andrew J. Landahl and Andrew D. Baczewski},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.14202},
eprint = {2610.14202},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.14202},
}
RIS
TY - UNPB
TI - Below-threshold execution of fault-tolerant ripple-carry addition on a trapped-ion quantum computer
AU - Jacob S. Nelson
AU - Andrew J. Landahl
AU - Andrew D. Baczewski
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.14202
UR - https://arxiv.org/abs/2610.14202
AB - We deploy a universal fault-tolerant quantum computing (FTQC) architecture based on error-detecting [ [8,3,2] ] and [ [4,2,2] ] codes on Quantinuum's Helios-1 trapped-ion quantum computer. We compile and execute ripple-carry adder (RCA) circuits for classical inputs up to five bits on this architecture. Uncomputing a workspace qubit provides an additional ``algorithmic check'' to detect errors. While available at both the physical and logical levels, this check synergizes with our architecture by increasing the effective fault distance of many circuit locations from two to four. Combining this algorithmic check with the error-detecting codes, we observed only a single logical failure in one-bit addition after burst-error filtering, yielding an estimated logical failure rate of (6.0 ± 5.9) × 10^−5. This is well below the (3.5 ± 1.3) × 10^−3 failure probability observed for one-bit addition on the same hardware in unencoded form. Two- and three-bit adders also showed performance improvements, while the longer four- and five-bit adders executed just above threshold.
ER -