Can quantum computers find rare disasters before they happen?

Finding rare but catastrophic events—market crashes, system failures, AI errors—requires exponential classical sampling because they're unknown in advance. This quantum algorithm discovers which events are rare and samples them without pre-identification, matching optimal quantum scaling. For heavy-tailed distributions, it achieves quadratic speedup; for natural stochastic processes, polynomial speedup determined by entropy structure.