What It Actually Speeds Up, and What to Do About It | Adople AI Research

Adople builds enterprise AI solutions and AI agents that automate critical workflows, connect fragmented data, and transform information into intelligent action.

  • Address

    600 California St, San Francisco, CA 94108
  • Email

    info@adople.ai
  • Contact

    +1 (415) 630-2010
RESEARCH PAPER — RQ-2026-04Peer-reviewed briefingNIST · Google · arXiv

What It Actually Speeds Up, and What to Do About It

In this article, you will learn how a quantum computer represents and processes information, which problems it is known to speed up and which it is not, what the current hardware can and cannot do, and the one area where engineers should act now: cryptography.

Fault-Tolerant Quantum Stack Architecture
Engineering Takeaway: Google Willow (<5 min vs classical 10²⁵ yrs) is a real milestone, but everyday speedups require specific mathematical structure. Cryptography is the immediate action area.
ARTICLE OVERVIEW

Topics we will cover include:

Five questions answered in order. Use them to navigate the full briefing below.

T-01
Amplitudes, not “0 and 1 at once”
Why a qubit is better described by amplitudes than by “0 and 1 at once”.
Jump to section →
T-02
Superposition + Entanglement
How superposition, entanglement and interference combine in a circuit.
Jump to section →
T-03
Proven vs unproven speedups
Where quantum speedups are established, and where claims are unproven.
Jump to section →
T-04
Error-correction cost
What error correction costs, with Willow results and 2025 RSA-2048 estimate.
Jump to section →
T-05
PQC checklist
A practical checklist for post-quantum cryptography.
Jump to section →
01Context & Significance

Why This Matters: A Real Milestone and a Common Overstatement

<5 min
Willow benchmark · Dec 2024
10²⁵ yrs
Google classical estimate · 10 septillion

In December 2024, Google reported that its Willow chip completed a benchmark computation in under five minutes. Google estimated that one of today’s fastest supercomputers would need about 10 septillion (10^25) years for the same task. Google also stated its own caveats. The estimate rests on conservative assumptions, classical methods will keep improving, and the benchmark has no known practical application.

The result is a real engineering milestone. It is not evidence that quantum computers are about to outperform classical ones on everyday workloads. The rest of this page separates what has been shown from what has been claimed.

📄
Engineer’s takeaway
Milestone is real; everyday speedup is not shown. Keep the benchmark and its caveats together whenever you cite it.
02How Information Is Represented

The Computational Model

A classical register of n bits holds exactly one of 2^n values at a time. A register of n qubits is described by 2^n complex numbers, called amplitudes, one for each possible bit string. The probability of measuring a given bit string is the squared magnitude of its amplitude, and the probabilities sum to 1.

FIG. 01 — Classical Bits vs Qubit State Vector

Two consequences follow:

Measurement returns one outcome. Reading the register collapses it to a single n-bit string. The 2^n amplitudes are never read out directly. Algorithms repeat the run many times (called shots) and look at the distribution of results.

The size is large but not free. With 300 qubits, 2^300 is about 2×10^90, far more than the roughly 10^80 atoms usually cited for the observable universe. A classical machine cannot store that many amplitudes, and a quantum machine does not store them explicitly. It evolves them physically. But because measurement returns only one string, quantum computing is not “try every answer at once and read the right one.”

The skill in quantum algorithm design is to arrange the amplitudes so that, at measurement time, the correct answer is overwhelmingly likely.

03The Three Mechanisms

Three Properties and How They Work Together

FIG. 02 — THREE PROPERTIES COMBINED
SUPERPOSITION → ENTANGLEMENT → INTERFERENCE
01H|0⟩
Superposition
Combination of |0⟩ and |1⟩ with amplitudes. Alone returns random bit string.
02H+CNOT
Entanglement
Correlated states. Bell state via H + CNOT. Results always agree.
03Σ ±α
Interference
Wrong answers cancel (−), correct answers add (+). The mechanism that works.

Superposition. A qubit’s state is a combination of the two basis states with amplitudes for each. By itself, superposition is not useful. Measuring a uniform superposition just returns a random bit string.

Entanglement. Entangled qubits have correlated states that cannot be described as independent parts. The standard example is a Bell state, built with a Hadamard (H) gate on one qubit followed by a controlled-NOT (CNOT) gate. Measuring either qubit gives a random result, but the two results always agree.

Interference. This is what makes algorithms work. Because amplitudes can be positive or negative, a circuit can make the amplitudes of wrong answers cancel and those of correct answers add up. Probabilities cannot cancel this way, which is why “a qubit is a probability distribution” is a misleading summary.

A minimal demonstration of interference: apply H to a qubit starting in state 0, and measuring gives 0 or 1 with equal probability. Apply H a second time and the result is 0 with certainty. The two paths leading to outcome 1 carry amplitudes of opposite sign and cancel, and the two paths leading to outcome 0 add.

FIG. 03 — Two Hadamard Operations (Interference)
StepOperationResult
Initial stateQubit starts in 00
First operationApply HEqual probability of 0 or 1
Second operationApply H again0 with certainty
04Speedup Map

What Quantum Computers Are Fast At

The speedup is structural: it exists only for problems with the right mathematical shape.

FIG. 04 — PROBLEM CLASS → STATUS MAPPING
STRUCTURAL ADVANTAGE
Problem classStatus
Factoring integers (Shor’s algorithm)Exponential speedup over the best known classical algorithms. This is the basis of the cryptographic threat.
Unstructured search (Grover’s algorithm)Quadratic speedup.
Simulating quantum systems (molecules, materials)The most natural fit, since the hardware models quantum physics directly.
Quantum machine learningMost proposed algorithms lack convincing speedups on practical problems.
General optimizationPromising in narrow cases, with no general advantage shown.
Accelerating AI training or financial modelingNot supported by current algorithms.

For most software today, almost nothing in the stack falls into a category that quantum computers accelerate. Cryptography is the exception.

05Constraints

The Hardware Reality

FIG. 05 — NOISE · COHERENCE · CORRECTION · SCALE
PHYSICAL LIMITS
NOISE
Heat · EM · vibration
Runs near absolute zero
COHERENCE
µs – ms hold time
State decays quickly
LOGICAL QUBIT
100s–1000s physical
Per reliable qubit
SCALE
Few thousand physical
Verify vendor roadmaps
Superconducting← trade-offs in coherence · speed · scalability →Trapped ionsPhotonic

Noise. Heat, electromagnetic interference and vibration can destroy a quantum state. Superconducting systems run near absolute zero for this reason.

Coherence time. On most current hardware, qubits hold their state for microseconds to milliseconds.

Error correction is expensive. One reliable logical qubit takes hundreds to thousands of physical qubits, depending on the code and the target error rate.

Scale. According to the source article, the largest systems have a few thousand physical qubits. Verify against current vendor roadmaps before quoting a figure.

Several hardware approaches exist. Superconducting circuits, trapped ions and photonic systems are all being developed, with different trade-offs in coherence, speed and scalability.

06Below Threshold

Error Correction: What Willow Showed

FIG. 06 — 3×3 → 5×5 → 7×7 ENCODED SURFACE CODE GRIDS
WILLOW 105-QUBIT BENCHMARK
3 × 3 — 105-QUBIT WILLOW
ε₀ baseline
5 × 5 — 105-QUBIT WILLOW
ε₀ / 2 — halved
7 × 7 — 105-QUBIT WILLOW
ε₀ / 4 — halved again

Willow has 105 qubits. Google tested encoded-qubit grids of 3×3, 5×5 and 7×7 and reported that the error rate was cut in half at each step up in size. This is called operating “below threshold”: adding more physical qubits makes the logical qubit better, not worse. Google also reported real-time error correction on a superconducting system and a result “beyond breakeven,” where the encoded array lived longer than the individual physical qubits it was built from.

This is the property a scalable machine needs. It is not a demonstration of a useful computation. Google says that remains the next goal.

07Act Now

The Cryptography Case: Why Engineers Should Act Now

FIG. 07 — RSA-2048 RESOURCE ESTIMATES COMPARISON
SHOR'S ALGORITHM IMPACT
2019 ESTIMATE — RESOURCE ESTIMATE
~20M
noisy physical qubits · ~8 hours runtime
Square grid · nearest-neighbor · 0.1% gate error · 1µs cycle · 10µs reaction.
MAY 2025 · GIDNEY — RESOURCE ESTIMATE
<1M
noisy qubits · under one week runtime
Approx. residue arithmetic · yoked surface codes · magic-state cultivation. Fewer qubits, longer time.

Breaking RSA-2048 with Shor’s algorithm needs a large, error-corrected machine, and that requirement has been falling. A 2019 estimate put it at about 20 million noisy physical qubits and roughly 8 hours of runtime. In May 2025, Craig Gidney published an estimate of fewer than 1 million noisy qubits and under a week of runtime.

The estimate keeps the same assumptions as the 2019 work: a square grid of qubits with nearest-neighbor connections, a uniform gate error rate of 0.1%, a surface-code cycle time of 1 microsecond, and a control-system reaction time of 10 microseconds. The reduction came from better algorithms and error-correction techniques, not hardware. The paper credits approximate residue arithmetic, yoked surface codes for idle logical qubits, and magic state cultivation. It also traded qubits for time: fewer qubits, longer runtime.

Two cautions:

  • —This is a resource estimate, not a working machine. No one has built a system anywhere near that size.
  • —Because algorithmic improvements are hard to predict, assuming the estimates have bottomed out is risky.

What to do about it:

NIST finalized its first post-quantum cryptography standards in August 2024: ML-KEM (FIPS 203) for key establishment, and ML-DSA (FIPS 204) and SLH-DSA (FIPS 205) for digital signatures. NIST’s transition guidance, IR 8547, sets out a migration timeline: today’s public-key algorithms such as RSA and elliptic-curve schemes are to be deprecated after 2030 and disallowed after 2035.

⚠️
Harvest now, decrypt later
An adversary can record encrypted traffic today and decrypt it once a capable machine exists. Data that must stay confidential for many years is already in the window.

The urgency comes from “harvest now, decrypt later”: an adversary can record encrypted traffic today and decrypt it once a capable machine exists. Data that must stay confidential for many years is already in the window.

FIG. 08 — PQC MIGRATION WORKFLOW + NIST TIMELINE
IR 8547 TRANSITION
1
Cryptography Inventory
TLS · VPNs · code signing · certificates · HSMs.
2
Confidentiality Lifetime Assessment
Data with 10+ year confidentiality requirements prioritized.
3
Crypto-Agility Architecture
Configurable algorithm modules allowing drop-in upgrades.
4
Test New Standards
ML-KEM (FIPS 203) · ML-DSA (FIPS 204) · SLH-DSA (FIPS 205).
5
Vendor Roadmap Review
Validate hardware and software support timelines.
NIST TIMELINE — IR 8547
2024 · FIPS 203/204/205 Finalized
2030 · Deprecated2035 · Disallowed
RSA + elliptic-curve schemes phased out of production.
Standards: ML-KEM (FIPS 203) key establishment · ML-DSA (FIPS 204) signatures · SLH-DSA (FIPS 205) signatures.
08Action Plan

A Practical Checklist

These are our recommendations, not claims from the sources.

01
Inventory your cryptography.
List where RSA, Diffie-Hellman and elliptic-curve algorithms are used: TLS, VPNs, code signing, certificates, stored encrypted data, hardware security modules.
02
Rank by confidentiality lifetime.
Data that must stay secret for 10 years or more comes first.
03
Build crypto-agility.
Make algorithms configurable so you can swap them without rewriting systems.
04
Test the new standards.
Try ML-KEM and ML-DSA in staging, and measure key sizes, signature sizes and latency.
05
Ask vendors for their post-quantum roadmaps.
Do this for every product that handles encryption.

For everything else, watch the problem classes. Ask whether your bottleneck has the mathematical structure quantum algorithms exploit. The answer is usually no, and when it is yes, researchers will demonstrate the advantage before you need to act.

09Scope & Caveats

Limitations

  • —Qubit counts, error rates and resource estimates change quickly. Treat every number here as a snapshot.
  • —Willow’s benchmark has no known practical application, and the classical comparison is Google’s own estimate.
  • —The RSA-2048 figures are estimates under stated assumptions, not hardware that exists.
  • —This page does not cover quantum networking, quantum sensing, or annealing-based systems.
Conclusion
In this article, you learned that a qubit register is a vector of amplitudes, that interference is the mechanism that makes algorithms work, and that quantum speedups apply only to specific problem classes. The hardware has reached a real milestone in error correction but is far from the scale cryptographic attacks would need. The practical action for engineers today is migrating to post-quantum cryptography, starting with data that has a long confidentiality lifetime.
Sources & References
🔗
Yatskiv, “Quantum Computing Explained for People Who Already Understand Software,” HackerNoon (May 23, 2026): https://hackernoon.com/quantum-computing-explained-for-people-who-already-understand-software
🔗
Google, “Meet Willow, our state-of-the-art quantum chip” (December 2024): https://blog.google/technology/research/google-willow-quantum-chip/
🔗
Gidney, “How to factor 2048 bit RSA integers with less than a million noisy qubits,” arXiv:2505.15917 (May 2025): https://arxiv.org/abs/2505.15917
🔗
NIST, post-quantum cryptography standards and IR 8547: https://csrc.nist.gov/projects/post-quantum-cryptography