������

���ܳٳ�ǰ���:��
������ (alphabetical order): Eric Brunner, Steve Clark, Fabian Finger, Gabriel Greene-Diniz, Pranav Kalidindi, Alexander Koziell-Pipe, David Zsolt Manrique, Konstantinos Meichanetzidis, Frederic Rapp
Hiverge (alphabetical order): Alhussein Fawzi, Hamza Fawzi, Kerry He, Bernardino Romera Paredes, Kante Yin

‍

What if every quantum computing researcher had an army of students to help them write efficient quantum algorithms? Large Language Models are starting to serve as such a resource.

������’s processors offer world-leading fidelity, and recent experiments show that they have surpassed the limits of classical simulation for certain computational tasks, such as simulating materials. However, access to quantum processors is limited and can be costly. It is therefore of paramount importance to optimise quantum resources and write efficient quantum software. Designing efficient algorithms is a challenging task, especially for quantum algorithms: dealing with superpositions, entanglement, and interference can be counterintuitive.

To this end, our joint team used AI platform for automated algorithm discovery, the Hive, to probe the limits of what can be done in quantum chemistry. The Hive generates optimised algorithms tailored to a given problem, expressed in a familiar programming language, like Python. Thus, the Hive’s outputs allow for increased interpretability, enabling domain experts to potentially learn novel techniques from the AI-discovered solutions. Such AI-assisted workflows lower the barrier of entry for non-domain experts, as an initial sketch of an algorithmic idea suffices to achieve state-of-the-art solutions.

In this initial proof-of-concept study, we demonstrate the advantage of AI-driven algorithmic discovery of efficient quantum heuristics in the context of quantum chemistry, in particular the electronic structure problem. Our early explorations show that the Hive can start from a naïve and simple problem statement and evolve a highly optimised quantum algorithm that solves the problem, reaching chemical precision for a collection of molecules. Our high-level workflow is shown in Figure 1. Specifically, the quantum algorithm generated by the Hive achieves a reduction in the quantum resources required by orders of magnitude compared to current state-of-the-art quantum algorithms. This promising result may enable the implementation of quantum algorithms on near-term hardware that was previously thought impossible due to current resource constraints.

The Electronic Structure Problem in Quantum Chemistry

The electronic structure problem is central to quantum chemistry. The goal is to prepare the ground state (the lowest energy state) of a molecule and compute the corresponding energy of that state to chemical precision or beyond. Classically, this is an exponentially hard problem. In particular, classical treatments tend to fall short when there are strong quantum effects in the molecule, and this is where quantum computers may be advantageous.

The paradigm of variational quantum algorithms is motivated by near-term quantum hardware. One starts with a relatively easy-to-prepare initial state. Then, the main part of the algorithm consists of a sequence of parameterised operators representing chemically meaningful actions, such as manipulating electron occupations in the molecular orbitals. These are implemented in terms of parameterised quantum gates. Finally, the energy of the state is measured via the molecule’s energy operator, the “Hamiltonian”, by executing the circuit on a quantum computer and measuring all the qubits on which the circuit is implemented. Taking many measurements, or “shots”, the energy is estimated to the desired precision. The ground state energy is found by iteratively optimising the parameters of the quantum circuit until the energy converges to a minimum value. The general form of such a variational quantum algorithm is illustrated in Figure 2.

The main challenge in these frameworks is to design an appropriate quantum circuit architecture, i.e. find an efficient sequence of operators, and an efficient optimisation strategy for its parameters. It is important to minimise the number of quantum operations in any given circuit, as each operation is inherently noisy and the algorithm’s output degrades exponentially. Another important quantum resource to be minimised is the total number of circuits that need to be evaluated to compute the energy values during the optimisation of the circuit parameters, which is time-consuming.

To meet these challenges, we task the Hive with designing a variational quantum algorithm to solve the ground state problem, following the workflow shown in Figure 1. The Hive is a distributed evolutionary process that evolves programs. It uses Large Language Models to generate mutations in the form of edits to an entire codebase. This genetic process selects the fittest programs according to how well they solve a given problem. In our case, the role of the quantum computer is to compute the fitness, i.e., the ground state energy. Importantly, the Hive operates at the level of a programming language; it readily imports and uses all known libraries that a human researcher would use, including ������’s quantum chemistry platform, InQuanto. In addition, the Hive can accept instructions and requests in natural language, increasing its flexibility. For example, we encouraged it to seek parameter optimisation strategies that avoid estimating gradients, as this incurs significant overhead in terms of circuit evaluations.  Intuitively, the interaction between a human scientist and the Hive is analogous to a supervisor and a group of eager and capable students: the supervisor provides guidance at a high level, and the students collaborate and flesh out the general idea to produce a working solution that the supervisor can then inspect.

We find that from an extremely basic starting point, consisting of a skeleton for a variational quantum algorithm, the Hive can autonomously assemble a bespoke variational quantum algorithm, which we call Hive-ADAPT. Specifically, the Hive evolves heuristic functions that construct a circuit as a sequence of quantum operators and optimise its parameters. Remarkably, the Hive converged on a structure resembling the current state-of-the-art, ADAPT-VQE. Crucially, however, Hive-ADAPT substantially outperforms this baseline, delivering significant improvements in chemical precision while reducing quantum resource requirements.

A molecule’s ground state energy varies with the distances between its atoms, called the “bond length”. For example, for the molecule H2O, the bond length refers to the length of the O-H bond. The Hive was tasked with developing an algorithm for a small set of bond lengths and reaching chemical precision, defined as within 1.6e-3 Hartree (Ha) of the ground state energy computed with the exact Full Configuration Interaction (FCI) algorithm. As we show in Figure 3, remarkably, Hive-ADAPT achieves chemical precision for more bond lengths than ADAPT-VQE. Furthermore, Hive-ADAPT also reaches chemical precision for other “unseen” bond lengths, showcasing the generalisation ability of the evolved quantum algorithm. Our results were obtained from classical simulations of the quantum algorithms, where we used NVIDIA CUDA-Q to leverage the parallelism enabled by GPUs. Further, relative to ADAPT-VQE, Hive-ADAPT exhibits one to two orders of magnitude reduction in quantum resources, such as the number of circuit evaluations and the number of operators used to construct circuits, which is crucial for practical implementations on actual near-term processors.

For molecules such as BeH2 at large Be-H bond lengths, a complex initial state is required for the algorithm to be able to reach the ground state using the available operators. Even in these cases, by leveraging an efficient state preparation scheme implemented in InQuanto, the Hive evolved a dedicated strategy for the preparation of such a complex initial state, given a set of basic operators to achieve the desired chemical precision.

To validate Hive-ADAPT under realistic conditions, we employed ������’s H2 Emulator, which provides a faithful classical simulator of the H2 quantum computer, characterised by a 1.05e-3 two-qubit gate error rate. Leveraging the Hive's inherent flexibility, we adapted the optimisation strategy to explicitly penalise the number of two-qubit gates—the dominant noise source on near-term hardware—by redefining the fitness function. This constraint guided the Hive to discover a noise-aware algorithm capable of constructing hardware-efficient circuits. We subsequently executed the specific circuit generated by this algorithm for the LiH molecule at a bond length of 1.5 Å with the Partition Measurement Symmetry Verification (PMSV) error mitigation procedure. The resulting energy of -7.8767 ± 0.0031 Ha, obtained using 10,000 shots per circuit with a discard rate below 10% in the PMSV error mitigation procedure, is close to the target FCI energy of -7.8824 Ha and demonstrates the Hive's ability to successfully tailor algorithms that balance theoretical accuracy with the rigorous constraints of hardware noise and approach chemical precision as much as possible with current quantum technology.

For illustration purposes, we show an example of an elaborate code snippet evolved by the Hive starting from a trivial version:

������’s in-house quantum chemistry expert, Dr. David Zsolt Manrique, commented,

“I found it amazing that the Hive converged to a domain-expert level idea. By inspecting the code, we see it has identified the well-known perturbative method, ‘MP2’, as a useful guide; not only for setting the initial circuit parameters, but also for ordering excitations efficiently. Further, it systematically and laboriously fine-tuned those MP2-inspired heuristics over many iterations in a way that would be difficult for a human expert to do by hand. It demonstrated an impressive combination of domain expertise and automated machinery that would be useful in exploring novel quantum chemistry methods.”

Looking to the Future

In this initial proof-of-concept collaborative study between ������ and Hiverge, we demonstrate that AI-driven algorithm discovery can generate efficient quantum heuristics. Specifically, we found a great reduction in quantum resources, which is impactful for quantum algorithmic primitives that are frequently reused. Importantly, this approach is highly flexible; it can accommodate the optimisation of any desired quantum resource, from circuit evaluations to the number of operations in a given circuit. This work opens a path toward fully automated pipelines capable of developing problem-specific quantum algorithms optimised for NISQ as well as future hardware.

An important question for further investigation regards transferability and generalisation of a discovered quantum solution to other molecules, going beyond the generalisation over bond lengths of the same molecule that we have already observed. Evidently, this approach can be applied to improving any other near-term quantum algorithm for a range of applications from optimisation to quantum simulation.

We have already demonstrated an error-corrected implementation of quantum phase estimation on quantum hardware, and an AI-driven approach promises further hardware-tailored improvements and optimal use of quantum resources. Beyond NISQ, we envision that AI-assisted algorithm discovery will be a fruitful endeavour in the fault-tolerant regime, as well, where high-level quantum algorithmic primitives (quantum fourier transform, amplitude amplification, quantum signal processing, etc.) are to be combined optimally to achieve computational advantage for certain problems.

Notably, we’ve entered an era where quantum algorithms can be written in high-level programming languages, like ������’s , and approaches that integrate Large Language Models directly benefit. Automated algorithm discovery is promising for improving routines relevant to the full quantum stack, for example, in low-level quantum control or in quantum error correction.

������ is focusing on redefining what’s possible in hybrid quantum–classical computing by integrating ������’s best-in-class systems with high-performance NVIDIA accelerated computing to create powerful new architectures that can solve the world’s most pressing challenges. 

The launch of Helios, Powered by Honeywell, the world’s most accurate quantum computer, marks a major milestone in quantum computing. Helios is now available to all customers through the cloud or on-premise deployment, launched with a go-to-market offering that seamlessly pairs Helios with the , targeting specific end markets such as drug discovery, finance, materials science, and advanced AI research. 

We are also working with NVIDIA to adopt  , an open system architecture, as a standard for advancing hybrid quantum-classical supercomputing. Using this technology with ������ Guppy and the , ������ has implemented NVIDIA accelerated computing across Helios and future systems to perform real-time decoding for quantum error correction. 

In an industry-first demonstration, an NVIDIA GPU-based decoder integrated in the Helios control engine improved the logical fidelity of quantum operations by more than 3% — a notable gain given Helios’ already exceptionally low error rate. These results demonstrate how integration with NVIDIA accelerated computing through NVQLink can directly enhance the accuracy and scalability of quantum computation.

This unique collaboration spans the full ������ technology stack. ������’s next-generation software development environment allows users to interleave quantum and GPU-accelerated classical computations in a single workflow. Developers can build hybrid applications using tools such as NVIDIA CUDA-Q, , and ������’s Guppy, to make advanced quantum programming accessible to a broad community of innovators.

The collaboration also reaches into applied research through the (NVAQC), where an NVIDIA GB200 NVL72 supercomputer can be paired with ������’s Helios to further drive hybrid quantum-GPU research, including  the development of breakthrough quantum-enhanced AI applications.

A recent achievement illustrates this potential: The ADAPT-GQE framework, a transformer-based Generative Quantum AI (GenQAI) approach, uses a Generative AI model to efficiently synthesize circuits to prepare the ground state of a chemical system on a quantum computer. Developed by ������, NVIDIA, and a pharmaceutical industry leader—and leveraging NVIDIA CUDA-Q with GPU-accelerated methods—ADAPT-GQE achieved a 234x speed-up in generating training data for complex molecules. The team used the framework to explore imipramine, a molecule crucial to pharmaceutical development. The transformer was trained on imipramine conformers to synthesize ground state circuits at orders of magnitude faster than ADAPT-VQE, and the circuit produced by the transformer was run on Helios to prepare the ground state using InQuanto, ������'s computational chemistry platform.

From collaborating on hardware and software integrations to GenQAI applications, the collaboration between ������ and NVIDIA is building the bridge between classical and quantum computing and creating a future where AI becomes more expansive through quantum computing, and quantum computing becomes more powerful through AI.

By Dr. Noah Berthusen

The earliest works on quantum error correction showed that by combining many noisy physical qubits into a complex entangled state called a "logical qubit," this state could survive for arbitrarily long times. QEC researchers devote much effort to hunt for codes that function well as "quantum memories," as they are called. Many promising code families have been found, but this is only half of the story.

Being able to keep a qubit around for a long time is one thing, but to realize the theoretical advantages of quantum computing we need to run quantum circuits. And to make sure noise doesn't ruin our computation, these circuits need to be run on the logical qubits of our code. This is often much more challenging than performing gates on the physical qubits of our device, as these "logical gates" often require many physical operations in their implementation. What's more, it often is not immediately obvious which logical gates a code has, and so converting a physical circuit into a logical circuit can be rather difficult.

Some codes, like the famous , are good quantum memories and also have easy logical gates. The drawback is that the ratio of physical qubits to logical qubits (the "encoding rate") is low, and so many physical qubits are required to implement large logical algorithms. High-rate codes that are good quantum memories have also been found, but computing on them is much more difficult. The holy grail of QEC, so to speak, would be a high-rate code that is a good quantum memory and also has easy logical gates. Here, we make progress on that front by developing a new code with those properties.

Building on prior error correcting codes

A recent work from ������ QEC researchers introduced . The underlying construction method for these codes, called the "symplectic double cover," also provided a way to obtain logical gates that are well suited for ������'s QCCD architecture. Namely, these "SWAP-transversal" gates are performed by applying single qubit operations and relabeling the physical qubits of the device. Thanks to the all-to-all connectivity facilitated through qubit movement on the QCCD architecture, this relabeling can be done in software essentially for free. Combined with extremely high fidelity (~1.2 x10^-5) single-qubit operations, the resulting logical gates are similarly high fidelity.

Given the promise of these codes, we take them a step further in our . We combine the symplectic double codes with the [[4,2,2]] Iceberg code using a procedure called "code concatenation". A concatenated code is a bit like nesting dolls, with an outer code containing codes within it---with these too potentially containing codes. More technically, in a concatenated code the logical qubits of one code act as the physical qubits of another code.

The new codes, which we call "concatenated symplectic double codes", were designed in such a way that they have many of these easily-implementable SWAP-transversal gates. Central to its construction, we show how the concatenation method allows us to "upgrade" logical gates in terms of their ease of implementation; this procedure may provide insights for constructing other codes with convenient logical gates. Notably, the SWAP-transversal gate set on this code is so powerful that only two additional operations (logical T and S) are necessary for universal computation. Furthermore, these codes have many logical qubits, and we also present numerical evidence to suggest that they are good quantum memories.

Concatenated symplectic double codes have one of the easiest logical computation schemes, and we didn’t have to sacrifice rate to achieve it. Looking forward in our roadmap, we are targeting hundreds of logical qubits at ~ 1x 10^-8 logical error rate by 2029. These codes put us in a prime position to leverage the best characteristics of our hardware and create a device that can achieve real commercial advantage.

Every year, the brings together the global supercomputing community to explore the technologies driving the future of computing.

At this year’s conference, from November 16^th – 21^st in St. Louis, Missouri, ������ showcased how our quantum hardware, software, and partnerships are helping define the next era of high-performance and quantum computing.

������ in the Expo Hall

The ������ team was on-site at booth #4432 to showcase how we’re building the bridge between HPC and quantum. Folks stopped by our booth to see: 

• Live demo unit of our quantum hardware
• Our new Helios replica, providing an up-close look at the design behind our next-generation system
• The Helios chip, highlighting the innovation driving the world’s most advanced trapped-ion quantum computers

Our quantum computing experts hosted daily tutorials at our booth on Helios, our next-generation hardware platform, Nexus, our all-in-one quantum computing platform, and Hybrid Workflows, featuring the integration of NVIDIA CUDA-Q with ������ Systems.

Speaking Sessions at SC25

Join our team as they share insights on the opportunities and challenges of quantum integration within the HPC ecosystem:

Panel Session: The Quantum Era of HPC: Roadmaps, Challenges and Opportunities in Navigating the Integration Frontier
November 19^th | 10:30 – 12:00pm CST

During this , Kentaro Yamamoto from ������, will join experts from Lawrence Berkeley National Laboratory, IBM, QuEra, RIKEN, and Pawsey Supercomputing Research Centre to explore how quantum and classical systems are being brought together to accelerate scientific discovery and industrial innovation.

BoF Session: Bridging the Gap: Making Quantum-Classical Hybridization Work in HPC
November 19^th | 5:15 – 6:45pm CST

Quantum-classical hybrid computing is moving from theory to reality, yet no clear roadmap exists for how best to integrate quantum processing units (QPUs) into established HPC environments. In this , co-led by ������’s Grahame Vittorini and representatives from BCS, DOE, EPCC, Inria, ORNL NVIDIA, and RIKEN we hope to bring together a global community of HPC practitioners, system architects, quantum computing specialists and workflow researchers, including participants in the Workflow Community Initiative, to assess the state of hybrid integration and identify practical steps toward scalable, impactful deployment.

������’s real world experiment, on the world’s most powerful quantum computer, is the largest of its kind— so large that no amount of classical computing could match it

In 1911, a student working under famed physicist Heike Kamerlingh Onnes made a discovery that would rewire our understanding of electricity. The student was studying the electrical resistance of wires, a seemingly simple question that held secrets destined to surprise the world. 

Kamerlingh Onnes had recently succeeded in liquefying helium, a feat so impressive it earned him the Nobel Prize in Physics two years later. With this breakthrough, scientists could now immerse other materials in a cold bath of liquid Helium, cooling things to unprecedented temperatures and observing their behavior.

Many theories existed about what would happen to a wire at such low temperatures. Lord Kelvin predicted that electrons would freeze in place, making the resistance infinite and stopping the conduction of electricity. Others expected resistance to decrease linearly with temperature—a hypothesis that led to thermometer designs still in use today.

When the student cooled a mercury wire to 3.6 degrees above absolute zero, he found something remarkable: the electrical resistivity suddenly vanished.

Onnes quickly devised an ingenious experiment: as a diligent researcher, he knew that he needed to validate these surprising findings. He took a closed loop of wire, set a current running through it, and watched as it flowed endlessly without fading—a type of perpetual motion that seemed to defy everything we know about physics. And so, superconductivity was born. 

More than a century later, all known superconductors still require extreme conditions like brutal cold or high pressure. If we could instead design a material that superconducts at room temperature, and under normal conditions, our world would be profoundly reshaped.  “Room temperature superconductivity”, as it is generally called, would enable a raft of technological breakthroughs from affordable MRI machines to nearly lossless power grids.

Designing such a material means answering many open questions, and scientists are pursuing diverse strategies to find answers. One promising approach is light-induced superconductivity. In one astonishing study, researchers at the Max Planck Institute in Hamburg used light to entice a material that normally superconducts at roughly -180 °C - but only for a few picoseconds. This effect raised new questions: how does light achieve something that scientists have been grappling with for decades? What is the microscopic mechanism behind this phenomenon? Could understanding it unlock practical room-temperature superconductors?

Nature’s language is mathematics and mathematics is the language of the world’s most powerful quantum computer, Helios

Physics is a surprisingly profound field when you stop to think about it. At its core lies the idea that nature speaks the language of mathematics—and that by discovering the right equations, we can reveal her secrets. As bold as that sounds, history has proven it true time and again. Whenever we peek behind the veil; mathematics is there.

To understand a phenomena like superconductivity, physicists first need a mathematical model, or a set of equations that describe how it works. With the right model, they can predict and even design new superconductors that operate under more practical conditions. This is a key frontier in the search for room temperature superconductors, one of science’s holy grails.

Since the discovery of superconductivity, a lot of work has gone into finding this right model – one that can act as a sort of ‘Rosetta stone’ for harnessing this phenomenon. One of the best bets for describing high temperature superconductors like the one in the Hamburg study is called the “non-equilibrium Fermi-Hubbard” model, which describes how electrons interact and move in a crystal. 

A surprising element of models that describe superconductivity is the prediction that electrons ‘pair up’ when the material becomes superconducting, dancing around in a waltz, two at a time. These pairs are referred to as “cooper pairs” after the famous physicist Leon Cooper. Now, scientists studying superconductors look for “pairing correlations”, a key signature of superconductivity.

Even armed with the Fermi-Hubbard model, light-induced superconductivity has been very difficult to study. The world’s most powerful supercomputers can only handle very small versions, limiting their utility. Even quantum platforms, like analog simulators, limit researchers to observing ‘average’ quantities and obscuring the microscopic details that are crucial for unravelling this mystery.

Light-induced superconductivity has proved challenging to study with quantum computers as well, as doing so requires low error rates, many qubits, and extreme flexibility to measure the fickle symptoms of superconductivity.

That was, until now: ������’s Helios is one of the first machines in the world able to handle the complexity of the non-equilibrium Fermi-Hibbard model at scales previously out of reach. 

Hopping across the lattice and connecting the dots

Before Helios, we were limited to small explorations of this model, stalling research on this critical frontier. Now, with Helios, we have a quantum computer uniquely suited for this problem. With a novel and using up to 90 qubits (72 system qubits plus 18 ancilla), Helios can simulate the dynamics of a 6×6 lattice — a system so large that its full quantum state spans over 2^72 dimensions.

Using Helios to study a system like this offers researchers a sort of “qubit-based laboratory.” Capable of handling complex quantum mechanical effects better than classical computers, Helios allows researchers to thoroughly explore phenomena like this without wasting expensive laboratory time and materials, or spending lots of money and energy running it on a supercomputer. 

Our qubit-based laboratory is a dream come true for several reasons. First, it allows arbitrary state preparation – preparing states far from equilibrium, a challenging task for classical computers. Second, it allows for meaningfully long ‘dynamical simulation’ – seeing how the state evolves in time as entanglement spreads and complexity increases. This is notoriously difficult for classical computers, in part due to their difficulty with handling distinctly quantum phenomena like entanglement. Finally, it allows for flexible measurements and experimental parameters – you can measure any observable, including critical “off-diagonal” observables that carry the signature of superconductivity, and simulate any system, such as those with laser pulses or electric fields. 

This last point is the most significant. While analog quantum simulators, like cold atom systems, can take snapshots of atom positions or measure densities, they struggle with off-diagonal observables—the very ones that signal the formation of Cooper pairs in superconductors.

Breaking new ground: a light-induced pairing

In our work, we've simulated three different regimes of the Fermi-Hubbard model and successfully measured non-zero superconducting pairing correlations — a first for any quantum computing platform.

We began by preparing a low-energy state of the model at half-filling — a standard benchmark for testing quantum simulations. Then, using simulated laser pulses or electric fields, we perturbed the system and observed how it responded.

After these perturbations, we measured a notable increase in the so-called “eta” pairing correlations, a mathematical signature of superconducting behavior. These results prove that our computers can help us understand light-induced superconductivity, such as the results from the Max Planck researchers. However, unlike those physical experiments, Helios offers a new level of control and insight. By tuning every aspect of the simulation — from pulse shape, to field strength, to lattice geometry — researchers can explore scenarios that are completely inaccessible to real materials or analog simulators.

Looking to a future where superconductors permeate our lives

Why does any of this matter? If we could predict which materials will become superconducting — and at what temperature, field, or current — it would transform how we search for new superconductors. Instead of trial-and-error in the lab, scientists could design and test new materials digitally first, saving huge amounts of time and money.

In the long run, Helios and its successors will become essential tools for materials science — not just confirming theories but generating new ones. And perhaps, one day, they’ll help us crack the code behind room-temperature superconductors.

Until then, the quantum revolution continues, one entangled pair at a time.

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.     

A Stellar Quantum Computer 

“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 , 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.

Qubits at a Crossroads

"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, ������

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 ������’s future generations, enabling faster operating speeds.

Animation: This triumph of engineering demonstrates exquisite control over some of nature’s smallest particles in a way the world has never seen; one colleague likened the ions to a “little marching band.”

������’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 , at the atomic level. By addressing this error directly, programmers can enhance the performance of their computation.

Delivered on Time – in Real Time

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 , 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.  

The Most Logical Path to Fault Tolerance

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 .

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 , 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 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 ������ systems—starting with Helios—will integrate , 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 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.