1. Bit
  2. Qubit
  3. Superposition
  4. Measurement
  5. Entanglement
  6. Circuits
  7. Fourier
  8. Shor
  9. Grover
  10. Correction

Chapter 02 · Interference

Amplitudes that cancel out

Probabilities only add up; amplitudes can cancel. That single difference, interference, is the source of all quantum advantage. A coin tossed twice is still random; a “quantum coin” tossed twice gives a certain answer.

In 1801 Thomas Young passed light through two narrow slits and saw on the wall a pattern of light and dark bands: where the waves arrived in step they reinforced each other, and where they arrived out of step they cancelled. In 1989 Akira Tonomura's team at Hitachi repeated the experiment by firing single electrons, one at a time. Each one left a single dot on the screen, but after thousands of them the same bands appeared. Each electron behaves as if it went through both slits and interfered with itself.

Evolution is linear and unitary

Between measurements, a closed quantum system evolves according to Schrödinger's equation (1926), iℏddt|ψ⟩=H|ψ⟩. Its solution is |ψ(t)⟩=U(t)|ψ(0)⟩ with U(t)=e−iHt/ℏ, a linear map that preserves the norm.

Postulate (evolution)

The evolution of a closed system over a time interval is given by a unitary matrix U, that is, one with U†U=I:

|ψ⟩↦U|ψ⟩.

Linearity is the superposition principle: if |ψ1⟩ and |ψ2⟩ are possible states, so is any normalized combination of them, and U acts on each part separately. Unitarity ensures that probabilities keep adding up to 1, and that every evolution can be undone with U†: it is the quantum version of reversible computation.

The interference term

Suppose an outcome can be reached along two paths with amplitudes a and b. Quantum mechanics adds the amplitudes and only then squares:

|a+b|2=|a|2+|b|2⏟classical+2Re(a‾b)⏟interference.

The last term can be positive (constructive interference) or negative (destructive). If b=−a, the outcome becomes impossible even though each path, on its own, would reach it. Richard Feynman made this rule the starting point of his formulation of quantum mechanics (1948): the amplitude of a process is the sum over all paths of the product of the amplitudes along each path.

Proposition (classical probabilities never cancel)

If S1,…,Sk are stochastic matrices, the probability of reaching an outcome is a sum, over paths, of products of non-negative numbers. Adding a new path can only increase it.

This is the whole difference. A randomized algorithm can only accumulate probability on the good answers; a quantum algorithm can, in addition, remove probability from the bad ones by making their paths cancel each other out.

A quantum coin

The Hadamard gate is the quantum version of tossing a coin:

H=12(111−1),H|0⟩=|+⟩=|0⟩+|1⟩2,H|1⟩=|−⟩=|0⟩−|1⟩2.

Applied to |0⟩ it gives a 50/50 superposition. A classical random coin applied twice still gives 50/50. The quantum coin, applied twice, gives back exactly the starting state.

Proposition (H2=I)
HH|0⟩=12(H|0⟩+H|1⟩)=12(|0⟩+|1⟩+|0⟩−|1⟩)=|0⟩.

The two paths that lead to |1⟩ have amplitudes +12 and −12 and cancel out; the two that lead to |0⟩ add up. The randomness of the first coin was not ignorance about a hidden result: it was a superposition, and superpositions can be undone.

The Mach–Zehnder interferometer

The same circuit can be built with light: a beam splitter (which acts as H), two arms, and a second splitter. If one arm adds a phase delay φ, the circuit is H⋅P(φ)⋅H, with P(φ)=diag(1,eiφ).

Proposition (interferometer)

Starting from |0⟩, the output of HP(φ)H is detected at 0 with probability

P(0)=|1+eiφ2|2=cos2⁡φ2.
Each output receives two contributions, one per arm. The arrows show the two amplitudes as complex numbers and their sum. With φ=0 they reinforce at detector 0 and cancel at detector 1; with φ=π the opposite happens. The particle is never split: each run triggers exactly one detector, but the probabilities follow the interference.

Quantum walks

Interference has striking effects even on simple processes. In a classical random walk, a walker flips a coin at each step and moves left or right: after t steps its typical distance from the origin grows like t, a consequence of the central limit theorem. In a quantum walk (Aharonov, Davidovich and Zagury, 1993; Ambainis et al., 2001) the coin is a qubit, the Hadamard gate is applied to it, and the walker moves left or right in superposition depending on the coin.

Distribution of the position after t steps. The classical walk (grey) is the familiar bell curve, of width t. The quantum walk (colour) has an irregular shape with two peaks that move away at constant speed: its spread grows like t, quadratically faster. Paths that return to the centre cancel each other out.
Theorem (ballistic spreading; Ambainis et al., 2001)

For the Hadamard walk on the line, the standard deviation of the position after t steps grows linearly, σt=Θ(t), whereas for the classical random walk σt=t.

This quadratic difference is the same one that will appear in Grover's algorithm, and quantum walks are the basis of several algorithms with exponential speedups for problems on graphs. The general lesson: a quantum computer does not try all the answers at once. It choreographs interference so that the paths towards the wrong answers cancel out.

References

  1. T. Young (1804). “The Bakerian Lecture: Experiments and Calculations Relative to Physical Optics”. Philosophical Transactions of the Royal Society, 94.
  2. R. P. Feynman (1948). “Space-Time Approach to Non-Relativistic Quantum Mechanics”. Reviews of Modern Physics, 20(2).
  3. A. Tonomura et al. (1989). “Demonstration of single-electron buildup of an interference pattern”. American Journal of Physics, 57(2).
  4. Y. Aharonov, L. Davidovich and N. Zagury (1993). “Quantum random walks”. Physical Review A, 48(2).
  5. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath and J. Watrous (2001). “One-dimensional quantum walks”. STOC.