ALGORITHMS / 30 MIN
Amplitude estimation & Monte Carlo
A|0⟩ = √(1−a)|bad⟩ + √a|good⟩ a = sin² θ
DERIVATION 1
Turn probability into an eigenphase
Prepare A and reflections about the good subspace and prepared state. Their product rotates in a two-dimensional subspace with eigenphases related to ±2θ. Phase estimation can then recover a=sin²θ. Sign conventions depend on the chosen reflections.
DERIVATION 2
Count the oracle calls
Ideal amplitude estimation achieves additive error ε with O(1/ε) coherent oracle uses, versus O(1/ε²) independent classical samples. This assumes controlled operations, reversible preparation and appropriate confidence amplification. Iterative variants avoid a large Fourier register but still need coherent powers.
DERIVATION 3
A finance case study
Encode a bounded payoff as an amplitude and estimate its expectation. Account for loading a probability distribution, reversible payoff arithmetic and fault-tolerant depth. A faster sampling bound alone is not evidence of faster real-world option pricing.
Assessment
0 / 2 answered · 0 saved attempts
