Bennett's Laws¶
A four-relation resource preorder for ideal two-party quantum communication: a transmitted qubit can simulate a classical bit channel or distribute one ebit, while an ebit plus one transmitted qubit simulates two classical bits and an ebit plus two classical bits simulates one transmitted qubit.
Core Idea¶
Bennett's Laws are four elementary resource-conversion statements for ideal two-party quantum communication. They compare three resources available to separated parties conventionally called Alice and Bob: a directed classical bit channel, a directed qubit channel, and an undirected shared maximally entangled qubit pair, or ebit. The relation \(X\succeq Y\) means that the resources in \(X\), together with the stipulated free local operations, can simulate any use of resource \(Y\) in the scoped task model. It is a capability preorder, not an ordinary numerical greater-than sign.
Scope of Application¶
Bennett's Laws apply to introductory and formal reasoning about quantum communication resources. They provide a common ledger for comparing direct classical transmission, direct quantum transmission, and pre-shared entanglement. The framework appears in quantum information courses, resource-theory explanations, communication-complexity reviews, and derivations that use teleportation or dense coding to move between models.
The canonical scope is ideal and exact. Channels are noiseless, qubit systems are two-dimensional, Bell pairs are maximally entangled, local operations and measurements work perfectly, and the parties share whatever reference frames and protocol agreements the construction needs. Classical and qubit communication are directed from the named sender to receiver.
Clarity¶
The node clarifies quantum communication by separating the object sent from the capability consumed. In teleportation no quantum system carrying the input state crosses the channel after the protocol begins, yet a qubit-channel use is simulated because the receiver ends with the arbitrary state, including its correlations with a reference. In dense coding only one qubit crosses during the message phase, yet two classical bits are transmitted because the previously distributed ebit enlarges the jointly distinguishable state set available to Bob.
Manages Complexity¶
The four relations compress circuit-level protocols into a small capability ledger. Instead of replaying gates, measurements, messages, and corrections every time, a proof can substitute one resource package for another and track what is consumed. This makes protocol composition legible: a complicated communication task can be analyzed by identifying its bit, qubit, and ebit requirements and replacing an unavailable resource with an available package.
Abstract Reasoning¶
Several deductions follow, provided side resources are declared:
- Classical bits free: because one qubit can distribute one ebit and one ebit plus free classical bits can teleport one qubit, qubit communication and shared ebits become mutually interconvertible at unit scale in this ideal accounting.
- Ebits free: dense coding makes one qubit sufficient for two cbits, while teleportation makes two cbits sufficient for one qubit.
Knowledge Transfer¶
Literal transfer occurs across quantum-information practices. A course uses the laws to introduce the distinct resource types. A protocol designer uses them to choose between transmitting qubits and distributing entanglement in advance. A communication-complexity theorist uses teleportation to translate a qubit protocol into an entanglement-assisted classical protocol. A quantum Shannon theorist embeds the same primitive conversions in a larger resource calculus.
Relationships to Other Abstractions¶
Current abstraction Bennett's Laws Domain-specific
Parents (1) — more general patterns this builds on
-
Bennett's Laws is a kind of Substitutability Prime
Bennett's Laws strictly instantiate Substitutability.
Hierarchy paths (8) — routes to 4 parentless roots
- Bennett's Laws → Substitutability → Compatibility
- Bennett's Laws → Substitutability → Modularity → Decomposition
- Bennett's Laws → Substitutability → Abstract Data Type → Information Hiding → Abstraction
- Bennett's Laws → Substitutability → Containerization → Information Hiding → Abstraction
- Bennett's Laws → Substitutability → Abstract Data Type → Information Hiding → Boundary
- Bennett's Laws → Substitutability → Abstract Data Type → Interface → Boundary
- Bennett's Laws → Substitutability → Containerization → Information Hiding → Boundary
- Bennett's Laws → Substitutability → Containerization → Interface → Boundary
Neighborhood in Abstraction Space¶
Bennett's Laws sits in a sparse region of the domain-specific corpus (90th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Quantum Communication & Benchmarking (6 abstractions)
Nearest neighbors
- Quantum Game Theory — 0.80
- Non-local quantum computation — 0.80
- Diamond norm — 0.78
- Six-state protocol — 0.78
- BB84 — 0.78
Computed from structural-signature embeddings · 2026-09-08