Pith. sign in

REVIEW 1 cited by

Quantum Proofs for Classical Theorems

Not yet reviewed by Pith; the record is open.

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

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 0910.3376 v2 pith:BJSJCS4Z submitted 2009-10-18 quant-ph cs.CC

Andrew Drucker (MIT) , Ronald de Wolf (CWI Amsterdam) This is my paper · ORCID
classification quant-phcs.CC
keywords quantumclassicalresultsalgorithmsalongsideareascomplexitydevelopment
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and the quantum toolbox they use.

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. Algorithmic Polynomial Freiman-Ruzsa Theorems

    math.CO 2025-09 conditional novelty 7.0 of 10

    Small-doubling subsets of F_2^n can now be covered by an explicit, efficiently learned subspace in polynomial time, with matching query lower bounds for classical and quantum algorithms.

Pith tools