Fundamental Quantum Information Protocols

Introduction and context

Quantum information protocols exploit properties that have no direct classical equivalent, especially superposition, measurement disturbance, and entanglement. They do not allow faster-than-light communication or free transmission of unknown quantum states. Instead, they reorganize available resources—quantum systems, shared entanglement, classical communication, and carefully controlled operations—to accomplish tasks with distinctive communication or computational advantages.

This chapter develops four foundational protocols:

• quantum teleportation, which transfers an unknown quantum state;
• superdense coding, which transmits two classical bits using one transmitted qubit;
• entanglement swapping, which creates entanglement between particles that have never interacted;
• distributed-state transfer, a broader engineering framework for moving or reconstructing quantum states across a network.

The protocols are closely related. Teleportation consumes shared entanglement and classical communication. Superdense coding consumes shared entanglement to increase the classical information carried by a transmitted qubit. Entanglement swapping extends entanglement over network links. Distributed-state transfer combines these ideas with routing, synchronization, error management, and verification.

Learning objectives

By the end of this chapter, a learner should be able to:

1. describe the resources and circuit operations used in the four protocols;
2. derive the measurement and correction steps of quantum teleportation;
3. explain why superdense coding does not violate classical or relativistic limits;
4. distinguish entanglement swapping from direct state teleportation;
5. evaluate fidelity, success probability, communication cost, and operational limitations;
6. select an appropriate protocol for a small quantum-network application.

1. Essential concepts and notation

A qubit is represented by a normalized state

where α and β are complex amplitudes satisfying

The probabilities of obtaining 0 and 1 in the computational basis are |α|² and |β|², respectively. A state is called unknown when its amplitudes are not available to the protocol operators for copying or direct preparation.

The four Pauli operators are

Here, I is the identity, X exchanges |0⟩ and |1⟩, Z changes the phase of |1⟩, and Y combines bit and phase changes. Global phase is physically unobservable, but relative phase affects measurement outcomes.

A Bell state is a maximally entangled two-qubit state. The four Bell states are

The entanglement resource is usually measured in ebits: one shared Bell pair represents one ebit of ideal bipartite entanglement.

A quantum channel carries qubits. A classical channel carries ordinary measurement results. A protocol may require both. Classical communication is limited by the speed of light, and quantum measurement results are intrinsically probabilistic.

2. Quantum teleportation

2.1 Purpose and resources

Quantum teleportation transfers an unknown input state from a sender, conventionally Alice, to a receiver, Bob. The input particle is not physically transported. The protocol requires:

• one unknown input qubit;
• one shared entangled Bell pair;
• two classical bits sent from Alice to Bob;
• a Bell-basis measurement by Alice;
• a conditional Pauli correction by Bob.

The original input state is destroyed by Alice’s measurement. Thus teleportation is a transfer rather than a copying operation, consistent with the no-cloning theorem.

2.2 State identity underlying teleportation

Let Alice’s input be

and let qubits 2 and 3 be in |Φ⁺⟩₂₃. The combined state is

This identity shows that a Bell measurement on qubits 1 and 2 leaves Bob’s qubit in one of four related states. Each outcome has probability 1/4 for an ideal maximally entangled pair, independent of α and β.

2.3 Operational sequence

1. Alice and Bob distribute and verify a Bell pair.
2. Alice combines the unknown qubit with her half of the Bell pair.
3. Alice performs a Bell measurement, obtaining two classical bits.
4. Alice sends those bits to Bob.
5. Bob applies I, Z, X, or XZ according to the result.
6. Bob obtains |ψ⟩, ideally with unit fidelity.

A common circuit implementation creates the Bell pair using a Hadamard gate followed by a controlled-NOT gate. Alice then applies a controlled-NOT from the input to her entangled qubit and a Hadamard gate to the input before measuring both qubits. The two measurement bits determine Bob’s correction.

The order of X and Z matters algebraically only by a global sign because XZ = −ZX; that global phase does not change measurement probabilities.

2.4 Why teleportation is not faster-than-light communication

Before Bob receives Alice’s two classical bits, his local state is effectively maximally mixed:

Therefore Bob cannot determine |ψ⟩ or use the protocol to encode a controllable message instantaneously. Entanglement supplies correlations, but classical communication supplies the usable information.

2.5 Performance measures

For an actual output state ρ_out and intended pure state |ψ⟩, state fidelity is

For a perfect output, F = 1. Noise in state preparation, entanglement distribution, gates, measurement, and classical feed-forward lowers F. If the input is unknown and performance is averaged over the Bloch sphere, the average fidelity is commonly used. A classical measure-and-prepare strategy has a benchmark average fidelity of 2/3 for uniformly distributed unknown qubit states; an experimentally demonstrated value above this benchmark is evidence of genuinely quantum state transfer under the relevant assumptions.

2.6 Resource accounting and limitations

Ideal teleportation consumes one ebit and two classical bits per qubit transferred. The entangled pair is consumed by Alice’s Bell measurement. Teleportation also requires a quantum memory or sufficiently precise timing if the classical message arrives after Bob’s qubit has been received.

Important limitations include photon loss, imperfect Bell-pair fidelity, detector errors, gate errors, latency, and the difficulty of applying corrections rapidly. In optical systems, a complete deterministic Bell measurement using only linear optics is difficult; many implementations are probabilistic or require ancillary resources. In a network, entanglement must be generated, stored, purified or error-corrected, and authenticated before it is trusted.

3. Superdense coding

3.1 Purpose and resources

Superdense coding enables Alice to communicate two classical bits to Bob by transmitting one qubit, provided that Alice and Bob initially share one Bell pair. The protocol does not transmit two unknown qubits. It transmits one of four deliberately selected classical messages encoded through local operations.

Resources are:

• one shared Bell pair;
• two classical bits held by Alice;
• one transmitted qubit;
• a Bell-basis measurement by Bob.

3.2 Protocol

Suppose the shared state is |Φ⁺⟩. Alice encodes message bits as follows:

Alice sends her qubit to Bob. Bob now possesses both qubits and performs a Bell measurement, distinguishing the four orthogonal Bell states and recovering the two bits without ambiguity in the ideal case.

The information rate is two classical bits per transmitted qubit under the specified shared-entanglement resource model. This does not contradict the Holevo bound. The bound concerns the classical information accessible from quantum systems under stated resource conditions; prior entanglement changes the communication resource accounting but does not permit unlimited information transmission.

3.3 Operational limitations

Superdense coding requires pre-shared entanglement. Establishing that entanglement may require substantial prior communication and hardware. Noise can make Bell states nonorthogonal or cause measurement errors. If the shared state has degraded, the effective capacity falls below the ideal two-bit result. The protocol is therefore most useful when entanglement distribution is already available and reliable.

4. Entanglement swapping

4.1 Concept

Entanglement swapping creates entanglement between two particles that have not interacted. Let particles A and B form one Bell pair, and particles C and D form another. A Bell measurement on B and C projects the remote particles A and D into a corresponding Bell state.

This is a central operation in quantum repeaters. It allows short entangled links to be joined into longer links, although the resulting entanglement must normally be heralded, stored, purified, or protected by error correction.

4.2 Derivation

Assume two initial pairs are |Φ⁺⟩_AB and |Φ⁺⟩_CD. Their product can be regrouped as

A Bell measurement on B and C therefore projects A and D into the same corresponding Bell state. If the measurement result is known, local Pauli corrections can transform the AD pair to a chosen Bell state. If the result is not communicated, AD is a classical mixture of Bell states from the perspective of an observer lacking the outcome record.

4.3 Distinction from teleportation

Teleportation transfers an unknown state using one entangled pair and two classical bits. Entanglement swapping transfers entanglement itself across a new connection. It may be used as a component of teleportation over long distances, but it does not by itself deliver an arbitrary unknown input state to a receiver.

4.4 Limitations in networks

The quality of a swapped pair depends on the quality of the input pairs and the Bell measurement. For independent Werner states with fidelities F₁ and F₂ relative to the target Bell state, an often-used idealized model gives a swapped fidelity

This expression assumes isotropic Werner-state noise, independent links, an ideal Bell measurement, and a particular target-state fidelity definition. It should not be applied to arbitrary correlated noise without modification. For identical links with fidelity F, it becomes

For F = 0.9, F_swap = 0.81 + 0.01/3 ≈ 0.8133. Thus swapping can reduce fidelity even before detector and memory imperfections are included.

Repeated swapping can cause rapid degradation. Quantum memories must preserve coherence while other links are generated. Loss and probabilistic Bell measurements make successful end-to-end distribution substantially less likely as distance and repeater count increase.

5. Distributed-state transfer

Distributed-state transfer refers broadly to moving quantum-state information between network nodes when the state, entanglement resource, or logical encoding is distributed across several physical systems. It includes single-qubit teleportation, remote gates, logical-qubit teleportation, and network-assisted transfer of multipartite states.

5.1 Single-qubit and logical-state transfer

A single-qubit state can be teleported directly. A logical qubit encoded across several physical qubits can also be transferred if the encoding, syndrome information, and correction operations are coordinated. In fault-tolerant architectures, teleportation is particularly valuable because measurements and classically controlled corrections can replace some difficult direct gates.

For a multipartite state, transfer is more demanding. If Alice holds one part of an entangled state and Bob holds another, the protocol must preserve correlations, not merely the reduced state of one subsystem. A state-transfer operation is successful only when the joint output has the required entanglement and logical relationships.

5.2 Network resource model

A practical transfer system has four layers:

1. Physical layer: photons, ions, superconducting qubits, or other carriers;
2. Entanglement layer: generation, distribution, storage, swapping, and verification;
3. Protocol layer: teleportation, dense coding, remote gates, and routing;
4. Control layer: timing, classical messages, calibration, error correction, and security.

Useful engineering metrics include fidelity F, success probability P_s, latency, entanglement-generation rate R_E, memory lifetime T_M, and resource consumption. If independent operations have success probabilities p₁, p₂, …, p_n, the idealized joint success probability is

This product model assumes statistical independence; correlated failures require a different model. It illustrates why many sequential probabilistic operations can make long-distance protocols inefficient.

5.3 Routing and synchronization

A network controller must know which links contain usable entanglement, reserve memories, match Bell-pair labels, and deliver measurement outcomes to the correct node. Classical records are therefore part of the protocol state. Clock synchronization is important because photon arrival windows and measurement gates may be narrower than network delays.

A practical system should distinguish:

• heralded success, where detectors or classical messages confirm an event;
• unheralded operation, where the receiver cannot immediately know whether the state is correct;
• deterministic logic, where the ideal protocol always completes;
• probabilistic logic, where loss or measurement constraints produce failure events.

6. Comparative evaluation

The best protocol depends on the task. Teleportation is appropriate when the state is unknown and a shared entangled pair is available. Superdense coding is appropriate when classical information must be sent and entanglement has already been established. Swapping is appropriate for constructing long-range entanglement. Distributed-state transfer is the appropriate systems perspective when multiple links, memories, error correction, and routing are involved.

7. Applied case: illustrative quantum-repeater link

Background

Consider three nodes: Alice, a repeater R, and Bob. Alice–R and R–Bob can each generate imperfect Bell pairs with fidelity F = 0.90. The repeater has a Bell-state measurement device and short-lived quantum memories.

Problem

Alice wishes to teleport an unknown qubit to Bob. A direct physical channel is too lossy, so the network attempts to create an Alice–Bob entangled pair through swapping.

Analysis

The two elementary pairs are swapped at R. Under the independent Werner-state model,

The result is below the elementary-link fidelity. The network must also account for the probability that both links are successfully generated and that the Bell measurement succeeds. If link-generation probabilities are p_AR and p_RB, and the Bell measurement succeeds with probability p_BSM, then, under independence,

After successful swapping and classical notification, Alice can use the Alice–Bob pair to teleport her unknown state. Bob applies the correction specified by the combined Bell-measurement records.

Approach and solution

The network should verify link quality, store one successful pair while waiting for the other, perform swapping, transmit the measurement record, and estimate the final state fidelity. If fidelity is inadequate, entanglement purification or a fault-tolerant encoded architecture may be required. The controller should not treat a generated photon detection as proof that a high-quality end-to-end state exists; heralding and characterization are necessary.

Outcome and learning points

The example shows that a repeater can overcome distance-related loss structurally, but swapping is not free. Fidelity, memory lifetime, classical latency, and probabilistic success jointly determine usefulness. A protocol that is correct at the circuit level may still be impractical at the network level.

8. Security, governance, and professional practice

Quantum protocols do not automatically provide security. Teleportation requires trusted handling of classical correction data and authenticated classical channels. An adversary who alters measurement records can cause incorrect corrections. Entanglement distribution should be tested for tampering, loss patterns, and unwanted side channels.

Quantum key distribution is related to these protocols but should not be conflated with them. Superdense coding is a communication protocol, not automatically an encryption method. Device imperfections can create leakage, detector vulnerabilities, and implementation-dependent attacks. Professional designs should document assumptions, calibration procedures, error models, confidence intervals for measured fidelity, and the distinction between theoretical and demonstrated performance.

Contemporary development focuses on quantum repeaters, photonic interconnects, memory-enhanced networks, error-corrected entanglement, and modular quantum computers. The major engineering challenge is not merely demonstrating a protocol once, but operating it repeatedly with sufficient rate, fidelity, synchronization, and maintainability.

Best-practice checklist

• Specify the resource model before claiming a communication advantage.
• Separate quantum communication from classical feed-forward.
• Track whether entanglement is consumed, stored, or renewed.
• Report fidelity, success probability, latency, and loss assumptions.
• Use a stated noise model when applying analytical formulas.
• Authenticate all classical control messages.
• Verify entanglement and do not infer quality from one detector event.
• Account for memory lifetime and synchronization in network designs.
• Distinguish ideal circuit correctness from hardware-level performance.

Chapter Summary

Quantum teleportation transfers an unknown qubit using one shared Bell pair, two classical bits, and conditional corrections; the input is destroyed and no faster-than-light signalling occurs. Superdense coding uses one shared Bell pair and one transmitted qubit to communicate two classical bits in the ideal resource model. Entanglement swapping performs a Bell measurement on parts of two entangled pairs to create entanglement between remote particles, forming a foundation for quantum repeaters. Distributed-state transfer generalizes these operations to logical, multipartite, and networked states.

The protocols demonstrate that quantum information is governed by resource trade-offs. Entanglement, classical communication, quantum memories, measurements, fidelity, and success probability must be evaluated together. In practical systems, loss, decoherence, imperfect gates, probabilistic measurements, latency, and security of classical control determine whether an elegant protocol can become a useful engineering service.

Key Terms

Qubit: The basic unit of quantum information.

Superposition: A coherent combination of basis states.

Entanglement: Nonclassical correlation between quantum systems.

Bell state: One of four maximally entangled two-qubit states.

Ebit: A unit representing one shared Bell-pair equivalent of entanglement.

Quantum teleportation: Transfer of an unknown quantum state using entanglement and classical communication.

Bell measurement: A joint measurement in the Bell-state basis.

Pauli correction: A conditional application of I, X, Y, or Z.

No-cloning theorem: The principle that an arbitrary unknown quantum state cannot be copied perfectly.

Superdense coding: Transmission of two classical bits through one qubit using shared entanglement.

Entanglement swapping: Creation of remote entanglement through a Bell measurement on intermediate particles.

Quantum repeater: A network device or architecture that extends entanglement over long distances.

Fidelity: A measure of agreement between an actual and intended quantum state.

Heralded success: Success confirmed by a measurement or classical notification.

Quantum memory: Hardware that stores a quantum state while preserving coherence.

Classical feed-forward: Use of measurement results to control later operations.

Distributed-state transfer: Networked movement or reconstruction of logical or multipartite quantum information.

Holevo bound: A limit on accessible classical information encoded in quantum ensembles under specified resources.

Werner-state model: An isotropic model of a noisy entangled state.

Review Questions

Short Answer Questions

1. What resources are required for ideal quantum teleportation?
2. Why does teleportation not permit faster-than-light communication?
3. How does Alice encode the four messages in superdense coding?
4. What is the purpose of entanglement swapping?
5. Define fidelity in the context of quantum state transfer.

Long Answer Questions

1. Derive the Bell-state decomposition used in quantum teleportation and explain the required corrections.
2. Compare teleportation and superdense coding in terms of purpose, resources, and output.
3. Explain how entanglement swapping supports quantum-repeater architectures.
4. Discuss the role of quantum memories and classical communication in distributed-state transfer.
5. Evaluate the principal hardware and security limitations of these protocols.

Analytical / Application Questions

1. A network has two independent entangled links with fidelity 0.95. Using the stated Werner-state model, calculate the swapped fidelity and interpret the result.
2. Design a protocol for transferring an unknown qubit across two repeater links. Identify the entanglement, measurements, classical messages, corrections, and verification steps.
3. A system has three independent operations with success probabilities 0.9, 0.8, and 0.75. Calculate the joint success probability and explain why the independence assumption must be checked in a real network.

Multiple Choice Questions with Answers

Question 1

Which resource combination is required for ideal quantum teleportation?

A. One shared Bell pair and two classical bits

B. Two shared Bell pairs and one classical bit

C. One transmitted qubit and no entanglement

D. Two transmitted qubits and no classical communication

Correct Answer: A. One shared Bell pair and two classical bits

Question 2

What happens to Alice’s original input state during quantum teleportation?

A. It is copied perfectly

B. It is destroyed by the measurement

C. It remains unchanged at Alice

D. It becomes a classical bit only

Correct Answer: B. It is destroyed by the measurement

Question 3

In superdense coding, how many classical bits can ideally be communicated by transmitting one qubit when one Bell pair is pre-shared?

A. One

B. Two

C. Three

D. Four

Correct Answer: B. Two

Question 4

Which operation corresponds to the message 01 in the convention used in this chapter?

A. I

B. Z

C. X

D. XZ

Correct Answer: C. X

Question 5

What is the primary result of entanglement swapping?

A. An unknown state is copied

B. Two classical bits are encrypted

C. Remote particles become entangled

D. A qubit is converted into a classical bit

Correct Answer: C. Remote particles become entangled

Question 6

For two identical links with Werner-state fidelity F = 0.9, what is the idealized swapped fidelity?

A. 0.7000

B. 0.8100

C. Approximately 0.8133

D. 0.9900

Correct Answer: C. Approximately 0.8133

Question 7

Why can Bob not reconstruct the teleported state before receiving Alice’s classical bits?

A. His qubit is destroyed immediately

B. His local state contains no usable information about the specific input

C. Bell states cannot be measured

D. Classical channels carry quantum states

Correct Answer: B. His local state contains no usable information about the specific input

Question 8

If three independent protocol stages have success probabilities 0.9, 0.8, and 0.75, what is the joint success probability?

A. 0.180

B. 0.540

C. 0.845

D. 2.450

Correct Answer: B. 0.540

Question 9

Which metric directly measures agreement between an actual output state and an intended pure state?

A. Latency

B. Fidelity

C. Bandwidth

D. Clock frequency

Correct Answer: B. Fidelity

Question 10

Which statement best distinguishes entanglement swapping from teleportation?

A. Swapping creates remote entanglement, whereas teleportation transfers an unknown state

B. Swapping requires no measurement, whereas teleportation does

C. Teleportation sends two classical bits without entanglement

D. Swapping always transmits an unknown qubit to a receiver

Correct Answer: A. Swapping creates remote entanglement, whereas teleportation transfers an unknown state