Has quantum advantage been achieved?

Imagine you are trying to prove that a new, super-fast race car exists. You don't just want to say, "It's fast!" You want to actually race it against the world's best human runner and show that the car wins by a huge margin.

This paper, written by physicist Dominik Hangleiter in 2026, is essentially a defense attorney's closing argument. He is addressing a skeptical jury (the scientific community) and asking: "Have we actually proven that quantum computers can do things classical computers can't?"

Here is the breakdown of his argument, using simple analogies.

The Big Question: Did We Win the Race?

Hangleiter starts by admitting something surprising. When he asked physicists at conferences, "Do you think quantum advantage has been achieved?" less than half said "Yes."

Many scientists are skeptical because:

The "Cheating" Fear: They think the quantum computers were just doing a useless trick that classical computers could eventually figure out.
The "Noise" Problem: Quantum computers are currently very "noisy" (like a radio with static). Critics argue that if you add enough static, the signal becomes so weak that a normal computer could fake it.

Hangleiter's answer is a resounding "Yes, we have won, but we need to understand how we won."

Part 1: The "Random Circuit" Game

To prove the quantum computer is special, scientists didn't ask it to solve a math problem (like factoring numbers) because the machines aren't big enough yet. Instead, they played a game called Random Circuit Sampling (RCS).

The Analogy: The Dice Roll
Imagine a quantum computer is a magical dice roller.

The Task: You give the computer a specific, complex recipe for rolling dice (a "circuit").
The Goal: The computer rolls the dice and gives you a string of numbers (0s and 1s).
The Catch: The pattern of numbers it produces is so incredibly complex that a classical supercomputer would take 10,000 years to predict the pattern. The quantum computer does it in minutes.

The Proof:
To check if the quantum computer actually did the magic, scientists use a score called XEB (Linear Cross-Entropy Benchmark).

Think of XEB as a "truth meter."
If the quantum computer is perfect, the score is 1.
If it's just guessing randomly (like a broken machine), the score is 0.
The Google and USTC experiments got scores significantly higher than 0, proving they weren't just guessing.

The Skeptic's Counter-Argument:
"But wait!" the skeptics say. "The quantum computer is noisy. Maybe it's just a broken machine that happens to look good on the truth meter."

Hangleiter explains that scientists realized there is a Phase Transition (a tipping point).

The Tipping Point: If the noise is too high, the "truth meter" (XEB) lies to you. A broken machine can fake a high score.
The Reality: Hangleiter shows that the recent experiments operated below this tipping point. The noise was low enough that the "truth meter" was actually telling the truth. The quantum computer really was doing something complex.

Part 2: Why Should We Trust the Data?

Hangleiter compares these experiments to the discovery of the Higgs Boson or Gravitational Waves.

When scientists found the Higgs Boson, they didn't just "see" it. They had to filter through mountains of data, use complex theories to predict what it should look like, and extrapolate from smaller, easier experiments.
Quantum advantage is the same. We can't calculate the answer classically (that's why it's an advantage!), so we use "proxies" (shortcuts) and math models to verify the result.

The Verdict: If you believe in the Higgs Boson, you should believe in Quantum Advantage. The method of proof is the same: rigorous testing, noise modeling, and statistical certainty.

Part 3: What's Next? (The "100 Logical Qubits" Goal)

So, we have proven quantum advantage exists. But Hangleiter admits: These experiments are still useless for real life. They are like a race car that can only drive in a straight line on a test track. It can't drive you to the grocery store yet.

He proposes three next steps to move from "Cool Science Trick" to "Useful Technology":

1. The "Fault-Tolerant" Race Car

Right now, if a quantum bit (qubit) makes a mistake, the whole calculation crashes.

The Goal: Build a system where the computer can fix its own mistakes (Error Correction).
The Plan: Run the "Random Circuit" game using "Logical Qubits" (groups of physical qubits working together as one perfect unit). If we can do this with 100 logical qubits, we prove we can run complex, error-free calculations.

2. The "Symmetry" Check (Trusted Experimenter)

Currently, checking the results is hard. Hangleiter suggests a new game: Random Circuits with Symmetries.

The Analogy: Imagine the quantum computer is building a snowflake. We know snowflakes have perfect symmetry.
The Trick: We design the game so that if the computer does it right, the result must have a specific symmetry. If the result is messy, we know it failed.
Why it helps: This lets us verify the computer worked correctly without needing a supercomputer to check the math.

3. The "Secret Code" (Untrusted Server)

This is the "Holy Grail." Imagine you want to use a quantum computer in the cloud (like Amazon or Google), but you don't trust them. How do you know they actually used a quantum computer and didn't just fake the results with a normal laptop?

The Plan: The verifier (you) hides a "secret" in the instructions (like a hidden peak in a mountain range).
The Test: Only a real quantum computer can find the peak and report it back. A classical computer faking the results would never find the hidden peak.
The Result: This would allow us to generate certifiable random numbers (perfectly random numbers that no one can predict), which is a huge deal for security and encryption.

The Bottom Line

Hangleiter concludes that Quantum Advantage has been achieved. We have proven that quantum machines can solve specific problems faster than any classical machine.

However, we are still in the "Wright Brothers" era of flight. We have proven a plane can fly, but we haven't built a jumbo jet that can carry passengers yet. The next decade is about building those "jumbo jets" (fault-tolerant, verifiable systems) so we can finally use quantum computers to solve real-world problems like designing new drugs or breaking encryption.

In short: The race car is real, it's fast, and it's beating the human runner. Now we just need to teach it how to drive on the highway.

Based on the provided article by Dominik Hangleiter (dated March 11, 2026), here is a detailed technical summary of the paper regarding the status of quantum advantage.

1. Problem Statement

The central question addressed is whether quantum advantage (the ability of a quantum device to perform a task infeasible for classical computers) has been definitively achieved.

Context: Since the 2019 Google "quantum supremacy" claim (Random Circuit Sampling, or RCS), skepticism has persisted within the community. Critics argue that:
- Early experiments were simulated by classical algorithms shortly after publication.
- The verification methods (Linear Cross-Entropy Benchmark, XEB) rely on extrapolations from classically tractable regimes.
- The experiments operate in a "noisy" regime where fidelity is low, raising questions about whether the task remains classically hard when noise is accounted for.
- There is a lack of device-independent verification (i.e., verifying the result using only classical samples without trusting the hardware).
Goal: The author aims to convince the community that existing experiments have demonstrated quantum advantage by rigorously analyzing the noise regimes, the validity of proxies (XEB), and the complexity of the tasks solved.

2. Methodology

The paper employs a multi-disciplinary approach combining experimental physics, computational complexity theory, and statistical mechanics:

Review of Experimental Data: Analysis of RCS experiments by Google (superconducting qubits), USTC (superconducting), and Quantinuum (trapped ions) from 2019 to 2025.
Complexity Analysis: Examining the hardness of Finite-Fidelity Random Circuit Sampling (FF-RCS). The author investigates whether sampling from a noisy quantum state (with fidelity $\delta$ ) remains classically hard as $\delta$ decreases.
Phase Transition Modeling: Utilizing a mapping between XEB decay and statistical-mechanics models to define a "weak-noise" vs. "strong-noise" regime. This determines when XEB is a reliable proxy for state fidelity.
Counter-Argument Analysis: Systematically addressing skepticism regarding noise scaling, verification loopholes, and the "unfairness" of tailored tasks.
Future Roadmap: Proposing theoretical frameworks for the "100 logical qubit" regime to close remaining loopholes.

3. Key Contributions

A. Validation of the "Weak-Noise" Regime

The author establishes that the recent experiments operate in a weak-noise regime, which is crucial for the validity of the advantage claim.

The Phase Transition: There is a critical noise threshold ( $\epsilon < c_A/n$ $ϵ < c_{A} / n$ ).
- Below Threshold (Weak Noise): The Linear Cross-Entropy Benchmark (XEB) is a reliable proxy for the actual state fidelity. The decay rate of XEB matches the decay of fidelity ( $\exp(-\epsilon n d)$ ).
- Above Threshold (Strong Noise): XEB decays much slower than fidelity. In this regime, classical "spoofing" algorithms can generate high XEB scores while the actual state fidelity is exponentially low, rendering the benchmark meaningless.
Experimental Verification: The author demonstrates that Google, USTC, and Quantinuum experiments have noise rates scaling better than $1/n $(specifically$ \epsilon \sim 1/(nd)$), keeping them safely within the weak-noise regime where XEB accurately reflects fidelity.

B. Complexity of Finite-Fidelity RCS

The paper argues that Finite-Fidelity RCS remains classically hard even with the low fidelities ( $\delta \approx 0.1\%$ ) achieved in experiments.

While classical algorithms can exploit reduced fidelity to speed up simulation, the cost remains exponential in the number of qubits.
The author asserts that no efficient classical algorithm exists for the specific fidelity levels achieved in the 2024–2025 experiments (70–83 qubits), unlike the 2019 53-qubit experiment which was eventually simulated.

C. Defense of Extrapolation Methods

Addressing the criticism that XEB cannot be computed directly in the advantage regime:

The author defends the use of proxies and extrapolation (from small systems or structured circuits) as standard scientific practice, comparable to the discovery of the Higgs boson or gravitational waves.
Consistency across different extrapolation methods (varying system sizes, adding structure) provides robust evidence that the reported XEB values are accurate.

D. Roadmap to "Classically Verifiable" Advantage

The paper identifies the current limitations (reliance on trusted experimenters) and proposes a path forward for the 100 logical qubit regime:

Fault-Tolerant Advantage: Using IQP (Instantaneous Quantum Polynomial) circuits, which are naturally compatible with error correction, to achieve near-perfect fidelity.
Symmetry-Based Verification: Introducing Random Circuits with Symmetries (e.g., Graph States, Bell Sampling). These allow for efficient verification of state fidelity using specific measurements (stabilizers) without needing to simulate the full circuit.
Planted Secrets (Untrusted Server): Developing schemes where a "secret" structure (e.g., a hidden peak in the distribution) is planted in the circuit. This would allow a classical verifier to check the output without trusting the quantum server, potentially enabling certifiable random number generation.

4. Results

Confirmation of Advantage: The author concludes that quantum advantage has been achieved. The experiments successfully solved a computational task (FF-RCS) that is intractable for classical computers, operating in a regime where the verification metric (XEB) is physically and theoretically sound.
Noise Scaling: The experiments have successfully improved error rates such that they satisfy the weak-noise condition ( $\epsilon < c_A/n$ ), invalidating arguments that the results could be explained by strong-noise spoofing.
Fidelity vs. Randomness: The achieved fidelities ( $\sim 0.1\%$ ) are vastly superior to the trivial baseline of a maximally mixed state ($2^{-n}$), confirming that the quantum device is performing a non-trivial computation.

5. Significance

Scientific Consensus: The paper aims to resolve the polarization in the community by providing a rigorous theoretical framework that validates the experimental claims, moving the field from "debate" to "acceptance."
Methodological Shift: It highlights that quantum advantage verification is not just about raw speed but about understanding the noise landscape and the relationship between benchmarks and physical fidelity.
Future Direction: It sets a clear agenda for the next generation of quantum computing:
- Moving from "noisy" advantage to fault-tolerant advantage.
- Transitioning from "physics-style" verification (trusted experimenter) to cryptographic verification (untrusted server).
- Identifying IQP circuits as the ideal candidate for bridging the gap between random sampling and practical, verifiable algorithms.
Practical Application: The ultimate goal outlined is the generation of classically certifiable random numbers, representing the first commercially or scientifically useful application of quantum advantage.

In summary, Hangleiter argues that while current quantum computers are noisy and the tasks are "useless" (sampling), the demonstration of quantum advantage is real and scientifically sound. The path forward lies in scaling to 100 logical qubits to achieve fault tolerance and develop verification protocols that do not require trusting the quantum hardware.