


We’re pleased to introduce Helios, a technological marvel redefining the possible.
Building on its predecessor H2, which has already breached quantum advantage, Helios nearly doubles the qubit count and surpasses H2’s industry-leading fidelity, pushing further into the quantum advantage regime than any system before it. With unprecedented capability across its full stack, Helios is the most powerful quantum computer in the world.
“Helios is a true marvel—a seamless fusion of hardware and software, creating a platform for discovery unlike any other.”- Dr. Rajeeb Hazra, CEO
Helios’ groundbreaking design and advanced software stack bring quantum programming closer than ever to the ease and flexibility of classical computing—positioning Helios to accelerate commercial adoption. Even before its public debut, Helios had already demonstrated its capabilities as the world’s first enterprise-grade quantum computer. During a two-month early access program, select partners including SoftBank Corp. and JPMorgan Chase conducted commercially relevant research. We also leveraged Helios to perform large-scale simulations in high-temperature superconductivity and quantum magnetism—both with clear pathways to real-world industry applications.
Helios is now available to all customers through our cloud service and on-premise offering, including an option to integrate with NVIDIA GB200 for applications targeting specific end markets.
“You would need to harvest every star in the universe to power a classical machine that could do the same calculations we did with Helios."
- Dr. Anthony Ransford, Helios Lead Architect

As we detailed in a benchmarking paper, Helios sets a new standard for quantum computing performance with the highest fidelity ever released to the market. It features 98 fully connected physical qubits with single-qubit gate fidelity of 99.9975% and two-qubit gate fidelity of 99.921% across all qubit pairs—making it the most accurate commercial quantum computer in the world.
Our fidelity shines in system-level benchmarks, such as Random Circuit Sampling (RCS), famously used by Google to demonstrate quantum supremacy when it performed an RCS task that would take a classical computer “10 septillion years” to replicate. Now, RCS serves as both a benchmark and the minimum standard for serious competitors in the market. Frequently missed in this conversation, however, is the importance of fidelity, or accuracy. That's why, when benchmarking Helios using RCS, we report the fidelity achieved by Helios on circuits of varying complexity (with complexity quantified by power requirements for classical simulation).
Our results show a classical supercomputer would require more power than the Sun—or, in fact, the combined power of all stars in the visible universe—to complete the same task in the same amount of time. In contrast, Helios achieved it using roughly the power of a single data center rack.
Like its predecessors, H1 and H2, Helios is designed to improve fidelity and overall system performance over time while sustaining competitive leadership through the launch of its successor.

"When I first saw the rotatable ion storage ring with a junction and gating legs sketched on a napkin, I loved the idea for its simplicity and efficiency. Seeing it finally realized after all of the team’s hard work has been truly incredible."
- Dr. John Gaebler, Fellow and Chief Scientist, Quantinuum
The Helios ion trap uses tiny currents to generate electromagnetic fields that hold single atomic ions (qubits) hovering above the trap for computation. We introduced a first-of-its-kind “junction”, which acts like a traffic intersection for qubits, enabling efficient routing and improved reliability. This is not only the first commercial implementation of this engineering triumph but it also allows our QCCD (Quantum Charged Coupled Device) architecture to scale, with future systems featuring hundreds of junctions arranged like a city street grid.

Whereas predecessor systems routed qubits using “physical swaps,” requiring sequential sorting, cooling, and gating that prevented parallel operations, the Helios QPU instead resembles a classical architecture with dedicated memory, cache, and computational zones. Like a spinning hard drive, the Helios QPU rotates qubits through ring storage (memory), passes them through the junction into the cache, moves them to logic zones for gating, and moves them to the leg storage while the next batch is processed. Sorting can now be done in parallel with cooling operations, resulting in a processor that is faster and less error prone. This parallelism will become a hallmark of Quantinuum’s future generations, enabling faster operating speeds.
Quantinuum’s QCCD provides full all-to-all connectivity, giving the Helios QPU significant advantages over “fixed qubit” architectures, such as those used in superconducting systems. Its ability to physically move qubits around and entangle any qubit with any other qubit enables algorithms and error-correcting codes that are functionally impossible for fixed qubit architectures.

We made another “tiny” but significant change: we switched our qubits from ytterbium to barium. Whereas ytterbium largely relied on ultraviolet lasers that are expensive and hard on other components, barium can be manipulated with lasers in the visible part of the spectrum, where mature industrial technology exists, providing a more affordable, reliable and scalable commercial solution.
Barium also naturally allows the quantum computer to detect and remove a certain type of error, known as leakage, at the atomic level. By addressing this error directly, programmers can enhance the performance of their computation.
As announced earlier this year, Helios launched with a completely new stack equipped with a new software environment that makes quantum programming feel as intuitive as classical development.
Our new stack also features a real-time engine that massively improves our capability. With a real-time control system, we are evolving from static, pre-planned circuits to dynamic quantum programs that respond to results on the fly. We can now, for the first time on a quantum computer, interleave GPU-accelerated classical and quantum computations in a single program.
Our real-time engine also means we have dynamic transport – routing qubits as the moment demands reduces time to solution and diminishes the impact of memory errors.

Programmers can now use our new quantum programming language, Guppy, to write dynamic circuits that were previously impossible. By combining Guppy with our real-time engine, developers can leverage arbitrary control flow driven by quantum measurements, as well as full classical computation—including loops, higher-order functions, early exits, and dynamic qubit allocation. Far from being mere conveniences, these capabilities are essential stepping stones toward achieving fault-tolerant quantum computing at scale—putting us decisively ahead of the competition.
Fully compatible with industry standards like QIR and tools such as NVIDIA CUDA-Q, Helios bridges classical and quantum computing more seamlessly than ever, making hybrid quantum-classical development simple, natural, and accessible, and establishing Helios as the most programmable, general-purpose quantum computer ever built.
While everyone else is promising fault-tolerance, we’re delivering it. We are the only company to demonstrate a fully universal fault-tolerant gate set, we’ve demonstrated more codes than anyone else, and our logical fidelities are the best in class.
Now, with 98 physical qubits, we’ve been able to make 94 logical qubits, fully entangled in one of the largest GHZ states ever recorded. We did this with better than break-even fidelity, meaning they outperform physical qubits running the same algorithm. Built on our Iceberg code, published last year in Nature Physics, these logical qubits achieve the industry’s highest encoding efficiency, needing only two ancilla qubits per code block, or roughly a 1:1 physical-to-logical qubit ratio.
With 50 error-detected logical qubits, Helios achieved better than break-even performance, running the largest encoded simulation of quantum magnetism to date—an exceptional example of how users can leverage efficient encodings. This range and flexibility let users tailor the encoding rate to their application: fewer logical qubits deliver higher fidelity for less complex tasks, while larger sets enable more complex simulations.
Helios also produced 48 fully error-corrected logical qubits at a remarkable 2:1 encoding rate, a ratio thought impossible just a few years ago. This super high encoding rate stands in stark contrast to other notable demonstrations from industry peers. For example, the demonstration linked in the previous sentence would need a whopping 4800 qubits to make 48 logical qubits. Our 2:1 encoding rate was achieved through a clever technique called code concatenation, a breakthrough that supports single-shot error correction, transversal logic, and full parallelization—all at 99.99% state preparation and measurement fidelity.
To extend this performance at scale, all future Quantinuum systems—starting with Helios—will integrate real-time decoding using NVIDIA Grace Hopper GPUs, treating decoding as a dynamic computational process rather than a static lookup. Errors can be corrected as computations run without slowing the logical clock rate. Combined with Guppy, NVIDIA CUDA-Q, and NVQLink, this infrastructure forms the foundation for fault-tolerant, real-time quantum computation, delivering immediate quantum advantage in the near term and a clear path to scalable error-corrected computing.
We remain the only company to perform a fully universal fault-tolerant gate set, with more error-correcting codes and higher logical fidelities than any other company.
Helios is ready to drive practical, commercial quantum applications across industries. Its unprecedented fidelity, scalability, and programmability give users the tools to tackle problems that were previously out of reach. This is just the beginning, and we look forward to seeing what users and companies will achieve with it.
Quantinuum, the world’s largest integrated quantum company, pioneers powerful quantum computers and advanced software solutions. Quantinuum’s technology drives breakthroughs in materials discovery, cybersecurity, and next-gen quantum AI. With over 500 employees, including 370+ scientists and engineers, Quantinuum leads the quantum computing revolution across continents.

In a follow-up to our recent work with Hiverge using AI to discover algorithms for quantum chemistry, we’ve teamed up with Hiverge, Amazon Web Services (AWS) and NVIDIA to explore using AI to improve algorithms for combinatorial optimization.
With the rapid rise of Large Language Models (LLMs), people started asking “what if AI agents can serve as on-demand algorithm factories?” We have been working with Hiverge, an algorithm discovery company, AWS, and NVIDIA, to explore how LLMs can accelerate quantum computing research.
Hiverge – named for Hive, an AI that can develop algorithms – aims to make quantum algorithm design more accessible to researchers by translating high-level problem descriptions in mostly natural language into executable quantum circuits. The Hive takes the researcher’s initial sketch of an algorithm, as well as special constraints the researcher enumerates, and evolves it to a new algorithm that better meets the researcher’s needs. The output is expressed in terms of a familiar programming language, like Guppy or NVIDIA CUDA-Q, making it particularly easy to implement.
The AI is called a “Hive” because it is a collective of LLM agents, all of whom are editing the same codebase. In this work, the Hive was made up of LLM powerhouses such as Gemini, ChatGPT, Claude, Llama, as well as NVIDIA Nemotron, which was accessed through AWS’ Amazon Bedrock service. Many models are included because researchers know that diversity is a strength – just like a team of human researchers working in a group, a variety of perspectives often leads to the strongest result.
Once the LLMs are assembled, the Hive calls on them to do the work writing the desired algorithm; no new training is required. The algorithms are then executed and their ‘fitness’ (how well they solve the problem) is measured. Unfit programs do not survive, while the fittest ones evolve to the next generation. This process repeats, much like the evolutionary process of nature itself.
After evolution, the fittest algorithm is selected by the researchers and tested on other instances of the problem. This is a crucial step as the researchers want to understand how well it can generalize.
In this most recent work, the joint team explored how AI can assist in the discovery of heuristic quantum optimization algorithms, a class of algorithms aimed at improving efficiency across critical workstreams. These span challenges like optimal power grid dispatch and storage placement, arranging fuel inside nuclear reactors, and molecular design and reaction pathway optimization in drug, material, and chemical discovery—where solutions could translate into maximizing operational efficiency, dramatic reduction in costs, and rapid acceleration in innovation.

In other AI approaches, such as reinforcement learning, models are trained to solve a problem, but the resulting "algorithm" is effectively ‘hidden’ within a neural network. Here, the algorithm is written in Guppy or CUDA-Q (or Python), making it human-interpretable and easier to deploy on new problem instances.
This work leveraged the NVIDIA CUDA-Q platform, running on powerful NVIDIA GPUs made accessible by AWS. It’s state-of-the art accelerated computing was crucial; the research explored highly complex problems, challenges that lie at the edge of classical computing capacity. Before running anything on Quantinuum’s quantum computer, the researchers first used NVIDIA accelerated computing to simulate the quantum algorithms and assess their fitness. Once a promising algorithm is discovered, it could then be deployed on quantum hardware, creating an exciting new approach for scaling quantum algorithm design.
More broadly, this work points to one of many ways in which classical compute, AI, and quantum computing are most powerful in symbiosis. AI can be used to improve quantum, as demonstrated here, just as quantum can be used to extend AI. Looking ahead, we envision AI evolving programs that express a combination of algorithmic primitives, much like human mathematicians, such as Peter Shor and Lov Grover, have done. After all, both humans and AI can learn from each other.
As quantum computing power grows, so does the difficulty of error correction. Meeting that demand requires tight integration with high-performance classical computing, which is why we’ve partnered with NVIDIA to push the boundaries of real-time decoding performance.
Realizing the full power of quantum computing requires more than just qubits, it requires error rates low enough to run meaningful algorithms at scale. Physical qubits are sensitive to noise, which limits their capacity to handle calculations beyond a certain scale. To move beyond these limits, physical qubits must be combined into logical qubits, with errors continuously detected and corrected in real time before they can propagate and corrupt the calculation. This approach, known as fault tolerance, is a foundational requirement for any quantum computer intended to solve problems of real-world significance.
Part of the challenge of fault tolerance is the computational complexity of correcting errors in real time. Doing so involves sending the error syndrome data to a classical co-processor, solving a complex mathematical problem on that processor, then sending the resulting correction back to the quantum processor - all fast enough that it doesn’t slow down the quantum computation. For this reason, Quantum Error Correction (QEC) is currently one of the most demanding use-cases for tight coupling between classical and quantum computing.
Given the difficulty of the task, we have partnered with NVIDIA, leaders in accelerated computing. With the help of NVIDIA’s ultra-fast GPUs (and the GPU-accelerated BP-OSD decoder developed by NVIDIA as part of NVIDIA CUDA-Q QEC library), we were able to demonstrate real-time decoding of Helios’ qubits, all in a system that can be connected directly to our quantum processors using NVIDIA NVQLink.
While real-time decoding has been demonstrated before (notably, by our own scientists in this study), previous demonstrations were limited in their scalability and complexity.
In this demonstration, we used Brings’ code, a high-rate code that is possible with our all-to-all connectivity, to encode our physical qubits into noise-resilient logical qubits. Once we had them encoded, we ran gates as well as let them idle to see if we could catch and correct errors quickly and efficiently. We submitted the circuits via both NVIDIA CUDA-Q as well as our own Guppy language, underlining our commitment to accessible, ecosystem-friendly quantum computing.
The results were excellent: we were able to perform low-latency decoding that returned results in the time we needed, even for the faster clock cycles that we expect in future generation machines.
A key part of the achievement here is that we performed something called “correlated” decoding. In correlated decoding, you offload work that would normally be performed on the QPU onto the classical decoder. This is because, in ‘standard’ decoding, as you improve your error correction capabilities, it takes more and more time on the QPU. Correlated decoding elides this cost, saving QPU time for the tasks that only the quantum computer can do.
Stay tuned for our forthcoming paper with all the details.
Every year, APS Global Physics Summit brings together scientific community members from around the world across all disciplines of physics.
Join Quantinuum at this year’s conference, taking place in our backyard, Denver, Colorado, from March 15th – 20th, where we will showcase how our quantum hardware, software, and partnerships are helping define the next era of high-performance and quantum computing.
Find our team at booth #1020 and join our sessions below to discover how we’re advancing quantum technologies and building the bridge between HPC and quantum.
Programmable quantum matter at the frontier of classical computation
Speaker: Andrew Potter
Time: 10:12 – 10:48 am
Benchmarking a 98-qubit trapped-ion quantum computer
Speaker: Charles Baldwin
Time: 12:36 – 12:48 pm
High-Fidelity Quantum operations in the Helios Barium-Ion Processor
Speaker: Anthony Ransford
Time: 4:18 – 4:30 pm
Generative AI Model for Quantum State Preparation
Speaker: Jem Guhit
Time: 4:42 – 4:54 pm
Quantum digital simulations of holographic models using Quantinuum Systems
Speaker: Enrico Rinaldi
Time: 5:54 – 6:30 pm
Software-Enabled Innovations that Drive Robust Commercial Operation on Quantinuum Helios
Speaker: Caroline Figgatt
Time: 8:00 – 8:12 am
Improving Clock Speed in the Quantinuum Helios Quantum Computer
Speaker: Adam Reed
Time: 8:12 – 8:24 am
Less Quantum, More Advantage: An End-to-End Quantum Algorithm for the Jones Polynomial
Speaker: Konstantinos Meichanetzidis
Time: 8:48 – 9:00 am
Quantum Operation Pipelining in the Quantinuum Helios Processor
Speaker: Colin Kennedy
Time: 9:00 - 9:12 am
Directly estimating the fidelity of measurement-based quantum computation
Speaker: David Stephen
Time: 9:12 - 9:24 am
Logical algorithms in a quantum error-detecting code on a trapped-ion quantum processor
Speaker: Matthew DeCross
Time: 9:36 - 9:48 am
Separate and efficient characterization of SPAM errors in the presence of leakage
Speaker: Leigh Norris
Time: 10:00 - 10:12 am
Logical benchmarking on a trapped-ion quantum processor
Speaker: Andrew Guo
Time: 12:00 - 12:12 pm
Modelling Actinides Chemistry with Trapped Ion Quantum Computers
Speaker: Carlo Alberto Gaggioli
Time: 3:30 - 3:42 pm
Digital quantum magnetism at the frontier of classical simulation
Speaker: Michael Foss-Feig
Time: 8:36 - 9:12 am
Shorter width truncated Taylor series for Hamiltonian dynamics simulations
Speaker: Michelle Wynne Sze
Time: 9:24 - 9:36 am
Quantum-Accelerated DFT+DMFT for Correlated Subspaces in Hemoglobin
Speaker: Juan Pedersen
Time: 9:48 - 10:00 am
Simple logical quantum computation with concatenated symplectic double codes
Speaker: Noah Berthusen
Time: 12:48 - 1:00 pm
When is enough enough? Efficient estimation of quantum properties by stopping early
Speaker: Oliver Hart
Time: 12:48 - 1:00 pm
High-Level Programming of the Quantinuum Helios Processor
Speaker: John Campora
Time: 1:48 - 2:24 pm
Error detection without post-selection in adaptive quantum circuits
Speaker: Eli Chertkov
Time: 4:42 - 4:54 pm
Below Threshold Logical Quantum Computation at Quantinuum
Speaker: Shival Dasu
Time: 8:00 - 8:36 am
Performing optimal phase measurements with a universal quantum processor
Speaker: Ross Hutson
Time: 8:36 - 8:48 am
Benchmarking with leakage heralded measurements on the Quantinuum Helios processor
Speaker: Victor Colussi
Time: 10:00 am
High-throughput bidirectional microwave-to-optical transduction assessed with a practical quantum capacity
Speaker: Maxwell Urmey
Time: 12:00 - 12:36 pm
Fast quantum state preparation via AI-based Graph Decimation
Speaker: Matteo Puviani
Time: 5:54 - 6:06 pm
2D Tensor Network Methods for Simulation of Spin Models on Quantum Computers
Speaker: Reza Haghshenas
Time: 8:36 - 8:48 am
High-Performance Computing Simulations for Optical Multidimensional Coherent Spectroscopy Studies of Strained Silicon-Vacancy Centers in Diamond
Speaker: Imran Bashir
Time: 10:36 - 10:48 am
High-Performance Statevector Simulation for TKET and Selene with NVIDIA cuStateVec
Speaker: Fabian Finger
Time: 12:36 - 12:48 pm
Part 1: Logic gates on High-rate Quantum LDPC codes using ion trap devices
Speaker: Elijah Durso-Sabina
Time: 12:48 - 1:00 pm
Driving Quantum Computing Forward: QEC, Hardware, and Applications with Quantinuum
Speaker: Natalie Brown
Time: 1:12 - 1:48 pm
A new QCCD computer and new applications
Speaker: Anthony Ransford
Time: 2:24 - 3:00 pm
*All times in MT