Quantum Operations and Completely Positive Trace-Preserving Maps
Closed quantum systems obey the Schrödinger equation, and their states rotate rigidly by a unitary, . That picture is exact and beautiful and far too small. Every real device leaks: a qubit couples to lattice phonons, a photon scatters off a lossy mirror, a spin dephases in a fluctuating field, an experimenter measures and the state jumps. To describe any of this — noise, dissipation, measurement back-action, the deliberate discarding of a subsystem — we need the most general transformation a quantum state can physically undergo. That object is the quantum operation, formalized as a completely positive trace-preserving (CPTP) map on the space of density operators. The demand "physically allowed" turns out to have exactly three axioms. The map must be linear, because mixing ensembles and then evolving must equal evolving and then mixing. It must be trace-preserving, so probabilities keep summing to one. And it must be completely positive — not merely positive. Positivity says valid states go to valid states; complete positivity says this survives even when the map acts on one half of a state entangled with an untouched spectator of any dimension. That third axiom is the subtle one, and the whole subject turns on it: the transpose map is positive yet not completely positive, and reality forbids it. The deep payoff, the theorems of Stinespring, Kraus, and Choi, is that these three abstract axioms collapse into one physical story told three equivalent ways: couple to an environment and trace it out; write an operator sum ; or check that a single matrix is positive. This trinity is the working language of open quantum systems, error correction, and quantum Shannon theory.
- A quantum operation is a linear map on density operators that is completely positive and trace-preserving — the most general physical transformation of a quantum state, covering unitary gates, measurement, noise, and dissipation in one structure.
- Complete positivity, stronger than plain positivity, is forced by entanglement: must stay positive for a reference of arbitrary size. The transpose is the canonical map that is positive but not CP.
- Every CPTP map has a Kraus (operator-sum) form with , and equivalently arises from unitary coupling to an environment followed by partial trace (Stinespring dilation).
- The Choi–Jamiołkowski isomorphism turns dynamics into statics: is CP iff its Choi matrix , and TP iff .
- CPTP maps form a convex set closed under mixing, composition, and tensor product; they are the discrete-time counterpart of the Lindblad/GKSL generator.
- Key idea: a transformation of quantum states is physical iff it is linear, completely positive, and trace-preserving — and by Stinespring, Kraus, and Choi this is the same as "unitary on a larger space, traced out," an operator sum with , and a positive Choi operator with the correct marginal.
A transformation of quantum states is physical if and only if it is linear, completely positive, and trace-preserving. By the theorems of Stinespring, Kraus, and Choi these axioms are equivalent to three concrete pictures: couple the system unitarily to an environment and trace it out; write an operator sum with ; and produce a positive-semidefinite Choi operator with the correct marginal. Complete positivity — positivity that survives entanglement with an arbitrary spectator — is the non-obvious ingredient.
Where this lives today
CPTP maps are not a formal abstraction; they are the daily currency of experimental quantum computing. When a group at IBM, Google, or a trapped-ion lab wants to know what a gate actually does, they reconstruct its Choi matrix by quantum process tomography — preparing a complete set of input states, measuring the outputs, and fitting the most likely subject to and the correct marginal, so the answer is guaranteed to be a physical channel. For many-qubit systems full tomography is exponentially expensive, so the field has moved to scalable summaries of the same CPTP object: randomized benchmarking extracts an average gate fidelity, gate set tomography reconstructs a self-consistent set of channels, and cycle benchmarking characterizes the effective Pauli (Kraus) error per layer. Every one of these is a measurement of a quantum operation. Downstream, the operator-sum structure is what makes fault tolerance possible at all: because a code that corrects a basis of Kraus errors automatically corrects their linear combinations, continuous physical noise "discretizes" into correctable Pauli errors, and threshold theorems then guarantee that iterated CPTP noise can be suppressed below any target. In quantum communication the same maps become the channels of quantum Shannon theory, whose classical, quantum, private, and entanglement-assisted capacities set the ultimate limits of quantum networks and QKD. And error mitigation on today's noisy devices — probabilistic error cancellation, zero-noise extrapolation — works by explicitly modeling and partially inverting the CPTP map a circuit implements. From the lab bench to the theory of capacities, the object introduced here is the interface.
The physical picture
Picture your system as a fragment of a larger closed universe. Whatever happens to it, however noisy or irreversible it looks, must be the shadow of an honest unitary acting on the system together with its environment. Prepare the environment in a fixed state, let the pair evolve by some , then look away from — trace out — the environment. The map from input state to reduced output state is what you call the channel. Stinespring's theorem says the set of maps obtainable this way is exactly the set of CPTP maps: nothing more exotic is physically realizable, and nothing physical is left out. The first figure is this one idea drawn as a circuit.
Why "completely" positive and not just positive? Imagine your qubit is secretly one half of an entangled pair, its partner held by a distant friend you will never contact. You apply your map to your half only; the untouched partner is a spectator. The joint state must remain a legitimate state — no measurement, however cleverly correlated across the pair, may return a negative probability. A map that fails this, like the transpose, would manufacture impossible statistics on the entangled pair. Complete positivity is precisely positivity that holds up under entanglement with an arbitrary, arbitrarily large spectator. It is the axiom you would never guess from single-system reasoning, and it is the one that makes the whole framework correct. The last move in the picture is the Choi trick, which converts dynamics into statics. Feed half of a maximally entangled pair through the channel and leave the other half alone; the resulting bipartite state — the Choi matrix — is a fingerprint that stores everything about the map. Abstract properties of the map (completely positive, trace-preserving, unital) become concrete properties of a single Hermitian matrix (positive, correct partial trace, correct other marginal) that you can diagonalize on a laptop or reconstruct in a lab. The second figure shows what two representative channels do to the Bloch ball — the geometry every qubit-noise calculation comes back to, with real contraction numbers.
The core equations
A quantum channel is defined by what it must preserve. It takes any valid state — positive, unit trace — to another valid state, and it must do so for every input at once.
where: — density operator (positive semidefinite, unit trace) on the system Hilbert space; — a linear map on operators, a superoperator; — positive semidefinite (no negative eigenvalues). Reading: legitimate states in, legitimate states out, with linearity assumed throughout. The subtle axiom is that positivity must survive tensoring with an untouched reference of any size. This is the definition of complete positivity, and it is strictly stronger than positivity of alone.
where: — the identity superoperator on a reference system of arbitrary dimension; — any positive operator on system reference. Reading: even acting on half of an entangled pair, the map may not create a negative eigenvalue anywhere. The structure theorem gives the map a concrete form: it is a sum of one-sided products with a completeness constraint. This is the representation you compute with.
where: — Kraus operators (operation elements), not required to be Hermitian, normal, or square-summable beyond the constraint; — completeness relation, which is exactly trace preservation. Reading: each is one "way the environment could have responded," summed coherently inside, incoherently across . Equivalently, the channel is a unitary on a dilated space with the environment traced out. This is the physical origin of the Kraus form.
where: — a unitary on system environment; — a fixed initial environment state; — partial trace over the environment. The Kraus operators are its matrix elements, . The Choi–Jamiołkowski operator packages the entire channel into one matrix by acting on half of an (unnormalized) maximally entangled state.
where: — Choi matrix, an operator on of size ; — unnormalized maximally entangled state; — Hilbert-space dimension. Reading: dynamics (a map) becomes statics (a state-like operator). The CPTP axioms become two linear-algebra checks on that one matrix — the reason process tomography is tractable.
where: — partial trace over the output factor of . Reading: check one eigenvalue spectrum for CP and one marginal for TP. Two canonical channels anchor the theory. The depolarizing channel shrinks any state toward the maximally mixed state; amplitude damping models irreversible energy loss and is the standard non-unital example.
where: — depolarizing probability, ; — maximally mixed fixed point; — damping probability, related to relaxation time by ; — the jump operator carrying . Reading: is unital, amplitude damping is not.
The goal of this derivation is to show that complete positivity is a genuinely stronger requirement than positivity, by exhibiting a map that sends every density operator to a legitimate density operator and yet is physically forbidden. The map is the matrix transpose, . It preserves eigenvalues, so it preserves positivity and trace on any single system. The failure appears only when acts on half of an entangled pair, which is exactly what complete positivity tests — and this single example is why the CP axiom exists.
Step 1. Take the two-qubit maximally entangled state , whose density operator is . This is a valid pure state, hence positive semidefinite. Why: we need a positive input on system-plus-reference to feed into ; an entangled one is what exposes the difference.
Step 2. Apply to the first tensor factor only. Transposing gives , so . Why: the partial transpose relabels rows and columns on subsystem one, and the sum of is precisely the swap operator that exchanges the two qubits.
Step 3. The swap operator has eigenvalue on the symmetric subspace and on the antisymmetric one: with . Therefore has an eigenvalue . Why: a negative eigenvalue means the output is not a valid state; the reference qubit, never touched, has forced to reveal itself as non-physical.
Step 4. Conclude that is positive but not completely positive, hence not a quantum operation, even though is a perfectly good density operator for every single-system . Why: this is the whole point — physicality is decided on the entangled extension, and only complete positivity captures it. *Verified: with least eigenvalue ; the map is trace- and eigenvalue-preserving on any single system (Nielsen & Chuang §8.2.4, Watrous Ch. 2).*
Go deeper · Derivation B · 2 minFrom complete positivity to the operator-sum form
The goal here is to prove the workhorse theorem: every completely positive trace-preserving map admits a Kraus representation with at most terms and . The route is Choi's: complete positivity makes the Choi matrix a positive operator, its spectral decomposition hands over the Kraus operators directly, and trace preservation becomes the completeness relation. This is the derivation that lets you go from an abstract "physical map" to explicit matrices you can multiply.
Step 1. Form the Choi operator by acting with on the unnormalized entangled state: . This single operator on the -dimensional space encodes completely, since knowing on the basis fixes it everywhere by linearity. Why: we trade the map for one operator so the axioms become properties of a matrix.
Step 2. Invoke complete positivity. Since and preserves positivity by hypothesis, the Choi operator is positive semidefinite, . Why: this is Choi's theorem in the forward direction, and positivity is exactly what makes the next step, a spectral decomposition with non-negative weights, legal.
Step 3. Spectrally decompose with . A positive operator on a -dimensional space has at most nonzero eigenvalues, so the sum has at most terms. Why: the number of Kraus operators (the Kraus rank) is fixed here as the rank of , capped at .
Step 4. Reshape each eigenvector into a matrix. Writing , define . The vectorization turns a -vector into a operator, and carries the weight. Why: this is the exact bridge from the static Choi data back to operators acting on states.
Step 5. Verify the action. One checks that for all , and by linearity for every . Why: this confirms the reshaped operators actually reproduce the map, not merely something with the right Choi matrix.
Step 6. Impose trace preservation. The TP condition translates term by term into , the completeness relation. Why: this closes the equivalence — CP gives the operator sum, TP gives the constraint, and together they are exactly "CPTP." *Verified: follows from ; the reshaping is the standard column-stacking isomorphism, and (Watrous Ch. 2, Nielsen & Chuang §8.2.3).*
Go deeper · Derivation C · 1 minStinespring dilation — every channel is a unitary in disguise
The goal is to run the argument the other way and show that the abstract Kraus form is not just formal bookkeeping but describes genuine unitary physics on a larger space. Given Kraus operators with completeness, we build an explicit environment, a fixed initial environment state, and a global unitary such that the channel is recovered by partial trace. The construction proves that open, irreversible dynamics is always closed, reversible dynamics viewed through a partial trace — the content of the first figure.
Step 1. Define the isometry , mapping the system into system environment with orthonormal environment states . Equivalently . Why: this bundles all the Kraus operators into one operator that adds an environment register recording "which ."
Step 2. Check that is an isometry: , using orthonormality of and Kraus completeness. Why: says preserves inner products, so it can be part of a unitary; the completeness relation is exactly the isometry condition.
Step 3. Trace out the environment: , since . Why: discarding the environment register collapses the coherences between different , turning one coherent unitary into the incoherent operator sum — this is where irreversibility enters.
Step 4. Extend to a unitary. Any isometry from into can be completed to a unitary on the full space by extending its columns to an orthonormal basis, with . This delivers the environmental form . Why: it realizes the channel as an honest closed-system evolution of system-plus-environment, which is Stinespring's theorem in finite dimensions. *Verified: is equivalent to Kraus completeness, and the dilation reproduces exactly; the minimal environment dimension equals the Kraus rank (Preskill Ch. 3, Wilde Ch. 5).*
Limiting cases
CPTP maps specialize to every familiar kind of quantum dynamics in well-defined regimes:
| Case | Result | Meaning |
|---|---|---|
| Unitary / closed limit | A single Kraus operator ; the environment decouples. Reversible, trace- and distance-preserving — the invertible corner of the CPTP set. | |
| Continuous Markovian limit | A one-parameter semigroup of CPTP maps; the generator has Lindblad/GKSL form. Each is itself a channel. | |
| Classical / fully dephased | Complete dephasing in a fixed basis reduces the channel to a stochastic matrix on the probability vector — classical Markov dynamics as a special CPTP map. | |
| Unital sub-case | , i.e. | Fixes the maximally mixed state (depolarizing, Pauli, phase damping). Cannot decrease the entropy of ; amplitude damping is the canonical non-unital exception. |
Worked examples
1 · Amplitude damping and the T₁ decay of an excited qubit (confidence builder)
A superconducting qubit has relaxation time . It is prepared in the excited state and left idle for . Using the amplitude-damping channel, find the surviving excited-state population and confirm the map is trace-preserving.
Step 1. Fix the damping parameter from the relaxation time: . This is the probability that one quantum of energy has leaked to the environment during the idle window.
Step 2. Apply the channel to . With and , we have and . Hence .
Step 3. Read off the physics: the excited-state population has fallen from to , and a fraction has decayed to the ground state — exactly the classical exponential for the excited population, now derived as a CPTP map. Trace preservation is manifest: , consistent with .
Step 4. Note non-unitality: . The maximally mixed state is not fixed; the channel drags every state toward , the signature of irreversible energy loss. Excited population , trace , and the channel is non-unital.
2 · Depolarizing a superposition and checking it stays a state (fully worked)
A qubit in passes through a depolarizing channel with . Find the output state, its purity, and verify it is a legitimate (positive, unit-trace) density operator.
Step 1. Write in Bloch form: with Bloch vector , a pure state on the surface of the ball. The depolarizing channel contracts the Bloch vector isotropically, , so .
Step 2. Reconstruct the output operator: . Its trace is , so probability is conserved.
Step 3. Purity: . The state has been pushed off the surface toward the center — coherence in the off-diagonal has shrunk from to , and the state is now mixed.
Step 4. Positivity check: eigenvalues of are , both non-negative. So is a valid density operator — as it must be, since the depolarizing channel is CPTP for . , purity , eigenvalues .
3 · Verifying a channel is CP by its Choi eigenvalues
Confirm directly that amplitude damping with is completely positive by computing the spectrum of its Choi matrix.
Step 1. Build the Choi matrix from . Using , , and , assemble the operator.
Step 2. Diagonalize. The eigenvalues come out to . All four are non-negative, so and the map is completely positive by Choi's criterion.
Step 3. Cross-check trace preservation via the marginal: , equivalently , which we already confirmed in Example 1. The two nonzero eigenvalues, and , correspond to the two Kraus operators — the Kraus rank is . All Choi eigenvalues , so amplitude damping is CPTP with Kraus rank 2.
Physics of the portrait
Behind the whole framework stands a 1955 theorem in the theory of operator algebras that had nothing to do with physics when it was proved — and everything to do with it forty years later.
Origins · 1 minW. Forrest Stinespring and how this was discovered
William Forrest Stinespring was an American mathematician trained in the operator-algebra school of the University of Chicago, and his single most cited result is a 1955 paper, "Positive functions on C-algebras," published in the Proceedings of the American Mathematical Society when he was in his mid-twenties. The question he answered was purely algebraic: given a completely positive linear map from a C-algebra into the bounded operators on a Hilbert space, what does it look like? His theorem — now called Stinespring dilation — says every such map factors as a representation of the algebra sandwiched between an isometry and its adjoint. Translated into the finite-dimensional language of quantum information, this is exactly the statement that every channel is a unitary on a larger space followed by a partial trace: the environmental picture that opens this article. At the time there were no qubits, no quantum computers, and no notion of a "quantum channel"; Stinespring was extending results of Gelfand, Naimark, and Segal on how abstract algebras represent as operators. The physics arrived later. When Kraus in 1971 wrote the general state change as an operator sum, and when the quantum information community matured in the 1990s, it became clear that Kraus's operators, Choi's positive matrix, and Stinespring's dilation were three faces of one theorem — and that Stinespring had, decades early and for entirely mathematical reasons, written down the structure of physical noise. His dilation is now the first thing proved in every graduate course on open quantum systems.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, Ch. 8 (Quantum noise and quantum operations) · Preskill, Quantum Computation lecture notes, Ch. 3 (Foundations II: Measurement and Evolution) · Watrous, The Theory of Quantum Information, Ch. 2 (Completely positive and trace-preserving maps) · Wilde, Quantum Information Theory, Ch. 4 (Quantum channels) · Kitaev, Shen & Vyalyi, Classical and Quantum Computation, Ch. 11 · Choi, "Completely positive linear maps on complex matrices," Linear Algebra Appl. 10 (1975) 285 · Stinespring, "Positive functions on C-algebras," Proc. Amer. Math. Soc.* 6 (1955) 211.
Provenance. The three representations follow Nielsen & Chuang Ch. 8, Preskill Ch. 3, and Watrous Ch. 2. A verifier should reproduce: the transpose counterexample with eigenvalue ; Kraus completeness trace preservation by cyclicity; the amplitude-damping numbers , excited population , non-unitality , and Choi spectrum ; and the depolarizing action giving , purity , eigenvalues at . The relation is standard (Nielsen & Chuang §8.3.5). No nonstandard constants are introduced.
Prerequisites. Density Operators and Mixed States · Open Quantum Systems and Reduced Dynamics · Tensor Products and Partial Trace · Unitary Evolution and the Schrödinger Equation. Leads to. Kraus Representation of Quantum Channels · Process Tomography and the Choi–Jamiołkowski Isomorphism · Lindblad / GKSL Master Equation · Depolarizing Channel · Amplitude Damping Channel.
Ask the tutor: Ask me to walk through why the transpose map is positive but not completely positive, or to build the Kraus operators of any channel from its Choi matrix step by step.
What is the difference between a "quantum operation" and a "quantum channel"?
In most modern usage the two are synonyms for a completely positive, trace-preserving map, and this article uses them interchangeably. Historically "quantum operation" (following Kraus) was the broader term, allowing trace-non-increasing maps that describe a single measurement outcome occurring with probability ; renormalizing by that probability gives the post-measurement state. "Quantum channel" almost always means the trace-preserving case, appropriate when no information about an outcome is recorded — for instance a noise process. So every channel is an operation, but a selective (outcome-conditioned) operation need only be trace-non-increasing. When someone says "CPTP map," they mean a channel.
Why exactly d² Kraus operators — where does that bound come from?
Because the Choi matrix lives on a Hilbert space of dimension (it is ), and a positive operator there has at most nonzero eigenvalues. Each nonzero eigenvalue supplies one Kraus operator in the spectral construction, so any channel on a -dimensional system can be written with at most Kraus operators. The minimal number actually needed is the Kraus rank, equal to the rank of : a unitary has rank 1, amplitude damping has rank 2, a full depolarizing channel has rank 4 for a qubit (, so up to ). You can always use more operators than the rank, but never fewer, and extra ones are related to the minimal set by an isometric remixing.
If a channel is "really" a unitary on a bigger space, why is it irreversible?
The full unitary on system-plus-environment is perfectly reversible — no information is destroyed there. Irreversibility appears the instant you trace out the environment, because the partial trace throws away the correlations that were built up between system and environment. Those correlations are exactly what you would need to run the evolution backward; without access to the environment you cannot recover them. This is why the Kraus form is an incoherent sum over : the coherences between different environment outcomes are precisely what the trace discards. The environment "measures" the system without telling you the result, and unread measurement is the microscopic origin of decoherence.
Are Kraus operators unique, and why does it matter?
No. Two Kraus sets and describe the same channel if and only if they are related by an isometric mixing , where has orthonormal columns (pad the shorter list with zero operators first). For example, the bit-flip channel can be written with or, after a Hadamard-like remix, with a different pair — both are correct. This matters practically: you cannot compare two noise processes by staring at their Kraus operators, because the same physics wears many costumes. The Choi matrix, by contrast, is a genuine invariant of the channel, which is why tomography and channel-distance measures are all built on rather than on any particular .
What makes amplitude damping "non-unital" and why does that matter physically?
A channel is unital if it leaves the maximally mixed state alone, . Amplitude damping fails this: it computes , because it does not treat and symmetrically — it drains population downhill into the ground state and never the reverse. Physically, non-unitality is the fingerprint of a channel that exchanges energy with a cold environment: it has a preferred fixed point () rather than the featureless center of the Bloch ball. Depolarizing and dephasing channels are unital because they are "unbiased" noise; relaxation ( decay) is non-unital because thermodynamics gives the ground state a special role.
How does a discrete CPTP map relate to the Lindblad master equation?
They are the discrete- and continuous-time faces of the same physics. A time-homogeneous Markovian evolution is a one-parameter semigroup of channels , and the requirement that every be CPTP forces the generator into the Lindblad/GKSL form with its dissipators . So integrating the Lindblad equation over a finite time produces a specific CPTP map, and conversely differentiating a smooth family of channels at recovers a Lindbladian. The Kraus operators of for small are and — the jump operators are the square-root-of-time Kraus terms.
Is measurement a quantum operation too?
Yes, and this is one of the framework's unifying wins. A general measurement with outcomes is described by a set of operators with ; outcome occurs with probability and leaves the state . Each outcome is a trace-non-increasing operation, and if you forget which outcome occurred you sum them into a single trace-preserving channel — exactly the Kraus form. Projective (von Neumann) measurement is the special case with orthogonal projectors. So measurement, gates, and noise are not three different theories; they are three uses of one operator-sum structure.