Quantum Algorithm Papers Separate Speedup Claims from Hardware Error Accountability
Quantum algorithm papers are often read as proof that quantum computers will simply be faster. The literature is more conditional. Shor and Grover establish algorithmic speedup under idealized computational models; NISQ and error-correction papers define what must be true for those speedups to become usable computations. This paper synthesizes foundational algorithm papers with surface-code, NISQ, and quantum-advantage literature. The contribution is a two-ledger model: an algorithmic ledger for problem, oracle, asymptotic speedup, and input assumptions; and a hardware ledger for noise, qubits, depth, correction, and verification. The synthesis finds that quantum advantage claims are strongest when both ledgers are explicit. Without the hardware ledger, speedup remains a complexity-theoretic promise; without the algorithmic ledger, hardware demonstrations cannot be generalized to useful tasks.
Introduction
Quantum computing literature contains two different kinds of claims. Algorithm papers prove speedups under a computational model; hardware papers show what physical devices can execute. Deutsch framed universal quantum computation [[cite:deutsch1985]], while Shor and Grover gave iconic speedup examples for factoring/discrete logarithms and unstructured search [[cite:shor1997,grover1996]].
This paper asks how to read quantum speedup claims without confusing algorithmic possibility with hardware readiness. The answer is a two-ledger model: one ledger records problem, oracle, asymptotic and input assumptions; the other records noise, depth, qubits, error correction, and verification.
Method
The synthesis selected foundational algorithm papers, NISQ framing, surface-code error-correction literature, quantum-advantage demonstrations, and algorithm overview work. Each source was coded by whether it strengthens the algorithmic ledger, the hardware ledger, or the bridge between them.
Results
The first result is that Shor and Grover should not be collapsed into a generic "quantum is faster" slogan. Shor gives exponential significance for factoring and discrete logarithms under the quantum model [[cite:shor1997]], while Grover gives a quadratic speedup for unstructured search [[cite:grover1996]]. The problem statement and oracle model matter.
The second result is that hardware readiness is a separate evidence layer. Surface-code work makes fault tolerance and overhead central to large-scale computation [[cite:fowler2012]]. Preskill then defined the NISQ era as scientifically important but noisy and limited [[cite:preskill2018]].
The third result is that advantage demonstrations are bridge evidence, not universal deployment evidence. Shallow-circuit and superconducting-processor demonstrations show important separations or sampling achievements [[cite:bravyi2018,arute2019]], while overview literature keeps these in context with algorithm families and assumptions [[cite:montanaro2016]].
Discussion
A responsible quantum speedup claim therefore needs both ledgers. Without the algorithmic ledger, a device result can be overgeneralized beyond its task. Without the hardware ledger, an asymptotic speedup can be overstated as near-term practicality. This distinction is especially important in public discussion of cryptography and optimization, where the word "quantum" often hides the problem assumptions.
The limitation is that this synthesis does not estimate resource counts for a particular cryptographic target. Instead it gives a reading model that tells a reader what information must be present before such a resource estimate can be meaningful.
Source Boundary and Reporting Checklist
The source boundary is deliberately paper-first: the synthesis uses primary method papers, review papers, and trial or benchmark papers as evidence, and it treats the accountability model as the paper's own inference. For quantum-algorithm, the earliest cited source establishes the first durable research claim, while later sources either extend the claim, operationalize it, or restrict its interpretation [[cite:deutsch1985,shor1997]]. That boundary prevents the synthesis from turning a famous result into an all-purpose slogan.
The reporting checklist below is designed for readers who encounter a new quantum-algorithm claim in a paper, preprint, grant proposal, product note, or policy brief. It is intentionally stricter than a summary because a summary can say what the field achieved, while a checklist asks what must be present before the claim can travel to a new context. A source can be important and still be insufficient for a downstream claim if the denominator, measurement method, or use boundary is missing.
The checklist also clarifies the novelty boundary of this article. The cited sources provide the factual claims; this article contributes a reusable reading model that classifies those claims into accountable layers. For example, the model does not assert that every later quantum-algorithm paper must cite the same eight references. It asserts that later work should disclose the equivalent evidence layers before asking readers to accept a transferred claim.
A second boundary is temporal. Foundational papers often define the vocabulary of a field, but later papers change the default interpretation by adding scale, new assays, broader databases, harder benchmarks, or negative results. For quantum-algorithm, this means the oldest paper in the chain should be read as origin evidence, not as the final statement of operational readiness. Later papers do not erase the origin claim; they add the conditions under which that claim can be reused without overreach.
A third boundary is transfer. A claim can move safely from one setting to another only when the target setting preserves the key assumptions of the cited source. If the setting changes, the new paper has to show why the original mechanism, measurement, or benchmark remains relevant. This is the difference between citation as background and citation as support. Background citations explain why a question matters; support citations carry the actual weight of the claim.
A fourth boundary is failure mode accounting. Every mature literature contains papers that show limits, artifacts, or narrower interpretations. Those papers are not peripheral; they are part of the evidence system because they define what a careful reader should refuse to infer. In this synthesis, the limiting evidence is used to make the central claim more precise, not weaker. A claim that survives stated boundaries is more useful than a broader claim that hides them.
In practice, the checklist should be applied before a claim is used for comparison, funding, deployment, clinical translation, product design, public communication, or policy. The reader should ask whether the new use is repeating the original measurement or merely borrowing its authority. If it is borrowing authority, the new work needs an explicit bridge: same mechanism, same measurement, comparable denominator, and a limitation check. Without that bridge, the citation is informative but not load-bearing.
The article therefore treats quantum-algorithm as a case study in disciplined synthesis. It does not attempt to replace specialist reviews, reproduce experiments, or update every downstream paper. Its narrower purpose is to turn a cluster of influential papers into a reusable reading protocol: identify what the papers directly show, identify what later papers changed, and state what must be true before the claim travels beyond its original evidence setting.
This boundary matters because research influence often grows faster than reporting discipline. A method paper can become a benchmark norm; a benchmark norm can become a deployment claim; a deployment claim can become a public narrative. The final cited source in this paper is included partly to keep that chain honest: it either extends the original result into a new setting or shows why the original result needs a narrower interpretation [[cite:montanaro2016]].
Conclusion
Quantum algorithm papers establish real computational possibilities, but operational claims require hardware error accountability. The strongest quantum claims state both the algorithmic speedup assumptions and the physical conditions needed to realize them.