- 3,000× speedup — quantum completed in 2 minutes what classical needed 100+ hours for
- 60% gate count reduction by Q-CTRL's Fire Opal compiler vs native Qiskit — the engineering that made it possible
- 12,635 atoms — largest biologically meaningful molecule ever simulated on quantum hardware (May 5 2026)
- 40× larger protein simulation than six months prior — driven by the EWF-TrimSQD algorithm
- 120 qubits, 10,000+ two-qubit gates — circuit depth previously considered infeasible on NISQ hardware
- IBM Starling roadmap: 200 logical qubits under error correction by 2029
On May 6, 2026, Q-CTRL ran a materials science simulation on an IBM quantum computer in 2 minutes. The best classical supercomputer needed over 100 hours to reach the same accuracy — and then gave up. The day before, IBM, Cleveland Clinic, and RIKEN simulated a 12,635-atom protein, 40 times larger than anything attempted six months prior. After 30 years of promises, practical quantum advantage arrived. What actually changed was a compiler.
The Story
For years, quantum computing has been a promise. Now, quantum computers are producing results that matter to science. The systems we simulated here are the kind of molecules that biologists and chemists work with in the real world.
— Jay Gambetta, Director of IBM Research, IBM Think 2026, Boston
On May 19 2026, Google Trends showed a BREAKOUT signal — the highest possible designation — on the query "what is quantum computing in simple terms." The trigger was two announcements that landed within 48 hours of each other. On May 5, scientists at Cleveland Clinic, RIKEN, and IBM used quantum computers to simulate trypsin, a protein with 12,635 atoms — the largest biologically meaningful molecule ever simulated on quantum hardware, 40 times larger than what the same method could achieve just six months prior. On May 6, Q-CTRL demonstrated a 3,000× speedup on a problem of real commercial relevance. The physics community called it practical quantum advantage — the first time a quantum computer had demonstrably outperformed the best classical tool on a problem that matters outside a laboratory.
Understanding why these results matter requires understanding what stood in the way. NISQ (Noisy Intermediate-Scale Quantum — the current era of quantum computing, characterised by processors with 50–1,000 qubits that are not error-corrected, meaning errors accumulate as circuit depth grows and place hard limits on what computations can run reliably) quantum computers accumulate errors with every two-qubit gate (the fundamental entangling operation in quantum computing — essential for quantum algorithms but a primary source of error in NISQ hardware, with typical error rates of 0.1–1% per gate). At shallow circuit depths with a handful of gates, error mitigation can recover useful results. At 10,000+ gates across 120 qubits — the depth required for commercially meaningful simulations — errors historically compounded until the output was indistinguishable from noise. This was the wall. The May 2026 results are not the wall coming down. They are the first evidence that engineers have found a way to work precisely enough within its constraints that real problems now fall on the quantum side of it.
Problem
NISQ Wall: Errors Compound Before Computation Completes
NISQ quantum processors accumulate errors with every two-qubit gate. For shallow circuits (hundreds of gates), error mitigation can recover useful results. For commercially meaningful simulations (10,000+ gates), errors historically compounded until the quantum output was indistinguishable from random noise. This wall had blocked practical quantum advantage for three decades.
Cause
Gate Count Was the Critical Variable
Every additional two-qubit gate multiplies error probability. IBM's native Qiskit compiler produced correct but gate-heavy implementations. Q-CTRL's Fire Opal compiler took the same algorithm and reduced gate count by 60% through circuit optimisation and error suppression. That 60% reduction was the difference between circuits that collapsed into noise and circuits that produced valid results.
Solution
Two Simultaneous Breakthroughs: Materials and Biology
May 5: IBM, Cleveland Clinic, and RIKEN simulated a 12,635-atom protein using quantum-centric supercomputing — fragmenting the molecule, computing quantum-mechanical behaviour on IBM Heron processors, and assembling results on Fugaku and Miyabi-G supercomputers. May 6: Q-CTRL demonstrated 3,000× speedup on the Fermi-Hubbard model, completing in 2 minutes what took classical computers 100+ hours.
Result
Practical Quantum Advantage: The Field's First
On May 6 2026, Q-CTRL declared practical quantum advantage — the first time a quantum computer had outperformed the best available classical tool on a problem of known commercial relevance, using hardware accessible to any developer via the IBM Quantum Platform. IBM CEO Arvind Krishna had predicted quantum advantage would arrive in 2026. The prediction was correct.
The Fix
The Engineering Stack That Made It Possible
The Q-CTRL result did not emerge from better quantum hardware alone. It emerged from a full engineering stack combining IBM's hardware, Q-CTRL's compiler, and years of quantum control research. Three layers mattered: the hardware layer (IBM Heron's 156-qubit chip with improved coherence times and gate fidelity), the compilation layer (Q-CTRL's Fire Opal reducing gate count by 60%), and the error suppression layer (runtime techniques that actively suppress errors during execution). None of these layers alone would have been sufficient — the result is an emergent property of all three operating together.
- 3,000× — wall-clock speedup of quantum over classical: 2 minutes vs 100+ hours on the best available classical hardware and software
- 60% — gate count reduction by Fire Opal vs native Qiskit — the single optimisation that made the circuit depth feasible
- 12,635 — atoms in the trypsin protein simulated by Cleveland Clinic + RIKEN + IBM
- 40× — increase in simulation system size achieved in six months, driven by the EWF-TrimSQD algorithm
# Conceptual: What Fire Opal does differently from native Qiskit compilation
# The 60% gate reduction is the engineering story in code form
# NATIVE QISKIT: correct but gate-heavy
from qiskit import QuantumCircuit, transpile
from qiskit_ibm_runtime import QiskitRuntimeService
backend = QiskitRuntimeService().backend('ibm_heron_r2') # 156-qubit Heron
# Fermi-Hubbard Trotter circuit at 90 steps:
# Naive implementation produces ~15,000+ two-qubit (CX) gates
circuit = build_fermi_hubbard_circuit(n_qubits=120, n_trotter_steps=90)
native = transpile(circuit, backend=backend)
# ~15,000+ CX gates → error rate exceeds threshold → output is noise
# Q-CTRL FIRE OPAL: noise-aware compilation
import fire_opal
# Fire Opal applies four optimisations simultaneously:
# 1. Circuit rewriting — finds equivalent circuits with fewer gates
# 2. Noise-aware qubit mapping — minimises cross-talk between physical qubits
# 3. Dynamical decoupling — inserts refocusing pulses to cancel drift errors
# 4. Gate fusion — combines adjacent compatible gates into single operations
result = fire_opal.run(
circuits=[circuit],
backend=backend,
optimization_level='aggressive',
error_suppression=['dynamical_decoupling', 'gate_twirling']
)
# ~6,000 CX gates — 60% reduction
# Circuit runs within error tolerance → produces results accurate enough
# to match and then exceed the classical TDVP benchmark
# Wall time: ~2 minutes
# Classical TDVP equivalent: 100+ hours before diverging irreconcilably
The Cleveland Clinic protein simulation: EWF-TrimSQD explained
The May 5 simulation used a quantum-centric supercomputing (QCSC) approach — pairing IBM Heron quantum processors at Cleveland Clinic (USA) and RIKEN (Japan) with two classical supercomputers: Fugaku at RIKEN and Miyabi-G at the University of Tokyo. The key algorithm was EWF-TrimSQD (Embedding Workflow with Tailored Reduced-qubit Molecular Dynamics) — a quantum-classical hybrid that fragmented the 12,635-atom trypsin protein into computable pieces, computed quantum-mechanical behaviour on QPUs (up to 94 qubits, ~6,000 quantum operations per fragment), and reconstructed the full protein's behaviour on classical supercomputers. The 40× system size increase in six months came from algorithmic improvement in how fragments were computed and assembled.
IBM Quantum roadmap: Loon to Starling
IBM Quantum Loon (November 2025) was the first processor to demonstrate all hardware components required for fault-tolerant quantum computing: c-couplers for long-range qubit connectivity, qubit reset between computations, and high-fidelity gates at FTQC-relevant speeds. IBM also achieved real-time qLDPC (quasi-cyclic Low-Density Parity-Check codes — IBM's chosen error-correcting code, requiring fewer physical qubits per logical qubit than the surface code) decoding in under 480 nanoseconds — a full year ahead of schedule. IBM Starling targets 200 logical qubits under full error correction by 2029.
Architecture
Both May 2026 achievements reflect the same architectural pattern: quantum processors are specialised accelerators for specific types of computation, tightly integrated with classical CPUs and GPUs that handle the parts of the problem where quantum offers no advantage. IBM calls this Quantum-Centric Supercomputing (QCSC) — a heterogeneous computing architecture where tasks are assigned to the compute layer where they run best. Quantum does not replace classical computing. It extends it.
The NISQ Error Accumulation Problem: Why Circuit Depth Is the Wall
View interactive diagram on TechLogStack →
Interactive diagram available on TechLogStack (link above).
Quantum-Centric Supercomputing (QCSC): The Cleveland Clinic Architecture
View interactive diagram on TechLogStack →
Interactive diagram available on TechLogStack (link above).
IBM Quantum Roadmap: From NISQ to Fault Tolerance (2025–2029)
View interactive diagram on TechLogStack →
Interactive diagram available on TechLogStack (link above).
Lessons
Quantum advantage arrived not from better qubits alone, but from better compilers. Q-CTRL's Fire Opal reduced gate count by 60% on the same IBM hardware that was already available. The 3,000× speedup was enabled by 60% fewer gates — and 60% fewer gates was enabled by years of investment in quantum control theory and noise-aware compilation. Hardware and software co-optimisation, not hardware alone, crossed the threshold.
Quantum-centric supercomputing (a heterogeneous architecture pairing quantum processors with classical CPUs and GPUs, assigning each part of a problem to the resource where it runs best) is how quantum advantage works in practice. Quantum computers do not replace classical computers — they accelerate the specific parts where quantum mechanics provides exponential advantage. Drug discovery, materials simulation, and optimisation are the first domains where this integration delivers measurable commercial results.
Error suppression and circuit optimisation are the engineering disciplines that matter most in the NISQ era. Error correction remains the long-term goal (IBM Starling, 2029), but error suppression — reducing gate count, noise-aware mapping, dynamical decoupling — is the bridge that makes today's hardware useful for real problems. Engineers building on quantum hardware should invest as much in compilation optimisation as in circuit design.
The rate of improvement is accelerating. 40× larger molecule simulation in six months. A year-ahead-of-schedule qLDPC decoder. Trotter (a simulation technique approximating quantum time evolution by breaking it into small sequential steps — 90 Trotter steps at 120 qubits with useful accuracy was previously considered infeasible on NISQ hardware) depth at 90 steps on 120 qubits that would have been impossible two years ago. Organisations that start developing quantum-advantage applications now will be ahead of those waiting for the technology to "mature."
Practical quantum advantage arrived on public cloud infrastructure. Q-CTRL's 3,000× speedup was achieved on IBM Quantum Platform hardware accessible via API to any registered developer — not on a private research machine. The cloud-first approach IBM took in 2016 is what made May 2026's results broadly verifiable and immediately applicable.
Engineering Glossary
Dynamical decoupling — a quantum error suppression technique that inserts short refocusing pulses during circuit execution to cancel low-frequency noise and drift errors. One of the core techniques used by Q-CTRL's Fire Opal to reduce effective error rates without requiring full error correction.
Fermi-Hubbard model — a foundational model in condensed matter physics describing interacting electrons on a lattice. Used to understand high-temperature superconductivity, Mott insulators, and quantum magnetism. Classical simulation cost grows exponentially with system size — a 60-electron system has 2^60 possible states. The Q-CTRL result is the first real-world confirmation that quantum computers provide exponential advantage on this class of problem.
Fire Opal — Q-CTRL's performance-management software for quantum computers. Applies circuit rewriting, noise-aware qubit mapping, dynamical decoupling, and gate fusion to reduce two-qubit gate count and improve circuit fidelity. Achieved 60% gate reduction vs native Qiskit on the Fermi-Hubbard circuit.
Logical qubit — a fault-tolerant qubit encoded across multiple physical qubits, with error detection and correction running continuously. The target unit for IBM Starling (200 logical qubits by 2029). Contrasted with physical qubits, which are noisy and uncorrected.
NISQ (Noisy Intermediate-Scale Quantum) — the current era of quantum computing, characterised by processors with 50–1,000 physical qubits that are not error-corrected. Errors accumulate as circuit depth grows, placing hard limits on computation length. The May 2026 results were achieved within NISQ constraints, not beyond them.
qLDPC (quasi-cyclic Low-Density Parity-Check codes) — IBM's chosen quantum error-correcting code, requiring fewer physical qubits per logical qubit than the surface code used by most competitors. IBM achieved real-time qLDPC decoding in under 480 nanoseconds in November 2025 — a year ahead of schedule.
Quantum-centric supercomputing (QCSC) — IBM's heterogeneous computing architecture pairing quantum processors with classical CPUs and GPUs, assigning each part of a computation to the resource where it runs best. The architectural model used in the Cleveland Clinic protein simulation.
Two-qubit gate — the fundamental entangling operation in quantum computing that creates correlations between qubits. Essential for quantum algorithms but a primary source of error in NISQ hardware. Reducing two-qubit gate count is the primary lever for improving circuit fidelity on today's hardware.
This case is a plain-English retelling of publicly available engineering material.
Read the full case on TechLogStack →
(Interactive diagrams, source links, and the full reader experience)
TechLogStack — built at scale, broken in public, rebuilt by engineers.
Top comments (0)