Quantum Mechanics & Wave Functions — Schrödinger, Tunnelling, Double-Slit and Quantum Circuits

Quantum mechanics is the most precisely tested physical theory in history — and one of the hardest to internalise, because its predictions are fundamentally probabilistic and its objects (wave functions) have no classical analogue. This guide connects each core quantum concept to a running simulation, building intuition step by step from the double-slit experiment to Grover's quantum search algorithm.

Why Quantum Mechanics Needs Simulation

Classical mechanics lets you picture a ball rolling down a hill. Quantum mechanics describes an electron as a complex-valued wave function ψ(x,t) whose squared magnitude |ψ|² gives a probability density. There is no intuitive mental image for this. The wave function doesn't live in ordinary space — it lives in a Hilbert space. When you "measure" the electron, the wave function collapses to a definite value in a way that no classical process can reproduce.

Simulation helps by rendering the otherwise invisible. An interactive Schrödinger wave packet lets you watch superposition and interference directly. Quantum tunnelling becomes visually obvious when you see the probability amplitude leak through a barrier that the particle classically couldn't cross. Grover's algorithm, which looks like pure abstract algebra on paper, snaps into focus when you watch amplitudes amplify iteratively toward the marked state.

This guide follows five progressive layers of quantum theory, each anchored to a simulation you can open and manipulate right now.

Part 1 — The Wave Function and Schrödinger's Equation

The Time-Dependent Schrödinger Equation

The central equation of quantum mechanics is the time-dependent Schrödinger equation (TDSE). It governs how a quantum state ψ(x,t) evolves over time in the presence of a potential V(x). Unlike Newton's F=ma — a differential equation for a trajectory — the TDSE is a differential equation for a probability amplitude. The wave function ψ is complex-valued; its modulus squared |ψ(x,t)|² gives the probability of finding the particle at position x at time t.

Time-Dependent Schrödinger Equation

iℏ · ∂ψ/∂t = Ĥψ = −(ℏ²/2m)·∂²ψ/∂x² + V(x)·ψ

Probability density: ρ(x,t) = |ψ(x,t)|² = ψ*·ψ

Normalisation: ∫|ψ|² dx = 1 (total probability = 1)

Stationary state: ψₙ(x,t) = φₙ(x)·exp(−iEₙt/ℏ)

For particle in box: Eₙ = n²π²ℏ²/(2mL²), n = 1, 2, 3, …

Gaussian wave packet: ψ(x,0) = A·exp(−x²/4σ² + ik₀x)

The Schrödinger simulation solves the 1D TDSE numerically using the Crank-Nicolson method, which is unconditionally stable and norm-conserving (it keeps ∫|ψ|² = 1 at every step). You can place a Gaussian wave packet — a localised probability bump with a mean momentum ℏk₀ — and watch it propagate, spread due to dispersion, and interact with barriers.

Part 2 — Quantum Tunnelling

Classically Forbidden Regions

Classical mechanics is absolute: a particle at position x with total energy E cannot enter a region where the potential energy V(x) > E. The kinetic energy K = E − V would be negative, which is impossible for a classical particle. Quantum mechanics has no such prohibition. The wave function can be non-zero inside a classically forbidden region — it decays exponentially, but doesn't vanish. If the barrier is thin enough, the wave function emerges on the other side with finite amplitude. This is quantum tunnelling.

Tunnelling is not a rare exotic effect. It is the mechanism behind alpha decay in radioactive nuclei, the operation of tunnel diodes, scanning tunnelling microscopy (STM), and enzymatic hydrogen transfer in biochemistry. The Sun itself depends on quantum tunnelling: without it, proton–proton fusion would be impossible at solar core temperatures (≈15 million K is far too cold to overcome the Coulomb barrier classically).

Quantum Tunnelling — Transmission Coefficient

Barrier: V(x) = V₀ for 0 ≤ x ≤ a, V = 0 elsewhere

Decay constant: κ = √(2m(V₀−E)) / ℏ   (E < V₀)

Transmission: T ≈ exp(−2κa)   (thin barrier, κa ≫ 1)

WKB approximation: T ≈ exp(−2∫κ(x) dx)   (arbitrary shape)

Gamow factor (alpha decay): Γ ∝ exp(−2∫√(2m(V(r)−E))/ℏ dr)

STM current: I ∝ exp(−2κd)   (d = tip–sample separation)

The scanning tunnelling microscope achieves sub-angstrom spatial resolution because tunnelling current falls by roughly an order of magnitude for every 1 Å increase in tip-to-sample distance. This extraordinary sensitivity — exponential dependence on gap width — turns each atom's topography directly into current fluctuations readable with a lock-in amplifier. The quantum tunnelling simulation captures this physics in one dimension with adjustable barrier width and height.

Part 3 — Atomic Structure: Hydrogen Orbitals

The Quantum Numbers of Hydrogen

The hydrogen atom is the only atom for which the Schrödinger equation has an exact analytic solution. Solving the 3D TDSE in spherical coordinates produces a set of wave functions ψ_nlm(r,θ,φ) labelled by three quantum numbers: n (principal, sets energy), l (orbital angular momentum, 0 ≤ l ≤ n−1), and m (magnetic quantum number, −l ≤ m ≤ l). Each unique (n,l,m) triple is an orbital — a spatial probability distribution for the electron.

Hydrogen Wave Functions

ψₙₗₘ(r,θ,φ) = Rₙₗ(r) · Yₗᵐ(θ,φ)

Energy: Eₙ = −13.6 eV / n²   (n = 1, 2, 3, …)

Rₙₗ(r): radial part — Laguerre polynomials × exp(−r/na₀)

Yₗᵐ(θ,φ): spherical harmonics (angular part)

Bohr radius: a₀ = ℏ²/(mₑe²) ≈ 0.529 Å

1s orbital (n=1,l=0,m=0): ψ = (1/√π)·a₀^{−3/2}·exp(−r/a₀)

The shapes of atomic orbitals determine chemical bonding. The 2p orbital has two lobes separated by a nodal plane — this geometry forces sigma bonds to form along the internuclear axis. The 3d orbitals' complex lobed geometries create the crystal field splitting responsible for the colours of transition metal compounds. Understanding the orbital shapes as probability distributions (rather than "shells") is the conceptual step from Bohr's model to modern quantum chemistry.

Part 4 — Quantum Computing: Qubits and Gates

From Classical Bits to Qubits

A classical bit is either 0 or 1. A qubit is a quantum system that can exist in a superposition of |0⟩ and |1⟩: |ψ⟩ = α|0⟩ + β|1⟩, where |α|² + |β|² = 1. The qubit's state is a unit vector in a 2D complex Hilbert space — visualised as a point on the Bloch sphere. Quantum gates are unitary operations that rotate this vector, and they are the quantum analogue of classical logic gates.

Qubit State and Single-Qubit Gates

State: |ψ⟩ = α|0⟩ + β|1⟩, where |α|² + |β|² = 1

Bloch vector: r = (2Re(α*β), 2Im(α*β), |α|²−|β|²)

Hadamard: H = (1/√2)[[1,1],[1,−1]] → |0⟩ → (|0⟩+|1⟩)/√2

Pauli-X (NOT): X = [[0,1],[1,0]] → |0⟩ ↔ |1⟩

Phase: S = [[1,0],[0,i]] → adds 90° phase to |1⟩

T gate: T = [[1,0],[0,exp(iπ/4)]] → 45° phase to |1⟩

CNOT (2-qubit): flips target qubit if control = |1⟩

The power of quantum computing comes from entanglement: two entangled qubits cannot be described independently — their joint state has correlations that no classical probability distribution can replicate. This is what Bell's theorem proves: the CHSH inequality S ≤ 2 must hold for any local hidden variable theory, but quantum mechanics predicts — and experiment confirms — S = 2√2 ≈ 2.83. The quantum entanglement simulation runs a live CHSH test that you can verify by adjusting measurement angles.

Part 5 — Grover's Quantum Search Algorithm

Quadratic Speedup for Unstructured Search

Given an unsorted database of N items with one marked item, a classical computer requires O(N) queries on average to find it. Grover's algorithm solves the same problem in O(√N) quantum queries — a quadratic speedup achieved by exploiting quantum amplitude amplification. The algorithm requires only about π√N/4 iterations to reach near-certain success probability.

Each iteration of Grover's algorithm consists of two operations: (1) an oracle that flips the sign (phase) of the marked state's amplitude, and (2) a diffusion operator that reflects all amplitudes about their mean. The net effect is to increase the marked state's amplitude by approximately 2/√N per step. After ~π√N/4 steps, the marked state has near-unit amplitude and measurement finds it with high probability.

Grover's Algorithm

Initial state: |s⟩ = (1/√N)·Σ|x⟩   (uniform superposition)

Oracle Uω: |x⟩ → −|x⟩ if x=ω, |x⟩ → |x⟩ otherwise

Diffusion D = 2|s⟩⟨s| − I   (inversion about mean)

Iteration: |ψₜ₊₁⟩ = D·Uω·|ψₜ⟩

After T steps: P(finding ω) = sin²((2T+1)·arcsin(1/√N))

Optimal T ≈ π√N/4 → P ≈ 1 − O(1/N)

Complexity: O(√N) vs classical O(N) — quadratic speedup

Grover's algorithm demonstrates a key principle of quantum advantage: it doesn't require the database to have any structure — it works on any oracle that can identify the marked item. The amplitude amplification technique it introduces is also a subroutine in more powerful quantum algorithms. In the simulation you can vary the database size (N), watch the sinusoidal probability evolution, and see that stopping at exactly the optimal iteration count matters — run too many steps and the probability starts falling again.

Quantum Connections Across the Collection

Quantum mechanics underpins simulations across many other categories on the platform:

Algorithms & Methods

Crank-Nicolson TDSE solver Gaussian wave packet WKB approximation Transfer matrix method Clebsch-Gordan coefficients Spherical harmonics Yₗᵐ Associated Laguerre polynomials Bloch sphere parametrisation Unitary gate matrices (SU(2)) Bell state preparation CHSH inequality test Oracle phase kickback Grover diffusion operator Amplitude amplification Quantum measurement Born rule

Next: Devlog #27 — Q2 2027 Platform Update covers the Wave 8 content sprint, new simulations, and what's coming next in the platform roadmap.