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 accessPublished 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
Cites
Statistics
Figures









Verification
Claims the paper makes
21 Valid · 4 Not valid · 18 Not checked · 102 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“However, mobile qubit architectures, such as QCCD and optical tweezers24,25, can distribute resources more efficiently than stationary qubit architectures26–28, because qubits flow through the QPU like bits in a classical processor, with separated memory structures, data buses and logic units, each optimized for their purpose12.”
§ A 98-qubit trapped-ion quantum computer with all-to-all connectivity > Main As several quantum processing units (QPUs) demonstrate key milestones on the path to utility, including experimental evidence of quantum supremacy14–16 and the feasibility of fault tolerance17,18, the focus of progress is shifting to making use of the unique advantages of each architecture to scale to much larger sizes without affecting performance. Like all modalities, the trapped-ion QPU based on the QCCD architecture7,19–23 has its unique set of challenges and advantages in scaling. For example, trapped ions can require complex optical systems for implementing quantum operations. However, mobile qubit architectures, such as QCCD and optical tweezers24,25, can distribute resources more efficiently than stationary qubit architectures26–28, because qubits flow through the QPU like bits in a classical processor, with separated memory structures, data buses and logic units, each optimized for their purpose12. Here we present Quantinuum Helios, a 98-qubit trapped-ion QCCD quantum processor with three key advances from earlier Quantinuum QPUs21,22. First, Helios uses barium ions as the qubits8, achieving 99.92% two-qubit gate fidelity with a more scalable laser architecture. Second, Helios uses a four-way ‘X’ junction10,11,29–35 to connect memory regions to quantum logic regions without increasing electrical control or device fabrication complexity. Third, Helios is orchestrated by a new classical control implementation capable of executing truly arbitrary quantum programs with all-to-all connectivity and complex control flow logic. The cumulative impact of these advances enable us to scale the system size, from six qubits in the first QCCD quantum computer demonstrated five years ago21 to now 98 qubits, while setting a new state-of-the-art performance across all metrics, confirmed here by system benchmarks, including RCS, and seen in associated applications run on Helios in materials science and cryptography36–38.
What the sources say
- Supportedcites [24] Bluvstein, D. et al. A quantum processor based on coherent transport of entangled atom arrays. Nature 604, 451–456 (2022). source
The citation identifies optical tweezers as an example of a mobile-qubit architecture. The Main section describes entangled neutral atoms shuttled by optical tweezers between operation zones, and the Methods describe moving atoms in mobile traps. The broader efficiency comparison and classical-processor analogy are not specifically attributed to this citation. (LLM, conf=0.92)
- Supportedcites [25] Reichardt, B. W. et al. Fault-tolerant quantum computation with a neutral atom processor. Preprint at https://arxiv.org/abs/2411.11822 (2025). source
The citation is attached to 'optical tweezers' as an example of a mobile qubit architecture, and our copy of Reichardt et al. (2024) is exactly that: NEUTRAL ATOM QUANTUM PROCESSOR (p. 3) states 'By moving atoms between arrays of static optical tweezer traps using mobile tweezers, this platform enables arbitrary connectivity between large numbers of qubits', and the Fig. 1 caption (p. 1) notes 'Moving atoms between the zones enables arbitrary 2Q gate connectivity'. The same pages describe the resource separation the claim rests on — storage and 1Q operations in the register array, 2Q gates in a dedicated interaction zone, readout/cooling in cavity-enhanced optical lattices (p. 3) — and the methods (Register loading and atom reuse, p. 9) add that extra loaded sites let atoms be reused across circuit instances to 'improve data rates'. The comparative verdict against stationary architectures and the classical-processor analogy are the citing authors' framing (cited elsewhere, to refs 26–28 and 12), not something this source must state; nothing in our copy contradicts the attributed content. (LLM, conf=0.85)
- Supportedcites [26] Kim, Y. et al. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 500–505 (2023). source
Citation 26–28 is attached to “stationary qubit architectures,” so this paper serves as an example of that architecture, not as evidence for the claimed efficiency advantage of mobile qubits. The Main section describes its processor as 127 fixed-frequency transmon qubits with heavy-hex connectivity and gates between neighbours. (LLM, conf=0.88)
- Disputedcites [27] Radnaev, A. G. et al. Universal neutral-atom quantum computer with individual optical addressing and nondestructive readout. PRX Quantum 6, 030334 (2025). sourceExperimental — accuracy not yet measured
The Introduction (Sec. 1, p. 2) of our copy compares exactly these two architecture families, but its verdict runs the other way: the shuttling/mobility approach 'increases compilation complexity and limits gate rates ... due to constraints on the speed of atom movement', whereas keeping qubits stationary and addressing them individually enables 'gate rates limited only by optical switching, which is inherently faster than atom movement' and 'the promise of faster circuits'. The only efficiency credit it gives to mobility is flexible connectivity and avoiding near-diffraction-limited addressing beams (p. 2), and the Outlook (Sec. 5, p. 7) again frames motion as unlocking long-range connectivity while individual addressing is preferable for parallel RZ and lower-power addressing. Nothing in our copy states that mobile architectures distribute resources more efficiently than stationary ones, and no passage offers the classical-processor rationale (qubits flowing through the QPU, separated memory, data buses, logic units) — searches for 'resource distribution', 'classical processor analogy', 'memory/data bus/logic units' returned only the architecture-comparison passage. The paper is also a stationary-qubit individual-addressing demonstration and does not mention QCCD or ion-trap architectures at all. (LLM, conf=0.65)
Checked by a reasoning model — may be wrong.
- Partly supportedcites [28] Chen, J.-S. et al. Benchmarking a trapped-ion quantum computer with 30 qubits. Quantum 8, 1516 (2024). sourceExperimental — accuracy not yet measured
Our copy supports only the 'stationary qubit architecture' side of the sentence: the Introduction (p. 1–2) states that in Forte 'the 30 qubits are all-to-all connected in a single, linear ion chain' and that 'the number of distinct gate pairs in an all-to-all connected architecture scales as O(N^2), and so the task of calibrating all gate pairs ... also scales as O(N^2)', and Sec. 2 (p. 2) confirms the chain 'generally persists in the quantum region' during computation (ions are transported only during loading/merging). Nothing in the paper compares this with mobile-qubit schemes: searched for QCCD, shuttling, race-track/moving-qubit and optical-tweezer architectures, and for any classical-processor analogy (memory/data-bus/logic separation) — the only mobile-architecture work mentioned is Klein et al.'s race-track processor, appearing in the reference list as a citation, not as a basis for an efficiency claim. The attribution that mobile architectures 'distribute resources more efficiently' is therefore not supported by this source. (LLM, conf=0.65)
- Supportedcites [12] Brandl, M. F. A quantum von Neumann architecture for large-scale quantum computing. Preprint at https://arxiv.org/abs/1702.02583 (2017). source
Brandl (2017) states exactly this content: Sec. 4 (p. 10) introduces the quantum von Neumann architecture whose 'operation principle ... is similar to that of classical von Neumann architecture', with a quantum bus system moving quantum information between a specialized QALU and a multiplexed quantum memory, in contrast to massively parallel architectures where the DiVincenzo criteria must be met at every qubit site; Sec. 3.1 (p. 7) and Sec. 4.2 (p. 12) give the efficiency argument (separate regions give low hardware demand per stored qubit, avoiding Rent's-rule/wiring limits of 'sea of qubits', Sec. 1 p. 2). The named mobile implementations are in our copy: QCCD in segmented ion traps (Sec. 5, p. 13) and optical tweezers with MEMS beam steering to move atoms/qubits (Sec. 4.4, p. 12). The only narrowing the source adds is that this advantage pertains to large-scale systems (small/medium-scale favours massively parallel hardware, Sec. 3.2 p. 10), consistent with the claim's hedged 'can'. (LLM, conf=0.85)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“Second, Helios uses a four-way ‘X’ junction10,11,29–35 to connect memory regions to quantum logic regions without increasing electrical control or device fabrication complexity.”
§ A 98-qubit trapped-ion quantum computer with all-to-all connectivity > Main As several quantum processing units (QPUs) demonstrate key milestones on the path to utility, including experimental evidence of quantum supremacy14–16 and the feasibility of fault tolerance17,18, the focus of progress is shifting to making use of the unique advantages of each architecture to scale to much larger sizes without affecting performance. Like all modalities, the trapped-ion QPU based on the QCCD architecture7,19–23 has its unique set of challenges and advantages in scaling. For example, trapped ions can require complex optical systems for implementing quantum operations. However, mobile qubit architectures, such as QCCD and optical tweezers24,25, can distribute resources more efficiently than stationary qubit architectures26–28, because qubits flow through the QPU like bits in a classical processor, with separated memory structures, data buses and logic units, each optimized for their purpose12. Here we present Quantinuum Helios, a 98-qubit trapped-ion QCCD quantum processor with three key advances from earlier Quantinuum QPUs21,22. First, Helios uses barium ions as the qubits8, achieving 99.92% two-qubit gate fidelity with a more scalable laser architecture. Second, Helios uses a four-way ‘X’ junction10,11,29–35 to connect memory regions to quantum logic regions without increasing electrical control or device fabrication complexity. Third, Helios is orchestrated by a new classical control implementation capable of executing truly arbitrary quantum programs with all-to-all connectivity and complex control flow logic. The cumulative impact of these advances enable us to scale the system size, from six qubits in the first QCCD quantum computer demonstrated five years ago21 to now 98 qubits, while setting a new state-of-the-art performance across all metrics, confirmed here by system benchmarks, including RCS, and seen in associated applications run on Helios in materials science and cryptography36–38.
What the sources say
- Supportedcites [10] Blakestad, R. B. et al. High-fidelity transport of trapped-ion qubits through an X-junction trap array. Phys. Rev. Lett. 102, 153002 (2009). source
The trap description (p. 1) identifies two intersecting channels as an X-junction with zones for ion transport, supporting the citation’s identification of a four-way junction. The citation appears immediately after “X junction”; the statements about Helios’s memory and logic regions and its complexity are the citing authors’ own design claims, not findings attributed to this paper. (LLM, conf=0.87)
- Supportedcites [11] Blakestad, R. B. et al. Near-ground-state transport of trapped-ion qubits through a multidimensional array. Phys. Rev. A 84, 032314 (2011). source
The citation is attached to the identification of a four-way X-junction. Section II (p. 3) describes two channels crossing to form an X-junction with four entrances. The sentence’s statements about Helios and its control or fabrication complexity are not attributed to this source by that citation. (LLM, conf=0.91)
- Partly supportedcites [29] Burton, W. C. et al. Transport of multispecies ion crystals through a junction in a radio-frequency Paul trap. Phys. Rev. Lett. 130, 173202 (2023). sourceExperimental — accuracy not yet measured
The paper describes transport through a four-leg X junction (p. 1) and says junctions connect linear trap sections (p. 1). It does not discuss Helios, identify the connected sections as memory and quantum-logic regions, or establish that this arrangement avoids additional electrical-control or fabrication complexity. (LLM, conf=0.85)
- Partly supportedcites [30] Hensinger, W. K. et al. T-junction ion trap array for two-dimensional ion shuttling, storage, and manipulation. Appl. Phys. Lett. 88, 034101 (2006). sourceExperimental — accuracy not yet measured
Our copy of Hensinger et al. (2006) supports the functional role the claim describes — the Introduction (p. 1) frames shuttling ions between memory (storage) and interaction (entanglement) regions through a multi-dimensional junction as the building block for a scaled ion-trap computer — but the junction demonstrated here is explicitly a three-arm T, not a four-way 'X': the Abstract (p. 1) states the geometry is 'two linear rf ion trap sections that are joined at a 90 degree angle to form a T-shaped structure,' and the shuttling discussion (p. 2) refers to 'linear rf nodes leading towards the junction from all three directions.' The added assertion that this comes 'without increasing electrical control or device fabrication complexity' is also absent: the paper instead reports needing a symmetric three-layer geometry because transverse confinement in the junction region is difficult with two layers, plus 28 individually controlled electrodes (p. 2) and carefully synchronised, numerically optimised voltage sequences for corner turning (p. 2, Fig. 4). So the memory/logic-junction concept is supported while the four-way X geometry and the no-added-complexity claim are not. (LLM, conf=0.72)
- Not checked — no full text of the sourcecites [31] Decaroli, C. et al. Design, fabrication and characterization of a micro-fabricated stacked-wafer segmented ion trap with two X-junctions. Quantum Sci. Technol. 6, 044001 (2021). source
- Partly supportedcites [32] Wright, K. et al. Reliable transport through a microfabricated X-junction surface-electrode ion trap. New J. Phys. 15, 033004 (2013). sourceExperimental — accuracy not yet measured
Our copy supports the device and its role: the Abstract (p. 1) and Introduction (p. 3) describe a microfabricated surface-electrode X-junction ('linear trapping zones arranged in a ninety-degree cross', i.e. a four-way junction) made with standard VLSI-compatible processes, and the Conclusions (p. 11) state such an X-junction 'could be used ... to shift ions between registers of a future large-scale trapped-ion quantum information processor' — the memory-to-logic shuttling idea is introduced (p. 2) via the Kielpinski/Monroe/Wineland array proposal [7]. The clause 'without increasing electrical control or device fabrication complexity' is not supported: Section 2 (p. 3) reports seventy-eight independent DC control electrodes, a three-patterned-metal-layer (M1/M2/M3) stack with segmented control electrodes and on-chip filter capacitors, and states that 'a junction naively assembled from the intersection of two linear sections does not provide adequate three-dimensional confinement', requiring genetically optimized RF-electrode shapes (p. 3, Section 2). So the source supports scalability of the fabrication approach, not an absence of added control or fabrication complexity. (LLM, conf=0.80)
- Misattributedcites [33] Amini, J. M. et al. Toward scalable ion traps for quantum information processing. New J. Phys. 12, 033031 (2010). sourceExperimental — accuracy not yet measured
Our copy of Amini et al. (2010) reports and demonstrates only a three-leg 'Y'-type surface-electrode junction (Introduction p. 2; Sec. 3.2 p. 7 with threefold rotational symmetry; Sec. 4.1 p. 9 and Fig. 6 p. 10, transport between the junction's three legs) — no four-way 'X' junction is built or tested here. The X-junction is mentioned only to credit other work: Sec. 3 (p. 5) says junctions between multiple ponderomotive tubes 'have been demonstrated in larger, multi-substrate traps [11, 12]' and that 'as was shown in [12], efficient transport through a junction is possible', where reference [12] (References p. 11) is Blakestad et al., 'High-fidelity transport of trapped-ion qubits through an X-junction trap array', PRL 102, 153002 (2009). Memory regions appear in this paper only as a future possibility ('these legs could be extended in future designs to integrate ... other components such as memory storage regions', Sec. 3 p. 4), so the connectivity claim as stated is not this paper's result. (LLM, conf=0.72) It matches “High-fidelity transport of trapped-ion qubits through an X-junction trap array” (2009) instead.
Checked by a reasoning model — may be wrong.
- Disputedcites [34] Moehring, D. L. et al. Design, fabrication and experimental demonstration of junction surface ion traps. New J. Phys. 13, 075018 (2011). sourceExperimental — accuracy not yet measured
The Introduction and Abstract describe the demonstrated traps as three-arm Y-junctions, not four-way X-junctions. The Operation section reports shuttling through those Y-junctions; it does not establish the claimed connection between memory and logic regions or the absence of added complexity. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Disputedcites [35] Shu, G. et al. Heating rates and ion-motion control in a Y-junction surface-electrode trap. Phys. Rev. A 89, 062308 (2014). sourceExperimental — accuracy not yet measured
The Introduction (p. 1) identifies the trap studied as having a central Y-junction, not the four-way X-junction attributed to this source. The Conclusion (p. 10) treats an X-junction as a separate trap in Ref. [42]. This paper also does not establish the claimed connection between memory and logic regions without added control or fabrication complexity. (LLM, conf=0.88)
Checked by a reasoning model — may be wrong.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“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.”
§ A 98-qubit trapped-ion quantum computer with all-to-all connectivity > Abstract
What the sources say
- Partly supportedcites [10] Blakestad, R. B. et al. High-fidelity transport of trapped-ion qubits through an X-junction trap array. Phys. Rev. Lett. 102, 153002 (2009). sourceExperimental — accuracy not yet measured
The introduction (p. 1) says junction-based trap arrays could bring ions from arbitrary locations together for multiqubit gates, and the trap description (p. 1) describes an X-junction connecting transport zones. The paper does not describe Helios, a rotatable ion storage ring, or two quantum operation regions, so it supports the junction-based connectivity concept but not the specific architecture claimed. (LLM, conf=0.84)
- Partly supportedcites [11] Blakestad, R. B. et al. Near-ground-state transport of trapped-ion qubits through a multidimensional array. Phys. Rev. A 84, 032314 (2011). sourceExperimental — accuracy not yet measured
The Introduction (p. 1) says ion transport through an array can bring arbitrarily selected qubits together for operations, and Section II (p. 2) describes an X-junction with an experiment zone. The paper does not describe Helios, a rotatable ion storage ring, or two quantum-operation regions connected by a junction. (LLM, conf=0.85)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture7.”
§ A 98-qubit trapped-ion quantum computer with all-to-all connectivity > Abstract
What the sources say
- Supportedcites [7] Kielpinski, D., Monroe, C. & Wineland, D. J. Architecture for a large-scale ion-trap quantum computer. Nature 417, 709–711 (2002). source
The citation is attached to the QCCD architecture, rather than to the processor’s name or qubit count. In “The quantum CCD,” the paper proposes a quantum charge-coupled device architecture using interconnected ion traps, which supports that attribution. (LLM, conf=0.92)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“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.”
§ A 98-qubit trapped-ion quantum computer with all-to-all connectivity > Abstract
What the sources say
- Not checked — no full text of the sourcecites [8] Dietrich, M., Kurz, N., Noel, T., Shu, G. & Blinov, B. Hyperfine and optical barium ion qubits. Phys. Rev. A 81, 052328 (2010). source
- Partly supportedcites [9] An, F. A. et al. High fidelity state preparation and measurement of ion hyperfine qubits with $$I > \frac{1}{2}$$. Phys. Rev. Lett. 129, 130501 (2022). sourceExperimental — accuracy not yet measured
The paper describes preparing ¹³⁷Ba⁺ hyperfine qubit states (p. 1) and trapping single ¹³⁷Ba⁺ ions (p. 2). It does not identify Helios or establish which qubits that system uses, so it supports the qubit technology but not the Helios-specific claim. (LLM, conf=0.85)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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.
- It may state two separate claims as one. 29
- Probably not a substantial claim. 47
- The quote only partly states this claim. 1
Citations
Cites
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1993) · doi:10.1007/978-1-4899-4541-9 · Cited by 21,230
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 2×
“RCS is a system-level benchmark assessing how effectively a quantum computer can generate computationally complex quantum states 15 .”
Architecture for a large-scale ion-trap quantum computer
Kielpinski, D., Monroe, C., & Wineland, D. J. (2002) · Nature · doi:10.1038/nature00784 · Cited by 1,589 · cited 2×
“We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture 7 .”
Experimental issues in coherent quantum-state manipulation of trapped atomic ions
Wineland, D. J., Monroe, C., Itano, W. M., Leibfried, D., King, B. E., & Meekhof, D. M. (1998) · Journal of Research of the National Institute of Standards and Technology · doi:10.6028/jres.103.019 · Cited by 1,497 · cited 1×
“Like all modalities, the trapped-ion QPU based on the QCCD architecture 7,19–23 has its unique set of challenges and advantages in scaling.”
Monte Carlo wave-function method in quantum optics
Mølmer, K., Castin, Y., & Dalibard, J. (1993) · Journal of the Optical Society of America B · doi:10.1364/josab.10.000524 · Cited by 1,233
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 1×
“Although the fidelity of such circuits can in principle be inferred by running them and performing cross-entropy benchmarking 101 , evaluating the cross-entropy requires exact simulation of the circuits in question and is infeasible except for small depth or qubit number.”
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059 · cited 1×
“…several quantum processing units (QPUs) demonstrate key mile-stones on the path to utility, including experimental evidence of quantum supremacy 14–16 and the feasibility of fault tolerance 17,18 , the focus of progress is shifting to making use of the unique advantages of each architecture to…”
Evidence for the utility of quantum computing before fault tolerance
Kim, Y., Eddins, A., Anand, S., Wei, K. X., van den Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06096-3 · Cited by 1,050 · cited 3×
“As well as the mirrored random circuits run to assess RCS performance, we also directly sampled the output of a single (unmirrored) random circuit of depth d = 26.”
InfluentialEntanglement and quantum computation with ions in thermal motion
Sørensen, A., & Mølmer, K. (2000) · Physical Review A · doi:10.1103/physreva.62.022311 · Cited by 783
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
Research works printed but not linked: 3
- Acharya, R. et al. Quantum error correction below the surface code threshold. Nature 638, 920–926 (2024).
- Moses, S. A. et al. A race-track trapped-ion quantum processor. Phys. Rev. X 13, 041052 (2023).
- Gaebler, J. et al. Detecting leakage errors in hyperfine qubits. US patent 20,240,211,792 (2023).
Cited by
Yang, B., & Negishi, N. (2026) · AVS Quantum Science · doi:10.1116/5.0308618 · Cited by 2
Variational compilation of native gates for efficient trapped-ion Hamiltonian simulation
Wang, P., Li, C. Z., Shi, H., & Chen, P. (2026) · Chinese Physics B · doi:10.1088/1674-1056/ae6b33
Barium autoionization for efficient ion trap loading
Wall, Z. J., Piel, J., Vizvary, S. R., Bareian, M., Diaz, S., Mossman, E., Ransford, A., Greene, C. H., Hudson, E. R., & Campbell, W. C. (2026) · Physical Review A · doi:10.1103/c5m6-kt93 · Cited by 1
Self-citationDesign and fabrication of ion traps for low RF power dissipation
Sterk, J. D., Blain, M. G., Delaney, M. A., Haltli, R. A., Heller, E., Holterhoff, A. L., Jennings, T., Jimenez, N., Katz, O., Kozhanov, A. E., et al. (2026) · AVS Quantum Science · doi:10.1116/5.0332336 · Cited by 1
Self-citationReconfigurable quantum computer juggles 98 qubits
Noel, C. (2026) · Nature · doi:10.1038/d41586-026-01702-6
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
- ORCID
- Ransford, Anthony
- Arkinstall, Jake
- Delaney, Robert D.
- Dreiling, Joan M.
- Figgatt, Caroline
- Husain, Ali A.
- Kennedy, Colin J.
- Kotibhaskar, Nikhil
- Milne, Alistair R.
- Park, Annie J.
- Reed, Adam P.
- Andersen, Molly P.
- Bartolotta, John
- Bjork, Bryce
- Blume-Kohout, Robin
- Borgna, Agustín
- Burton, William Cody
- Carron, Christopher J.
- Colussi, Victor E.
- DeCross, Matthew
- Ertsgaard, Christopher T.
- Fabrikant, Maya I.
- Gilbreth, Christopher N.
- Hansen, Azure
- Hayes, David
- Heidemann, Lukas
- Hines, Jordan
- Hoffman, Ian M.
- Holliman, Craig
- Hothem, Daniel
- Hutson, Ross
- Lawrence, Alan
- Lysne, Nathan K.
- Maxwell, Daniel
- Miller, David B.
- Narmour, Louis
- Pino, Juan M.
- Potter, Andrew C.
- Proctor, Timothy
- Roman, Conrad
- Roy, Craig
- Schaffer, Andrew
- Semenenko, Henry
- Siegfried, Peter
- Singhal, Kartik
- Sivarajah, Seyon
- Sletten, Lucas
- Sprenkle, R. Tucker
- Tader, Mariel
- Taylor, Stephen F.
- Tran, Anh
- Vittorini, Grahame
- Wringe, Chester
- Young, Kevin
- Zuraski, Kristen
- Baldwin, Charles H.
- Gaebler, John P.
- Neyenhuis, Brian
- Stutz, Russell
- Bohnet, Justin G.
- Venue
- Nature
- Published
- 2026-06-17
- Volume
- 655
- Issue
- 8121
- Pages
- 81-86
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- PMC
- PMC13322971
- OpenAlex
- W7165026787
- Cited by
- 16
- References
- 82
- Citations by year
- 2026: 16
- FWCI
- 54.32
- Type
- journal article
- Language
- en
- Update notices
- correction (2026-07-07)
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc-nd
- creativecommons.org/licenses/by-nc-nd/4.0 (tdm)
- creativecommons.org/licenses/by-nc-nd/4.0 (vor)
- 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.