黑料社

Debunking algorithmic qubits

March 1, 2024
Executive Summary: 黑料社鈥檚 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 鈥済ame,鈥 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.

Fig. 1: Simulations of the algorithmic qubits (AQ) test with only two-qubit gate errors for two hypothetical machines. 聽The machines are identical except one has much higher two qubit gate fidelity. The test was run with three different options: (Base) Running the exact circuits as specified by the algorithmic qubits , (Gate compilation) Running circuits with custom Pytket compiler passes to reduce two-qubit gate counts, and (Gate compilation + plurality voting) Running the compiled circuits and also applying plurality voting error mitigation with voting over 25 random variants each with 100 shots. Note that the quantum volume (QV) of the machines most closely tracks to the 鈥渂ase鈥 case without compilation and plurality voting, but even that base case of AQ can overestimate the QV of the machine. 聽

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 . 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 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 黑料社鈥檚 H2-1 system as well as publicly available data from IonQ鈥檚 Forte system.

Fig. 2: Algorithmic qubit data with gate compilation but without plurality voting error mitigation. 聽Data from smaller qubit and gate counts was omitted from the 黑料社 data as those points do not tend to influence the AQ score. 聽H2-1 has a measured quantum volume of 216. 聽Based on this publicly available data from Forte, combined with the AQ simulation data above, we estimate the Forte quantum volume is around 25, although spread in qubit fidelities and details of circuit compilation could skew this estimate.

We reproduce data without any error mitigation from IonQ鈥檚 in association with a preprint posted to the , and compare it to data taken on our H2-1 device. Without error mitigation, IonQ Forte achieves an AQ score of 9, whereas 黑料社 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 黑料社鈥檚 H2-1 vs 99.35% for IonQ鈥檚 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鈥檚 true capabilities.

Fig. 3: Algorithmic qubit data with gate compilation and plurality voting error mitigation. For the H2-1 data plurality voting is done over 25 variants each with 20 shots for every test and qubit number. For Forte it is not clear to us exactly what plurality voting strategy was employed.

Here the H2-1 algorithmic performance still exceeds Forte (from the publicly released data), but the perceived gap has been reduced by error mitigation. 聽

鈥淓rror mitigation, including plurality voting, may be a useful tool for some near-term quantum computing but it doesn鈥檛 work for every problem and it鈥檚 unlikely to be scalable to larger systems. In order to achieve the lofty goals of quantum computing we鈥檒l 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 黑料社鈥檚 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 . 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 黑料社 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 黑料社

黑料社,聽the world鈥檚 largest integrated quantum company, pioneers powerful quantum computers and advanced software solutions. 黑料社鈥檚 technology drives breakthroughs in materials discovery, cybersecurity, and next-gen quantum AI. With over 500 employees, including 370+ scientists and engineers, 黑料社 leads the quantum computing revolution across continents.聽

Blog
June 10, 2025
Our Hardware is Now Running Quantum Transformers!

If we are to create 鈥榥ext-gen鈥 AI that takes full advantage of the power of quantum computers, we need to start with quantum native transformers. Today we announce yet again that 黑料社 continues to lead by demonstrating concrete progress 鈥 advancing from theoretical models to real quantum deployment.

The future of AI won't be built on yesterday鈥檚 tech. If we're serious about creating next-generation AI that unlocks the full promise of quantum computing, then we must build quantum-native models鈥攄esigned for quantum, from the ground up.

Around this time last year, we introduced Quixer, a state-of-the-art quantum-native transformer. Today, we鈥檙e thrilled to announce a major milestone: one year on, Quixer is now running natively on quantum hardware.

Why this matters: Quantum AI, born native

This marks a turning point for the industry: realizing quantum-native AI opens a world of possibilities.

Classical transformers revolutionized AI. They power everything from ChatGPT to real-time translation, computer vision, drug discovery, and algorithmic trading. Now, Quixer sets the stage for a similar leap 鈥 but for quantum-native computation. Because quantum computers differ fundamentally from classical computers, we expect a whole new host of valuable applications to emerge. 聽

Achieving that future requires models that are efficient, scalable, and actually run on today鈥檚 quantum hardware.

That鈥檚 what we鈥檝e built.

What makes Quixer different?

Until Quixer, quantum transformers were the result of a brute force 鈥渃opy-paste鈥 approach: taking the math from a classical model and putting it onto a quantum circuit. However, this approach does not account for the considerable differences between quantum and classical architectures, leading to substantial resource requirements.

Quixer is different: it鈥檚 not a translation 鈥 it's an innovation.

With Quixer, our team introduced an explicitly quantum transformer, built from the ground up using quantum algorithmic primitives. Because Quixer is tailored for quantum circuits, it's more resource efficient than most competing approaches.

As quantum computing advances toward fault tolerance, Quixer is built to scale with it.

What鈥檚 next for Quixer?

We鈥檝e already deployed Quixer on real-world data: genomic sequence analysis, a high-impact classification task in biotech. We're happy to report that its performance is already approaching that of classical models, even in this first implementation.

This is just the beginning.

Looking ahead, we鈥檒l explore using Quixer anywhere classical transformers have proven to be useful; such as language modeling, image classification, quantum chemistry, and beyond. More excitingly, we expect use cases to emerge that are quantum-specific, impossible on classical hardware.

This milestone isn鈥檛 just about one model. It鈥檚 a signal that the quantum AI era has begun, and that 黑料社 is leading the charge with real results, not empty hype.

Stay tuned. The revolution is only getting started.

technical
All
Blog
June 9, 2025
Join us at ISC25

Our team is participating in (ISC 2025) from June 10-13 in Hamburg, Germany!

As quantum computing accelerates, so does the urgency to integrate its capabilities into today鈥檚 high-performance computing (HPC) and AI environments. At ISC 2025, meet the 黑料社 team to learn how the highest performing quantum systems on the market, combined with advanced software and powerful collaborations, are helping organizations take the next step in their compute strategy.

黑料社 is leading the industry across every major vector: performance, hybrid integration, scientific innovation, global collaboration and ease of access.

  • Our industry-leading quantum computer holds the record for performance with a Quantum Volume of 2虏鲁 = 8,388,608 and the highest fidelity on a commercially available QPU available to our users every time they access our systems.
  • Our systems have been validated by a #1 ranking against competitors in a recent benchmarking study by J眉lich Research Centre.
  • We鈥檝e laid out a clear roadmap to reach universal, fully fault-tolerant quantum computing by the end of the decade and will launch our next-generation system, Helios, later this year.
  • We are advancing real-world hybrid compute with partners such as RIKEN, NVIDIA, SoftBank, STFC Hartree Center and are pioneering applications such as our own GenQAI framework.
Exhibit Hall

From June 10鈥13, in Hamburg, Germany, visit us at Booth B40 in the Exhibition Hall or attend one of our technical talks to explore how our quantum technologies are pushing the boundaries of what鈥檚 possible across HPC.

Presentations & Demos

Throughout ISC, our team will present on the most important topics in HPC and quantum computing integration鈥攆rom near-term hybrid use cases to hardware innovations and future roadmaps.

Multicore World Networking Event

  • Monday, June 9 | 7:00pm 鈥 9:00 PM at Hofbr盲u Wirtshaus Esplanade
    In partnership with Multicore World, join us for a 黑料社-sponsored Happy Hour to explore the present and future of quantum computing with 黑料社 CCO, Dr. Nash Palaniswamy, and network with our team.

H1 x CUDA-Q Demonstration

  • All Week at Booth B40
    We鈥檙e showcasing a live demonstration of NVIDIA鈥檚 CUDA-Q platform running on 黑料社鈥檚 industry-leading quantum hardware. This new integration paves the way for hybrid compute solutions in optimization, AI, and chemistry.
    Register for a demo

HPC Solutions Forum

  • Wednesday, June 11 | 2:20 鈥 2:40 PM
    鈥淓nabling Scientific Discovery with Generative Quantum AI鈥 鈥 Presented by Maud Einhorn, Technical Account Executive at 黑料社, discover how hybrid quantum-classical workflows are powering novel use cases in scientific discovery.
See You There!

Whether you're exploring hybrid solutions today or planning for large-scale quantum deployment tomorrow, ISC 2025 is the place to begin the conversation.

We look forward to seeing you in Hamburg!

events
All
Blog
May 27, 2025
Teleporting to new heights

黑料社 has once again raised the bar鈥攕etting a record in teleportation, and advancing our leadership in the race toward universal fault-tolerant quantum computing.

Last year, we demonstrating the first-ever fault-tolerant teleportation of a logical qubit. At the time, we outlined how crucial teleportation is to realize large-scale fault tolerant quantum computers. Given the high degree of system performance and capabilities required to run the protocol (e.g., multiple qubits, high-fidelity state-preparation, entangling operations, mid-circuit measurement, etc.), teleportation is recognized as an excellent measure of system maturity.

Today we鈥檙e building on last year鈥檚 breakthrough, having recently achieved a record logical teleportation fidelity of 99.82% 鈥 up from 97.5% in last year鈥檚 result. What鈥檚 more, our logical qubit teleportation fidelity now exceeds our physical qubit teleportation fidelity, passing the break-even point that establishes our H2 system as the gold standard for complex quantum operations.

Figure 1: Fidelity of two-bit state teleportation for physical qubit experiments and logical qubit experiments using the d=3 color code (Steane code). The same QASM programs that were ran during March 2024 on the 黑料社's H2-1 device were reran on the same device on April to March 2025. Thanks to the improvements made to H2-1 from 2024 to 2025, physical error rates have been reduced leading to increased fidelity for both the physical and logical level teleportation experiments. The results imply a logical error rate that is 2.3 times smaller than the physical error rate while being statistically well separated, thus indicating the logical fidelities are below break-even for teleportation.

This progress reflects the strength and flexibility of our Quantum Charge Coupled Device (QCCD) architecture. The native high fidelity of our QCCD architecture enables us to perform highly complex demonstrations like this that nobody else has yet to match. Further, our ability to perform conditional logic and real-time decoding was crucial for implementing the Steane error correction code used in this work, and our all-to-all connectivity was essential for performing the high-fidelity transversal gates that drove the protocol.

Teleportation schemes like this allow us to 鈥渢rade space for time,鈥 meaning that we can do quantum error correction more quickly, reducing our time to solution. Additionally, teleportation enables long-range communication during logical computation, which translates to higher connectivity in logical algorithms, improving computational power.

This demonstration underscores our ongoing commitment to reducing logical error rates, which is critical for realizing the promise of quantum computing. 黑料社 continues to lead in quantum hardware performance, algorithms, and error correction鈥攁nd we鈥檒l extend our leadership come the launch of our next generation system, Helios, in just a matter of months.

technical
All