Pith. sign in

REVIEW 1 cited by

Introduction to Quantum Algorithms

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 quant-ph/0005003 v2 pith:YIYLTEE5 submitted 2000-04-29 quant-ph

classification quant-ph
keywords algorithmsquantumclassicalonlyproblemssignificantlyspeedtechniques
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical algorithms. It is not clear yet whether the reason for this is that we do not have enough intuition to discover more techniques, or that there are only a few problems for which quantum computers can significantly speed up the solution.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Networked Quantum Services

    quant-ph 2025-05 conditional novelty 4.0 of 10

    A survey of networked quantum services, from distributed quantum computers and cloud platforms to programming languages and standardization efforts.

Pith tools