Channel Composition and Fixed Points
Quantum channels are rarely used only once. A qubit may dephase during storage, relax during readout, and then pass through a detector model. A bosonic mode may lose photons in a fiber, pass through an amplifier, and then be measured. A Markovian noise model may be applied repeatedly in small time steps.
The channel-level questions are:
- how to compose two physical maps without losing complete positivity or trace preservation;
- when repeated applications are powers of one channel;
- which states or observables are unchanged by the noise;
- whether fixed states are actually attracting under repeated application.
This page treats the finite-dimensional channel picture first and then points to continuous-time semigroups. The full generator theory belongs to Quantum Dynamical Semigroups and Lindblad–GKSL Equation.
Serial Composition
Section titled “Serial Composition”Let
and
be quantum channels. Their serial composition is
The rightmost channel acts first. This order convention is the same as ordinary function composition.
If
and
then the composite channel has Kraus operators
because
Trace preservation is inherited:
Thus a serial composition of completely positive trace-preserving maps is again a channel. If one of the maps is trace nonincreasing, the composite is trace nonincreasing; it then describes a selected branch or filter rather than a deterministic channel.
Composition in Common Representations
Section titled “Composition in Common Representations”Several representations make composition useful in different ways.
In Kraus form, composition multiplies Kraus operators as above. This is physically transparent when one channel follows another, but the number of Kraus operators can grow.
In a matrix representation of the linear map, vectorize operators as . Then
and serial composition becomes ordinary matrix multiplication:
This is the most convenient representation for eigenvalues, fixed points, and numerical iteration. The exact entries of depend on the vectorization convention, so formulas with transposes must be used consistently.
In Choi form, composition is a contraction of the output leg of the first channel with the input leg of the second channel. This is often called a link product. Because tensor-ordering and transpose conventions differ across references, the safest route is to state the Choi convention first and then use the reconstruction formula from Choi Matrix.
Powers and Discrete-Time Channels
Section titled “Powers and Discrete-Time Channels”If the same channel is applied repeatedly, write
This describes a discrete-time process with one fixed step. It is not automatically a continuous-time Markovian semigroup. A semigroup needs a family satisfying for all nonnegative times, not only integer powers.
For common one-parameter channels, repeated application often composes through the physically natural survival or shrink factor:
| Channel | One step | identical steps |
|---|---|---|
| depolarizing | traceless part | |
| dephasing | coherence | |
| amplitude damping | excited population survives by | decay probability |
| pure bosonic loss | transmissivity | transmissivity |
These formulas assume the same basis, mode, and convention at every step. Interleaved Hamiltonian rotations or basis changes can turn an apparently simple composition into a different noise model.
Different Mechanisms Need Not Commute
Section titled “Different Mechanisms Need Not Commute”Two channels generally do not commute:
Order matters whenever the first channel changes the basis, population, coherence, or support on which the second channel acts. A dephasing channel in the basis and a unitary rotation about the axis do not have the same effect in the two possible orders.
Some special channels do commute with many others. The -dimensional depolarizing channel
commutes with unitary conjugations because it treats every traceless direction equally:
Pure dephasing and amplitude damping in the same energy basis also compose simply on matrix elements: populations relax while coherences acquire both the dephasing factor and the damping factor. But this simplicity is basis dependent.
A common modeling mistake is to add finite-step probabilities directly. For independent amplitude-damping steps with probabilities and , the total decay probability is
not except to first order when both probabilities are small.
Fixed States
Section titled “Fixed States”A fixed state of a channel is a density operator satisfying
Finite-dimensional quantum channels always have at least one fixed state. The reason is not specifically quantum: the state space is compact and convex, and a channel is a continuous map from that state space to itself. A fixed-point theorem then applies.
The fixed states form a convex set. If and are fixed, then any mixture
is also fixed.
Examples:
| Channel | Fixed states |
|---|---|
| identity channel | every state |
| unitary channel | states commuting with |
| projective dephasing | states block diagonal in the measured decomposition |
| depolarizing with | the maximally mixed state |
| zero-temperature amplitude damping with | the ground state |
| thermal oscillator damping | the thermal state of the oscillator |
| pure bosonic loss | the vacuum state |
The existence statement above is finite dimensional. Infinite-dimensional channels need additional compactness, tightness, or energy-bound assumptions. Additive Gaussian noise, for example, keeps increasing covariance and has no normalizable finite-energy fixed state.
Fixed Observables
Section titled “Fixed Observables”The adjoint channel acts on observables:
A fixed observable satisfies
This means that the expectation value of is conserved under the channel:
for all input states .
Do not confuse fixed states with fixed observables. A dephasing channel fixes diagonal density matrices in the Schrödinger picture and fixes diagonal observables in the Heisenberg picture, but more general channels can have different-looking fixed-state and fixed-observable structures.
Attracting Fixed Points
Section titled “Attracting Fixed Points”A fixed state need not attract all initial states. Attraction is an asymptotic statement:
In finite dimensions, represent as a linear map on the vector space of operators. If
then is an eigenoperator and is a channel eigenvalue. Fixed operators have . Decaying modes have .
For a completely positive trace-preserving map, the relevant spectrum lies in the unit disk. If the only eigenvalue on the unit circle is a simple eigenvalue and the fixed-state space is one-dimensional, then repeated application converges to the unique fixed state. If other unit-modulus eigenvalues appear, the channel may preserve phases, support noiseless modes, or produce periodic behavior.
This is why uniqueness of a fixed state is stronger than existence but still must be paired with spectral information when one wants a convergence rate. The discrete-time spectral gap is controlled by the largest below one.
Solving for Fixed Points
Section titled “Solving for Fixed Points”In a finite-dimensional calculation, the fixed-point problem is linear before the positivity constraint is imposed:
A practical workflow is:
- choose a basis of operators or a superoperator matrix ;
- solve
- restrict to Hermitian with ;
- keep the positive semidefinite solutions.
For a qubit affine Bloch-vector map
a fixed point satisfies
If is invertible, the fixed Bloch vector is unique. If is singular, there may be a continuum of fixed states or no physical solution inside the Bloch ball unless the channel constraints supply one.
Examples:
- depolarizing has and , so when ;
- dephasing has a whole fixed line along the dephasing axis;
- amplitude damping has a unique fixed point at the ground-state pole in the usual energy-basis convention.
For numerical examples of these affine maps, see Bloch Vector Noise Models. For general finite-dimensional channel matrices, see Simulating Quantum Channels.
Idempotent Channels
Section titled “Idempotent Channels”Some channels satisfy
These are idempotent channels. After one application, the state is already in the fixed set.
The standard example is nonselective projective measurement:
Applying the same nonselective measurement again does nothing:
The fixed states are exactly those block diagonal in the measured decomposition:
This is the channel version of dephasing by unread measurement. It should not be confused with a selective measurement branch, which is trace nonincreasing before normalization.
Relation to Semigroups and Steady States
Section titled “Relation to Semigroups and Steady States”For a continuous-time Markovian semigroup
a steady state satisfies
It is then fixed by every time- channel:
The converse needs care. A state fixed by one finite-time map need not be stationary for all . For example, a unitary rotation can return some coherences after one period even though they evolved nontrivially at intermediate times.
Thus:
- fixed by one channel is a discrete-time statement;
- stationary under a generator is a continuous-time statement;
- attracting under repeated application requires spectral information.
The generator-level treatment, including Liouvillian eigenvalues and relaxation modes, is developed in Quantum Dynamical Semigroups and Solving Lindblad Equations.
Physical Interpretation
Section titled “Physical Interpretation”Fixed points tell you what the environment is trying to stabilize or preserve. Depolarizing noise stabilizes the maximally mixed state. Thermal damping stabilizes a Gibbs or oscillator thermal state. Zero-temperature amplitude damping stabilizes the ground state. A projective dephasing channel preserves classical mixtures in the measurement basis.
The fixed set also tells you what information survives the noise. If the fixed set is large, some classical or quantum information may be protected. This is the entry point to Decoherence-Free Subspaces, Pointer States, and reservoir engineering, where the goal is to design a dissipative channel or generator whose desired state is the unique attracting fixed point.
The most useful diagnostic question is not only “what is fixed?” but also “what is attracted, how fast, and from which initial states?”
Common Mistakes
Section titled “Common Mistakes”- Reading left to right instead of applying first.
- Composing finite-step error probabilities by ordinary addition outside the small-probability limit.
- Treating tensor-product noise as the same thing as serial composition.
- Assuming a fixed state is automatically unique or attracting.
- Applying finite-dimensional fixed-point existence arguments to infinite-dimensional channels without compactness or energy assumptions.
- Forgetting that a finite-time fixed point need not be a continuous-time steady state.
- Ignoring output spaces: channels can be composed only when the output space of the first map matches the input space of the next map.
- Confusing fixed density operators with conserved observables of the adjoint channel.
References
Section titled “References”- M. M. Wolf, Quantum Channels & Operations: Guided Tour (lecture notes, 2012).
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 10th anniversary ed. (2010).
- A. Arias, A. Gheondea, and S. Gudder, “Fixed points of quantum operations,” Journal of Mathematical Physics 43, 5872-5881 (2002).
- B. Baumgartner and H. Narnhofer, “Analysis of quantum semigroups with GKS-Lindblad generators: II. General,” Journal of Physics A: Mathematical and Theoretical 41, 395303 (2008).
- R. Alicki and K. Lendi, Quantum Dynamical Semigroups and Applications, Springer, 2nd ed. (2007).
Exercises
Section titled “Exercises”- Composite Kraus operators. Suppose has Kraus operators and has Kraus operators . Prove that is a Kraus representation of .
Solution
Insert the Kraus form of into :
Thus the composite Kraus operators are . If both channels are trace preserving, then
as shown in the main text.
- Depolarizing powers. Let . Show that .
Solution
Write with . Then
After applications,
Therefore
- Amplitude-damping probabilities. Two amplitude-damping channels in the same basis have decay probabilities and . Find the total decay probability.
Solution
The excited population survives the first channel with probability and the second with probability . The total survival probability is
Therefore the total decay probability is
For small probabilities, this is approximately , but the exact expression includes the product term.
- Fixed states of dephasing. Let for orthogonal projectors with . Show that is fixed exactly when it is block diagonal in this decomposition.
Solution
Decompose the state into blocks:
The channel removes the off-block terms:
Thus exactly when
That is the statement that is block diagonal in the projective decomposition.
- Fixed does not mean attracting. Give an example of a channel with many fixed states that is not mixing to one state.
Solution
The identity channel is the simplest example:
Every state is fixed, so there is no unique attracting state. A less trivial example is a unitary channel . States that commute with are fixed, while coherences between different eigenvalue sectors generally rotate rather than decay.