The Vast World of Quantum Advantage — A Full-Spectrum Audit

In the paper's words

Full-spectrum audit of Huang, Choi, McClean & Preskill (2025) "The vast world of quantum advantage" (arXiv:2508.05720). Subjects both the Huang et al. five-keystone framework and QNFO's own prior critiques to symmetric scrutiny. Key findings: Theorem 1 is the most sophisticated challenge to QNFO's epistemic posture yet produced; QNFO has five documented vulnerabilities; maximum convergence on core values but irreducible uncertainty on implications.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Shor-Crossover v1.0 (Finding, 2026-07-14): Computes that RSA-2048 requires 2.1–7.9M physical qubits at 99.999% fidelity, with wall-clock Shor time of ~180,000 seconds (~50 hours).

   from Third (Revisited): The Shor's Assumptions Gap

2. Abelian HSP Classification (Finding, 2026-07-14): Audit of 15+ quantum algorithms with exponential speedup shows >80% reduce to abelian Hidden Subgroup Problem variants.

   from Third (Revisited): The Shor's Assumptions Gap

3. The full manuscript (13,001 chars) was recovered from the QNFO archive, revealing: a 9-premise decomposition of Shor's claim architecture ($P_{1}-P_{9}$), a surface code overhead sensitivity analysis showing physical qubit requirements range from 820K to 8.2B depending on gate fidelity, a GNFS constant trajectory analysis ($c \approx 1.923$ stable for 30 years), and a NIST PQC narrative audit.

   from Impact on Severity Assessments

4. It acknowledges that BPP ≠ BQP — the foundational conjecture of quantum computing — is unproven after 30 years.

   from 1. Introduction

5. However, the "shor-assumptions-audit-2026" source has produced three substantive Knowledge Graph Findings: FACTORING-not-in-BPP (Finding, 2026-07-14): Documents that quantum advantage for factoring requires FACTORING ∈ BQP (proven) AND FACTORING ∉ BPP (unproven after 30 years).

   from Third (Revisited): The Shor's Assumptions Gap

6. Non-abelian HSP remains quantum-hard after 30 years.

   from Third (Revisited): The Shor's Assumptions Gap

How it is done

1. Their Perspective paper — "The vast world of quantum advantage" (arXiv:2508.05720) — constructs a systematic framework for evaluating quantum advantage claims through five "keystone" properties (Predictability, Typicality, Robustness, Verifiability, Usefulness), surveys four distinct realms where quantum advantage can manifest, and proves a genuinely original theorem: that detecting quantum advantage is itself classically hard, assuming BPP ≠ BQP.

   from 1. Introduction

2. For computation, the threshold theorem provides theoretical assurance — but with unknown overhead.

   from 2. The Five Keystone Properties

3. The paper's most original and philosophically consequential contribution is Theorem 1.

   from 3. Theorem 1: The Unpredictability Result

4. Huang et al. treat Shor's algorithm as the gold standard for quantum computational advantage — satisfying all five keystone properties.

   from 4. QNFO's Vulnerabilities

What would falsify it

1. Initial assessment: QNFO demands falsifiability from others but has not published symmetric conditions for its own claims.

   from Fifth (Revisited): Missing Self-Falsification Conditions

2. QNFO has published: A falsifiable criterion: The Physics of Computation proposes "a falsifiable criterion for physical computational advantage: a device must solve a commercially relevant problem at lower total energy cost (joules per solution) than any classical alternative." This is operationalized — a device that satisfies it would refute QNFO's thermodynamic argument.

   from Fifth (Revisited): Missing Self-Falsification Conditions

3. A self-correction registry: The Knowledge Graph contains a "Disconfirming Registry: 5 Anti-Adelic Findings" ( correction-disconfirming-registry , status: applied ).

   from Fifth (Revisited): Missing Self-Falsification Conditions

Where the claim stops

1. The framework cannot answer because it never asks.

   from 5. Huang et al.'s Limitations

2. Theorem 1 does not prove what the paper claims it proves.

   from 5. Huang et al.'s Limitations

3. It does not tell you which candidate advantages are likely to satisfy them.

   from 5. Huang et al.'s Limitations

Where to read

1. 1. Introduction380 words · 2 min
2. 2. The Five Keystone Properties207 words · 1 min
3. 3. Theorem 1: The Unpredictability Result192 words · 1 min
4. 4. QNFO's Vulnerabilities2,479 words · 11 min
5. 5. Huang et al.'s Limitations311 words · 1 min
6. 6. The Convergence118 words · 1 min
7. 7. The Deepest Problem241 words · 1 min
8. 8. Recommendations374 words · 2 min
9. 9. Conclusion349 words · 2 min