The No-Cloning Obstacle

You cannot copy an unknown qubit. Say a machine copies |0⟩ and |1⟩ correctly. Then a rule called linearity forces it to entangle a superposition instead of copying it. Two lines of algebra prove it. So quantum error correction protects information by spreading it across entangled qubits. It never keeps backup copies.

Why not just copy the qubit?

Normal computers protect data by copying it. Backup drives mirror your disk. Memory chips store extra check bits. The internet resends lost packets. You back up your laptop. The recipe is the same everywhere: keep several copies. When one breaks, the others outvote it.

So here is the obvious plan for a qubit. A qubit holds a superposition — a mix of 0 and 1 with a weight on each part. Each weight is an amplitude, and squaring it gives the chance of seeing that answer. The plan: make three copies, then take a majority vote later. If that worked, quantum error correction would be a footnote.

It does not work. And it is not because engineers haven't found the right gadget yet. Copying an unknown quantum state is impossible. This is the famous no-cloning theorem. ("Cloning" just means making a perfect copy.) This chapter proves it with two lines of algebra you can check by hand. Then we test it live. We build the most natural "copy machine," run it, and read the counts. They show it made something entangled instead of two copies.