English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Two Bits Grown Together: The Mathematical Face of Tensor Products and Entanglement

Forum topic · 小凯 · 2026-11-07

Summary

Episode 015 of a Chinese quantum computing column ('From Coins to Error Correction') explains how the joint state of two qubits is written via the tensor product, and gives a precise mathematical definition of entanglement. Using a playing-card analogy (a 52-card deck as the full catalog of suit × rank combinations), the post builds the four computational basis states |00⟩, |01⟩, |10⟩, |11⟩. It shows that independent qubit states expand as (a|0⟩+b|1⟩)⊗(c|0⟩+d|1⟩) = ac|00⟩ + ad|01⟩ + bc|10⟩ + bd|11⟩, meaning separability — factorability back into individual states — is the signature of independence. The Bell state (1/√2)|00⟩ + (1/√2)|11⟩ is then proven inseparable: no amplitudes a, b, c, d can reproduce it, which the author defines as entanglement's exact mathematical form. Measuring this state yields 00 or 11 with equal probability, explaining 'individually random, jointly correlated' behavior without signaling. The post concludes that separable states are a measure-zero special case while entangled states fill the state space — the source of quantum computing's power and the difficulty of classical simulation.

Two Bits Grown Together: The Mathematical Face of Tensor Products and Entanglement

> Prerequisites: Episodes 014 (amplitude bookkeeping), 003 (entanglement intuition), and 013 (amplitudes). > Next episode: 016, "The Squaring Step."

A deck of playing cards has fifty-two cards, but you only need to memorize two small lists: four suits (spades, hearts, clubs, diamonds) and thirteen ranks (A through K). Every card is a "suit × rank" pairing. The whole deck is the complete catalog of all pairings of these two lists.

The state ledger of two qubits is compiled the same way — and it is precisely in this "master catalog of pairings" that entanglement reveals its mathematical true form. This post accomplishes exactly one task: proving that there exists a master catalog that cannot be torn back into the two original lists.

First, Build the Catalog: Four Basis States

A single bit's ledger has two amplitudes: one for |0⟩ and one for |1⟩ (Episode 013). With two bits, pair the two lists: |0⟩ with |0⟩, |0⟩ with |1⟩, |1⟩ with |0⟩, |1⟩ with |1⟩ — written as |00⟩, |01⟩, |10⟩, |11⟩. Four basis rows, four arrows in the ledger.

(Reading convention: |10⟩ means the first bit is 1 and the second is 0. This column always places the first bit on the left.)

Two Independent Bits: The Expansion of Pairings

If the two bits are independent — the first in its own superposition, the second in its own — how is the joint ledger written?

Take the expansion of pairings of the two small ledgers: each amplitude of the first bit is paired and multiplied with each amplitude of the second bit, filling the corresponding cell of the joint catalog. In one line (⊗ is read as "expansion of pairings," formally the tensor product):

> (a|0⟩ + b|1⟩) ⊗ (c|0⟩ + d|1⟩) = ac·|00⟩ + ad·|01⟩ + bc·|10⟩ + bd·|11⟩

Notice: the four numbers of the joint ledger (ac, ad, bc, bd) are all generated from the four original numbers (a, b, c, d). Like the card catalog, where every card reduces to "suit × rank": the joint state of an independent system can always be reduced back to the individual states.

Separability is the mathematical signature of independence.

Entangled States: The Catalog That Cannot Be Torn

Now the exact form of the "telepathic dice" from Episode 003:

> (1/√2)|00⟩ + (1/√2)|11⟩ — the joint ledger is (1/√2, 0, 0, 1/√2): only the |00⟩ and |11⟩ amplitudes are nonzero; the |01⟩ and |10⟩ cells are zero.

In plain words: the two bits are either both 0 or both 1, each with half probability — measurement results are always synchronized, with no "one zero, one one" noise. This is the standard Bell pair.

Now try to factor it back into "state of the first bit ⊗ state of the second bit" — i.e., find four numbers a, b, c, d such that ac = 1/√2, ad = 0, bc = 0, bd = 1/√2.

Try solving it: ad = 0 implies a = 0 or d = 0; bd = 1/√2 implies b ≠ 0 and d ≠ 0, so d ≠ 0, forcing a = 0; but ac = 1/√2 requires a ≠ 0 — contradiction. No solution.

No matter what values you try, this joint ledger cannot be torn back into two independent small ledgers. Its four arrows are not a pairing combination of any "individual tendencies."

"Cannot be torn back into the original lists" is the mathematical definition of entanglement. When Episode 003 said "each bit alone has no state," here is the precise meaning: no state can be assigned to a single bit at all — the pair of brackets (a|0⟩+b|1⟩) and (c|0⟩+d|1⟩) simply does not hold for it.

Why This State Is "Individually Random, Jointly Synchronized"

Re-derive Episode 003's phenomenon from the four amplitudes:

Measure it (Episode 013's rule: probabilities are squared amplitudes): probability of |00⟩ = (1/√2)² = 1/2, likewise |11⟩ at 1/2, |01⟩ and |10⟩ zero. So every measurement yields 00 or 11, each half the time — the two bits are always identical, yet each is completely random. That is the entire mathematics of "rolling dice in Paris, synchronized in Beijing": the synchronization is not a signal; it is that the joint ledger simply has no cells where noise could be written.

This also explains Episode 012's warning that "the state sphere only works for a single bit": one bit has two amplitudes (a, b), enough to draw a sphere; the four amplitudes of an entangled two-bit state are locked together (here a = d, b = c = 0 in strong correlation), so there is no such thing as "the first bit's own sphere." Lose separability, lose the sphere.

A Ghost in the Counting

Note a numerical trick: the joint ledger of two bits has 4 amplitudes; two independent bits also have 2 + 2 = 4 parameters. The numbers match, but separable states occupy only a tiny fraction of all joint states — because "being separable" is itself a strong constraint (the four numbers must exactly take the shape ac, ad, bc, bd), like keeping only those cards that can be reduced back to "suit × rank."

In other words: entangled states are not rare monsters; they are the overwhelming majority of the two-bit world — "independence" is the rare exception. Two randomly grabbed bits are almost certainly entangled. This intuition becomes a heavy blow in Episode 79 (why classical simulation falls behind): a simulator must serve this untearable ledger, and untearable ledgers fill the entire state space.

Dismantling the Analogy

What the playing-card analogy borrows — and where it breaks:

  • Disanalogy 1: Card pairings are unique identifiers (one card has exactly one suit and one rank); amplitude pairings are distributions (a superposition occupies multiple pairing positions at once). The joint ledger is a catalog of probability clouds, not a shelf of physical objects.
  • Disanalogy 2 (the fatal one): A card catalog is always separable — any card reduces to suit and rank; the quantum joint ledger has inseparable members (entangled states). This is exactly where the analogy must be abandoned. Cards serve to build mechanical intuition about "expansion of pairings"; once built, the intuition is discarded immediately.

What to Take Away

1. The two-bit joint ledger has four basis rows |00⟩, |01⟩, |10⟩, |11⟩. Independent states are expansion-of-pairings (factorable back into two sets of parameters); entangled states are joint ledgers that cannot be torn back into the original lists — this is the rigorous definition of entanglement. 2. The Bell state (1/√2)(|00⟩+|11⟩) has no separable solution; its measurement distribution — "half and half, always synchronized" — is the mathematical embodiment of Episode 003's dice story. 3. Independence is the exception; entanglement is the norm — the separability constraint is extremely strong, and inseparable states fill the state space. This is both the treasure trove of quantum computing's power and the nightmare of classical simulation.

Hook for the next stop: you can now read the amplitude ledger — but the squaring step that turns amplitudes into probabilities hides a precise rule this column has not yet stated (why the square of the length, and where the cross terms went). Episode 016, "The Squaring Step."

eventtags:

quantum-computing

Tags

#quantum-computing#tensor-product#entanglement#bell-state#qubits#superposition#mathematics#tutorial

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178636849