

In the world of physics, ideas can lie dormant for decades before revealing their true power. What begins as a quiet paper in an academic journal can eventually reshape our understanding of the universe itself.
In 1993, nestled deep in the halls of Yale University, physicist Subir Sachdev and his graduate student Jinwu Ye stumbled upon such an idea. Their work, originally aimed at unraveling the mysteries of “spin fluids”, would go on to ignite one of the most surprising and profound connections in modern physics—a bridge between the strange behavior of quantum materials and the warped spacetime of black holes.
Two decades after the paper was published, it would be pulled into the orbit of a radically different domain: quantum gravity. Thanks to work by renowned physicist Alexei Kitaev in 2015, the model found new life as a testing ground for the mind-bending theory of holography—the idea that the universe we live in might be a projection, from a lower-dimensional reality.
Holography is an exotic approach to understanding reality where scientists use holograms to describe higher dimensional systems in one less dimension. So, if our world is 3+1 dimensional (3 spatial directions plus time), there exists a 2+1, or 3-dimensional description of it. In the words of Leonard Susskind, a pioneer in quantum holography, "the three-dimensional world of ordinary experience—the universe filled with galaxies, stars, planets, houses, boulders, and people—is a hologram, an image of reality coded on a distant two-dimensional surface."
The “SYK” model, as it is known today, is now considered a quintessential framework for studying strongly correlated quantum phenomena, which occur in everything from superconductors to strange metals—and even in black holes. In fact, The SYK model has also been used to study one of physics’ true final frontiers, quantum gravity, with the authors of the paper calling it “a paradigmatic model for quantum gravity in the lab.”
The SYK model involves Majorana fermions, a type of particle that is its own antiparticle. A key feature of the model is that these fermions are all-to-all connected, leading to strong correlations. This connectivity makes the model particularly challenging to simulate on classical computers, where such correlations are difficult to capture. Our quantum computers, however, natively support all-to-all connectivity making them a natural fit for studying the SYK model.
Now, 10 years after Kitaev’s watershed lectures, we’ve made new progress in studying the SYK model. In a new paper, we’ve completed the largest ever SYK study on a quantum computer. By exploiting our system’s native high fidelity and all-to-all connectivity, as well as our scientific team’s deep expertise across many disciplines, we were able to study the SYK model at a scale three times larger than the previous best experimental attempt.
While this work does not exceed classical techniques, it is very close to the classical state-of-the-art. The biggest ever classical study was done on 64 fermions, while our recent result, run on our smallest processor (System Model H1), included 24 fermions. Modelling 24 fermions costs us only 12 qubits (plus one ancilla) making it clear that we can quickly scale these studies: our System Model H2 supports 56 qubits (or ~100 fermions), and Helios, which is coming online this year, will have over 90 qubits (or ~180 fermions).
However, working with the SYK model takes more than just qubits. The SYK model has a complex Hamiltonian that is difficult to work with when encoded on a computer—quantum or classical. Studying the real-time dynamics of the SYK model means first representing the initial state on the qubits, then evolving it properly in time according to an intricate set of rules that determine the outcome. This means deep circuits (many circuit operations), which demand very high fidelity, or else an error will occur before the computation finishes.
Our cross-disciplinary team worked to ensure that we could pull off such a large simulation on a relatively small quantum processor, laying the groundwork for quantum advantage in this field.
First, the team adopted a randomized quantum algorithm called TETRIS to run the simulation. By using random sampling, among other methods, the TETRIS algorithm allows one to compute the time evolution of a system without the pernicious discretization errors or sizable overheads that plague other approaches. TETRIS is particularly suited to simulating the SYK model because with a high level of disorder in the material, simulating the SYK Hamiltonian means averaging over many random Hamiltonians. With TETRIS, one generates random circuits to compute evolution (even with a deterministic Hamiltonian). Therefore, when applying TETRIS on SYK, for every shot one can just generate a random instance of the Hamiltonain, and generate a random circuit on TETRIS at the same time. This simple approach enables less gate counts required per shot, meaning users can run more shots, naturally mitigating noise.
In addition, the team “sparsified” the SYK model, which means “pruning” the fermion interactions to reduce the complexity while still maintaining its crucial features. By combining sparsification and the TETRIS algorithm, the team was able to significantly reduce the circuit complexity, allowing it to be run on our machine with high fidelity.
They didn’t stop there. The team also proposed two new noise mitigation techniques, ensuring that they could run circuits deep enough without devolving entirely into noise. The two techniques both worked quite well, and the team was able to show that their algorithm, combined with the noise mitigation, performed significantly better and delivered more accurate results. The perfect agreement between the circuit results and the true theoretical results is a remarkable feat coming from a co-design effort between algorithms and hardware.
As we scale to larger systems, we come closer than ever to realizing quantum gravity in the lab, and thus, answering some of science’s biggest questions.
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.
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.
Join our experts and partners at our kiosks and for short sessions in our theater running throughout the day. Topics include:
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.
Our experts are also speaking in the SC26 technical program. Add these sessions to your schedule (all times CST):
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
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
3:30 – 4:00pm | Room: W181abc
Bringing Quantum Computing to the HPC Datacenter
Presenting: Kentaro Yamamoto
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.
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.
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.
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?
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.
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.
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.
[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.
Quantum computing is entering a new era. As systems move from Noisy Intermediate-Scale Quantum (NISQ) toward Fault-Tolerant Application-Scale Quantum (FASQ), traditional metrics like qubit count, gate fidelity, and gate speed are no longer enough to describe what a machine can actually deliver.
Developed by Sandia National Laboratories, with input from Quantinuum and NVIDIA, QUOPS—the Quantum Universal Operations Performance System—is a common, architecture-agnostic benchmark for measuring quantum performance across both physical- and logical-qubit systems on the path toward quantum utility.
QUOPS can be applied to different architectures, codes, modalities, and levels of fault tolerance. QUOPS runs the same randomized workloads across different computational shapes, measures whether each workload succeeds, identifies the boundary of a system’s capability region, and reports two summary metrics:
The result is a direct measure of how much computation a system can perform and how quickly it can do so. Together, these measurements provide a two-dimensional view of capability while reducing system performance to a common currency: quantum operations.
Component-level metrics remain essential for engineering. Qubit count, two-qubit fidelity, and gate speed can reveal control errors, crosstalk, leakage, connectivity constraints, and other system limitations. But they do not necessarily predict system-level performance.
Fault tolerance makes this gap even larger. Physical operations become logical computation with the addition of logical encoding, syndrome measurement, decoding, logical gate construction, magic-state production, routing, and control. Ultimately, this means that fault tolerance expands the relevant currencies of computation. Code distance, logical fidelity, magic-state throughput, decoding, connectivity, and space-time volume can matter far more for performance than raw qubit count or individual gate speeds.
This creates a growing challenge for buyers, governments, and researchers. As organizations move from experimentation toward larger-scale and potentially on-premise quantum systems, they need to know a simple thing:
What computation can a machine actually execute successfully?
QUOPS addresses that question by measuring the integrated system rather than inferring performance from individual components.
This is particularly important as the field considers workloads requiring roughly 10⁹–10¹² operations on thousands of qubits. Today's measured capabilities are still orders of magnitude smaller; QUOPS turns that gap into a measurable quantity.
QUOPS can also provide a practical layer for quantum procurement and planning.
HPC centers need to understand when quantum computing will become useful for real workloads. Customers may have a goal of procuring a system that can, for example, run a trillion error-free operations. Today, answering these questions can require complex resource estimates that depend on hardware modality, QEC code, magic-state factories, decoding, compilation, and other architectural choices.
In both cases, QUOPS provides a simpler system-level reference point: Q describes the size of computation a machine can execute, while Ω describes its effective throughput. Furthermore, because QUOPS is architecture-neutral and includes anti-gaming provisions, it can also help buyers compare competing systems without relying solely on vendor-selected metrics or announcements.
While QUOPS is a new benchmark, it has already been measured on several vendors’ hardware. This marks an important step for our industry: we can now compare vendors directly, assessing their capabilities in a way that flattens the differences introduced by modality and architecture choices.
Figure 1. The QUOPS capability region and score for state-of-the-art processors from Quantinuum, Google, and IBM (adapted from Figure 2 of the scientific publication co-authored by Quantinuum, Sandia National Laboratories, and NVIDIA). QUOPS specifies a random circuit construction that can be built for a specified width (number of qubits) and size (number of quantum gates). A set of circuits is run at several width and size points and the average fidelity of those circuits are measured and compared to a predefined threshold. Each labeled point above represents experimental data from QUOPS circuits that passed the threshold with high confidence. The lines are filled capability limits of each machine between the points. The stars indicate the QUOPS score (Q), which is the experimental data point that passes the threshold with maximum size inside the shaded cone of width2 ≤ size ≤ width3.
Figure 2. The QUOPS score (Q) vs rate (Ω) for state-of-the-art processors from Quantinuum, Google, and IBM (adapted from Figure 2 of the QUOPS scientific publication co-authored by Quantinuum, Sandia National Laboratories, and NVIDIA). Each point is the maximum QUOPS circuit size that passes the threshold within the specified cone and rate that it was run. The dashed lines indicate the extrapolated effect of error mitigation, which attenuates the rate by including the shot overhead needed for general-purpose error mitigation. The gradient lines show the estimated runtime of a circuit at a given score and rate.
Figures 1 and 2 show how QUOPS quantifies the capability tradeoffs between different systems. Willow and Boston are superconducting systems with very fast gate speeds but limited connectivity, while Helios is a trapped-ion QCCD system with effective all-to-all connectivity but much slower gates. Willow and Boston have smaller capability regions and QUOPS scores but higher QUOPS rates; while Helios reaches larger capability regions and QUOPS scores but lower QUOPS rates. All three systems have the ability to trade speed for larger circuits with error mitigation. This is commonly assumed in the community but is nicely quantified with the QUOPS rate, which accounts for the corresponding sampling overheads of general error mitigation techniques (as shown by the dashed lines in Figure 2).
QUOPS will not replace every quantum benchmark. The field will continue to need application-specific suites, component-level measurements, hybrid-HPC benchmarks, and independent verification.
QUOPS instead serves as a common system-level yardstick that can make roadmaps more comparable, procurement more objective, and progress easier to track.
We are calling on vendors to report QUOPS metrics (Q, Ω) and capability regions alongside existing metrics, buyers and agencies to consider QUOPS thresholds in RFPs, and researchers to contribute fault-tolerant architectures and resource estimates.
As quantum computers become fault tolerant, success will no longer be defined simply by how many qubits a machine contains or how low its error rates are.
It will be defined by the computation the machine can deliver.
QUOPS is a step toward measuring that capability—and toward giving the quantum industry a benchmark built for the era ahead.