Automated Quantum Algorithm Discovery for Quantum Chemistry

Quantinuum, the world's leading quantum computing company, and Hiverge, a Cambridge-based startup developing an engine for automated algorithm discovery, have initiated a collaboration on quantum algorithm discovery.

December 11, 2025

Authors: 
Quantinuum (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.

Quantinuum’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 Hiverge’s 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.

Figure 1: Workflow: A scientist prompts Hiverge's platform, the Hive, with the molecule of interest and a sketch of a quantum algorithm. The goal of the quantum algorithm is to find the ground state energy of the molecule. The Hive evolves the sketch into an efficient version that solves the problem.
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.

Figure 2: A variational quantum algorithm is defined by a function select_next_operator that iteratively constructs a parameterised quantum circuit as a sequence of operators [O1(θ1),O2(θ2),O3(θ3), ...], and a function update_parameters that optimises its parameters; these functions update the quantum circuit and refine it to its final form that prepares the ground state. The Hive evolves sophisticated versions of these functions starting from trivial versions, written in a familiar programming language, producing a novel, efficient variational quantum algorithm that solves the problem.

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 Quantinuum’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.

Figure 3: (Top): The measured ground state energy of the molecule in Hartree (Ha) as a function of the bond length in Angstrom (Å), i.e. the length of the O-H and Be-H bonds in H2O and BeH2, respectively. Both ADAPT-VQE and Hive-ADAPT recover the energy curve. (Bottom): The difference between the energy estimated by the quantum algorithms and the reference value computed with the exact FCI method. Hive-ADAPT achieves chemical precision for more bond lengths than ADAPT-VQE (energy below dashed flat lines). Hive-ADAPT was evolved by the Hive to solve a particular set of bond lengths (red circles), and we observe that the same algorithm can also solve the problem on other bond lengths (green circles), showing generalisation over bond lengths.

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 Quantinuum’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:

Quantinuum’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 Quantinuum 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 Quantinuum’s Guppy, 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.

About Quantinuum

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. 

Blog
|
events
November 15, 2026
Super Computing 26
Visit Quantinuum at SC26 – Booth 4838

Quantinuum is heading to SC26 in Chicago, and we'd love to see you at Booth 4838 in the Quantum Junction. Stop by during exhibit hours to catch partner theater sessions throughout the day, see what's new with Helios and Nexus, and talk with our team about how quantum computing is expanding its footprint in the HPC datacenter, including hybrid quantum-classical applications.

In our booth:

Join our experts and partners at our kiosks and for short sessions in our theater running throughout the day. Topics include:

  • Next Gen Enterprise Computing Partners – how leading enterprises are bringing quantum into their computing strategy
  • Error Correction: The Path to Fault Tolerance – where quantum error correction stands today and what comes next
  • Develop for the Fault Tolerant Era with Nexus – building, running, and managing quantum workflows on the Nexus platfor
  • Helios: The Most Accurate Quantum Computer – a closer look at our latest system and what its performance makes possible
  • Startup Partners: Accelerating Quantum Ecosystem Innovation – how startups are building on Quantinuum technology
  • Real Commercial Impact – quantum applications in pharma, chemicals, materials, and finance
Coffee and cookies on us

Need a break from the show floor? Our barista will be serving up coffee, and we'll have fresh cookies every afternoon. Grab a cup, pull up a seat for a theater session, and chat with the team.

Catch Quantinuum in the SC26 program

Our experts are also speaking in the SC26 technical program. Add these sessions to your schedule (all times CST):

Speaking Sessions
November 15th

9:45 – 10:00am | Room: W178a
‍Quantum-HPC Workflows Across Multiple Quantum Computing Platforms: Two Case Studies – part of the 2nd International Workshop for Software Frameworks and Workload Management on Quantum-HPC Ecosystems
Presenting: Philipp Seitz

November 16th

3:30 – 4:00pm | Room: W179a
‍Software for Large Scale Application – part of the 2nd Annual Workshop on Large-Scale Quantum-Classical Computing (LSQCC)
Presenting: Juan Pederson

November 19th

3:30 – 4:00pm | Room: W181abc
‍Bringing Quantum Computing to the HPC Datacenter
Presenting: Kentaro Yamamoto

See you in Chicago

Whether you're exploring quantum for the first time or planning how to integrate it with your HPC environment, our team is ready to talk. Find us at Booth 4838 in the Quantum Junction, November 16–19.

‍

events
All
Blog
|
corporate
November 10, 2026
Reimei Powers Up to Help Japan Lead the Next Era of Discovery  
  • RIKEN and Quantinuum have upgraded Reimei to System Model H2, bringing quantum advantage into sight with their hybrid supercomputing platform.
  • Using the new quantum processor, a Quantinuum-led frontier project team is combining quantum and classical data to map complex material behavior, using Reimei for classically challenging regimes, the JHPC-quantum GPU supercomputer ROQUO and the supercomputer Fugaku for large-scale simulation and AI, and generative models to predict unexplored conditions.
  • A second frontier project is focused on creating a scalable hybrid workflow for biomolecular chemistry, combining quantum computing, supercomputing, and AI to simulate the excited-state properties of complex molecules—with potential applications in drug discovery, advanced materials, and solar energy. Once these projects conclude, Reimei will start regular operations under the Test User Program.

The future of supercomputing just got an upgrade in Japan.

RIKEN and Quantinuum have upgraded the Reimei quantum computer to Quantinuum’s System Model H2, bringing quantum advantage into sight with their hybrid supercomputing platform. Their combination of Reimei, the supercomputer Fugaku, and the ROQUO GPU supercomputer is a world-leading platform that reaches far beyond what any modality can currently offer on its own.

With 56 fully-connected high-fidelity qubits, Reimei is already supporting two frontier projects in quantum materials and biomolecular chemistry. Both are designed to move hybrid computing beyond infrastructure demonstrations and toward high-value scientific applications.

Expanding the landscape of supercomputing

Many scientific problems contain both classically ‘accessible’ and classically ‘inaccessible’ regions.

For example, a classical supercomputer may efficiently explore broad areas of a model’s parameter space but struggle near a phase transition, where correlations grow and the required computational resources increase sharply. In chemistry, classical methods can model much of a molecule accurately but encounter difficulties in small, strongly correlated regions that determine its most important properties. In contrast, quantum computers can often handle these problems deftly, thanks to their native “quantumness”.

We have been working to bring quantum computers together with classical computers, using them as specialized accelerators inside broader heterogeneous computing environments.

RIKEN’s platform is our first instantiation of that vision, bringing together three complementary resources:

  • Fugaku, RIKEN’s classical supercomputer, provides large-scale classical modeling, data processing, and established scientific computing methods.
  • ROQUO, RIKEN’s GPU supercomputer, supports tensor-network simulation, AI training, and massively parallel computation.
  • Reimei, RIKEN’s quantum computer, performs selected calculations involving quantum states and correlations that become prohibitively expensive to represent classically.

Quantinuum Nexus’s hybrid workflow management system coordinates these resources, allowing jobs running on classical infrastructure to submit quantum tasks to Reimei and incorporate the results into a larger calculation.

This foundation has been operational for some time now. A major result from earlier this year used Reimei and Fugaku together to investigate chemical reactions inside biomolecules. Recently, we expanded our work using Fugaku and QPUs: coordinating Reimei and ibm_kobe in a combined VQE–QPE workflow to calculate a simple system’s ground-state energy. In all these cases, quantum hardware augmented the classical supercomputer, with each processor assigned the part of the calculation best suited to its strengths.

The addition of ROQUO now extends this architecture with GPU-accelerated simulation, optimization, and AI. Combined with the upgrade of Reimei to System Model H2, we have launched two frontier projects to push the forefront of scientific computing and prove out Reimei’s capability.

Project 1: GenQAI for materials discovery

The first frontier project brings together quantum simulation, classical tensor networks, and generative AI to investigate many-body physics.

The goal is to discover a sort of ‘treasure map’ for a material: the phase diagram. A phase diagram is a multidimensional map that shows how a material’s properties change when variables like temperature, pressure, or magnetic field are changed. Phase diagrams can hold the secret to exotic properties like superconductivity; can point the way to novel materials for memory devices and energy transfer, or can help to elucidate new medical imaging techniques.

Phase diagrams are extremely valuable, but they can be difficult to calculate or measure. To measure one, you would need a laboratory that could detect material properties at hundreds of points while also generating repeatable parameter changes. Computationally, the problem is similar, but (as mentioned above) one often encounters regions where correlations extend across larger portions of the system, making it incredibly difficult to compute. On top of this, during pre-thermal dynamics or phase transitions, entanglement can grow rapidly, further stretching classical computing capacity.

Reimei is well suited to probing these difficult regimes. We have already used System Model H2 to explore quantum magnetism at scales that frustrate classical approaches. Its high-fidelity operations and flexible qubit connectivity enable the execution of demanding quantum many-body circuits at a scale where matched-accuracy classical simulation can become impractical. But this quantum data is also expensive to generate. The goal is therefore to use it selectively.

ROQUO can perform dense tensor-network simulations across classically tractable regions, parallelizing calculations over model parameters and bond dimensions. This allows Reimei to focus on regimes requiring deep time evolution circuits, where long-range correlations and growing entanglement can sharply increase the cost of classical simulation. Classical data alone is not enough to train a robust generative model across the phase diagram, and that is why quantum data becomes essential.

The team has already collected hardware data for a 6 × 6 two-dimensional spin model, trained a Transformer model for zero-noise extrapolation across the parameter space, and applied active learning to prioritize additional quantum data collection.

Using these results, the team trained a generative AI model capable of learning a parametric representation of the fluctuations and many-body correlations across the combined dataset: the classically reachable and the classically hard regions are both well described by our trained generative model.

Once trained, the generative model is used at inference time on ROQUO to sample the phase diagram at conditions that have not yet been simulated and obtain results for material properties with good accuracy. Step by step, the phase diagram for a material is filled out, generating a ‘treasure map’ of its key behaviors.

For materials researchers, this ‘map’ can add up to a lot. Quantum computers, such as Reimei, could contribute to more accurate predictions of phase diagrams and response functions, helping researchers understand how materials respond to external conditions, a key determinant in electronics, sensing, medical imaging, energy infrastructure, and more.

Project 2: A hybrid blueprint for biomolecular chemistry

The second frontier project applies the same hybrid philosophy to one of quantum computing’s most anticipated applications: the accurate simulation of complex molecules.

Researchers from RIKEN, NVIDIA, and Quantinuum are working together to develop a scalable QPU–GPU–HPC workflow for predicting realistic chemical properties of biomolecular systems. Our initial target is zinc porphyrin, a light-absorbing molecule whose response to light is influenced by its surrounding environment.

While many current projects in quantum computational chemistry are focused on ground state searches, this project focuses on excited states—the electronically energized states involved in processes such as light absorption. These states are typically more complicated to calculate than a molecule’s ground state, but they are essential to understanding how photoactive molecules function in the real world.

As before, the hybrid workflow assigns each part of the calculation to the most appropriate processor:

  • Fugaku and conventional HPC methods represent the chromophore’s larger molecular environment and perform the broader chemistry workflow.
  • ROQUO’s NVIDIA GPUs support optimization, configuration-interaction calculations, AI-assisted circuit design, and spectral reconstruction.
  • Reimei concentrates on strongly correlated electronic regions and searches for important electron configurations that classical methods may miss.

This gives the QPU a focused role: discovering important determinants (candidate electronic configurations) that can enrich the classical calculation. The HPC systems then use those configurations to calculate energies and reconstruct experimentally meaningful properties, including the molecule’s absorption spectrum.

This separation of responsibilities makes the workflow scalable. The QPU is not asked to represent the entire biomolecular environment. Instead, it targets the part of the electronic structure problem where quantum sampling could add information that is difficult to obtain through classical methods alone. To help tackle this, we developed a new hybrid method to solve complicated electronic structure problems.

This approach could provide a blueprint for studying functional biomolecules at the accuracy needed for industrial research. Applications could eventually span drug discovery, biomolecular engineering, advanced materials, and the design of more efficient light-harvesting systems such as solar cells.

A platform for the next era of discovery

Hybrid computing is sometimes described as a future architecture. At RIKEN, these foundations have been operational since 2025 – and they just got a massive upgrade.

Reimei supplies high-fidelity quantum computation. Fugaku provides the scale of a world-leading supercomputer. ROQUO adds accelerated computing and AI. The Nexus workflow management system brings the systems together into coordinated scientific workflows.

Together, they demonstrate a broader principle: the value of quantum computing will not be measured by what a QPU can do in isolation, but by what becomes possible when quantum computers are integrated into the world’s most advanced computing environments.

With Reimei, RIKEN and Quantinuum are building that future now—and building it with Japan.

*Reimei deployment is supported by the New Energy and Industrial Technology Development Organization (NEDO), an organization under the jurisdiction of Japan's Ministry of Economy, Trade and Industry (METI)'s "Development of Integrated Utilization Technology for Quantum and Supercomputers" as part of the "Project for Research and Development of Enhanced Infrastructures for Post 5G Information and Communications Systems."

corporate
All
technical
All
Blog
|
corporate
October 28, 2026
Fidelity First in the Quantum Race

By: Harry Buhrman, Chief Scientist

Quantum computing is often framed as a race to the most qubits, the fastest gates, and the biggest benchmarks.

But a race needs a destination. In the fault-tolerant era, that means solving a valuable problem faster or at a lower cost than the best classical approach—and the time to solution is ultimately what matters most.

In this context, gate speed metrics have received a lot of attention. While gate speed is a meaningful component of the overall quality of a quantum computer, what actually matters most is fidelity. As we all know, speed on its own matters little if we don’t arrive at the correct destination. 

Fidelity has emerged as the most important foundation for success in quantum computing. Higher fidelity means fewer errors in the underlying physical operations. Combined with quantum error correction, higher fidelity can reduce the number of additional qubits and operations needed to make computations reliable. This reduction in overhead can lower costs and shorten the time to deliver a useful answer—even compared with systems that have faster gates but lower fidelity.

Fast Gates Do Not Guarantee Fast Answers

‍Consider a simple example. In an independent-error model, a computation with 10,000 operations, each with an error rate of 10⁻³, or 99.9% fidelity, will experience about ten faults on average that can render the computation useless.

Now make every gate ten times faster without changing its error rate. You still get ten faults. You just get them ten times sooner.

Speed matters, but the relevant measure is the total time required to obtain a trustworthy and useful result. Getting to that point requires performance in many different and connected areas such as state preparation, measurement, error correction, repeated runs, and other work needed to complete the computation.

Gate speed alone cannot establish which system performs best. A fast machine that cannot reliably finish a sufficiently large computation cannot deliver commercial value.

Why Fidelity Changes the Resource Equation

‍Quantum error correction protects information by encoding it across multiple physical qubits. That protection requires resources: additional qubits, measurements, operations, and classical processing. These techniques work better when the underlying physical operations are reliable enough that increasing error protection reduces the logical error rate. 

This requirement is known as the fault-tolerance threshold, the point below which physical error rates are low enough that adding protection reduces logical errors. Faster gates can shorten the computation, but they cannot replace the physical fidelity needed to cross that threshold. 

At Quantinuum, our latest error-correction results on Helios demonstrate this principle. Using our error-correction architecture, logical memory errors fell exponentially as we increased protection. Across the tested code sizes, the fitted error reduction was about twelvefold for each increase of two in code distance. In the largest quantum-memory experiment, the estimated failure rate was about five in a million per error-correction cycle.1 This demonstrates how high-fidelity physical operations and effective error correction work together to make quantum information more reliable as protection grows.

The next question is what that reliability enables. How large a computation can a system complete, and how quickly can it deliver the result?

A New Performance Benchmark

The Quantum Universal Operations Performance System, or QUOPS, provides a standardized way to assess both. This architecture-neutral benchmark gauges performance by measuring computational “reach” and speed.2

“Reach” measures how large a benchmark circuit a system can execute successfully. Speed measures how quickly it executes that circuit, in effective quantum operations per second. QUOPS uses wall-clock time and accounts for extra samples and discarded runs caused by noise.

Together, these measures provide a common basis for comparing what different quantum systems deliver and tracking progress toward better time to solution.

Quantinuum’s H2 and Helios systems executed substantially larger benchmark circuits than Google’s Willow and IBM’s Boston. These superconducting systems sometimes achieved higher effective operation rates, but on smaller circuits, which means that they are not computationally comparable.

Superconducting systems can use error mitigation to tackle larger computations, but at a steep cost in speed. The QUOPS study estimates that the additional repetitions can make effective processing thousands of times slower. Some computations remain beyond the system’s reliable reach, even with mitigation. In those cases, faster gates may deliver no useful answer at all within practical limits on time and cost.

Useful applications require speed on much larger circuits. For example, the study estimates that factoring RSA-2048 or calculating FeMoco’s ground-state energy within five days would require roughly 100,000 times the computational reach demonstrated by today’s physical-qubit processors. Some machines approach the estimated speed requirement, but only on small circuits. The challenge is to sustain that speed at the required scale, including the additional work needed for error correction.

Larger uncorrected circuits accumulate more errors. Protecting them requires extra qubits and time. Reliability and speed must therefore scale together, and QUOPS offers a way to track both. 

Higher Fidelity Makes Larger, Reliable Computations Possible

Improving fidelity can reduce the extra qubits and operations needed for error correction, lowering the time, cost, and resources required for useful computation. The benefit comes from reaching the required reliability with less protection, leaving more resources available for the computation itself.

Helios brings together the physical performance and error-correction capabilities needed to pursue those savings. In our paper published in Nature we showed that the system achieved an average single-qubit gate fidelity of 99.9975% and average two-qubit gate fidelity of 99.921% across its operational zones, while scaling the trapped-ion architecture to 98 fully connected physical qubits.3

The latest color-code experiments build on that physical performance. Alongside the logical memory results, protected two-qubit Clifford operations also became more reliable as protection increased. This connects improvements in the underlying hardware to improvements in logical computation.

A flexible error-correction architecture creates further opportunities to improve efficiency. Our recent Helix and color-code demonstrations used the same Helios hardware to explore different balances of accuracy and physical-qubit requirements. That flexibility allows us to evaluate which codes best suit different computational tasks as systems scale.

However, we continue to push ahead and accelerate the development of machines, such as Apollo, where quantum utility comes into play at scale. Decoding in the new color-code benchmarks was performed offline, and we are now turning our attention to integrating error correction, magic-state resources and real-time control into longer, reliable computations.

While that work continues, today’s systems can already contribute to scientific research. NISQ systems have advanced algorithms and hardware, enabled certified randomness, and supported studies of quantum magnetism and superconducting pairing correlations. These results leave room for useful applications before fault tolerance, even as error correction provides the scalable path to larger, reliable computations.4

The goal is to combine these capabilities so that larger computations can run reliably within practical limits on time and resources. Fidelity provides the foundation, and optimizing the full system turns that foundation into better time to solution.

Fidelity First. Then Optimize Time to Solution.

‍Scaling quantum computation requires continued progress in fidelity. As physical operations move further below threshold, increasing error protection can suppress logical errors more effectively, enabling longer, more demanding computations.

Speed must improve alongside that reliability. Advances in transport, cooling, measurement, compilation, and parallel execution can reduce the time and total cost of solving useful problems. These improvements become increasingly valuable as systems gain the reliability needed to complete larger computations.

Our latest Helios results are proof points on the path to Apollo, our planned universal fault-tolerant quantum computer, expected by 2029. The goal is to translate these gains into systems that can solve industrially relevant problems faster or at lower cost than the best classical approach.

Industrial partnerships help connect that progress to problems that matter, from understanding high-temperature superconductivity to how molecules interact to accelerate drug discovery. They bring practical research questions into the development process and help identify where improving quantum capabilities could deliver useful results beyond the reach of classical computing alone.

Our motto is simple: fidelity first, with speed built on that foundation.

References & For Further Reading

‍[1] A. Lavasani et al., "Quantum error correction well below the color code threshold," arXiv:2610.24077 [quant-ph] (2026). doi:10.48550/arXiv.2610.24077.

[2] T. Proctor et al., "Benchmarking the computational power of quantum computers," arXiv:2609.12146 [quant-ph] (2026). doi:10.48550/arXiv.2609.12146.

[3] A. Ransford et al., "A 98-qubit trapped-ion quantum computer with all-to-all connectivity," Nature 655, 81-86 (2026). doi:10.1038/s41586-026-10676-4.

[4] M. Liu, R. Shaydulin, P. Niroula et al., "Certified randomness using a trapped-ion quantum processor," Nature 640, 343-348 (2025). doi:10.1038/s41586-025-08737-1.

     S. Dasu et al., "Computing with many encoded logical qubits beyond break-even," arXiv:2602.22211 [quant-ph] (2026). doi:10.48550/arXiv.2602.22211.

      E. Granet et al., "Superconducting pairing correlations on a trapped-ion quantum computer," arXiv:2511.02125 [quant-ph] (2025; revised 2026). doi:10.48550/arXiv.2511.02125.

corporate
All