Computing Library › Quantum Algorithms
Quantum Algorithms
Amplitude Amplification
Amplitude amplification turns a rare 'good' outcome from probability p into one found in about 1/sqrt(p) tries - the quadratic Monte-Carlo speedup most relevant to Kronos's neutronics.
The concept
Generalizing Grover, it alternates reflections about the good subspace and about the state-preparation operator, rotating amplitude into good outcomes quadratically faster than resampling. It underlies quantum amplitude estimation.
How Kronos uses it
Tritium-breeding-ratio and activation estimates rely on Monte-Carlo integration with expensive success tests - exactly the setting where amplitude estimation could cut sample counts, sharpening a number like TBR 1.8 with less compute.
Honest note
The payoff is a research target for the ~mid-2030s hardware generation.