Extreme Quantum Advantage for Rare-Event Sampling

C. Aghamohammadi; J. P. Crutchfield; J. R. Mahoney; S. P. Loomis

Extreme Quantum Advantage for Rare-Event Sampling

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 1707.09553 v1 pith:4JI3B657 submitted 2017-07-29 quant-ph cond-mat.stat-mechcs.CCcs.ITmath.IT

Extreme Quantum Advantage for Rare-Event Sampling

C. Aghamohammadi , S. P. Loomis , J. R. Mahoney , J. P. Crutchfield This is my paper

classification quant-ph cond-mat.stat-mechcs.CCcs.ITmath.IT

keywords quantumadvantagesamplingalgorithmbiasedclassicalextremememory

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We introduce a quantum algorithm for efficient biased sampling of the rare events generated by classical memoryful stochastic processes. We show that this quantum algorithm gives an extreme advantage over known classical biased sampling algorithms in terms of the memory resources required. The quantum memory advantage ranges from polynomial to exponential and when sampling the rare equilibrium configurations of spin systems the quantum advantage diverges.

discussion (0)

Forward citations

Cited by 1 Pith paper

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

QANTIS: Hardware-Calibrated Sequential POMDP Belief Updates on IBM Heron
cs.AI 2026-07 conditional novelty 5.0

All-step fixed-point amplitude amplification on IBM Heron preserves sequential Tiger POMDP posteriors and planner actions across 8–32 step horizons inside a measured operating envelope.