Shor's Algorithm for Quantum Computing - Computerphile

The rule that probabilities equal squared amplitudes is taken as an empirical postulate: amplitudes are represented as phasors and squaring their length gives measurement probabilities, yet why squaring yields probability remains the unresolved quantum measurement problem.

In a trapped-ion qubit two atomic energy levels encode |0> and |1>, microwave pulses rotate the state by changing relative phase and amplitude, and laser fluorescence readout samples the state probabilistically so you repeat the cycle to build statistics.

A discrete function that repeats with period r produces strong amplitude at the matching frequency in its Fourier spectrum, and so taking the transform turns period detection into spotting a sharp spectral peak.

Picking a random base a can fail because some choices produce unusable periods or trivial gcds, so the algorithm simply retries with a different a until a workable period appears.

Working modulo N keeps intermediate exponentiation results bounded between 0 and N−1, so repeated modular multiplications avoid exploding integers and make exponentiation feasible for large RSA-size numbers.

Scaling quantum computers is hardest because environmental noise randomly perturbs relative phases, which washes out the interference patterns algorithms rely on and forces heavy isolation and error correction overhead.

Measuring a quantum state projects it into a definite basis state, so you must reprepare and rerun the experiment many times to estimate the underlying probabilities.

Think of a qubit as a rotating arrow whose length sets a complex amplitude, and because measurement probabilities equal the square of that length the wave-like combination directly yields the chance of observing each basis state.