Multi-Qubit Circuits, Entanglement, and No-Hype Protocols

Four joint outcomes, one ordered basis#

Build the two-qubit coordinate system and state the endianness convention.

Multi-qubit computing is where the state space grows exponentially, gates become conditional, and entanglement appears. It is also where bad explanations become tempting, so this guide keeps four disciplines in view throughout:

• Combine systems with tensor products, never with wishful notation.
• Use multi-qubit gates to create correlations that no collection of independent one-qubit states can represent.
• Use measurement to extract classical data; and expect it to destroy the rest.
• Respect no-signaling: entanglement never sends usable information faster than light.

For two qubits, this book uses a fixed ordering, and the fixedness matters:

A general two-qubit pure state is $\lvert\psi\rangle=a_{00}\lvert00\rangle+a_{01}\lvert01\rangle+a_{10}\lvert10\rangle+a_{11}\lvert11\rangle$, with the squared magnitudes of the four amplitudes summing to one. Most early mistakes in multi-qubit work are ordering mistakes; decide the convention once and never improvise it again.

Combining two one-qubit states multiplies every component of the first vector by every component of the second:

Worked through on basis states:

Two qubits give a four-dimensional state space; ten give a thousand; three hundred give more amplitudes than there are atoms in the observable universe. That growth is the source of both the excitement and the simulation cost.

Evidence boundary. Composite quantum systems are represented by tensor-product state spaces. [John Watrous] [Michael A. Nielsen]

CNOT as a branch-dependent permutation#

Trace all basis inputs before applying it to a superposition.

CNOT uses the first qubit as control and the second as target, flipping the target exactly when the control is 1:

As a matrix in the fixed basis ordering:

It is the quantum version of an if-statement, and because it is linear it acts on superpositions branch by branch; which is exactly how the next example manufactures entanglement.

A two-qubit product state factors into independent one-qubit states, $(a\lvert0\rangle+b\lvert1\rangle)\otimes(c\lvert0\rangle+d\lvert1\rangle)$, which expands to $ac\lvert00\rangle+ad\lvert01\rangle+bc\lvert10\rangle+bd\lvert11\rangle$. Compare the coefficients and you get a test: a two-qubit pure state is separable only if its amplitudes satisfy

For $\Phi^+$, the left side is $(1/\sqrt2)(1/\sqrt2)=1/2$ and the right side is $0\cdot0=0$. The test fails, so no choice of local one-qubit states can reproduce the joint state. That is the whole definition: entangled means not factorable. No distance, no drama, just algebra.

A classical random process can also produce correlated bits; 00 half the time, 11 half the time; and in one measurement basis that looks exactly like the Bell state. The difference shows up when you measure in other bases: Bell states produce structured correlations there too, and no classical local hidden-variable model can reproduce the full set of statistics observed in Bell-type experiments.

For computation the practical point is simpler still: entanglement means the joint state cannot be represented as independent local states. It is a state-space and correlation-structure resource; not a communication loophole, and not evidence that the universe is whispering between particles.

Evidence boundary. A Hadamard followed by CNOT creates a Bell state that cannot be factored into independent one-qubit states. [Michael A. Nielsen] [John Preskill]

The factorization test on a Bell pair#

Show algebraically why the output cannot be written as two independent states.

The correlations are real, but they carry no controllable message. Three facts close every loophole:

• Each local measurement outcome is individually random.
• The correlation becomes visible only when the two parties compare classical records.
• Comparing records requires ordinary, slower-than-light classical communication.

Teleportation respects the same rule. It transfers an unknown quantum state using a shared entangled pair plus two classical bits, and the receiver cannot reconstruct anything until the classical bits arrive. Relativity survives quantum mechanics intact.

Suppose a universal cloning operation $U$ existed, with $U\lvert\psi\rangle\lvert0\rangle=\lvert\psi\rangle\lvert\psi\rangle$ for any state $\lvert\psi\rangle$. Applied to two different inputs it would give $U\lvert a\rangle\lvert0\rangle=\lvert a\rangle\lvert a\rangle$ and $U\lvert b\rangle\lvert0\rangle=\lvert b\rangle\lvert b\rangle$.

Unitary operations preserve inner products. Before cloning, the inner product of the two input states is $\langle a\vert b\rangle$, since the blank state contributes a factor of one. After cloning it is $(\langle a\vert b\rangle)^2$. Preservation demands $\langle a\vert b\rangle=(\langle a\vert b\rangle)^2$, which holds only when the states are identical or perfectly distinguishable; never for arbitrary unknown states.

So universal cloning is impossible, and the proof is three lines of linear algebra. This is not an engineering limitation awaiting a clever fix; it is a theorem, and Part III shows how the field turns it from a constraint into a security resource.

Evidence boundary. Bell correlations do not allow controllable faster-than-light signaling. [John S. Bell] [Michael A. Nielsen]

Local randomness and joint structure#

Separate marginal statistics from correlations observed after classical comparison.

Superdense coding#

Resource: one shared Bell pair, plus one qubit sent from Alice to Bob.

Outcome: Bob recovers two classical bits from Alice's single transmitted qubit.

Operational boundary:

• A physical qubit still makes the trip.
• Relativistic signaling limits remain intact.
• It spends pre-shared entanglement; the pair is consumed.

Teleportation#

Resource: one shared Bell pair, plus two classical bits sent from Alice to Bob.

Outcome: Bob reconstructs Alice's unknown qubit state.

Operational boundary:

• The protocol moves a qubit state rather than an object.
• Alice's original is destroyed, as no-cloning requires.
• Completion waits for the classical bits to arrive.

BB84 and quantum key distribution#

Resource: quantum states prepared in non-commuting bases, plus an authenticated classical channel.

Outcome: a shared key with eavesdropping detection, under clearly stated assumptions about the devices and the channel.

What it does not replace: the migration to post-quantum cryptography across ordinary internet infrastructure, which solves a different problem for a fraction of the operational cost. Part VIII weighs both honestly.

Entangling gates are usually the hard part of a machine. One-qubit rotations are comparatively easy; making two qubits interact strongly enough to entangle, while keeping cross-talk, leakage, calibration drift, and measurement error under control, is where modalities differ. The questions that matter:

• What is the native entangling gate?
• What is its measured fidelity?
• How does that fidelity change as the system grows?
• How connected are the qubits?
• Does routing force long chains of swap gates?
• Can error-correction cycles run fast enough to keep up?

Entanglement is necessary for many quantum advantages, but it is never sufficient by itself. The weak version of an application claim runs: "this uses entanglement, so it will beat classical computing." The strong version names the problem structure being exploited, the algorithm that exploits it, the hardware that can run the circuit within error limits, and the classical baseline that loses under stated assumptions. Anything between those two poles is marketing.

Protocol contracts without supernatural payloads#

List the resources and outputs of cloning, dense coding, and teleportation claims.

1. Compute $\lvert1\rangle\otimes\lvert0\rangle$ in the fixed basis ordering.
2. Write CNOT's action on all four two-qubit basis states from memory.
3. Derive the Bell state from $\lvert00\rangle$ using $H$ on the first qubit and then CNOT.
4. Test whether $(\lvert00\rangle+\lvert01\rangle)/\sqrt2$ is entangled.
5. Test whether $(\lvert00\rangle+\lvert11\rangle)/\sqrt2$ is entangled.
6. Explain why no-cloning does not prevent copying classical bits.
7. Explain teleportation to a technical audience without science-fiction language.
8. Pick a hardware company and identify its main entangling operation or error-correction route.

Part III of the book gives each of these ideas a full chapter:

• Multi-Qubit Circuits; the circuit model at full size.
• Bell States and GHZ States; the entangled states worth knowing by name.
• Teleportation; the protocol, gate by gate.
• Quantum Key Distribution; BB84 and what it actually secures.

Then continue to Quantum Algorithms and Speedups, where entanglement and interference are put to work.