Grover's Algorithm

Grover's algorithm searches an unstructured space in about sqrt(N) steps - and its engine, amplitude amplification, is what Kronos eyes for speeding up Monte-Carlo neutronics and design search.

The concept

From an equal superposition, an oracle phase-marks the target and a diffusion step reflects amplitudes about their average; after about (pi/4)sqrt(N) rounds the answer is likely. The speedup is quadratic, not exponential.

How Kronos uses it

Kronos's neutronics and uncertainty quantification lean on Monte-Carlo sampling. Amplitude amplification - Grover generalized - promises a quadratic reduction in the samples needed for such estimates, and Grover-style search maps onto scanning discrete design choices.

Honest note

A quadratic edge helps only once hardware is large and reliable, expected ~mid-2030s; classical Monte-Carlo does the work today.