Quantum Information Theory

Core Idea

Quantum information theory extends Shannon's classical information theory to quantum systems. The fundamental quantum analog is the von Neumann entropy S(rho) = -Tr[rho log_2(rho)], where rho is a density matrix representing a quantum state. Like Shannon entropy, von Neumann entropy quantifies uncertainty and is maximized for completely mixed states. However, quantum information differs profoundly: quantum states cannot be copied (no-cloning theorem), entanglement creates correlations with no classical analog, and quantum channels have capacities for classical bits, quantum bits (qubits), and entanglement-assisted communication that differ. The quantum capacity C_Q of a channel represents the number of qubits that can be reliably transmitted per channel use. Quantum key distribution (QKD) uses quantum states to distribute cryptographic keys information-theoretically secure against eavesdroppers. Quantum information theory unifies quantum mechanics, information theory, and cryptography, with profound implications for communication, computation, and security.

Explainer

Classical information theory, founded by Shannon, assumes information carriers are classical bits — 0 or 1, distinguishable and copyable. Quantum systems obey different rules: quantum bits (qubits) exist in superposition, cannot be copied without disturbance, and can be entangled in ways with no classical analog. Quantum information theory extends Shannon's framework to these quantum resources.

Von Neumann Entropy and Quantum States:

A quantum state is represented by a density matrix rho (a positive semidefinite matrix with trace 1). The von Neumann entropy is S(rho) = -sum_i lambda_i log_2(lambda_i), where lambda_i are the eigenvalues of rho. For a pure state |psi> (a single eigenvalue 1, rest 0), S = 0 — no uncertainty, complete information. For a maximally mixed state (all eigenvalues equal), S = log_2(d) where d is the dimension — maximum uncertainty. Quantum information parallels classical information: H(X) = -sum_i p_i log_2(p_i) for a classical random variable. The key difference: quantum superposition allows states with no classical counterpart.

The No-Cloning Theorem:

In classical computation, copying data is free and perfect. In quantum mechanics, Wiesner and Dieks independently proved that no operation can perfectly clone an arbitrary unknown quantum state. The proof uses unitarity and is elegant: if cloning worked for all states, it would create impossible correlations (orthogonal states would map to indistinguishable results). This prohibition is fundamental — not a technological limitation but a consequence of quantum mechanics. It has profound implications: an eavesdropper cannot clone intercepted quantum states to measure them without disturbing them, enabling secure key distribution.

Quantum Channel Capacities:

A quantum channel N transmits quantum states: rho -> N(rho). Three capacities characterize it:

1. Classical Capacity C: Maximum bits per channel use of classical information that can be reliably transmitted. Achieved by encoding classical bits into quantum states, sending through the channel, and measuring at the receiver. For many channels, computing C is an open problem.

2. Quantum Capacity C_Q: Maximum qubits per channel use. Requires transmitting and preserving quantum coherence. Can be positive even when C = 0 (superactivation: combining two zero-capacity channels can yield positive quantum capacity).

3. Entanglement-Assisted Capacity C_E: Classical capacity when sender and receiver share pre-distributed entanglement. Remarkably, C_E = 2*C for some channels (entanglement doubles classical capacity).

The gap between these capacities reveals quantum advantage: entanglement as a resource enables communication beyond classical limits.

Quantum Key Distribution (QKD):

Quantum key distribution (e.g., BB84 by Bennett and Brassard, or E91 by Ekert) uses quantum states to distribute cryptographic keys with information-theoretic security. The basic idea: Alice sends qubits in random bases, Bob measures in random bases, they later compare bases publicly and keep the bits where they used the same basis. An eavesdropper (Eve) attempting to intercept the qubits must measure them to extract information. Measurement in a non-commuting basis disturbs the state, introducing errors Alice and Bob detect. Since Eve cannot clone the qubits, she cannot avoid this choice: either she learns nothing (wrong basis), or she risks detection. This is fundamentally different from computational security: the security comes from quantum mechanics, not hardness assumptions, making it resilient to future algorithmic breakthroughs (including quantum computers).

Entanglement and Quantum Communication:

Quantum entanglement — correlations between qubits that exceed classical limits — enables quantum advantages in communication. The Bell states are maximally entangled, and exploiting entanglement allows protocols like quantum teleportation (transmitting a quantum state using classical bits plus pre-shared entanglement) and dense coding (encoding two classical bits into one qubit via entanglement). These phenomena have no classical analogs.

Quantum information theory is a deep field bridging quantum mechanics, information theory, and cryptography. It has already enabled quantum key distribution systems deployed globally, and continues to shape quantum computing and communication. The theory reveals that information itself has a quantum nature, with profound implications for the limits and possibilities of communication, computation, and security.