Protocols That Prove Quantum Works

Theory is persuasive. Experiments are convincing. But protocols are decisive.

A protocol is a recipe: a step-by-step procedure that takes specific inputs, performs specific operations, and produces a specific output. If the protocol works (meaning it produces the claimed output when you follow the steps), you do not need to trust the theory. You can verify it directly.

This chapter presents three protocols that demonstrate quantum information is real, useful, and fundamentally different from classical information. Each protocol achieves something that is mathematically impossible using classical resources alone. They are not theoretical curiosities. All three have been implemented in laboratories, and the first two are building blocks for quantum networks now being developed in the United States, Europe, and China.

Protocol 1: Quantum teleportation

The name is unfortunate. “Teleportation” makes people think of Star Trek, of matter being disassembled in one place and reassembled in another. Quantum teleportation is nothing like that. No matter moves. No energy is transmitted. What happens is that a quantum state, the complete description of a qubit’s amplitudes and phases, is transferred from one location to another. The qubit at the source is destroyed in the process, and the qubit at the destination acquires the original state.

Here is why this is remarkable: the state being transferred is unknown. Alice has a qubit in some state she does not know (and cannot determine, because measuring it would change it). She wants Bob to have a qubit in that exact state. Without teleportation, she would need to physically send her qubit to Bob, which means building a quantum communication channel that preserves the fragile quantum state over distance, a hard engineering problem.

Teleportation avoids this. Instead of sending the quantum state through a quantum channel, Alice and Bob use a shared entangled pair (which they prepared earlier) and a classical communication channel (a phone line, the internet, anything).

How it works

Setup. Alice and Bob share a Bell pair. Alice holds one qubit of the pair. Bob holds the other. Alice also has the qubit whose state she wants to teleport.

Step 1. Alice performs a joint measurement on her two qubits: the one she wants to teleport and her half of the Bell pair. This is a specific measurement called a Bell measurement, and it has four possible outcomes. The measurement destroys the state of both qubits at Alice’s location. This is not a side effect. It is essential. The no-cloning theorem (Chapter 5) guarantees that the original must be destroyed for the copy to appear elsewhere.

Step 2. Alice sends the two-bit measurement result to Bob using a classical channel. This takes time, limited by the speed of light. No faster-than-light communication occurs.

Step 3. Bob receives Alice’s two bits and performs one of four simple corrections on his qubit (one of the four Pauli operations: identity, X, Z, or XZ, depending on Alice’s result). After the correction, Bob’s qubit is in exactly the state that Alice’s original qubit was in.

What happened

The quantum state was transferred from Alice to Bob. Alice’s original qubit was destroyed (by the Bell measurement). The entangled pair was consumed (the entanglement is gone after the protocol). Bob’s qubit is now in the original state. Two classical bits and one shared entangled pair were used.

Note what was not transmitted faster than light. Before Alice sends her two bits, Bob’s qubit is in a random state. He cannot do anything useful with it. The two-bit message is what tells Bob which correction to apply. Without it, his qubit is useless. The quantum information was transferred, but the protocol required classical communication, which respects the speed of light.

Teleportation has been demonstrated experimentally over distances ranging from laboratory benches to hundreds of kilometers via satellite. The Chinese Micius satellite, launched in 2016, demonstrated quantum teleportation between ground stations and orbit. This is engineering, not speculation.

Why it matters

Teleportation is a primitive, a basic building block for more complex protocols. In quantum networks, teleportation allows quantum information to be transmitted between nodes without a direct quantum channel. In quantum computing, it is used for long-range interactions in architectures where physical qubits can only interact locally. In error correction, it is used to move logical qubits between different parts of a processor.

The protocol also demonstrates two fundamental facts. First, quantum information can be separated from its physical carrier. The state that started on Alice’s qubit ended up on Bob’s qubit, two entirely different physical objects. Second, entanglement is a genuine resource: the protocol consumes one Bell pair per teleportation, and you need a fresh pair each time.

Protocol 2: Superdense coding

Superdense coding is the mirror image of teleportation. Where teleportation uses entanglement and classical communication to transmit quantum information, superdense coding uses entanglement and quantum communication to transmit classical information more efficiently than should be possible.

The setup

Alice wants to send two classical bits to Bob. Classically, this requires sending two bits. With superdense coding, Alice sends one qubit, provided she and Bob share an entangled pair beforehand.

How it works

Setup. Alice and Bob share a Bell pair, just like in teleportation.

Step 1. Alice decides which of four two-bit messages she wants to send: 00, 01, 10, or 11. Based on her choice, she applies one of four operations to her half of the Bell pair: do nothing (for 00), apply the X gate (for 01), apply the Z gate (for 10), or apply both X and Z (for 11). Each operation transforms the Bell pair into a different Bell state. There are four Bell states, each corresponding to one of Alice’s four possible messages.

Step 2. Alice sends her qubit to Bob. This is the only thing she transmits: one qubit.

Step 3. Bob now holds both qubits of the (modified) Bell pair. He performs a Bell measurement on the pair, which tells him which of the four Bell states they are in. This reveals Alice’s two-bit message with certainty.

The bookkeeping

Alice sent one qubit. Bob received two bits of information. This seems to violate information theory: one qubit should carry at most one bit. But the accounting works because of the pre-shared entanglement. The total resources consumed were: one qubit of communication plus one shared entangled pair, to transmit two classical bits. The entanglement was a resource that effectively doubled the communication capacity.

Without entanglement, one qubit can carry at most one classical bit (Holevo’s theorem). With entanglement, one qubit carries two classical bits. The entanglement is not free, it had to be created and distributed earlier, but it demonstrates that entanglement is a genuine resource that augments communication.

Why it matters

Superdense coding demonstrates the complementarity between teleportation and classical communication:

Protocol	Input resources	Output
Teleportation	1 entangled pair + 2 classical bits	1 qubit of quantum information transferred
Superdense coding	1 entangled pair + 1 qubit	2 classical bits transferred

This symmetry is not a coincidence. It reflects a deep duality in quantum information theory between quantum and classical information, with entanglement as the resource that converts between them.

For practical applications, superdense coding shows that quantum networks can achieve higher classical communication rates than classical networks, given pre-shared entanglement. This is relevant for quantum network architectures where entanglement distribution is available.

Protocol 3: The CHSH game

The CHSH game (named after Clauser, Horne, Shimony, and Holt) is not a communication protocol. It is a game, specifically designed to test whether quantum correlations are genuinely stronger than classical ones. It is the most direct, most intuitive formulation of Bell’s theorem (Chapter 3), and it settles the question with a number you can calculate on paper.

The rules

Alice and Bob are in separate rooms. They cannot communicate during the game. A referee sends Alice a random bit (call it x) and Bob a random bit (call it y). Alice must respond with a bit (a). Bob must respond with a bit (b). They win if their answers satisfy a specific condition:

• If both x and y are 1, Alice and Bob win when their answers are different (a is not equal to b).
• In all other cases (x=0,y=0 or x=0,y=1 or x=1,y=0), they win when their answers are the same (a equals b).

That is it. Four possible input pairs, each equally likely. A simple win condition. The question is: what is the best winning strategy?

The classical limit

Alice and Bob can agree on a strategy before the game. They can share any amount of classical information: synchronized clocks, lookup tables, pre-arranged signals, anything. But once the game starts, they cannot communicate.

The best classical strategy wins 75% of the time. You can verify this by trying all possible deterministic strategies (there are 16: Alice has 4 possible strategies for responding to her two possible inputs, and Bob has 4). The best ones win in 3 out of 4 input combinations. No classical strategy, no matter how clever, can exceed 75%.

This 75% ceiling is not a conjecture. It is a mathematical proof. It holds for all classical strategies, including randomized ones (randomization cannot improve on the best deterministic strategy in this game).

The quantum strategy

Now give Alice and Bob a shared entangled pair. Their strategy is:

When Alice receives her input x, she measures her qubit in one of two bases (chosen based on x). When Bob receives his input y, he measures his qubit in one of two bases (chosen based on y). The four bases are carefully chosen angles on the Bloch sphere.

With the optimal choice of measurement angles, Alice and Bob win approximately 85.4% of the time. The exact value is cos-squared of pi over 8, which equals (2 + square root of 2) divided by 4.

This number, roughly 85%, exceeds the classical limit of 75%. Not by a little. By a measurable, statistically significant amount. And the gap is not due to cleverness or information theory tricks. It comes from the quantum correlations in the entangled pair, which are genuinely stronger than any classical correlations.

What the CHSH game proves

The CHSH game is Bell’s theorem made tangible. It proves three things:

First, quantum correlations exceed classical correlations. The 85% vs 75% gap is an experimental fact, verified in labs worldwide with increasing precision.

Second, hidden variables cannot explain quantum mechanics. Any hidden-variable theory (where the particles carry pre-determined values) is a classical strategy. All classical strategies are limited to 75%. Quantum mechanics predicts 85%. Nature delivers 85%. Therefore, hidden variables do not describe nature.

Third, the quantum advantage is quantifiable. The difference between 85% and 75% is not a vague claim about “quantum superiority.” It is a specific number (approximately 10.4 percentage points) that can be measured in any lab with an entangled photon source and two detectors.

The CHSH game is also a bound. Quantum mechanics does not allow Alice and Bob to win 100% of the time. The 85.4% limit (called the Tsirelson bound) is as fundamental as the 75% classical limit. If any experiment ever showed a winning rate above 85.4%, it would require physics beyond quantum mechanics. So far, nature respects both bounds precisely.

What these protocols tell us together

Three protocols. Three different impossibility proofs overcome by quantum resources.

Teleportation: classical communication alone cannot transmit a quantum state (you need entanglement). Superdense coding: classical communication alone cannot send two bits with one carrier (you need entanglement). The CHSH game: classical correlations alone cannot win more than 75% (you need entanglement).

The common thread is entanglement as a resource that enables capabilities provably inaccessible to classical means. Not “probably” inaccessible. Not “difficult” to achieve classically. Mathematically, provably impossible without quantum resources.

For a technical leader, these protocols serve as a calibration tool. Anyone claiming quantum advantage should be able to point to a mechanism as clear as these protocols: a specific capability, a specific classical limit, and a specific quantum improvement, with the gap verified experimentally. If the claimed advantage cannot be articulated with this precision, skepticism is appropriate.

The next chapter connects these information-theoretic concepts to computation: how quantum states, gates, entanglement, and measurement compose into algorithms that solve problems faster than classical computers can.