Pith. sign in

REVIEW 2 cited by

Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.00523 v1 pith:WHX4XQ4R submitted 2023-07-02 quant-ph cs.DScs.PFphysics.pop-ph

Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage

classification quant-ph cs.DScs.PFphysics.pop-ph
keywords quantumapplicationsalgorithmscomputingadvantageclassicalcomputersguidelines
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum computers offer a new paradigm of computing with the potential to vastly outperform any imagineable classical computer. This has caused a gold rush towards new quantum algorithms and hardware. In light of the growing expectations and hype surrounding quantum computing we ask the question which are the promising applications to realize quantum advantage. We argue that small data problems and quantum algorithms with super-quadratic speedups are essential to make quantum computers useful in practice. With these guidelines one can separate promising applications for quantum computing from those where classical solutions should be pursued. While most of the proposed quantum algorithms and applications do not achieve the necessary speedups to be considered practical, we already see a huge potential in material science and chemistry. We expect further applications to be developed based on our guidelines.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Partial oracles quantum algorithm framework -- Part I: Analysis of in-place operations

    quant-ph 2026-04 unverdicted novelty 6.0

    The paper gives a construction for the partial-oracles search iteration operator restricted to in-place operations via a new reciprocal transform applied to SHA-256 building blocks.

  2. Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation

    quant-ph 2025-03 unverdicted novelty 6.0

    SNT merges SV and PEC for subspace-tailored error mitigation in Trotterized FHM simulations, mapping out optimal combinations by hardware quality and shot budget while quantifying when noisy devices could surpass clas...