Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 101 of the 101 references it cites were found in a registry or an index; 41 of the 72 sources its claims cite were checked for support.

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

Open access
Ransford, Anthony, Allman, M. S., Arkinstall, Jake, Campora, J. P., Cooper, Samuel F., Delaney, Robert D., Dreiling, Joan M., Estey, Brian, Figgatt, Caroline, Hall, Alex, Husain, Ali A., Isanaka, Akhil, Kennedy, Colin J., Kotibhaskar, Nikhil, Madjarov, Ivaylo S., Mayer, Karl, Milne, Alistair R., Park, Annie J., Reed, Adam P., Ancona, Riley, Andersen, Molly P., Andres-Martinez, Pablo, Angenent, Will, Argueta, Liz, Arkin, Benjamin, Ascarrunz, Leonardo, Baker, William, Barnes, Corey, Bartolotta, John, Berg, Jordan, Besand, Ryan, Bjork, Bryce, Blain, Matt, Blanchard, Paul, Blume-Kohout, Robin, Bohn, Matt, Borgna, Agustín, Botamanenko, Daniel Y., Boutelle, Robert, Brown, Natalie, Buckingham, Grant T., Burdick, Nathaniel Q., Burton, William Cody, Carey, Varis, Carron, Christopher J., Chambers, Joe, Chan, Jia Wen, Children, John, Colussi, Victor E., Crepinsek, Steven, Cureton, Andrew, Davies, Joe, Davis, Daniel, DeCross, Matthew, Deen, David, Delaney, Conor, DelVento, Davide, DeSalvo, B. J., Dominy, Jason, Drotar, Sydney, Duncan, Ross, Eccles, Vanya, Edgington, Alec, Erickson, Neal, Erickson, Stephen, Ertsgaard, Christopher T., Esposito, Jay, Evans, Bruce, Evans, Tyler, Fabrikant, Maya I., Fischer, Andrew, Foltz, Cameron, Foss-Feig, Michael, Francois, David, Freyberg, Brad, Gao, Charles, Garay, Robert, Garvin, Jane, Gaudiosi, David M., Gilbreth, Christopher N., Giles, Josh, Glynn, Erin, Graves, Jeff, Hansen, Azure, Hayes, David, Heidemann, Lukas, Higashi, Bob, Hilbun, Tyler, Hines, Jordan, Hlavaty, Ariana, Hoffman, Kyle, Hoffman, Ian M., Holliman, Craig, Hooper, Isobel, Horning, Bob, Hostetter, James, Hothem, Daniel, Houlton, Jack, Hout, Jared, Hutson, Ross, Jacobs, Ryan T., Jacobs, Trent, Johannsen, Melf, Johansen, Jacob, Jones, Loren, Julian, Sydney, Jung, Ryan, Keay, Aidan, Klein, Todd, Koch, Mark, Kondo, Ryo, Kong, Chang, Kosto, Asa, Lawrence, Alan, Liefer, David, Lollie, Michelle, Lucchetti, Dominic, Lysne, Nathan K., Lytle, Christian, MacPherson, Callum, Malm, Andrew, Mather, Spencer, Mathewson, Brian, Maxwell, Daniel, McCaffrey, Lauren, McDougall, Hannah, Mendoza, Robin, Miller, David B., Mills, Michael, Morrison, Richard, Narmour, Louis, Nguyen, Nhung, Nugent, Lora, Olson, Scott, Ouellette, Daniel, Parks, Jeremy, Peters, Zach, Peterson, Timothy A., Petricka, Jessie, Pino, Juan M., Polito, Frank, Potter, Andrew C., Preidl, Matthias, Price, Gabriel, Proctor, Timothy, Pugh, McKinley, Ratcliff, Noah, Raymondson, Daisy, Rhodes, Peter, Roman, Conrad, Roy, Craig, Ryan-Anderson, Ciaran, Sanchez, Fernando Betanzo, Sangiolo, George, Sawadski, Tatiana, Schaffer, Andrew, Schow, Peter, Sedlacek, Jon, Semenenko, Henry, Shevchuk, Peter, Shore, Susan, Siegfried, Peter, Singhal, Kartik, Sivarajah, Seyon, Skripka, Thomas, Sletten, Lucas, Spaun, Ben, Sprenkle, R. Tucker, Stoufer, Paul, Tader, Mariel, Taylor, Stephen F., Thompson, Travis H., Tobey, Raanan, Tran, Anh, Tran, Tam, Vittorini, Grahame, Volin, Curtis, Walker, Jim, White, Sam, Williams, Garrett R., Wilson, Douglas, Wolf, Quinn, Wringe, Chester, Young, Kevin, Zheng, Jian, Zuraski, Kristen, Baldwin, Charles H., Chernoguzov, Alex, Gaebler, John P., Sanders, Steven J., Neyenhuis, Brian, Stutz, Russell, Bohnet, Justin G. · 2026 · Nature

Published version of a preprint

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.

Overview

CoChat Summary

## TL;DR

Helios is a 98-qubit trapped-ion QCCD quantum processor with all-to-all connectivity, real-time compilation, and parallelized operations. The paper reports average infidelities of 2.5(1) × 10−5 for 1Q gates, 7.9(2) × 10−4 for 2Q gates, and 3.3(5) × 10−4 for SPAM, and argues that its random circuit sampling is beyond classical simulation.

## Key findings

  • Helios is a 98-qubit trapped-ion processor using 137Ba+ hyperfine qubits, with all-to-all connectivity enabled by a rotatable ion storage ring and junction-based routing.
  • Component benchmarks report average infidelities of:
  • 2.5(1) × 10−5 for single-qubit gates, including a leakage rate of 1.12(6) × 10−5
  • 7.9(2) × 10−4 for two-qubit gates, including a leakage rate of 2.4(1) × 10−4
  • 3.3(5) × 10−4 for SPAM
  • The paper reports a per-MCMR crosstalk error of 1.3(1) × 10−5, a linear memory error rate of 5(1) × 10−4, and a quadratic memory error parameter of 7(2) × 10−5.
  • System-level benchmarks give an effective 2Q error of 1.7(2) × 10−3 from random Clifford circuits and 2.00(6) × 10−3 from mirror benchmarking for RCS; the paper states this demonstrates operation “well beyond the reach of classical simulation.”

## Methods

  • The system is a transport-based QCCD architecture with spatially separated memory and logic regions; up to 16 qubits are processed at a time across eight operation zones, with parallel sorting and ground-state cooling.
  • Benchmarking includes component-level tests (SPAM, 1Q RB, 2Q RB, cycle benchmarking, memory-error transport RB, and MCMR crosstalk) and system-level tests (random Clifford circuits with MCMR and mirror benchmarking for RCS).
  • Main analyses fit decay models to randomized benchmarking and mirror-benchmarking data, using leakage-aware infidelity estimates and stabilizer tracking / polarization fits to extract effective error rates.

## Limitations

  • The authors explicitly state that some reported error sources are “not fundamentally limited” and “probably able to be improved.”
  • They note a discrepancy between the measured 2Q infidelity, 7.9(2) × 10−4, and the lower predicted value, 3.5(4) × 10−4; they suggest possible causes such as higher leakage, non-thermal motion, crosstalk, or other unaccounted effects.
  • The paper states that its comparison between component-level and system-level benchmarking is heuristic and that a rigorous methodology for comparing them is “an open problem.”

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41586-026-10676-4

Cites

101 of 101 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Image of 98 trapped atomic ions. An image of 98 atomic ions illuminated by resonant laser light in the Helios 2D surface trap illustrated in Fig. 2. The overlaid lines indicate different regions of the device, with the quincunx of ions showing the location of the ion trap junction.
Fig. 1 Image of 98 trapped atomic ions. An image of 98 atomic ions illuminated by resonant laser light in the Helios 2D surface trap illustrated in Fig. 2. The overlaid lines indicate different regions of the device, with the quincunx of ions showing the location of the ion trap junction.CC BY-NC-ND · PubMed Central
Fig. 2 Illustration of the Helios design and conception of operations. a, The final five stages of loading the cache region with qubits from ring storage. The ring rotates ions in both directions to move the circled qubit into the cache. b, Diagram of trap (not to scale) part way through a program. Ring storage qubits are being loaded into the cache and qubits in the quantum logic region are undergoing ground-state cooling. The actual horizontal length is 15.3 mm, the ring diameter is 2.8 mm and the operational zones are 750 μm apart. c, Junction operations shown with two ion pairs. The yellow pair moves into the junction, the ion order is rearranged and then it is transported out to the bottom leg. The red pair moves through the junction back to the ring. d, The proper alignment of a four-ion crystal in the quantum logic zones during 2Q gates. e, Laser beam and crystal configurations during example quantum operations as labelled. Beams are focused to operate on top/bottom legs as shown by colour gradients. The 2Q gate beams are tilted both vertically and horizontally away from the 45° line that intersects the ion crystals in both legs by approximately 1° so as to only interact with a single ion crystal at a time.
Fig. 2 Illustration of the Helios design and conception of operations. a, The final five stages of loading the cache region with qubits from ring storage. The ring rotates ions in both directions to move the circled qubit into the cache. b, Diagram of trap (not to scale) part way through a program. Ring storage qubits are being loaded into the cache and qubits in the quantum logic region are undergoing ground-state cooling. The actual horizontal length is 15.3 mm, the ring diameter is 2.8 mm and the operational zones are 750 μm apart. c, Junction operations shown with two ion pairs. The yellow pair moves into the junction, the ion order is rearranged and then it is transported out to the bottom leg. The red pair moves through the junction back to the ring. d, The proper alignment of a four-ion crystal in the quantum logic zones during 2Q gates. e, Laser beam and crystal configurations during example quantum operations as labelled. Beams are focused to operate on top/bottom legs as shown by colour gradients. The 2Q gate beams are tilted both vertically and horizontally away from the 45° line that intersects the ion crystals in both legs by approximately 1° so as to only interact with a single ion crystal at a time.CC BY-NC-ND · PubMed Central
Fig. 3 Circuit run times. a, Time budget per layer for an example depth-10 random program that executes 1Q and 2Q gates on all 98 qubits after an arbitrary permutation each layer, broken down into three categories: ion transport, ground-state cooling and 1Q and 2Q gates. b, Total time per layer versus number of active qubits for three programs: a random program with fully dense 2Q gates, the same random program with approximately half the 2Q gate density and a program with 2D nearest-neighbour 2Q gate pairing. For the two random programs, solid points represent the mean of ten program instances and hollow points show the individual values.
Fig. 3 Circuit run times. a, Time budget per layer for an example depth-10 random program that executes 1Q and 2Q gates on all 98 qubits after an arbitrary permutation each layer, broken down into three categories: ion transport, ground-state cooling and 1Q and 2Q gates. b, Total time per layer versus number of active qubits for three programs: a random program with fully dense 2Q gates, the same random program with approximately half the 2Q gate density and a program with 2D nearest-neighbour 2Q gate pairing. For the two random programs, solid points represent the mean of ten program instances and hollow points show the individual values.CC BY-NC-ND · PubMed Central
Fig. 4 Summary of Helios benchmarking results. a,b, Component fidelity from MCMR crosstalk, 1Q gates, SPAM and 2Q operations in upper (a) and lower (b) logic zones. c, Average memory errors as a function of random rounds of 98-qubit rearrangement. d, CB data of stochastic Pauli errors in the 2Q gate. e, Random Clifford circuit success probability as a function of sequence length with different number of MCMR operations. f, Random Clifford circuit MCMR error estimate as a function of number of MCMR operations. g, Fidelity of random quantum circuits as a function of depth, inferred from mirror benchmarking. h, Classical simulation cost of sampling from the associated circuits using optimized tensor-network contraction, shown for both the 56-qubit H2 quantum computer (purple) and for Helios (green). Shaded regions (symbols) denote the min/max (mean) optimized cost over five random circuit instances. i, Summary of average component errors for each benchmarked operation. All uncertainty shown is one standard deviation from bootstrap resampling.
Fig. 4 Summary of Helios benchmarking results. a,b, Component fidelity from MCMR crosstalk, 1Q gates, SPAM and 2Q operations in upper (a) and lower (b) logic zones. c, Average memory errors as a function of random rounds of 98-qubit rearrangement. d, CB data of stochastic Pauli errors in the 2Q gate. e, Random Clifford circuit success probability as a function of sequence length with different number of MCMR operations. f, Random Clifford circuit MCMR error estimate as a function of number of MCMR operations. g, Fidelity of random quantum circuits as a function of depth, inferred from mirror benchmarking. h, Classical simulation cost of sampling from the associated circuits using optimized tensor-network contraction, shown for both the 56-qubit H2 quantum computer (purple) and for Helios (green). Shaded regions (symbols) denote the min/max (mean) optimized cost over five random circuit instances. i, Summary of average component errors for each benchmarked operation. All uncertainty shown is one standard deviation from bootstrap resampling.CC BY-NC-ND · PubMed Central
Extended Data Fig. 1 Three types of measurement are available in all eight quantum operation zones that make use of optical (2S1/2, 2D5/2), metastable (2D5/2) and ground-state (2S1/2) superpositions. All measurements are made with the target ion displaced from the RF null to reduce stray light interacting with non-measured ions51, as shown with double arrows. a, Standard measurement occurs when the user specifies a measurement but not for all of the qubits in the batch. b, Protected measurement occurs when the compiler detects an entire batch of qubits will be measured, such as at the end-of-program measurement. Protected measurement performs the 2D5/2 mapping operations on both qubits before state detection, such that crosstalk from 493-nm detection light does not affect the measurement outcome. c, User-specified ternary measurement allows the user to obtain a result of 0, 1 or L, in which L indicates leakage out of the qubit manifold. In this case, each qubit state amplitude is mapped to different parts of the 2D5/2 manifold108 and any remaining population in the 2S1/2 population (representing leakage errors) is measured by induced fluorescence with the 493-nm and 650-nm lasers. Afterwards, a series of pulses independently maps each state amplitude back into the 2S1/2 and 2D3/2 manifolds, allowing measurement of the qubit state (0 or 1). Ternary and protected measurements can be combined when an entire batch is measured. d, Energy-level diagram for 137Ba+ with 2S1/2 ground-state manifold used for storage and quantum operations, optical superpositions of 2S1/2 and 2D5/2 are used during standard measurement. An optical superposition shelves the qubit ground state |0⟩ state to the 2D5/2 manifold for measurement. e, Metastable superpositions in the 2D5/2 are used for ternary measurements by shelving both ground-state qubit levels to detect leakage errors.
Extended Data Fig. 1 Three types of measurement are available in all eight quantum operation zones that make use of optical (2S1/2, 2D5/2), metastable (2D5/2) and ground-state (2S1/2) superpositions. All measurements are made with the target ion displaced from the RF null to reduce stray light interacting with non-measured ions51, as shown with double arrows. a, Standard measurement occurs when the user specifies a measurement but not for all of the qubits in the batch. b, Protected measurement occurs when the compiler detects an entire batch of qubits will be measured, such as at the end-of-program measurement. Protected measurement performs the 2D5/2 mapping operations on both qubits before state detection, such that crosstalk from 493-nm detection light does not affect the measurement outcome. c, User-specified ternary measurement allows the user to obtain a result of 0, 1 or L, in which L indicates leakage out of the qubit manifold. In this case, each qubit state amplitude is mapped to different parts of the 2D5/2 manifold108 and any remaining population in the 2S1/2 population (representing leakage errors) is measured by induced fluorescence with the 493-nm and 650-nm lasers. Afterwards, a series of pulses independently maps each state amplitude back into the 2S1/2 and 2D3/2 manifolds, allowing measurement of the qubit state (0 or 1). Ternary and protected measurements can be combined when an entire batch is measured. d, Energy-level diagram for 137Ba+ with 2S1/2 ground-state manifold used for storage and quantum operations, optical superpositions of 2S1/2 and 2D5/2 are used during standard measurement. An optical superposition shelves the qubit ground state |0⟩ state to the 2D5/2 manifold for measurement. e, Metastable superpositions in the 2D5/2 are used for ternary measurements by shelving both ground-state qubit levels to detect leakage errors.CC BY-NC-ND · PubMed Central
Extended Data Fig. 2 1QRB data. a, 1QRB success probability as a function of sequence length for the 16 qubits occupying the eight operation zones. b, 1QRB measured leakage population as a function of sequence length. The leakage rate is combined with the success decay rate to compute the 1Q Clifford infidelity. c, Breakdown of 1Q Clifford error rates into computational (‘Comp.’) errors and leakage (‘Leak.’) errors for the 16 individual qubits. Label locations correspond to qubit locations in Fig. 2b, with qubits 0–7 in the top operation zones and qubits 8–15 in the bottom operation zones (two per zone ordered left to right). Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.
Extended Data Fig. 2 1QRB data. a, 1QRB success probability as a function of sequence length for the 16 qubits occupying the eight operation zones. b, 1QRB measured leakage population as a function of sequence length. The leakage rate is combined with the success decay rate to compute the 1Q Clifford infidelity. c, Breakdown of 1Q Clifford error rates into computational (‘Comp.’) errors and leakage (‘Leak.’) errors for the 16 individual qubits. Label locations correspond to qubit locations in Fig. 2b, with qubits 0–7 in the top operation zones and qubits 8–15 in the bottom operation zones (two per zone ordered left to right). Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.CC BY-NC-ND · PubMed Central
Extended Data Fig. 3 2QRB data. a, 2QRB success probability as a function of sequence length for 8-qubit pairs in the eight operation zones. Sequence length here refers to the number of Clifford group elements. b, 2QRB measured leakage rate as a function of sequence length. The leakage rate is combined with the success decay rate to compute the 2Q infidelity. c, Breakdown of RZZ(π/2) errors into computational and leakage errors for the 8-qubit pairs. Label locations correspond to qubit locations in Fig. 2b, with qubits 0–7 in the top operation zones and qubits 8–15 in the bottom operation zones (two per zone ordered left to right). Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.
Extended Data Fig. 3 2QRB data. a, 2QRB success probability as a function of sequence length for 8-qubit pairs in the eight operation zones. Sequence length here refers to the number of Clifford group elements. b, 2QRB measured leakage rate as a function of sequence length. The leakage rate is combined with the success decay rate to compute the 2Q infidelity. c, Breakdown of RZZ(π/2) errors into computational and leakage errors for the 8-qubit pairs. Label locations correspond to qubit locations in Fig. 2b, with qubits 0–7 in the top operation zones and qubits 8–15 in the bottom operation zones (two per zone ordered left to right). Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.CC BY-NC-ND · PubMed Central
Extended Data Fig. 4 2QCB data. a–h, Pauli expectation values and measured leakage rate as a function of sequence length for the eight operation zones in the order of Fig. 2. i, Pauli error probabilities and leakage survival probability for the native RZZ(π/2) gate, up to unlearnable degrees of freedom, for the eight operation zones. Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.
Extended Data Fig. 4 2QCB data. a–h, Pauli expectation values and measured leakage rate as a function of sequence length for the eight operation zones in the order of Fig. 2. i, Pauli error probabilities and leakage survival probability for the native RZZ(π/2) gate, up to unlearnable degrees of freedom, for the eight operation zones. Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.CC BY-NC-ND · PubMed Central
Extended Data Fig. 5 Transport-1QRB is run with all 98 qubits grouped into four groups that have different numbers of random depth-1 transport operations between each 1Q Clifford gate per group. a, Success probability as a function of Clifford sequence length. b, Measured leakage population as a function of Clifford sequence length. c, Qubit-averaged leakage rate (dashed curve) and total memory error (solid curve) as a function of the number of depth-1 transport operations. Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.
Extended Data Fig. 5 Transport-1QRB is run with all 98 qubits grouped into four groups that have different numbers of random depth-1 transport operations between each 1Q Clifford gate per group. a, Success probability as a function of Clifford sequence length. b, Measured leakage population as a function of Clifford sequence length. c, Qubit-averaged leakage rate (dashed curve) and total memory error (solid curve) as a function of the number of depth-1 transport operations. Each random circuit is run with 100 shots. Error bars are one-sigma confidence intervals constructed from bootstrap resampling.CC BY-NC-ND · PubMed Central

Verification

Claims the paper makes

21 Valid · 4 Not valid · 18 Not checked · 102 Own results and interpretations

71 more claims · 10 with their cited sources checked

Create a free account to see all 145 claims and to verify the 17 references still open.

See all claims — free account
  • It may state two separate claims as one. 29
  • Probably not a substantial claim. 47
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 82 references

Research works printed but not linked: 3

  1. Acharya, R. et al. Quantum error correction below the surface code threshold. Nature 638, 920–926 (2024).
  2. Moses, S. A. et al. A race-track trapped-ion quantum processor. Phys. Rev. X 13, 041052 (2023).
  3. Gaebler, J. et al. Detecting leakage errors in hyperfine qubits. US patent 20,240,211,792 (2023).

Cited by

See all 16

Metadata

Authors
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., Husain, A. A., Isanaka, A., Kennedy, C. J., Kotibhaskar, N., Madjarov, I. S., Mayer, K., Milne, A. R., Park, A. J., Reed, A. P., Ancona, R., Andersen, M. P., Andres-Martinez, P., Angenent, W., Argueta, L., Arkin, B., Ascarrunz, L., Baker, W., Barnes, C., Bartolotta, J., Berg, J., Besand, R., Bjork, B., Blain, M., Blanchard, P., Blume-Kohout, R., Bohn, M., Borgna, A., Botamanenko, D. Y., Boutelle, R., Brown, N., Buckingham, G. T., Burdick, N. Q., Burton, W. C., Carey, V., Carron, C. J., Chambers, J., Chan, J. W., Children, J., Colussi, V. E., Crepinsek, S., Cureton, A., Davies, J., Davis, D., DeCross, M., Deen, D., Delaney, C., DelVento, D., DeSalvo, B. J., Dominy, J., Drotar, S., Duncan, R., Eccles, V., Edgington, A., Erickson, N., Erickson, S., Ertsgaard, C. T., Esposito, J., Evans, B., Evans, T., Fabrikant, M. I., Fischer, A., Foltz, C., Foss-Feig, M., Francois, D., Freyberg, B., Gao, C., Garay, R., Garvin, J., Gaudiosi, D. M., Gilbreth, C. N., Giles, J., Glynn, E., Graves, J., Hansen, A., Hayes, D., Heidemann, L., Higashi, B., Hilbun, T., Hines, J., Hlavaty, A., Hoffman, K., Hoffman, I. M., Holliman, C., Hooper, I., Horning, B., Hostetter, J., Hothem, D., Houlton, J., Hout, J., Hutson, R., Jacobs, R. T., Jacobs, T., Johannsen, M., Johansen, J., Jones, L., Julian, S., Jung, R., Keay, A., Klein, T., Koch, M., Kondo, R., Kong, C., Kosto, A., Lawrence, A., Liefer, D., Lollie, M., Lucchetti, D., Lysne, N. K., Lytle, C., MacPherson, C., Malm, A., Mather, S., Mathewson, B., Maxwell, D., McCaffrey, L., McDougall, H., Mendoza, R., Miller, D. B., Mills, M., Morrison, R., Narmour, L., Nguyen, N., Nugent, L., Olson, S., Ouellette, D., Parks, J., Peters, Z., Peterson, T. A., Petricka, J., Pino, J. M., Polito, F., Potter, A. C., Preidl, M., Price, G., Proctor, T., Pugh, M., Ratcliff, N., Raymondson, D., Rhodes, P., Roman, C., Roy, C., Ryan-Anderson, C., Sanchez, F. B., Sangiolo, G., Sawadski, T., Schaffer, A., Schow, P., Sedlacek, J., Semenenko, H., Shevchuk, P., Shore, S., Siegfried, P., Singhal, K., Sivarajah, S., Skripka, T., Sletten, L., Spaun, B., Sprenkle, R. T., Stoufer, P., Tader, M., Taylor, S. F., Thompson, T. H., Tobey, R., Tran, A., Tran, T., Vittorini, G., Volin, C., Walker, J., White, S., Williams, G. R., Wilson, D., Wolf, Q., Wringe, C., Young, K., Zheng, J., Zuraski, K., Baldwin, C. H., Chernoguzov, A., Gaebler, J. P., Sanders, S. J., Neyenhuis, B., Stutz, R., & Bohnet, J. G.
Affiliations
  • Quantinuum (United States) (US)
  • Quantinuum (United Kingdom) (GB)
  • Sandia National Laboratories (US)
  • Sandia National Laboratories California (US)
Corresponding author
Ransford, Anthony
Venue
Nature
Published
2026-06-17
Volume
655
Issue
8121
Pages
81-86
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W7165026787
Cited by
16
References
82
Citations by year
2026: 16
FWCI
54.32
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by-nc-nd)
  • Research Square (acceptedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
Funders
  • U.S. Department of Energy (DENA0003525, 0003525)
  • Office of Science (DE-NA0003525)
  • National Nuclear Security Administration (DENA-0003525)
  • Advanced Scientific Computing Research (DE-NA-0003525)
  • Sandia National Laboratories (DE‐NA,0003525)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Cold Atom Physics and Bose-Einstein Condensates
Keywords
trapped-ion quantum computer, quantum charge-coupled device, all-to-all connectivity, gate fidelity, random circuit sampling, quantum advantage, quantum processor scaling

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A 98-qubit trapped-ion quantum computer with all-to-all connectivity. https://app.cochat.ai/papers/10.1038/s41586-026-10676-4
The paper
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., Husain, A. A., Isanaka, A., Kennedy, C. J., Kotibhaskar, N., Madjarov, I. S., Mayer, K., Milne, A. R., Park, A. J., Reed, A. P., . . . Bohnet, J. G. (2026). A 98-qubit trapped-ion quantum computer with all-to-all connectivity. Nature. https://doi.org/10.1038/s41586-026-10676-4

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.