Skip to content

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.

Let

Φ:B(HA)→B(HB)\Phi: \mathcal B(\mathcal H_A) \to \mathcal B(\mathcal H_B)

and

Ψ:B(HB)→B(HC)\Psi: \mathcal B(\mathcal H_B) \to \mathcal B(\mathcal H_C)

be quantum channels. Their serial composition is

(Ψ∘Φ)(ρ)=Ψ(Φ(ρ)).(\Psi\circ\Phi)(\rho) = \Psi(\Phi(\rho)).

The rightmost channel acts first. This order convention is the same as ordinary function composition.

If

Φ(ρ)=∑αKαρKα†\Phi(\rho) = \sum_\alpha K_\alpha\rho K_\alpha^\dagger

and

Ψ(σ)=∑βLβσLβ†,\Psi(\sigma) = \sum_\beta L_\beta\sigma L_\beta^\dagger,

then the composite channel has Kraus operators

Mβα=LβKα,M_{\beta\alpha} = L_\beta K_\alpha,

because

(Ψ∘Φ)(ρ)=∑β,αLβKαρKα†Lβ†=∑β,αMβαρMβα†.\begin{aligned} (\Psi\circ\Phi)(\rho) &= \sum_{\beta,\alpha} L_\beta K_\alpha \rho K_\alpha^\dagger L_\beta^\dagger\\ &= \sum_{\beta,\alpha} M_{\beta\alpha} \rho M_{\beta\alpha}^\dagger. \end{aligned}

Trace preservation is inherited:

∑β,αMβα†Mβα=∑αKα†(∑βLβ†Lβ)Kα=∑αKα†Kα=IA.\begin{aligned} \sum_{\beta,\alpha} M_{\beta\alpha}^\dagger M_{\beta\alpha} &= \sum_\alpha K_\alpha^\dagger \left( \sum_\beta L_\beta^\dagger L_\beta \right) K_\alpha\\ &= \sum_\alpha K_\alpha^\dagger K_\alpha\\ &= I_A. \end{aligned}

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.

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 ∣X⟩⟩\lvert X\rangle\rangle. Then

∣Φ(X)⟩⟩=SΦ∣X⟩⟩,\lvert\Phi(X)\rangle\rangle = S_\Phi\lvert X\rangle\rangle,

and serial composition becomes ordinary matrix multiplication:

SΨ∘Φ=SΨSΦ.S_{\Psi\circ\Phi} = S_\Psi S_\Phi.

This is the most convenient representation for eigenvalues, fixed points, and numerical iteration. The exact entries of SΦS_\Phi 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.

If the same channel is applied repeatedly, write

Φn=Φ∘Φ∘⋯∘Φ⏟n times.\Phi^n = \underbrace{\Phi\circ\Phi\circ\cdots\circ\Phi}_{n\ \mathrm{times}}.

This describes a discrete-time process with one fixed step. It is not automatically a continuous-time Markovian semigroup. A semigroup needs a family {Φt:t≥0}\{\Phi_t:t\ge0\} satisfying Φt+s=ΦtΦs\Phi_{t+s}=\Phi_t\Phi_s 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:

ChannelOne stepnn identical steps
depolarizingtraceless part τ↦λτ\tau\mapsto\lambda\tauτ↦λnτ\tau\mapsto\lambda^n\tau
dephasingcoherence ρij↦λρij\rho_{ij}\mapsto\lambda\rho_{ij}ρij↦λnρij\rho_{ij}\mapsto\lambda^n\rho_{ij}
amplitude dampingexcited population survives by 1−γ1-\gammadecay probability 1−(1−γ)n1-(1-\gamma)^n
pure bosonic losstransmissivity η\etatransmissivity ηn\eta^n

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.

Two channels generally do not commute:

Ψ∘Φ≠Φ∘Ψ.\Psi\circ\Phi \ne \Phi\circ\Psi.

Order matters whenever the first channel changes the basis, population, coherence, or support on which the second channel acts. A dephasing channel in the ZZ basis and a unitary rotation about the XX axis do not have the same effect in the two possible orders.

Some special channels do commute with many others. The dd-dimensional depolarizing channel

Dλ(ρ)=λρ+(1−λ)Id\mathcal D_\lambda(\rho) = \lambda\rho + (1-\lambda)\frac{I}{d}

commutes with unitary conjugations because it treats every traceless direction equally:

Dλ(UρU†)=UDλ(ρ)U†.\mathcal D_\lambda(U\rho U^\dagger) = U\mathcal D_\lambda(\rho)U^\dagger.

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 γ1\gamma_1 and γ2\gamma_2, the total decay probability is

γtot=1−(1−γ2)(1−γ1),\gamma_{\mathrm{tot}} = 1-(1-\gamma_2)(1-\gamma_1),

not γ1+γ2\gamma_1+\gamma_2 except to first order when both probabilities are small.

A fixed state of a channel Φ\Phi is a density operator ρ∗\rho_\ast satisfying

Φ(ρ∗)=ρ∗.\Phi(\rho_\ast) = \rho_\ast.

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 ρ1\rho_1 and ρ2\rho_2 are fixed, then any mixture

pρ1+(1−p)ρ2,0≤p≤1,p\rho_1+(1-p)\rho_2, \qquad 0\le p\le1,

is also fixed.

Examples:

ChannelFixed states
identity channelevery state
unitary channel UρU†U\rho U^\daggerstates commuting with UU
projective dephasingstates block diagonal in the measured decomposition
depolarizing with λ≠1\lambda\ne1the maximally mixed state I/dI/d
zero-temperature amplitude damping with γ>0\gamma\gt0the ground state ∣0⟩⟨0∣\lvert0\rangle\langle0\rvert
thermal oscillator dampingthe thermal state of the oscillator
pure bosonic lossthe 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.

The adjoint channel Φ†\Phi^\dagger acts on observables:

Tr⁡ ⁣[AΦ(ρ)]=Tr⁡ ⁣[Φ†(A)ρ].\operatorname{Tr} \!\left[ A\Phi(\rho) \right] = \operatorname{Tr} \!\left[ \Phi^\dagger(A)\rho \right].

A fixed observable satisfies

Φ†(A)=A.\Phi^\dagger(A)=A.

This means that the expectation value of AA is conserved under the channel:

Tr⁡[AΦ(ρ)]=Tr⁡[Aρ]\operatorname{Tr}[A\Phi(\rho)] = \operatorname{Tr}[A\rho]

for all input states ρ\rho.

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.

A fixed state need not attract all initial states. Attraction is an asymptotic statement:

lim⁡n→∞Φn(ρ)=ρ∗.\lim_{n\to\infty} \Phi^n(\rho) = \rho_\ast.

In finite dimensions, represent Φ\Phi as a linear map on the vector space of operators. If

Φ(Xα)=λαXα,\Phi(X_\alpha) = \lambda_\alpha X_\alpha,

then XαX_\alpha is an eigenoperator and λα\lambda_\alpha is a channel eigenvalue. Fixed operators have λα=1\lambda_\alpha=1. Decaying modes have ∣λα∣<1|\lambda_\alpha|\lt1.

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 λ=1\lambda=1 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 ∣λα∣|\lambda_\alpha| below one.

In a finite-dimensional calculation, the fixed-point problem is linear before the positivity constraint is imposed:

(Φ−I)(X)=0.(\Phi-I)(X)=0.

A practical workflow is:

  1. choose a basis of operators or a superoperator matrix SΦS_\Phi;
  2. solve
(SΦ−I)∣X⟩⟩=0;(S_\Phi-I)\lvert X\rangle\rangle=0;
  1. restrict to Hermitian XX with Tr⁡X=1\operatorname{Tr}X=1;
  2. keep the positive semidefinite solutions.

For a qubit affine Bloch-vector map

r′=Ar+c,\mathbf r' = A\mathbf r+\mathbf c,

a fixed point satisfies

(I−A)r∗=c.(I-A)\mathbf r_\ast = \mathbf c.

If I−AI-A is invertible, the fixed Bloch vector is unique. If I−AI-A 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 A=λI3A=\lambda I_3 and c=0\mathbf c=0, so r∗=0\mathbf r_\ast=0 when λ≠1\lambda\ne1;
  • 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.

Some channels satisfy

Φ2=Φ.\Phi^2=\Phi.

These are idempotent channels. After one application, the state is already in the fixed set.

The standard example is nonselective projective measurement:

Φ(ρ)=∑aPaρPa.\Phi(\rho) = \sum_a P_a\rho P_a.

Applying the same nonselective measurement again does nothing:

Φ(Φ(ρ))=Φ(ρ).\Phi(\Phi(\rho)) = \Phi(\rho).

The fixed states are exactly those block diagonal in the measured decomposition:

ρ=∑aPaρPa.\rho = \sum_a P_a\rho P_a.

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.

For a continuous-time Markovian semigroup

Φt=etL,\Phi_t=e^{t\mathcal L},

a steady state satisfies

L(ρss)=0.\mathcal L(\rho_{\mathrm{ss}})=0.

It is then fixed by every time-tt channel:

Φt(ρss)=ρsst≥0.\Phi_t(\rho_{\mathrm{ss}}) = \rho_{\mathrm{ss}} \qquad t\ge0.

The converse needs care. A state fixed by one finite-time map ΦT\Phi_T need not be stationary for all tt. 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.

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?”

  • Reading Ψ∘Φ\Psi\circ\Phi left to right instead of applying Φ\Phi first.
  • Composing finite-step error probabilities by ordinary addition outside the small-probability limit.
  • Treating tensor-product noise ΦA⊗ΦB\Phi_A\otimes\Phi_B 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.
  • 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).
  1. Composite Kraus operators. Suppose Φ\Phi has Kraus operators {Kα}\{K_\alpha\} and Ψ\Psi has Kraus operators {Lβ}\{L_\beta\}. Prove that {LβKα}β,α\{L_\beta K_\alpha\}_{\beta,\alpha} is a Kraus representation of Ψ∘Φ\Psi\circ\Phi.
Solution

Insert the Kraus form of Φ\Phi into Ψ\Psi:

(Ψ∘Φ)(ρ)=Ψ(∑αKαρKα†)=∑β,αLβKαρKα†Lβ†.\begin{aligned} (\Psi\circ\Phi)(\rho) &= \Psi \left( \sum_\alpha K_\alpha\rho K_\alpha^\dagger \right)\\ &= \sum_{\beta,\alpha} L_\beta K_\alpha \rho K_\alpha^\dagger L_\beta^\dagger. \end{aligned}

Thus the composite Kraus operators are Mβα=LβKαM_{\beta\alpha}=L_\beta K_\alpha. If both channels are trace preserving, then

∑β,αMβα†Mβα=I,\sum_{\beta,\alpha} M_{\beta\alpha}^\dagger M_{\beta\alpha} = I,

as shown in the main text.

  1. Depolarizing powers. Let Dλ(ρ)=I/d+λ(ρ−I/d)\mathcal D_\lambda(\rho)=I/d+\lambda(\rho-I/d). Show that Dλn=Dλn\mathcal D_\lambda^n=\mathcal D_{\lambda^n}.
Solution

Write ρ=I/d+τ\rho=I/d+\tau with Tr⁡τ=0\operatorname{Tr}\tau=0. Then

Dλ(ρ)=Id+λτ.\mathcal D_\lambda(\rho) = \frac{I}{d} + \lambda\tau.

After nn applications,

τ↦λnτ.\tau \mapsto \lambda^n\tau.

Therefore

Dλn(ρ)=Id+λn(ρ−Id)=Dλn(ρ).\mathcal D_\lambda^n(\rho) = \frac{I}{d} + \lambda^n \left( \rho-\frac{I}{d} \right) = \mathcal D_{\lambda^n}(\rho).
  1. Amplitude-damping probabilities. Two amplitude-damping channels in the same basis have decay probabilities γ1\gamma_1 and γ2\gamma_2. Find the total decay probability.
Solution

The excited population survives the first channel with probability 1−γ11-\gamma_1 and the second with probability 1−γ21-\gamma_2. The total survival probability is

(1−γ2)(1−γ1).(1-\gamma_2)(1-\gamma_1).

Therefore the total decay probability is

γtot=1−(1−γ2)(1−γ1).\gamma_{\mathrm{tot}} = 1-(1-\gamma_2)(1-\gamma_1).

For small probabilities, this is approximately γ1+γ2\gamma_1+\gamma_2, but the exact expression includes the product term.

  1. Fixed states of dephasing. Let Φ(ρ)=∑aPaρPa\Phi(\rho)=\sum_a P_a\rho P_a for orthogonal projectors {Pa}\{P_a\} with ∑aPa=I\sum_aP_a=I. Show that ρ\rho is fixed exactly when it is block diagonal in this decomposition.
Solution

Decompose the state into blocks:

ρ=∑a,bPaρPb.\rho = \sum_{a,b} P_a\rho P_b.

The channel removes the off-block terms:

Φ(ρ)=∑aPaρPa.\Phi(\rho) = \sum_a P_a\rho P_a.

Thus Φ(ρ)=ρ\Phi(\rho)=\rho exactly when

PaρPb=0a≠b.P_a\rho P_b=0 \qquad a\ne b.

That is the statement that ρ\rho is block diagonal in the projective decomposition.

  1. 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:

Φ(ρ)=ρ.\Phi(\rho)=\rho.

Every state is fixed, so there is no unique attracting state. A less trivial example is a unitary channel Φ(ρ)=UρU†\Phi(\rho)=U\rho U^\dagger. States that commute with UU are fixed, while coherences between different eigenvalue sectors generally rotate rather than decay.