Quantum computing. Beyond the hype.

The idea

An orchestra, not a head count.

The book’s central idea is simple: more musicians don’t guarantee better music. A quantum computer also needs coordination, accuracy, and enough time to finish the performance.

The science · 01 / 04

Superposition

Before measurement, a qubit can hold a quantum combination of 0 and 1. That creates possibilities; it doesn’t automatically produce a useful answer.

Right now this qubit would read 0 every time.

For the physicists|ψ⟩ = α|0⟩ + β|1⟩ on the Bloch sphere, with |α|² + |β|² = 1.

The science · 02 / 04

Entanglement

Qubits can share a state, linking their measurement outcomes. This lets the system behave as a coordinated whole. It cannot send messages faster than light.

Two qubits, one shared state. Watch them move together.

For the physicists|Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Correlation, not communication.

The science · 03 / 04

Interference

Like waves, quantum amplitudes can reinforce or cancel one another. Carefully designed algorithms use this to make useful outcomes more likely.

The two paths are in step. Chance of the useful answer: 100%.

For the physicistsTwo equal paths, relative phase φ: P = |a₁ + a₂|² = cos²(φ/2).

The science · 04 / 04

Measurement

Reading one qubit gives one ordinary bit: 0 or 1. You don’t get to read every possibility. The algorithm must shape the odds before you look.

Eight possible answers. The algorithm has stacked the odds toward one.

For the physicistsBorn rule: P(k) = |a_k|², summing to 1 across every outcome.

At this accuracy, a 1,000-step job almost never finishes cleanly.

For the physicistsSuccess after n gates ≈ Fⁿ.