Sign inGet started
Paper · arXiv

Quantum enhanced rare event discovery and sampling

Financial crashes, cascading failures in infrastructure, and critical errors in AI systems are frequently triggered by events that occur with extremely small probability. Efficiently discovering and sampling events with probability below a threshold is therefore of critical interest. Yet this task is highly non-trivial using existing classical or quantum methods. Being rare, such events require an immense sampling overhead to collect sufficient data samples. Moreover, because the rare events are not known in advance, they cannot be flagged for amplification using standard techniques. Here, we introduce a quantum algorithm for rare-event discovery and sampling without first learning which ...

AuthorsNaixu Guo, Po-Wei Huang, Qisheng Wang et al.
Primary categoryquant-ph
Published4 June 2026
Last updated at source4 June 2026
quant-phcs.AIcs.DS
Embed this entry
<iframe src="https://silytics.si/embed/item/9d658cd9-588f-4371-a551-add8696b9b87" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.