Claim analyzed

Tech

“Quantum computers are capable of breaking all currently used encryption algorithms.”

The conclusion

False
2/10

This claim is false. Quantum computers pose a recognized future threat to certain public-key encryption systems (like RSA and ECC) via Shor's algorithm, but they cannot break "all" currently used encryption. Symmetric algorithms like AES-256 are only marginally weakened by Grover's algorithm and remain secure with appropriate key sizes. Moreover, no quantum computer today has the fault-tolerant hardware needed to break even real-world RSA-2048. NIST itself describes this as a future risk to "many" systems — not a present capability against all encryption.

Caveats

  • The claim uses the universal quantifier 'all,' but symmetric encryption (e.g., AES-256) is not broken by known quantum algorithms — Grover's algorithm only provides a quadratic speedup, manageable by increasing key sizes.
  • Reported quantum 'breaks' of RSA involve trivially small instances (e.g., 22-bit integers on D-Wave annealing systems), not real-world RSA-2048, and D-Wave systems cannot run Shor's algorithm.
  • No fault-tolerant, error-corrected quantum computer capable of breaking deployed encryption at real-world key sizes currently exists; the threat remains future-oriented.

Sources

Sources used in the analysis

Full Analysis

Expert review

How each expert evaluated the evidence and arguments

Expert 1 — The Logic Examiner
Focus: Inferential Soundness & Fallacies
False
2/10

The claim asserts quantum computers are currently capable of breaking all currently used encryption algorithms — but the evidence logically refutes both key components: (1) "all" encryption is contradicted by Sources 8, 12, 13, and 15, which establish that symmetric encryption (e.g., AES-256) is not broken by quantum computers but merely weakened and remains manageable with larger keys, while Sources 4 and 15 confirm that no fault-tolerant quantum computer capable of running Shor's algorithm at RSA-2048 scale exists today; (2) the proponent's supporting evidence (Sources 7, 10) commits a hasty generalization by extrapolating from a 22-bit RSA factorization on a D-Wave adiabatic system — which Source 14 explicitly notes cannot run Shor's algorithm — to a claim of universal encryption-breaking capability, and Source 5's Google research describes a theoretical future threshold, not a present capability. The claim is therefore false: the logical chain from evidence to conclusion is broken by scope mismatch ("all" vs. "some asymmetric"), a capability-vs.-actuality conflation (future threat vs. present capability), and the proponent's reliance on sources that, when read carefully, undermine rather than support the absolute claim.

Logical fallacies

Hasty Generalization: The proponent extrapolates from a 22-bit RSA factorization on a D-Wave adiabatic system (Sources 7, 10) to the conclusion that quantum computers can break all currently used encryption, ignoring that this is orders of magnitude removed from real-world RSA-2048 and that D-Wave systems cannot run Shor's algorithm at all (Source 14).Equivocation: The proponent conflates 'could break' (a future conditional acknowledged by NIST) with 'are capable of breaking' (a present-tense assertion of realized capability), treating a recognized future threat as a current demonstrated ability.Overgeneralization / Scope Mismatch: The claim uses 'all currently used encryption algorithms,' but even the most threat-acknowledging sources (Sources 8, 13) explicitly distinguish asymmetric encryption (threatened by Shor's) from symmetric encryption (AES-256 remains manageable under Grover's algorithm), making the universal quantifier logically indefensible.Appeal to Consequences (implicit): The proponent argues that because NIST released post-quantum standards urgently, quantum computers must already be capable of breaking encryption — but NIST's action is a precautionary forward-looking measure, not confirmation of present-day capability.False Equivalence: The proponent treats theoretical algorithmic capability (Shor's algorithm can factor large numbers) as equivalent to practical hardware capability, ignoring that millions of error-corrected logical qubits are required and do not yet exist (Sources 4, 15).
Confidence: 9/10
Expert 2 — The Context Analyst
Focus: Completeness & Framing
False
2/10

The claim's framing overgeneralizes from “quantum computers could eventually break many widely used public‑key systems” (RSA/ECC via Shor) to “break all currently used encryption algorithms,” omitting that symmetric encryption (e.g., AES) is not outright broken by known quantum algorithms and is generally mitigable by larger keys (e.g., AES‑256) (Sources 8, 13), and that reported “breaks” involve toy sizes (e.g., 22‑bit RSA) or non–cryptographically relevant demonstrations rather than real‑world RSA‑2048/AES‑256 (Sources 7, 10, 14). With full context, quantum computers (especially current, non–fault-tolerant ones) are not capable of breaking all currently used encryption, and even in the long run the threat is primarily to specific classes (public‑key) rather than universally to every algorithm (Sources 2, 4, 8).

Missing context

“Encryption algorithms” spans asymmetric, symmetric, hashes/MACs, and protocols; quantum impact differs substantially across these categories (Shor vs Grover vs no known speedup).Current demonstrations cited as 'cracking RSA/AES' are not equivalent to breaking deployed parameter sets (e.g., RSA‑2048, AES‑256) and often involve small instances or different computational models (e.g., D‑Wave annealing).Even for symmetric crypto, Grover provides at most a quadratic speedup and is typically addressed by increasing key sizes; calling that 'breaking' is misleading.NIST's language is consistently about a future risk to “many” systems and the need to migrate, not that quantum computers can already break all encryption.
Confidence: 8/10
Expert 3 — The Source Auditor
Focus: Source Reliability & Independence
False
2/10

The highest-authority sources in this pool — NIST (Sources 1, 2, 3), IBM Quantum (Source 4), and TCG (Source 8) — consistently refute the absolute claim that quantum computers are capable of breaking all currently used encryption. NIST explicitly states quantum computers "could eventually break many of today's widely used cryptographic systems" (not all), IBM Quantum confirms current hardware is nowhere near the fault-tolerant scale needed, and TCG clarifies that symmetric encryption like AES-256 is not broken but merely weakened by Grover's algorithm — a manageable threat. The supporting sources (Sources 5, 7, 10, 16) either describe theoretical future capabilities, misrepresent D-Wave adiabatic systems as general-purpose quantum computers (debunked by Source 14), or conflate cracking a 22-bit RSA integer with breaking real-world RSA-2048. The claim's use of "all currently used encryption" is a critical overstatement: the most reliable, independent, and authoritative sources uniformly agree that symmetric encryption (e.g., AES-256) is not categorically broken by quantum computers, and that even asymmetric encryption requires hardware that does not yet exist at scale — making the claim false as stated.

Weakest sources

Source 16 (YouTube) is a low-authority video platform source with no peer review or institutional backing, and its claim that 'anybody with a large working quantum computer today would pose an immediate threat' is speculative and unsupported by current hardware realities.Source 10 (CSO Online, Dec 2025) conflates factoring a 22-bit RSA integer — a trivially small number — with breaking real-world RSA-2048 encryption, making its 'SUPPORT' stance deeply misleading and disproportionate to the actual finding.Source 9 (J.P. Morgan) has an unknown publication date, a potential institutional interest in promoting quantum-readiness narratives for financial services, and its snippet only confirms Shor's algorithm can break RSA in theory — not that current quantum computers can do so.Source 7 (PCMag) reports on D-Wave quantum attacks without adequately distinguishing adiabatic quantum systems from general-purpose gate-based quantum computers, a critical technical distinction that undermines the article's framing of the threat as immediate and broad.
Confidence: 8/10

Expert summary

See the full panel summary

Create a free account to read the complete analysis.

Sign up free
The claim is
False
2/10
Confidence: 8/10 Unanimous

The arguments

Two AI advocates debated this claim using the research gathered.

P
Proponent Argues TRUE

The theoretical and emerging empirical evidence firmly supports the claim that quantum computers are capable of breaking currently used encryption algorithms: Source 7 (PCMag) and Source 10 (CSO Online) report that Chinese researchers at Shanghai University have already demonstrated quantum attacks on RSA and AES using D-Wave systems, while Source 5 (CSO Online) cites Google Quantum AI research showing that RSA-2048 can theoretically be cracked with one million noisy qubits — a threshold far closer than previously estimated. Furthermore, authoritative institutions like Source 1 (NIST) and Source 9 (J.P. Morgan) explicitly acknowledge that quantum computers "could break the current encryption" and that Shor's algorithm "can quickly factor large numbers and thereby break RSA encryption," confirming that the capability is recognized as real and imminent, not merely speculative.

O
Opponent Rebuttal

You're equivocating from “can attack” or “factored a 22-bit RSA integer” to “break all currently used encryption,” but the D-Wave reports you cite (Source 7: PCMag; Source 10: CSO Online) don't demonstrate breaking real-world RSA-2048 or AES-256, and the brief explicitly notes adiabatic D-Wave systems aren't capable of breaking RSA-2048/AES-256 at all (Source 14: Freemindtronic). And even if Shor's algorithm threatens RSA/ECC, that still isn't “all encryption”: NIST repeatedly says quantum computers could eventually break “many” systems and urges migration to PQC (Source 1: NIST; Source 2: NIST CSRC), while symmetric schemes like AES are described as manageable under Grover (not outright broken) with larger keys (Source 8: TCG; Source 13: Coursera), making your conclusion a classic overgeneralization.

O
Opponent Argues FALSE

The motion is false because even the most authoritative brief sources say quantum computers are a future risk that could break “many” of today's public‑key systems, not “all currently used encryption,” and NIST explicitly points to post‑quantum standards that can be deployed now to protect data (Source 2: NIST CSRC; Source 1: NIST PQC). Moreover, symmetric encryption is not categorically breakable by quantum computers—Grover's algorithm only reduces effective key strength and remains manageable with larger keys like AES‑256 (Source 8: TCG; Source 13: Coursera), while today's hardware is not fault‑tolerant and is far from the error‑corrected scale needed to break practical RSA at all (Source 4: IBM Quantum).

P
Proponent Rebuttal

Your argument hinges on the word "all," yet you conveniently ignore that Source 8 (TCG) explicitly confirms Shor's algorithm poses an "existential threat to all widely used asymmetric encryption, including RSA and ECC," and Source 7 (PCMag) and Source 10 (CSO Online) document real quantum attacks already targeting both RSA and AES — meaning the claim covers the full spectrum of currently used encryption, not just one category. Furthermore, your retreat to "hardware isn't ready yet" is a temporal deflection, not a capability refutation — Source 5 (CSO Online) citing Google Quantum AI shows the qubit threshold for cracking RSA-2048 has already been slashed twentyfold, and the claim that quantum computers "are capable" of breaking encryption is validated by the very fact that NIST, your own cited authority, urgently released post-quantum standards precisely because the threat to current algorithms is recognized as real and achievable.

Your annotation will be reviewed by an editor before becoming visible.

Embed this verification

Copy this code and paste it in your article's HTML.