| classical-quantum channels | |
|---|---|
| Name | Classical–quantum channel |
| Type | Quantum communication primitive |
| Field | Quantum information theory |
| Introduced | 1970s |
| Notable | Holevo's theorem, Holevo quantity |
classical-quantum channels
A classical-quantum channel is a mathematical model describing a communication process that maps classical information to quantum states. These channels formalize how classical symbols are encoded into density operators for transmission or storage in quantum systems and are fundamental to Quantum information theory and protocols in Quantum communication.
A classical-quantum channel (often abbreviated c→q) is defined by a finite or countable alphabet X and a map x ↦ ρ_x, where each symbol x∈X is associated with a density operator ρ_x acting on a Hilbert space H. The model contrasts with purely classical channel models by producing noncommuting quantum states as outputs. Formal treatments appear in work by Alexander Holevo, Benjamin Schumacher, and Charles H. Bennett in the development of quantum coding and transmission theory. The channel is formally a completely positive trace-preserving (CPTP) map from the commutative algebra ℓ^1(X) or the classical probability simplex to the algebra of operators B(H), implemented as an ensemble {p_x,ρ_x} when preceded by a probability distribution p on X.
Mathematically a classical-quantum channel can be represented as a linear map Φ: diag(p_x) ↦ ∑_x p_x ρ_x, where diag(p_x) is a diagonal density matrix encoding the classical probability distribution. The image of a basis element |x⟩⟨x| is the quantum state ρ_x. Properties of importance include convexity of output ensembles, nonorthogonality of states, and the role of von Neumann entropy S(ρ)=−Tr(ρ log ρ) in quantifying uncertainty. Key bounds and results use the Holevo bound and the Holevo–Schumacher–Westmoreland theorem (HSW) which relate ensembles {p_x,ρ_x} to classical capacity. Distinguishability metrics for outputs include the trace distance, fidelity, and relative entropy D(ρ||σ). Structural concepts such as the supports of ρ_x, commutativity of the set {ρ_x}, and degradable or antidegradable behavior appear in capacity analysis. The channel is a special case of a general quantum channel when the input algebra is classical.
Practical realizations include encoding classical bits into polarization states of photons in quantum optics experiments, e.g., mapping 0↦|H⟩⟨H| and 1↦|V⟩⟨V| as in implementations of quantum key distribution protocols such as BB84 protocol. Other examples are amplitude-encoded coherent states in continuous-variable quantum information and time-bin encoding used in fiber-optic systems developed by groups at institutions like IBM Research, University of Cambridge, University of Oxford, and MIT. In solid-state platforms, classical information can be mapped to spin states in nitrogen-vacancy center systems or to superconducting qubit states in devices from companies like Google and Rigetti Computing. Experimental studies often reference canonical papers by Bennett and Brassard and experimental demonstrations by groups led by Anton Zeilinger and Nicolas Gisin.
Information measures for classical-quantum channels include the mutual information I(X:Q)=S(ρ)−∑_x p_x S(ρ_x) known as the Holevo quantity χ({p_x,ρ_x}), which upper-bounds accessible classical information per channel use. The classical capacity C of a c→q channel is characterized by the regularized Holevo information (HSW theorem): C = lim_{n→∞} (1/n) χ(Φ^{⊗n},P_n), where P_n ranges over input ensembles on n uses. Single-letter capacities can be achieved for special classes (e.g., commuting outputs or entanglement-breaking channels). When assisted by entanglement shared between sender and receiver, the entanglement-assisted capacity follows formulas derived from the quantum mutual information and the Bennett–Shor–Smolin–Thapliyal (BSST) theorem. Trade-offs with resources like classical communication and entanglement are analyzed via resource theories and operational tasks such as hypothesis testing and channel discrimination.
Classical-quantum channels model many operational tasks: classical data compression into quantum memory (quantum source coding), classical message transmission over quantum media, classical message decoding via positive operator-valued measures (POVMs), and quantum hypothesis testing for ensemble discrimination. They underpin protocols for quantum cryptography (e.g., security proofs for BB84 use c→q maps), quantum fingerprinting and fingerprint schemes in quantum communication complexity, and hybrid classical-quantum networking where classical control signals prepare quantum states for distributed quantum computation experiments at Oak Ridge National Laboratory and LIGO-style sensor networks. In quantum machine learning, classical-quantum encodings are studied under "quantum feature maps" and models for quantum classifiers.
A classical-quantum channel sits between classical channels and full quantum channels: it is equivalent to a quantum channel whose input algebra is diagonal (commutative), and its Stinespring dilation reduces to state preparation operations. The dual notion, a quantum-classical (q→c) channel, describes quantum measurements producing classical outcomes and is modeled by POVMs and instruments; composition of q→c and c→q channels yields general quantum channels. Connections to entanglement-breaking channels are important: any entanglement-breaking quantum channel can be decomposed into a q→c measurement followed by a c→q preparation. Relations to coding theorems, the Holevo-Jozsa-Nielsen results, and resource trade-offs make classical-quantum channels a canonical building block in broader studies of quantum Shannon theory and practical quantum communication systems.