Complementary Channels and Degradability
Every quantum channel is one half of a story. Its Stinespring dilation realizes the noisy map as a noiseless isometry that lifts the input into a larger space and then discards an environment . But the environment is not a bookkeeping fiction — it is a physical system that has learned something about the input, and keeping while discarding Bob's system defines a second, equally legitimate channel: the complementary channel . The pair is a single coin with two faces. What Bob receives and what leaks to the environment are two views of one purification, and the entire theory of quantum capacity, private communication, and quantum key distribution lives in the tension between them. This article develops that tension into a working tool. Because the dilation is unique up to an isometry on , the complement is unique up to a partial isometry — so its output entropy is an intrinsic invariant, and the coherent information is well defined. Degradability then asks a sharp operational question: can Bob, holding only his output, run a box that reproduces exactly what the environment sees, ? When yes, the coherent information becomes additive and the quantum capacity collapses to a single-letter formula — a rarity where almost every capacity is an intractable regularized limit. When the reverse holds, , no-cloning forces the quantum capacity to zero. Degradability is thus the fault line between the handful of channels we can solve exactly and the vast majority we cannot.
- Every channel has a complementary channel , sending the input to the environment of its Stinespring dilation; is what Bob gets, is what leaks to the eavesdropper.
- The complement is unique up to an isometry on , so is intrinsic and the coherent information is well defined.
- is degradable if for some channel (Bob can simulate Eve) and antidegradable if (Eve can simulate Bob).
- For degradable channels is concave and additive, so the quantum capacity is the single-letter maximum — no regularization — giving the exact capacities of dephasing, erasure, amplitude-damping, and pure-loss channels.
- Antidegradable channels have by no-cloning; amplitude damping above , erasure above , and pure loss below are the canonical cases.
- Key idea: the complementary channel is what the environment learns; degradability () means Bob can reconstruct Eve's view, which makes the coherent information additive and gives a single-letter quantum capacity, while antidegradability () lets Eve clone Bob and forces .
Where this lives today
Degradability is the first question a quantum communication engineer asks about any new channel, because the answer decides whether a capacity is a one-line formula or an open problem. In fibre-optic and free-space links the model is the bosonic pure-loss channel: degradable above transmissivity with exact capacity , and antidegradable below it — the 3 dB no-go that quantum communication cannot survive more than half loss, the motivation for quantum repeaters. In quantum key distribution the complement is the eavesdropper: Eve holds , and for degradable links the private capacity equals the coherent information, giving provable secret-key rates. At the frontier, the depolarizing channel — neither degradable nor antidegradable in its interesting range — is where superadditivity was first demonstrated and the exact quantum capacity is still unknown; the modern response is approximate degradability, an SDP measuring the diamond-norm distance to the degradable set and turning it into rigorous capacity bounds. Degradability still marks the boundary between the solvable and the open in quantum Shannon theory.
The physical picture
Think of the Stinespring isometry as a fork in an information road. The input climbs a lossless ramp — an isometry preserves everything — and the road splits into two lanes: Bob's system and the environment . The channel watches and throws away ; the complement watches and throws away . Nothing is destroyed at the fork — the loss is entirely the discarding. That is why, for a pure input, Bob and Eve carry equal entropy: they are the two marginals of one pure state, whose halves have matching spectra by Schmidt decomposition. The first figure fixes this fork in mind and marks the extra arrow — a degrading map from back to — that decides everything.
The fork explains why one number governs the subject. The coherent information is Bob's output entropy minus Eve's — how much more the legitimate receiver knows than the eavesdropper. If Bob can post-process his output into a copy of Eve's () he is uniformly better informed, and this advantage survives running many copies in parallel — the additivity that makes the capacity computable. The reverse, where Eve reconstructs Bob, is fatal: two parties would share one quantum message, which no-cloning forbids unless it is empty. The second figure turns this into hard numbers on the workhorse qubit amplitude-damping channel, whose regimes meet exactly at .
The core equations
The framework begins with the Stinespring dilation, which represents a noisy channel as a lossless isometry followed by a partial trace. It is the machine that manufactures both and its complement.
where: — the Stinespring isometry into system environment; — the isometry condition (no loss yet); — Bob's and the environment's spaces; — partial trace over the environment. Reading it: all the noise is in discarding ; before that trace the evolution is reversible. Keep the environment and discard Bob, and the same isometry defines the complement — the eavesdropper's channel, mapping the input to what the world has recorded.
where: — the complement ; — Kraus operators with ; — an orthonormal environment basis. Reading it: the environment output has entries , so few Kraus operators means a small . The single scalar tying the two channels together is the coherent information: Bob's output entropy minus Eve's. On a purified input it equals , a genuine measure of the quantum correlation surviving the channel.
where: — von Neumann entropy in bits; — a reference purifying ; — the (possibly negative) conditional entropy. Reading it: requires , a hallmark of entanglement. Degradability and antidegradability are the two one-way orderings between a channel and its complement, each saying a CPTP map interpolates from one to the other.
where: — a degrading map from Bob's system to the environment; — a degrading map from the environment to Bob's system; — composition. Reading it: these must hold exactly as maps on all inputs — matching on one state is not enough — and a generic channel satisfies neither. The quantum capacity in general is the regularized coherent information — the Lloyd–Shor–Devetak (LSD) theorem — an optimization over entangled inputs on unboundedly many copies, hence uncomputable in general.
where: — quantum capacity in qubits per use; — parallel copies; — a possibly entangled input across copies. Reading it: the limit is forced because can be superadditive — entangled inputs beat times the single-copy value. Degradability dissolves that limit, fixes the private capacity, and kills antidegradable channels.
where: — the private capacity; the left identity holds when is degradable, the right when antidegradable. Reading it: for degradable channels one concave maximization replaces the intractable limit, and and coincide.
The goal is to prove the working identity , which turns an abstract "information that survives the channel" into two computable entropies of the branches of the Stinespring fork. We purify the input, push it through the isometry to a global pure state, and use the most useful fact about pure states — complementary marginals share a spectrum — to relate Eve's entropy to a reference-Bob entropy, so the same quantity reads three equivalent ways.
Step 1. Purify the input: introduce a reference and pure with . Why: purity lets us trade one marginal's entropy for another's, so we manufacture a pure state to work with.
Step 2. Apply the dilation on the leg: ; since is an isometry, is pure on all three parties. Why: a pure global state forces its marginals to pair up, and — the equalities the argument runs on.
Step 3. Read off the reduced states: and , so and . Why: this is just the two channels as the two partial traces of the same , applied inside the purified state.
Step 4. Combine with : , and on the pure state, so all three forms coincide. Why: shows positive coherent information means negative conditional entropy — a purely quantum feature — while makes the complementary symmetry manifest. *Note: on any pure input the state is pure on , so and — a useful sanity check on the sign convention.*
Go deeper · Derivation B · 1 minAntidegradable channels cannot send quantum information
The goal is to show that antidegradability, , forces the coherent information to be non-positive on every input and hence the quantum capacity to zero — the cleanest no-cloning argument in quantum Shannon theory. The idea: if the environment can be processed back into Bob's output, any quantum information Bob could reliably recover would exist at both and , i.e. it would have been cloned. We make this rigorous through the data-processing inequality for the coherent information plus the antisymmetry of under swapping Bob and the environment.
Step 1. Write the coherent information on the purified state as . Why: casting as a difference of branch entropies lets the complement enter symmetrically.
Step 2. The complement has , since exchanges which branch is "output" and which is "environment". Why: this exact antisymmetry is the lever — a bound in one direction becomes a sign-flipped bound for the complement.
Step 3. Apply antidegradability: since is a further processing of , monotonicity gives . Why: data processing forbids manufacturing coherent information by acting on the output, so the extra map can only reduce it.
Step 4. Chain: , hence for every input. Why: a never-positive single-letter quantity cannot be rescued by the limit.
Step 5. Regularize. Antidegradability of implies it for (use ), so every term of the LSD limit is and . Why: this promotes the single-letter bound to the true capacity with no additivity needed. *Note: amplitude damping is self-complementary at , where makes it trivially antidegradable with , consistent with the second figure.*
Go deeper · Derivation C · 1 minDegradability collapses the quantum capacity to a single letter
The goal is to prove that for degradable channels the coherent information is additive, so the regularized LSD formula (5) collapses to the single-letter maximum of equation (6) — what makes a whole family (dephasing, erasure, amplitude damping below threshold, pure loss above threshold) exactly solvable. The technical heart is that for two degradable channels in parallel each environment output is a local processing of the corresponding Bob output, arranging the four systems into exactly the pattern strong subadditivity constrains.
Step 1. Dilate both channels: , so . Why: we need the two-copy coherent information in branch-entropy form before bounding it by single-copy values.
Step 2. Use degradability to realize each environment locally, with , so comes from alone. Why: locality makes the map factorize — the hypothesis strong subadditivity needs.
Step 3. Apply strong subadditivity: once the are local functions of the . Why: SSA is the one inequality strong enough to control a four-party entropy difference, and degradability is what lets us invoke it.
Step 4. Translate back: , and the reverse holds trivially for product inputs, so is exactly additive. Why: additivity both ways pins the two-copy optimum to the sum of one-copy optima, removing the regularization.
Step 5. Iterate to all : , and degradability also makes concave in , so this is one well-behaved concave program. Why: concavity guarantees no spurious local maxima, so the closed form is genuinely computable. *Note: the dephasing channel gives , additive for every , consistent with this argument.*
Limiting cases
The value of degradability is a short list of channels with exactly known capacities. The table collects the canonical qubit and bosonic examples and their degradable/antidegradable thresholds.
| Case | Result | Meaning |
|---|---|---|
| Dephasing, flip prob. | degradable for all ; | phase noise never lets Eve out-learn Bob; only at |
| Amplitude damping, damping | degradable iff , antidegradable iff | self-complementary at , so there and above |
| Erasure, erasure prob. | degradable for ; | complement is erasure with prob. ; antidegradable and for |
| Depolarizing, | neither degradable nor antidegradable (generic) | coherent information is superadditive; exact still open |
| Bosonic pure loss, transmissivity | degradable for ; | beam-splitter complement has transmissivity ; hard cutoff at (3 dB) |
Worked examples
1 · Quantum capacity of the dephasing channel (fully worked)
The qubit dephasing channel applies a phase flip with probability . Find its complementary channel, confirm degradability, and compute the quantum capacity, evaluating it at .
Step 1. Kraus and isometry. Take , , so ; since , is a valid isometry with a two-dimensional environment.
Step 2. The complementary channel. Its matrix elements have fixed diagonal and off-diagonal : the environment sees a state with fixed populations whose coherence tracks only — a classical-like readout of the input's diagonal.
Step 3. Degradability. A fixed dephasing-type map carries Bob's output to Eve's for every , so is degradable for all and equation (6) applies: .
Step 4. Maximize. By symmetry the optimum is : Bob's output is still so bit, while the environment output has spectrum so with . Therefore
Step 5. Numbers and sanity. At or the map is unitary and ; at , so . At , , giving qubits per use, and by degradability the private capacity equals it, .
2 · Amplitude damping: the degradable-to-dead transition
The amplitude-damping channel with damping has , , and coherent information at input population . Locate the degradable region and evaluate at and .
Step 1. Degradable region. The complement of amplitude damping is amplitude damping with damping , so is degradable when and antidegradable for ; only in the degradable region does hold.
Step 2. Evaluate at (degradable). Maximizing over gives the optimum near , where qubits per use — the amber point on the second figure (the symmetric input already gives ).
Step 3. Evaluate at (threshold). Here , so the channel equals its own complement: identically, so , pinned at zero for all .
Step 4. The lesson. As climbs from to the capacity falls smoothly from to ( at ), and the upper half of the range is dead — the qubit sibling of the pure-loss cutoff at .
Physics of the portrait
The complementary channel is named not after a person but after an idea: a channel and its leakage are two projections of one reversible isometry — a lineage running from a 1955 theorem about positive maps to the modern theory of quantum capacity.
Origins · 1 mincomplementary channel and how this was discovered
The complementary channel is the mathematical shadow every quantum channel casts onto its environment, and its history is the history of learning to take dilations seriously. W. Forrest Stinespring proved in 1955 that every completely positive map extends to an isometry into a larger space — a result that decades later became the physicist's statement that noise is unitary interaction with an unwatched environment. Once channels were routinely dilated, the complementary (or conjugate) channel emerged as the object encoding what that environment records, developed in the 1970s by Lindblad and Holevo. The information-theoretic payoff waited for the coherent information of Schumacher and Nielsen (1996) and the Lloyd–Shor–Devetak theorem (1997–2005) that made it the quantum capacity. The decisive structural idea — degradability — is due to Devetak and Shor in 2005: by asking whether Bob can degrade his output into the environment's, they isolated exactly the channels for which the capacity is single-letter, and proved private and quantum capacities then coincide. Giovannetti and Fazio pinned the amplitude-damping threshold to that year, and Cubitt, Ruskai, and Smith mapped the degradable set in 2008 — turning a theorem about abstract positive maps into the daily triage tool of quantum communication.
Going further
Texts. Wilde, Quantum Information Theory, 2nd ed., ch. 13 and 24 · Watrous, The Theory of Quantum Information, ch. 2 and 8 · Nielsen and Chuang, Quantum Computation and Quantum Information, ch. 8 and 12 · Preskill, Lecture Notes on Quantum Computation, ch. 10. Key results to keep in mind: is unique up to an environment isometry; on the purified state; the antidegradable chain and degradable single-letter additivity both follow from strong subadditivity; with and ; amplitude-damping values , . The thresholds , (erasure), (pure loss) and the structure of the degradable set are standard.
Prerequisites. Stinespring Dilation Theorem · Quantum Channels and CPTP Maps · Kraus Representation of Quantum Channels · Von Neumann Entropy · Data-Processing Inequality. Leads to. Quantum Joint, Conditional Entropy and Mutual Information · Strong Subadditivity of Quantum Entropy · Holevo Bound.
Ask the tutor: Name any channel — dephasing, amplitude damping, or your own Kraus set — and we will build its complement, point the degrading arrow, and read off whether its quantum capacity is a one-line formula or an open problem.
Why is the complementary channel well defined if the Stinespring dilation is not unique?
Two dilations of the same channel differ only by an isometry on the environment, . Tracing out Bob then gives — the candidate complements are related by a fixed partial isometry on . Every isometry-invariant quantity is therefore unambiguous, including the one thing we actually use, the environment's output entropy , since entropy is unitarily invariant. Degradability is invariant too, because composing with can be absorbed into the degrading map. So although the complement is defined only up to an environment isometry, everything the theory computes with it is fixed.
What is the difference between the complementary channel and simply the noise?
The complement is not "the error" — it is a bona fide channel mapping the same input to a legitimate output, the reduced state of the environment. Where answers "what does Bob hold?", answers "what does the rest of the universe hold?"; both come from the single isometry by tracing out the other system. It matters because of information conservation: the isometry loses nothing, so any information missing from Bob went to , and says exactly what and how much — which is why the eavesdropper in a security proof is modelled by the complementary channel.
How can I quickly tell whether a channel is degradable?
Write down a Stinespring isometry and read off , then ask whether a CPTP map satisfies ; for low-dimensional channels this is a small linear-algebra check, and for named channels the complement is another member of the same family, making it transparent. A shortcut: if and swap a parameter across (damping ), degradability holds on the less noisy side. When neither nor exists exactly, the channel is generic and you fall back on approximate degradability for bounds.
Why does antidegradability force the quantum capacity to be exactly zero?
Because it would otherwise let you clone. If were antidegradable and had , Bob could reliably recover transmitted states, while the environment — which by antidegradability can be processed into a copy of Bob's output — could independently recover the same states, giving two faithful copies of an unknown state in violation of no-cloning. The formal version shows the coherent information is non-positive on every input, and a never-positive single-letter quantity regularizes to zero, so exactly — which is why amplitude damping above , erasure above , and pure loss below transmit no quantum information at all.
Does additivity of the coherent information also make the private and classical capacities single-letter?
No, and conflating these is a common error. Degradability makes the coherent information additive, single-letterizing , and for degradable channels the private capacity coincides with so it too is single-letter. But the classical capacity is governed by the Holevo quantity, a different functional that can be superadditive even when the coherent information is additive. And the additivity argument needs degrading maps for both factors of a tensor product — one degradable factor is not enough. Keep the three capacities separate: degradability is a statement about (and, as a bonus, ), not a universal additivity theorem.
If almost no channel is exactly degradable, why does the concept matter?
Two reasons. First, the degradable channels model much of real hardware: dephasing is pure phase noise, amplitude damping is energy relaxation ( decay), erasure is heralded photon loss, and pure loss is optical fibre — so the solvable set is the backbone of practical analysis, not a curiosity. Second, degradability is the reference point for everything else: approximate degradability measures how far a channel sits from the degradable set and turns that distance into rigorous capacity bounds by SDP — currently the best handle on hard cases like the depolarizing channel. It matters not because every channel is degradable, but because degradability is the axis along which all channels are measured.