Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.
Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.
Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments, and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution, and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost, and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.
Quantum information processing has moved, within the space of roughly two years, from a discipline defined by extrapolation to one defined by measurement. This review consolidates and critically appraises the technical and commercial state of the field as it stood in mid-2026. Four developments frame the analysis: the demonstration of verifiable computational advantage on superconducting hardware through observable-based echo protocols in April 2026; the extension of advantage claims into the simulation of heterogeneous quantum materials in July 2026; the operation of surface-code memories below the fault-tolerance threshold; and the completion of the first tranche of standardised post-quantum cryptographic primitives. Against these advances the review sets an equally important body of negative evidence — systematic benchmark studies in which classically tractable formulations of putative quantum use cases were solved to proven optimality in seconds, and the withdrawal of at least one major financial institution from quantum research after resource estimation placed its target problem beyond any plausible machine. The paper surveys six physical qubit modalities, evaluates them against criteria that extend well past raw qubit count, examines the principal algorithmic families and their known limitations, assesses the software and cloud-access ecosystem, analyses the cryptographic migration timeline in policy and engineering terms, and reviews error-correction progress from repetition codes through quantum low-density parity-check constructions. The central conclusion is that the field has entered a period in which scientific advantage is demonstrable but economic advantage is not, and that the interval between the two will be governed less by qubit counts than by logical error rates, compilation overheads, and the availability of trained personnel.
This paper applies the Quantum Operations Model (QOM)¹ cost framework to the five mostconsequential developments in quantum computing from late 2025 through early 2026: theGoogle/Oratomic cryptographic resource estimate compression, Microsoft's contestedtopological qubit claims, IBM's qLDPC-based Starling architecture roadmap, the first deliveriesof error-corrected "level-2" quantum machines (systems implementing real-time quantum errorcorrection on physical hardware), and emerging continuous-variable (CV) error correctiontechniques that bypass Gottesman-Kitaev-Preskill (GKP) state preparation. We ask: how dothese recent advances alter the cost structure of fault-tolerant quantum computation as modeledby QOM?The answer is nuanced. Algorithmic improvements — particularly in Shor's algorithmcompilation and quantum LDPC error correction codes — have compressed the gap betweencurrent hardware and useful fault-tolerant computation more than any single hardware advance,though these algorithmic results carry their own assumptions that require scrutiny. The QECoverhead,² identified in prior work as the dominant cost factor in quantum computation, is beingrenegotiated through new codes but has not yet been reduced in practice on any shippinghardware. Meanwhile, the topological qubit program suffered a significant credibility correctionwhen replication studies published in Science found simpler explanations for previouslycelebrated experimental signatures. Updated QOM cost tables are provided for all four majorarchitectures under both legacy surface-code and projected qLDPC overhead assumptions, withsensitivity ranges across physical error rates from 10⁻³ to 10⁻⁴. The central thesis of the QuantumAudit series — that quantum computing's near-term value lies in capability rather than costreduction — remains intact, but the timeline to that capability shortened meaningfully this year.¹ The Quantum Operations Model (QOM) is an original cost-accounting framework developed bythe author across three prior papers in this series: "Time Is Money: Wall-Clock Economics ofFault-Tolerant Quantum Computation," "The Decoder Is Architecture: Classical Bottlenecks inFault-Tolerant Quantum Systems," and "Show Me the Numbers: Concrete Costs of QuantumOperations." All three are available on Zenodo and Academia.edu. The QOM source code isavailable at github.com/kase1111-hash.² Throughout this paper, "QEC overhead" refers to the combined physical-to-logical qubit ratioand the code-distance time multiplier required to achieve a target logical error rate — thequantity introduced in the first Quantum Audit paper as the "error correction tax."
Fault-tolerant quantum computation enables the deployment of practical quantum algorithms but incurs substantial overhead from error correction, making resource estimation a central concern. Beyond case-by-case analyses, existing quantum programming languages either require programmers to manipulate low-level hardware details, rendering fault-tolerant implementations cumbersome, or abstract away the underlying error-correction schemes, reducing the effectiveness of resource utilization and estimation.
To address these limitations while preserving programmability, we present a quantum programming language that enables efficient resource utilization, together with a resource-estimation framework for comprehensive resource analysis. Our framework features programmer-visible abstractions of error-correction schemes and cross-layer program-hardware analysis, allowing systematic exploration of resource trade-offs. We evaluate our approach on detailed fault-tolerant implementations of practical large-scale quantum algorithms, including components typically treated as black boxes in existing frameworks. The results demonstrate that our framework enables substantial resource savings while delivering detailed, fine-grained, and accurate resource estimates for fault-tolerant quantum programs.
Quantum computing has generated significant expectations for its potential to enhance machine learning (ML) tasks, with theoretical research proposing computational advantages ranging from polynomial to exponential speedups for specific subroutines.However, a critical disconnect remains: theoretical or asymptotic speedup claims do not automatically imply a practical, end-to-end advantage.Current evidence does not clearly establish whether these claimed advantages translate into measurable superiority over optimised classical approaches.This review critically assesses the relationship between theoretical claims of quantum advantage and the currently available practical and experimental evidence.We critically examine the evidence and assumptions underlying claimed speedups, including the overheads associated with data encoding and access, as well as the use of appropriate and competitive classical baselines for fair comparison.The scope of this assessment covers key limiting factors, such as scalability, trainability, hardware noise in the noisy intermediate-scale quantum (NISQ) era, and overall resource requirements.By distinguishing between theoretical potential and demonstrated practical performance, this work identifies where current evidence is convincing and where it remains insufficient.The review identifies the specific conditions required for the credible validation of quantum advantage and argues that future progress must be positioned around rigorous, realistic, and end-to-end evaluation rather than theoretical complexity claims alone.
This note separates two things often labelled “quantum finance”: the quantum formalism, which applies quantum-mechanical mathematics on classical computers and is judged by empirical fit, and quantum computers, which are judged by whether they complete tasks classical machines cannot. Classifying the evidence into four types (unconditional; beyond-classical under complexity assumptions; empirical claims on specific problems; asymptotic speedups requiring fault tolerance), it finds that, among the public evidence identified and verified here (cut-off 17 October 2026), no economic or financial task has demonstrated broadly accepted practical quantum advantage against strong classical baselines and end-to-end costs. The strongest unconditional results concern information resources rather than computational speed; the formalism has already produced methods usable on classical hardware and testable empirical results; the most mature provable speedup directly relevant to finance is the quadratic speedup of amplitude estimation, which requires fault-tolerant hardware; and because published estimates place the logical-qubit threshold for elliptic-curve discrete logarithms below that for derivative-pricing advantage, cryptographic infrastructure is a channel through which material impact may arrive earlier — a scenario, not a timing prediction, since the two workloads differ in gate counts, runtimes and fault-tolerance assumptions. The note is a structured synthesis of published evidence and reports no new experiments or measurements.