Skip to content

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.

Version
v2 · 2026-09-19 · History
Domain-specific #
1367
Domain group
Formal Sciences
Origin domain
Information Theory
Subdomains
Quantum Information Theory, Quantum Communication Resource Accounting → Information Theory
Aliases
Bennett's four laws of quantum information, Bennett's laws of information

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.

How would you explain it like I'm…

 

No faithful explanation at this level. All three generators agree any five-year-old picture turns the ebit into a magic link, shared coin or secret note, collapsing entanglement into classical shared randomness or free signalling, which the laws rule out since an ebit yields communication only when combined with an actual channel use and is consumed.

Quantum Message Trading Rules

Bennett's Laws are four trading rules for sending information between two people, usually called Alice and Bob, using quantum physics. There are three kinds of resources: sending an ordinary bit (a 0 or 1), sending a qubit (a quantum bit), and sharing a special linked pair of qubits called an ebit. The rules say: sending a qubit can do the job of sending one ordinary bit; sending a qubit can also set up a shared linked pair; a linked pair plus one qubit sent can carry two ordinary bits; and a linked pair plus two ordinary bits sent can move a qubit's state from Alice to Bob, using up the original. Together they show these resources can be swapped in ways ordinary messages can't.

Converting Bits, Qubits and Ebits

Bennett's Laws are four resource-conversion rules in quantum information for two separated parties, Alice and Bob. They compare three resources: a one-way classical bit channel, a one-way qubit channel, and a shared maximally entangled pair called an ebit. 'X ≽ Y' means X, plus free local operations, can do anything Y can. The laws are: a qubit sent ≽ a classical bit sent (encode 0 and 1 in distinguishable states); a qubit sent ≽ an ebit (make an entangled pair and send half); an ebit plus a qubit sent ≽ two classical bits (superdense coding); and an ebit plus two classical bits sent ≽ a qubit sent (quantum teleportation, which destroys the original). Together they show that quantum communication can create entanglement, entanglement boosts what quantum communication can carry, and entanglement plus classical communication can replace quantum communication.

 

Bennett's Laws are four elementary resource inequalities for ideal two-party quantum communication, relating a directed noiseless classical bit channel [c→c], a directed noiseless qubit channel [q→q], and an undirected shared ebit [qq]. The relation X ≽ Y is a capability preorder: resources X together with free local operations can simulate any use of Y within the task model, not a numerical inequality. The laws are [q→q] ≽ [c→c], by encoding 0 and 1 in orthogonal states and measuring in the agreed basis; [q→q] ≽ [qq], by locally preparing a Bell pair and sending one half; [qq] + [q→q] ≽ 2[c→c], which is superdense coding; and [qq] + 2[c→c] ≽ [q→q], which is teleportation of an arbitrary unknown state, destroying the sender's instance. Benjamin Schumacher presents the four as Charles Bennett's basic rules for bits, qubits and ebits, and they are standard in quantum-information teaching. They sit inside the broader resource-inequality framework of quantum Shannon theory, which formalizes simulation order, composition and asymptotic conversion. Jointly they expose a nonclassical triangle: quantum communication distributes entanglement, entanglement plus quantum communication amplifies classical capacity, and entanglement plus classical communication substitutes for quantum communication.

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

Local relationship map for Bennett's LawsParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Bennett's LawsDOMAINPrime abstraction: Substitutability — is a kind ofSubstitutabilityPRIME

Current abstraction Bennett's Laws Domain-specific

Parents (1) — outgoing typed relations

  • Bennett's Laws is a kind of Substitutability Prime

    Bennett's Laws strictly instantiate Substitutability.

Hierarchy paths (8) — routes to 4 parentless roots

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 — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25