A 98-qubit trapped-ion quantum computer with all-to-all connectivity

Quantum computers require both high-fidelity operations and large qubit numbers to surpass classical capabilities1. Trapped-ion platforms have demonstrated the highest gate fidelities of any modality2–6 but scaling to larger qubit numbers while preserving performance has remained a central challenge. We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture7. Helios features 137Ba+ hyperfine qubits8,9, all-to-all connectivity enabled by a rotatable ion storage ring connecting two quantum operation regions by a junction10,11, speed improvements from parallelized operations12 and a new software stack with real-time compilation of dynamic programs13. Averaged over all operational zones in the system, we achieve average infidelities of 2.5(1) × 10−5 for single-qubit (1Q) gates, 7.9(2) × 10−4 for two-qubit (2Q) gates and 3.3(5) × 10−4 for state preparation and measurement (SPAM), none of which are fundamentally limited and probably able to be improved. These component infidelities are predictive of system-level performance in both random Clifford circuits and random circuit sampling (RCS), the latter demonstrating that Helios operates well beyond the reach of classical simulation and establishes a new frontier of fidelity and complexity for quantum computers14. A new quantum computer, Quantinuum Helios, which is a 98-qubit trapped-ion quantum processor built on the QCCD architecture, demonstrates performance well beyond classical capabilities and provides a path for scaling up quantum computing.

Authors

Institutions

Publication Details

Journal
Nature
Published
2026-06-17
DOI
https://doi.org/10.1038/s41586-026-10676-4
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
17.93
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A 98-qubit trapped-ion quantum computer with all-to-all connectivity

Ivaylo S. Madjarov, Jack Houlton, Róbert Garay, Daniel Y. Botamanenko et al.
1 citations
Nature
Quantum Computing Algorithms and Architecture
17.93
article

A 98-qubit trapped-ion quantum computer with all-to-all connectivity

Ivaylo S. Madjarov, Jack Houlton, Róbert Garay, Daniel Y. Botamanenko, Jia Wen Chan, Joan Dreiling, Varis Carey, Caroline Figgatt, Nathaniel Burdick, Daniel Hothem, Adam Reed, V. E. Colussi, Annie J. Park, Jake Arkinstall, Ryan Besand, Jeff Graves, Charles Gao, Riley Ancona, Joe Chambers, Christopher T. Ertsgaard, Ali Husain, Maya Fabrikant, Anthony Ransford, Alistair R. Milne, Colin J. Kennedy, BJ DeSalvo, William Cody Burton, David Francois, Michael Foss‐Feig, Alec Edgington, Andrew Cureton, Brad Freyberg, Neal Erickson, Nikhil Kotibhaskar, Ian M. Hoffman, Ross Duncan, Lukas Heidemann, Robert D. Delaney, Azure Hansen, Molly P. Andersen, J. P. Campora, Stephen Erickson, David Deen, C. N. Gilbreth, David M. Gaudiosi, Matt Bohn, C. Carron, Bernal, Davide DelVento, Mark Allman, T. M. Evans, Pablo Andres-Martinez, Vanya Eccles, Craig Holliman, Samuel F. Cooper, Bob Higashi, Bryce Bjork, Jordan Hines, Andrew Fischer, Tyler Hilbun, Isobel Hooper, Kyle Hoffman, Corey Barnes, Paul Blanchard, Robin Blume-Kohout, Ariana Hlavaty, Natalie Brown, Conor Delaney, Will Angenent, Agustíin Borgna, John Children, Leonardo Ascarrunz, Grant T. Buckingham, John Bartolotta, Benjamin Arkin, Josh Giles, Liz Argueta, David Hayes, Brian Estey, Steven Crepinsek, Ross Hutson, Jane Garvin, Cameron Foltz, Sydney Drotar, Matthew DeCross, Erin Glynn, Jason Dominy, James Hostetter, Akhil Isanaka, Jay Esposito, Bruce Evans, Bob Horning, Karl Mayer, Joe Davies, Jared Hout, Matt Blain, Robert Boutelle, William Baker, Daniel Davis, Jordan Berg
article en
1 citations

Abstract

Quantum computers require both high-fidelity operations and large qubit numbers to surpass classical capabilities1. Trapped-ion platforms have demonstrated the highest gate fidelities of any modality2–6 but scaling to larger qubit numbers while preserving performance has remained a central challenge. We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture7. Helios features 137Ba+ hyperfine qubits8,9, all-to-all connectivity enabled by a rotatable ion storage ring connecting two quantum operation regions by a junction10,11, speed improvements from parallelized operations12 and a new software stack with real-time compilation of dynamic programs13. Averaged over all operational zones in the system, we achieve average infidelities of 2.5(1) × 10−5 for single-qubit (1Q) gates, 7.9(2) × 10−4 for two-qubit (2Q) gates and 3.3(5) × 10−4 for state preparation and measurement (SPAM), none of which are fundamentally limited and probably able to be improved. These component infidelities are predictive of system-level performance in both random Clifford circuits and random circuit sampling (RCS), the latter demonstrating that Helios operates well beyond the reach of classical simulation and establishes a new frontier of fidelity and complexity for quantum computers14. A new quantum computer, Quantinuum Helios, which is a 98-qubit trapped-ion quantum processor built on the QCCD architecture, demonstrates performance well beyond classical capabilities and provides a path for scaling up quantum computing.

Nature
Sandia National Laboratories California (US), MSD K.K. (Japan) (JP), Cambridge Quantum Computing (United Kingdom) (GB), Quantum Technologies (Sweden) (SE), Plymouth State University (US)
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
17.93
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.