Debunking algorithmic qubits
Executive Summary: Quantinuum’s H-Series computers have the highest performance in the industry, verified by multiple widely adopted benchmarks including quantum volume We demonstrate that an alternative benchmark called algorithmic qubits is deeply flawed, hiding computer performance behind a plurality voting trick and gate compilations that are not widely useful.
Recently a new benchmark called algorithmic qubits (AQ) has started to be confused with quantum volume measurements. Quantum volume (QV) was specifically designed to be hard to “game,” however the algorithmic qubits test turns out to be very susceptible to tricks that can make a quantum computer look much better than it actually is. While it is not clear what can be done to fix the algorithmic qubits test, it is already clear that it is much easier to pass than QV and is a poor substitute for measuring performance. It is also important to note that algorithmic qubits are not the same as logical qubits, which are necessary for full fault-tolerant quantum computing.
To make this point clear, we simulated what algorithmic qubits data would look like for two machines, one clearly much higher performing than the other. We applied two tricks that are typically used when sharing algorithmic qubits results: gate compilation and error mitigation with plurality voting. From the data above, you can see how these tricks are misleading without further information. For example, if you compare data from the higher fidelity machine without any compilation or plurality voting (bottom left) to data from the inferior machine with both tricks (top right) you may incorrectly believe the inferior machine is performing better. Unfortunately, this inaccurate and misleading comparison has been made in the past. It is important to note that algorithmic qubits uses a subset of algorithms from a QED-C paper that introduced a suite of application oriented tests and created a repository to test available quantum computers. Importantly, that work explicitly forbids the compilation and error mitigation techniques that are causing the issue here.
As a demonstration of the perils of AQ as a benchmark, we look at data obtained on both Quantinuum’s H2-1 system as well as publicly available data from IonQ’s Forte system.
We reproduce data without any error mitigation from IonQ’s publicly released data in association with a preprint posted to the arXiv, and compare it to data taken on our H2-1 device. Without error mitigation, IonQ Forte achieves an AQ score of 9, whereas Quantinuum H2-1 achieves AQ of 26. Here you can clearly see improved circuit fidelities on the H2-1 device, as one would expect from the higher reported 2Q gate fidelities (average 99.816(5)% for Quantinuum’s H2-1 vs 99.35% for IonQ’s Forte). However, after you apply error mitigation, in this case plurality voting, to both sets of data the picture changes substantially, hiding each underlying computer’s true capabilities.
Here the H2-1 algorithmic performance still exceeds Forte (from the publicly released data), but the perceived gap has been reduced by error mitigation.
“Error mitigation, including plurality voting, may be a useful tool for some near-term quantum computing but it doesn’t work for every problem and it’s unlikely to be scalable to larger systems. In order to achieve the lofty goals of quantum computing we’ll need serious device performance upgrades. If we allow error mitigation in benchmarking it will conflate the error mitigation with the underlying device performance. This will make it hard for users to appreciate actual device improvements that translate to all applications and larger problems,” explained Dr. Charlie Baldwin, a leader in Quantinuum’s benchmarking efforts.
There are other issues with the algorithmic qubits test. The circuits used in the test can be reduced to very easy-to-run circuits with basic quantum circuit compilation that are freely available in packages like pytket. For example, the largest phase estimation and amplitude estimation tests required to pass AQ=32 are specified with 992 and 868 entangling gates respectively but applying pytket optimization reduces the circuits to 141 and 72 entangling gates. This is only possible due to choices in constructing the benchmarks and will not be universally available when using the algorithms in applications. Since AQ reports the precompiled gate counts this also may lead users to expect a machine to be able to run many more entangling gates than what is actually possible on the benchmarked hardware.
What makes a good quantum benchmark? Quantum benchmarking is extremely useful in charting the hardware progress and providing roadmaps for future development. However, quantum benchmarking is an evolving field that is still an open area of research. At Quantinuum we believe in testing the limits of our machine with a variety of different benchmarks to learn as much as possible about the errors present in our system and how they affect different circuits. We are open to working with the larger community on refining benchmarks and creating new ones as the field evolves.
To learn more about the Algorithmic Qubits benchmark and the issues with it, please watch this video where Dr. Charlie Baldwin walks us through the details, starting at 32:40.
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.
- Mitsui & Co. and Mitsubishi Electric demonstrated one of the world’s largest approximate Quantum Fourier Transforms (QFT) on Quantinuum Helios, scaling from prior records to 98 physical qubits.
- The collaboration also implemented a logical QFT using a QEC (Quantum Error Correction) code with up to 12 logical qubits.
- The work highlights Quantinuum’s accuracy and flexible architecture.
While there is ongoing debate around the pace of quantum computing’s development, a more grounded way to assess progress is through concrete demonstrations of foundational algorithms at meaningful scale. In this context, Mitsui & Co. and Mitsubishi Electric are taking a pragmatic view of quantum progress—focusing on how close the field is to executing core algorithmic primitives that underpin many potential industrial applications, rather than relying on abstract milestones or timelines.
In a new white paper, the industrial giants teamed up with Quantinuum to measure how close we are to running the Quantum Fourier Transform (QFT), a widely-used algorithmic primitive, at scales necessary for industrial applications. In the process, the team successfully ran one of the largest instances of the approximate QFT ever demonstrated. This achievement matters because the QFT is an essential primitive that underpins many of the quantum algorithms expected to deliver practical advantages.
You may have heard of the (classical) Fourier transform (FT), due to its ubiquity throughout modern computing. The FT is essential in everything from image analysis to data compression, with almost limitless applications in between. The quantum Fourier transform (QFT) is similar; it’s used in everything from chemistry to finance.
Because the QFT is a foundational primitive underpinning many quantum algorithms, demonstrating it at larger scales and higher fidelity is a practical way to measure quantum computing readiness. This is exactly the type of benchmarking that organizations should consider to understand where today’s systems are useful, and to see how fault-tolerant approaches are progressing. Ultimately, algorithm-level benchmarking like this is one of the most useful ways to understand not just where we are, but where we are going.
A Transformative Approach
Primitives like Fourier Transform are so widespread because they simplify problems by transforming them into something that is easier to deal with. At Quantinuum, we are very interested in transforms: not only are they crucial for industrial applications but they can also simplify algorithms, making them possible to run now instead of later. This ‘transformational’ approach extends beyond the QFT - other transforms exist, and we have even invented our own quantum-native transforms.
Using our Helios quantum computer and Guppy language, the joint team explored running the QFT on both physical qubits and on logical qubits, showing that fault tolerance is progressing quickly. Running the QFT on 98 physical qubits; the paper shows a clear progression from previous results.
Then, using the Steane code, one of the best-studied quantum error correcting codes, the team used Helios’ 98 physical qubits to form 12 logical qubits, successfully running the QFT with the mechanisms of quantum error correction interwoven into the algorithm. This marks a crucial step forward for the field.
Foundational Progress
Taken together, these results provide a more concrete lens through which to view progress in quantum computing: not as abstract projections, but as measurable advances in the execution of foundational algorithms at increasing scale. By benchmarking the Quantum Fourier Transform on both physical and logical qubits, Mitsui & Co. and Mitsubishi Electric are helping to clarify what today’s hardware can already achieve, and where fault-tolerant approaches begin to extend those limits.
More broadly, the organizations best positioned to benefit from quantum computing will be those that focus on these foundational capabilities early, and use them to build a clear, evidence-based understanding of how the technology fits into their business goals.
It is believed that unlocking answers to some of the most complex scientific and industrial problems will require the seamless integration of high-performance computing (HPC), generative AI (GenAI), and quantum computing. Toward this goal, Quantinuum, NVIDIA, and a major pharmaceutical company have successfully demonstrated the first step in a proof-of-principle framework designed to connect these three distinct computing paradigms for industrially relevant computational chemistry.
This milestone, enabled by three industry leaders and experts in their respective domains, serves as a foundational capability that could support the development of future hybrid quantum-AI workflows to help optimize industrial research and development (R&D).
The potential value is a path toward more automated, repeatable, and scalable workflows for translating chemistry problems into executable quantum programs—capabilities that could eventually make hybrid computing easier to deploy in industrial R&D.
The GenQAI Framework
The framework, termed Generative Quantum AI (GenQAI), involved a quantum computer simulating a pharmaceutical compound using programming instructions generated by an AI model, which itself was trained on quantum data that was simulated using HPC.
While the vision for GenQAI explores how future industrial simulation workflows might be optimized by training AI models using quantum data derived directly from a quantum computer, the framework currently consists of four main technical steps:
- Simulating quantum data: The process began by simulating quantum data with NVIDIA accelerated computing using NVIDIA CUDA-Q.
- Fine-tuning the AI: This simulated quantum data was used to fine-tune a pre-trained AI model from the open NVIDIA Nemotron family.
- Generating instructions: The AI model then generated quantum circuits, which are the programming instructions required for the quantum simulation.
- Validating accuracy: To validate the results, the circuits were run on Quantinuum’s Helios quantum computer using its InQuanto quantum chemistry platform.
The core novelty of this development lies within the process of the framework itself. In this proof-of-principle experiment, an AI model fine-tuned on simulated quantum data generated circuits that were successfully executed and validated on Quantinuum’s Helios system. Rather than delivering an immediate commercial advantage, this achievement establishes a credible, verifiable baseline for how HPC, AI, and quantum computing can function in tandem.
The Case Study
The validation of the framework represents an early step toward the goal of developing scalable architectures for the pharmaceutical industry.
With a shared view toward eventually scaling the framework for pharmaceutical R&D applications, the researchers simulated a pharmaceutical compound: imipramine. This anti-depressant was chosen because it serves as a model compound for drug degradation and shelf-life studies, which are standard components of the pharmaceutical R&D lifecycle.
Developing hybrid infrastructure that enterprises may adopt requires a deep, coordinated effort among domain experts. As such, this successful test highlights the value of combining the strengths of a quantum computing hardware and software leader (Quantinuum), with a hybrid-quantum classical platform (NVIDIA), and a leading enterprise end-user to build and test future computing capabilities for industrial chemistry.
Scaling the Framework
Although demonstrated on a pharmaceutical compound, the architecture could eventually inform similar molecular-simulation workflows in sectors such as energy, agriculture, advanced materials, and electronics. At this stage, it provides a reference for further testing and development.
Engage Further
Access the paper here to explore the full technical details of this demonstration and contact our team to learn more about joining Quantinuum’s enterprise partner network.
Quantinuum is pleased to announce that applications are now open for the Quantinuum SG Grand Challenge 2026, a global innovation challenge designed to bring together researchers, developers, scientists and innovators to explore practical applications of quantum computing.
Organized by Quantinuum and supported by Singapore's National Quantum Office and Aqora, the three-month program aims to foster collaboration across academia, industry and the quantum developer community while supporting the continued growth of Singapore's quantum ecosystem.
A Platform for Quantum Computing Innovation
Participants will work in teams to develop solutions across a range of challenge areas, including chemistry and molecular simulation, optimization, AI for quantum systems, quantum error correction, condensed matter and materials science, and open innovation. Throughout the program, participants will have access to mentoring, technical enablement and Quantinuum quantum computing resources.
Singapore Grand Finale
Selected finalist teams will be invited to present their work at the Grand Finale hosted in Singapore before representatives from academia, and industry. The event will celebrate innovative applications of quantum computing while providing an opportunity for participants to engage with Singapore's growing quantum community.
Join the Challenge
The Quantinuum SG Grand Challenge welcomes participants from around the world. Whether you are an experienced quantum researcher or beginning your quantum computing journey, the program offers an opportunity to collaborate, learn and contribute to the development of practical quantum applications.
Applications are now open. Spaces are limited and subject to review and approval.