Pith. sign in

REVIEW 2 major objections 6 minor 17 references

Noisy quantum hardware can only run what classical code already simulates

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · glm-5.2

2026-07-09 07:44 UTC pith:B4CCHA7Q

load-bearing objection Synthesis argues NISQ advantage is structurally unavailable; the synthesis is valuable but the universality claim overreaches. the 2 major comments →

arxiv 2607.07530 v1 pith:B4CCHA7Q submitted 2026-07-08 quant-ph

The NISQ Trap: Eight Years of Demonstrations the Hardware Was Built to Lose

Amit Hagar This is my paper
classification quant-ph
keywords nisqdemonstrationeighthardwareregionsyearsadmitclassical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper argues that the eight-year NISQ (Noisy Intermediate-Scale Quantum) programme has been trapped in a closed loop: the features that allow noisy quantum hardware to run a circuit with sufficient fidelity—shallow depth, strong algebraic structure, geometric locality—are precisely the features that allow classical algorithms to simulate that circuit efficiently. Six simulability theorems from 2024 through 2026 collectively cover the circuit-space regions NISQ devices can reach, showing each region to be classically tractable. The paper synthesizes these results into a single claim: the hardware constraint and the classical simulability constraint are two faces of one identity, meaning quantum advantage on noisy hardware is structurally unavailable rather than merely undemonstrated. The paper dates the NISQ programme from its 2018 articulation as a retreat from the unmet conditions of the 1996 fault-tolerance threshold theorems, characterizes the subsequent eight years as a repeated cycle of advantage claims followed by classical reproductions or theorem-based closures (typically within eighteen months), and locates the only exit from the loop where the threshold theorems originally placed it: in fault-tolerant error correction that actively pumps entropy out of the computation. The author examines more than thirty advantage-class announcements from major quantum companies and finds that, with a single contested exception (Google's October 2025 Quantum Echoes experiment), every flagship demonstration has been classically reproduced or closed by a simulability theorem. The paper distinguishes the genuine engineering progress of the NISQ era (improved coherence times, gate fidelities, qubit counts) from the unsupported claim that specific demonstrations have crossed into computationally classically intractable territory.

Core claim

The central object is what the paper calls the 'closed loop': an identity between two regions of circuit-space. One region is defined by what noisy quantum hardware can execute with sufficient fidelity (circuits of logarithmic effective depth, or circuits with strong algebraic structure such as paired fermionic states, Gaussian dynamics, or integrable Hamiltonians). The other region is defined by what classical algorithms can simulate efficiently (the same circuits, because the same structural features—low depth, algebraic compressibility, geometric locality—enable both execution and simulation). Six theorems from 2024 to 2026 establish the classical-tractability side: Mele et al. show noisy

What carries the argument

The argument is carried by six simulability theorems (references [2] through [7] and [13]) that each carve off a region of circuit-space and prove it classically tractable: (1) Mele et al. [3]—noisy circuits above a constant noise rate converge to logarithmic effective depth; (2) Oh et al. [2]—structured non-Gaussian fermionic inputs with paired states admit Pfaffian compression; (3) Nelson et al. [4]—geometrically local noisy circuits are classically simulable; (4) Zhang et al. [5]—approximately Markovian noisy circuits are sampleable in quasi-polynomial time; (5) Upreti et al. [6]—non-Gaussianity in noisy bosonic circuits accelerates classical simulation; (6) Oh [7] and Lee et al. [13]—no

Load-bearing premise

The paper's synthesis rests on the claim that six simulability theorems collectively cover all circuit-space regions accessible to NISQ hardware. Whether these six regimes—logarithmic effective depth from constant noise, Pfaffian-compressible paired fermionic states, geometrically local noisy circuits, approximately Markovian noisy circuits, noisy bosonic circuits, and noisy linear optics—exhaust everything NISQ hardware can in principle run is not formally proven; it is an合成

What would settle it

A single NISQ-era demonstration of quantum advantage that escapes all six simulability regimes—running with sufficient fidelity on noisy hardware yet admitting no known efficient classical simulation—would break the closed loop. The paper acknowledges this possibility explicitly and states that the burden of producing such a demonstration falls to defenders of NISQ.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • If the closed-loop identity holds, then no NISQ-era advantage demonstration can succeed without escaping the six simulability regimes, which requires either deeper coherent circuits or structural features the theorems do not yet cover.
  • The paper's framing shifts the burden of proof: after eight years and thirty-plus advantage claims, defenders of NISQ must produce a demonstration that falls outside all six simulability results, rather than critics needing to de-quantize each new claim individually.
  • The DOE's 2028 fault-tolerant quantum computer target can be evaluated by a single arithmetic quantity: achieved logical error rate times circuit depth, which must fall below the erasure bound the simulability theorems set. This provides a concrete pass/fail criterion for the solicitation.
  • The distinction between engineering progress (real and unquestioned) and computational advantage claims (structurally unavailable on noisy hardware) provides a framework for interpreting future quantum computing announcements.
  • The paper implies that the field's demonstr
  • feed_headline
  • feed_subtitle
  • feed_emoji

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The closed-loop argument could be strengthened by a formal impossibility result showing that the union of the six simulability regimes exhausts all circuits achievable at a given noise rate and coherence budget, rather than relying on a synthesis of individually proven cases.
  • If the identity between hardware-executable and classically-simulable regions is as tight as claimed, one prediction is that any future NISQ advantage claim will be reproducible within approximately eighteen months—the paper's observed median—providing a testable temporal pattern.
  • The Quantum Echoes experiment's dependence on error-mitigation rescaling and model-based accuracy projections at the advantage scale suggests a concrete diagnostic: advantage claims that rely on error-model validation at scales below the claimed advantage are candidates for the 'physics experiment booked as computational advantage' category.
  • The DOE RFI's specification of 150-250 logical qubits at 10^-8 logical error rate with 10^5 hard gates can be checked against the Mele erasure bound directly: if the product of error rate and depth exceeds the bound, the machine is in the NISQ regime and the closed loop applies; if it falls below, the machine has crossed into fault tolerance.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The manuscript synthesizes six simulability theorems (2024–2026) to argue that the regions of circuit-space accessible to NISQ hardware coincide with the regions classical algorithms compress efficiently, rendering quantum advantage on noisy hardware structurally unavailable. It frames the NISQ programme (2018–2026) as a 'closed loop' in which hardware constraints force demonstrations into classically tractable regimes, locates the exit in fault tolerance (per the 1996 threshold theorems), and examines the Google Quantum Echoes experiment as the sole contested exception. The paper is a perspective/synthesis rather than a derivation; its central claim rests on whether the six cited theorems collectively cover all NISQ-accessible circuit regimes.

Significance. The paper provides a timely, well-organized synthesis of a rapid sequence of simulability results that individually address specific circuit regimes but collectively suggest a structural pattern. The framing of NISQ as a historical retreat from the threshold-theorem conditions is intellectually coherent. The Quantum Echoes analysis (§4) is notably careful in its attention to error-mitigation dependencies and supplementary-table details. The paper does not introduce fitted parameters or define its conclusion circularly; it assembles external results by independent teams. The falsifiable prediction—that a NISQ demonstration escaping the six theorem-regimes would break the pattern—is clearly stated.

major comments (2)
  1. §2 and §3: The claim that the six cited theorems 'close the perimeter' of NISQ-accessible circuit space (§2, 'Together these statements close the perimeter of what NISQ hardware can deliver') and that 'these two regions are the same region' (§3) is stated as established fact. The paper's own §3 acknowledges that 'a future demonstration could in principle escape the current results by exploiting features the simulability theorems do not yet cover,' but treats this as a burden-shift rather than an open gap. The coverage is strong—three of the six results [3,4,5] cover geometrically local, approximately Markovian, constant-noise-rate circuits, which describes most current hardware—but the union is not formally proven to be exhaustive. For example, all-to-all connected hardware (e.g., trapped ions with full connectivity, not covered by [4]) operating below the constant-noise threshold of [3]
  2. Abstract and §3: The empirical claim that 'every NISQ-era flagship demonstration of quantum advantage has been classically reproduced, or closed by a simulability theorem, within eighteen months of its announcement' is central to the paper's rhetorical force. However, the manuscript does not provide a table or systematic enumeration of the 'more than thirty advantage-class announcements' mentioned in §5. Without such an inventory, the reader cannot verify the 'eighteen months' figure or assess which demonstrations count as 'flagship.' Adding a table listing each announcement, its date, and the corresponding classical reproduction or theorem would substantially strengthen the empirical claim, which currently rests on assertion.
minor comments (6)
  1. A table summarizing the six simulability theorems (regime covered, key assumptions, reference) would help readers follow the synthesis argument in §1–§2.
  2. §4: The Quantum Echoes analysis is dense with specifics (e.g., 'the 13,000× figure is the zero-removal, memory-constrained entry of the same supplementary table'). Consider adding a brief summary table or structured paragraph separating the methodological concerns from the numerical details for readability.
  3. §6: The 'perpetual motion machine' metaphor and 'plugged into the wall' analogy are rhetorically charged for a journal submission. Consider toning down.
  4. §5: The phrase 'the four major US-listed quantum companies' could benefit from a footnote clarifying the selection criterion for this categorization.
  5. Reference [11] lists 'Phys. Rev. Lett. (2026)' without volume/page numbers; update if available.
  6. §3: The sentence beginning 'The circularity has been known since the late 1990s' would benefit from a specific citation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for a careful reading and for identifying two concrete points where the manuscript can be strengthened. We address each below.

read point-by-point responses

  1. Referee: §2 and §3: The claim that the six theorems 'close the perimeter' is stated as established fact, but the union is not formally proven to be exhaustive. The manuscript's own §3 acknowledges a future demonstration could escape current results but treats this as burden-shift rather than open gap. Specific example: all-to-all connected hardware operating below the constant-noise threshold of [3].

    Authors: The referee is correct that the union of the six theorems is not formally proven to be exhaustive, and the language in §2 ('close the perimeter') and §3 ('these two regions are the same region') overstates what has been established. We will revise both passages to make clear that the coverage is strong but not formally complete, and that the claim is an empirical generalization supported by the pattern of de-quantizations, not a theorem about all possible NISQ-accessible circuits. We will also address the referee's specific example directly. On all-to-all connected hardware: theorem [3] (Mele et al.) does not require geometric locality—it applies to general circuits above a constant noise rate, regardless of connectivity. Theorem [4] (Nelson et al.) adds geometric locality as a tightening condition. So all-to-all hardware is covered by [3] when the noise rate exceeds the constant threshold. The genuine gap the referee identifies is the regime where noise is below the [3] threshold but the circuit is not covered by the structured-input or algebraic-compression results [2, 6, 7, 8, 9]. This is a real opening. We will state this explicitly rather than treating it as a mere burden-shift. Our argument is that after eight years and thirty-plus demonstrations, no flagship has landed in that gap, but we agree the manuscript should not present the gap as closed when it is open. We will revise §2 to say that the six results 'cover the circuit regimes NISQ demonstrations have actually occupied' rather than 'close the perimeter,' and §3 to say that the hardware-accessible and classically-tractable regions 'overlap in every regime explored to date' rather than 'are the same region.' The falsifiable prediction remains intact and will be stated more prominently as a result of these修订. revision: yes

  2. Referee: Abstract and §3: The empirical claim about 'eighteen months' and 'more than thirty advantage-class announcements' lacks a supporting table or systematic enumeration. Without such an inventory, the reader cannot verify the figure or assess which demonstrations count as 'flagship.'

    Authors: This is a fair and constructive request. We will add a table in §5 enumerating the advantage-class announcements, including for each entry: the announcing institution, the date, the claimed task/regime, and the corresponding classical reproduction or closing theorem (or status as contested). We will restrict the table to announcements from the four major US-listed companies (Google, IBM, Quantinuum, IonQ) and comparable Chinese efforts, as the manuscript already names these in §5. We will define 'flagship' as a demonstration accompanied by an explicit quantum-advantage claim in the paper or in the issuing institution's press materials, and we will note which entries meet that bar versus which are incremental benchmarking results. The 'eighteen months' figure is an empirical observation from this set; the table will allow the reader to verify it directly. If any entries upon compilation do not fit the eighteen-month window, we will report the actual distribution rather than asserting a single number. The abstract will be adjusted to match whatever the table shows. revision: yes

Circularity Check

0 steps flagged

No circularity: the paper synthesizes external simulability theorems by independent author teams to argue a structural identity between NISQ-accessible and classically simulable circuit regions.

full rationale

The paper's central claim—that the regions of circuit-space NISQ hardware can run with sufficient fidelity coincide with the regions classical algorithms compress efficiently—is supported by six externally authored theoretical results (Mele et al. [3], Oh et al. [2], Nelson et al. [4], Zhang et al. [5], Upreti et al. [6], Oh [7]). None of these are self-citations by the author (Hagar). The argument chain is: (1) hardware constraints produce shallow/structured circuits, (2) theorems by other teams prove such circuits are classically simulable, (3) therefore NISQ advantage is structurally unavailable. No fitted parameters are introduced and then 'predicted.' No conclusion is defined in terms of its own inputs. The paper does note a circularity in the threshold theorem program ('Verifying, at scale, the correlation structure the theorems assume would itself need a quantum computer of the kind the theorems promise,' §3), but this is an observation about the broader quantum computing program, not a circularity in the paper's own argument. The paper's synthesis assertion—that six regime-specific results collectively cover NISQ-accessible circuit space—is a coverage claim that may be incomplete (as the reader notes), but incompleteness of a coverage argument is a correctness risk, not circularity. The derivation is self-contained against external benchmarks: each cited theorem is an independent result by a different author team, and the empirical pattern of de-quantizations is externally verifiable.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

The paper introduces no free parameters, no new mathematical objects, and no invented entities. It is a synthesis essay that assembles six externally authored theorems into a framework. The axioms are domain assumptions about the coverage of the cited theorems and the empirical pattern of de-quantization. No ad hoc constructions are introduced.

axioms (4)
  • domain assumption The six cited simulability theorems (Mele et al., Oh et al., Nelson et al., Zhang et al., Upreti et al., Oh et al.) collectively cover all circuit-space regions accessible to NISQ hardware with sufficient fidelity.
    Stated in §2: ‘Together these statements close the perimeter of what NISQ hardware can deliver.’ This is the load-bearing synthesis claim; it is not proven but asserted by assembling the theorems.
  • domain assumption Every NISQ-era flagship advantage demonstration has been classically reproduced or closed by theorem within 18 months, with one contested exception.
    Stated in abstract and §2. This is an empirical claim assembled from the literature; the paper does not provide a structured dataset of the 30+ announcements and their de-quantization timelines.
  • standard math The 1996 threshold theorems’ assumptions (independence, locality, rate below threshold) correctly describe the conditions for fault-tolerant quantum computation, even if no current hardware meets them.
    Invoked in §3 and §5; the threshold theorems are established results in quantum information theory.
  • standard math The BQP vs classical polynomial time separation conjecture remains intact; the simulability results do not collapse BQP.
    Stated in §5: ‘the results assembled here leave intact the conjectured separation between BQP and classical polynomial time.’

pith-pipeline@v1.1.0-glm · 9025 in / 2787 out tokens · 450072 ms · 2026-07-09T07:44:32.518851+00:00 · methodology

0 comments
read the original abstract

With a single contested exception, every NISQ-era flagship demonstration of "quantum advantage" has been classically reproduced, or closed by a simulability theorem, within eighteen months of its announcement. Six theoretical results from 2024 through April 2026 explain the pattern: the regions of circuit-space NISQ hardware can run with sufficient fidelity coincide with the regions classical algorithms compress efficiently, because the features that admit one (low effective depth, strong algebraic structure, geometric locality) are the features that admit the other. This reading dates the NISQ programme from its 2018 articulation as an interim retreat from the unmet conditions of the 1996 threshold theorems, characterises the eight years that followed as a closed loop in which the demonstrations the hardware could run were drawn from the only regions classical methods could already attack, and locates the exit from the loop where the threshold theorems originally located it: in fault tolerance. The empirical pattern could in principle break with a demonstration that escapes the current simulability results. After eight years and more than thirty advantage-class announcements, the burden of producing such a demonstration falls to the defenders of NISQ.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages · 6 internal anchors

  1. [1]

    Alamet al., Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation, arXiv:2510.26300 (2025)

    F. Alamet al., Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation, arXiv:2510.26300 (2025)

    work page arXiv 2025

  2. [2]

    C. Oh, M. Oszmaniec, O. Reardon-Smith, and Z. Zimborás, Classical simulation of free- fermionic dynamics and quantum chemistry with magic input, arXiv:2604.26813 (2026). 6

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  3. [3]

    A. A. Mele, A. Angrisani, S. Ghosh, S. Khatri, J. Eisert, D. Stilck França, and Y. Quek, Noise- induced shallow circuits and the absence of barren plateaus, Nat. Phys. 22, 751–756 (2026); arXiv:2403.13927 (2024)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  4. [4]

    Nelson, J

    J. Nelson, J. Rajakumar, and M. J. Gullans, Limitations of noisy geometrically local quantum circuits, arXiv:2510.06346 (2025)

    work page arXiv 2025

  5. [5]

    Y. F. Zhang, S.-u. Lee, L. Jiang, and S. Gopalakrishnan, Classically sampling noisy quantum circuits in quasi-polynomial time under approximate Markovianity, arXiv:2510.06324 (2025)

    work page arXiv 2025

  6. [6]

    Upreti, U

    V. Upreti, U. Chabaud, Z. Holmes, and A. Angrisani, When quantum resources backfire: non- Gaussianity and symplectic coherence in noisy bosonic circuits, arXiv:2510.07264 (2025)

    work page arXiv 2025

  7. [7]

    Classical simulability of constant-depth linear-optical circuits with noise

    C. Oh, Classical simulability of constant-depth linear-optical circuits with noise, arXiv:2406.08086 (2024)

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  8. [8]

    L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput. 31, 1229 (2002)

    work page 2002

  9. [9]

    B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65, 032325 (2002)

    work page 2002

  10. [10]

    Benchmarking quantum simulation with neutron-scattering experiments

    Y.-T. Leeet al., Benchmarking quantum simulation with neutron-scattering experiments, arXiv:2603.15608 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  11. [11]

    Leeet al., Digital quantum simulation of spin transport, Phys

    Y.-T. Leeet al., Digital quantum simulation of spin transport, Phys. Rev. Lett. (2026); arXiv:2507.22846 (2025)

    work page arXiv 2026

  12. [12]

    Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018)

    J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018)

    work page 2018

  13. [13]

    S.-u. Lee, S. Ghosh, C. Oh, K. Noh, B. Fefferman, and L. Jiang, Classical simulation of noisy random circuits from exponential decay of correlation, arXiv:2510.06328 (2025)

    work page arXiv 2025

  14. [14]

    Google Quantum AI and Collaborators, Observation of constructive interference at the edge of quantum ergodicity, Nature 646, 825–830 (2025); arXiv:2506.10191 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  15. [15]

    Mind the gaps: The fraught road to quantum advantage

    J. Eisert and J. Preskill, Mind the gaps: the fraught road to quantum advantage, arXiv:2510.19928 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  16. [16]

    Department of Energy, Office of Science, Request for Information on Scientifically Relevant Fault-Tolerant Quantum Computing Systems, RFI 892431-26-RFI-0001 (May 12, 2026)

    U.S. Department of Energy, Office of Science, Request for Information on Scientifically Relevant Fault-Tolerant Quantum Computing Systems, RFI 892431-26-RFI-0001 (May 12, 2026)

    work page 2026

  17. [17]

    Genkina, The Trump administration doubles down on quantum, IEEE Spectrum (June 30, 2026)

    D. Genkina, The Trump administration doubles down on quantum, IEEE Spectrum (June 30, 2026). 7

    work page 2026