Skip to content

Common Noise Channels

Noise channels are effective maps for how a quantum state changes when uncontrolled degrees of freedom are ignored, randomized, lost, or only partially observed. They are not all the same physical mechanism.

The most useful first classification is:

dephasing loss of phase coherence without energy exchange
damping population relaxation, usually with energy exchange
depolarizing symmetric benchmark randomization
Pauli noise stochastic Pauli conjugations
erasure/loss known loss event or attenuation into inaccessible modes
Gaussian noise continuous-variable noise preserving Gaussian states

This page is a map of standard models. It emphasizes what each model means, which assumptions are built in, and which mistakes to avoid.

Common Noise Models is the complementary device-facing reference. It owns simulator parameter conversions, matched T1T_1–T2T_2 composition, leakage and seepage population models, coherent overrotation cards, and correlation checks. This open-systems page remains the canonical home for the channel constructions and physical distinctions.

A deterministic noise model is a completely positive, trace-preserving map

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

The Kraus representation is one way to write the channel. The Stinespring representation writes it as a reversible system-environment interaction followed by discarding the environment. The physical noise model is the map Φ\Phi together with an interpretation of the system, basis, timescale, and environment.

A selected measurement branch is instead trace nonincreasing before normalization. That belongs to an instrument, not to a deterministic channel by itself.

For reproducible finite-dimensional checks of these maps, use Simulating Quantum Channels.

For serial noise models, repeated channel powers, and invariant states, see Channel Composition and Fixed Points.

ChannelBasic actionPhysical readingMain caution
dephasingsuppresses off-diagonal terms in a preferred basisphase randomization, unread which-path information, low-frequency noisebasis dependent
Pauliapplies stochastic I,X,Y,ZI,X,Y,Z conjugationserror models, stabilizer simulations, twirled noiseunital and often approximate
depolarizingshrinks the state toward I/dI/dsymmetric benchmark noiserarely microscopic
amplitude dampingtransfers excited population to lower stateszero-temperature relaxation, spontaneous emission, T1T_1 processnot a Pauli channel
thermal dampingrelaxes toward a Gibbs statefinite-temperature bathneeds bath temperature and detailed balance
erasurereplaces the state by a flagged loss stateknown loss eventoutput Hilbert space changes
bosonic lossattenuates field amplitudephoton loss, imperfect transmissionnot the same as qubit erasure
Gaussian additive noisebroadens quadrature uncertaintycontinuous-variable classical noise or thermal backgroundconvention dependent

No table can determine the correct model by itself. One must know which degrees of freedom are ignored, which basis is physically selected, and whether the noise is Markovian, correlated, or conditioned on a record.

Dephasing suppresses coherence in a preferred basis while leaving populations fixed. For a qubit in the ZZ basis, a common phase-flip form is

Φp(ρ)=(1−p)ρ+pZρZ,0≤p≤1.\Phi_p(\rho) = (1-p)\rho+pZ\rho Z, \qquad 0\le p\le1.

For

ρ=(ρ00ρ01ρ10ρ11),\rho= \begin{pmatrix} \rho_{00}&\rho_{01}\\ \rho_{10}&\rho_{11} \end{pmatrix},

the output is

Φp(ρ)=(ρ00(1−2p)ρ01(1−2p)ρ10ρ11).\Phi_p(\rho) = \begin{pmatrix} \rho_{00}&(1-2p)\rho_{01}\\ (1-2p)\rho_{10}&\rho_{11} \end{pmatrix}.

Often one writes the coherence factor as λ\lambda:

ρ01⟼λρ01,∣λ∣≤1.\rho_{01}\longmapsto \lambda\rho_{01}, \qquad |\lambda|\le1.

For Markovian pure dephasing, λ=e−Γϕt\lambda=e^{-\Gamma_\phi t} in an appropriate convention. See Dephasing Channel for the canonical channel formulas.

Physical sources include fluctuating energy splittings, which-path information leaking into an environment, nonselective measurement in the dephasing basis, and random phases accumulated over an ensemble.

The main warning: dephasing is always dephasing in some basis. If the Hamiltonian basis changes or the noise couples through another operator, the channel may not be diagonal in the computational basis.

The depolarizing channel is an isotropic benchmark model. In the replacement-probability convention for a dd-dimensional system,

Dq(ρ)=(1−q)ρ+qId,0≤q≤1.\mathcal D_q(\rho) = (1-q)\rho+q\frac{I}{d}, \qquad 0\le q\le1.

For a qubit Bloch vector,

ρ=12(I+r⋅σ),\rho = \frac12 \left( I+\mathbf r\cdot\boldsymbol\sigma \right),

this gives

r⟼(1−q)r.\mathbf r\longmapsto (1-q)\mathbf r.

The channel treats all Bloch-sphere directions equally. This makes it convenient for benchmarking, randomized models, and simple estimates.

It is not a generic model of laboratory noise. Energy relaxation, leakage, coherent calibration errors, and correlated crosstalk are not automatically depolarizing. Also check conventions: the Pauli-error probability convention differs from the replacement-probability convention. See Depolarizing Channel for the canonical discussion and the reference model card for a compact formula.

Amplitude damping models irreversible relaxation from an excited state to a lower state. For a qubit with ∣1⟩|1\rangle excited and ∣0⟩|0\rangle ground, a standard zero-temperature Kraus representation is

K0=(1001−γ),K1=(0γ00).K_0 = \begin{pmatrix} 1&0\\ 0&\sqrt{1-\gamma} \end{pmatrix}, \qquad K_1 = \begin{pmatrix} 0&\sqrt{\gamma}\\ 0&0 \end{pmatrix}.

The channel is

Aγ(ρ)=K0ρK0†+K1ρK1†.\mathcal A_\gamma(\rho) = K_0\rho K_0^\dagger + K_1\rho K_1^\dagger.

It maps

ρ=(ρ00ρ01ρ10ρ11)⟼(ρ00+γρ111−γρ011−γρ10(1−γ)ρ11).\rho = \begin{pmatrix} \rho_{00}&\rho_{01}\\ \rho_{10}&\rho_{11} \end{pmatrix} \quad\longmapsto\quad \begin{pmatrix} \rho_{00}+\gamma\rho_{11} & \sqrt{1-\gamma}\rho_{01}\\ \sqrt{1-\gamma}\rho_{10} & (1-\gamma)\rho_{11} \end{pmatrix}.

Amplitude damping is trace preserving but not unital. It moves the maximally mixed state toward the ground state. For exponential relaxation one often writes

γ(t)=1−e−t/T1.\gamma(t)=1-e^{-t/T_1}.

Use this model when zero-temperature relaxation is the intended approximation. If upward transitions are relevant, use a thermal or generalized amplitude-damping model instead. See Amplitude-Damping Channel for the canonical discussion and the reference model card for a compact formula.

Thermal damping describes relaxation toward a finite-temperature equilibrium state

ρβ=e−βHZ,Z=Tr⁡e−βH.\rho_\beta = \frac{e^{-\beta H}}{Z}, \qquad Z=\operatorname{Tr}e^{-\beta H}.

For a qubit, this means both downward and upward transitions occur, with rates constrained by detailed balance:

Γ↑Γ↓=e−βℏω.\frac{\Gamma_\uparrow}{\Gamma_\downarrow} = e^{-\beta\hbar\omega}.

In a Markovian approximation, thermal damping is usually described by a thermal master equation rather than a single memorized finite-time formula. The finite-time channel depends on the Hamiltonian, temperature, coupling operator, and approximations used.

The warning is simple: do not use zero-temperature amplitude damping when the bath can thermally excite the system.

The erasure channel represents a known loss event. The output space contains the original Hilbert space plus an orthogonal flag state ∣e⟩|e\rangle:

Hout=Hin⊕C∣e⟩.\mathcal H_{\mathrm{out}} = \mathcal H_{\mathrm{in}}\oplus\mathbb C|e\rangle.

For erasure probability pp,

Ep(ρ)=(1−p)ρ+p Tr⁡(ρ)∣e⟩⟨e∣.\mathcal E_p(\rho) = (1-p)\rho + p\,\operatorname{Tr}(\rho)|e\rangle\langle e|.

The receiver knows whether erasure occurred because ∣e⟩|e\rangle is orthogonal to all valid input states.

This is different from unknown depolarizing noise. In erasure noise, the damage location is flagged; the quantum information may be gone, but the event is identifiable.

See Erasure and Loss Channels for the full distinction between flagged erasure, postselected survival, leakage, detector inefficiency, and bosonic attenuation.

For an optical or oscillator mode, loss is often modeled by coupling the mode to an environment mode through a beam splitter of transmissivity η\eta. In the Heisenberg picture,

aout=η ain+1−η ein,a_{\mathrm{out}} = \sqrt{\eta}\,a_{\mathrm{in}} + \sqrt{1-\eta}\,e_{\mathrm{in}},

where eine_{\mathrm{in}} is an environment annihilation operator.

If the environment is vacuum, this is the pure-loss channel. If the environment is thermal, the channel adds thermal noise as well as attenuation.

Bosonic loss is not the same as a qubit erasure channel. The photon number changes probabilistically, and the loss event is not necessarily flagged.

The channel-level loss conventions are developed in Erasure and Loss Channels.

Continuous-variable systems are often described by quadratures

R=(q1,p1,…,qn,pn).R=(q_1,p_1,\ldots,q_n,p_n).

A Gaussian channel maps Gaussian states to Gaussian states. At the level of first moments dd and covariance matrices VV, it has the form

d⟼Xd+d0,V⟼XVXT+Y.d\longmapsto Xd+d_0, \qquad V\longmapsto XVX^{\mathsf T}+Y.

The matrices XX and YY must satisfy a complete-positivity inequality determined by the symplectic form and the convention for ℏ\hbar. Physically important examples include pure loss, amplification, additive classical noise, and thermal noise.

Gaussian channels are powerful because many optical and oscillator noise models stay inside the Gaussian sector. They are also limited: photon counting, strong nonlinearities, and non-Gaussian state preparation require more than covariance-matrix dynamics.

See Gaussian Channels for the complete-positivity condition, attenuation and amplification formulas, and convention warnings.

For a qubit, a Pauli channel has the form

Φ(ρ)=∑μ=03pμσμρσμ,∑μ=03pμ=1,\Phi(\rho) = \sum_{\mu=0}^3 p_\mu \sigma_\mu\rho\sigma_\mu, \qquad \sum_{\mu=0}^3p_\mu=1,

where σ0=I\sigma_0=I and σ1,σ2,σ3\sigma_1,\sigma_2,\sigma_3 are X,Y,ZX,Y,Z.

Pauli channels are unital and diagonal in the Pauli operator basis. They are useful in quantum error correction and randomized noise models, but coherent errors, amplitude damping, leakage, and many correlated errors are not Pauli channels without additional twirling or approximation.

See Pauli Channels for the Bloch-vector eigenvalues, complete-positivity tetrahedron, and multiqubit Pauli-string conventions.

A coherent control error may be a unitary channel:

ρ⟼UerrρUerr†.\rho\longmapsto U_{\mathrm{err}}\rho U_{\mathrm{err}}^\dagger.

This is a valid channel, but it is not stochastic noise. Repeated coherent over-rotations can add systematically rather than diffusively.

Randomizing, averaging, or twirling coherent errors can produce an effective stochastic channel, but that is an additional physical or protocol assumption. Do not replace coherent error by depolarizing noise unless the approximation has been justified.

Noise, Channels, and Error Mitigation owns the operational choice from mechanism and context through diagnostic evidence, intervention, and cost; this page retains the channel constructions, parameter conventions, characteristic actions, and general mathematical comparisons.

Before choosing a noise channel, ask:

  • What is the system Hilbert space, and can population leave it?
  • Which basis is selected by the Hamiltonian, apparatus, or coupling operator?
  • Is energy exchanged with the environment, or only phase information?
  • Is the bath effectively zero temperature or finite temperature?
  • Is the loss event flagged, unflagged, or only partially observed?
  • Are errors independent, correlated in time, or correlated across subsystems?
  • Is the channel meant as a microscopic model, an effective fit, or a benchmark?
  • Are coherent calibration errors being averaged into a stochastic model?

These questions are often more important than the formula. The same algebraic channel can represent different experiments, and similar experiments can require different channels.

  • Calling every decay of off-diagonal elements “depolarizing.”
  • Using amplitude damping for finite-temperature relaxation without upward transitions.
  • Treating depolarizing noise as realistic merely because it is mathematically simple.
  • Confusing qubit erasure with bosonic photon loss.
  • Ignoring leakage out of the computational subspace.
  • Assuming independent single-qubit channels when the environment creates correlated noise.
  • Reading a Kraus representation as a unique set of physical histories.
  • Fitting a channel outside the domain where the Markovian approximation is valid.
  • M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2010).
  • H.-P. Breuer and F. Petruccione, The Theory of Open Quantum Systems, Oxford University Press (2002).
  • Á. Rivas and S. F. Huelga, Open Quantum Systems: An Introduction, Springer (2012).
  • A. S. Holevo, Quantum Systems, Channels, Information, De Gruyter (2012).
  • M. M. Wilde, Quantum Information Theory, Cambridge University Press, 2nd ed. (2017).
  • C. W. Gardiner and P. Zoller, Quantum Noise, Springer, 3rd ed. (2004).
  1. Dephasing matrix form. Starting from Φp(ρ)=(1−p)ρ+pZρZ\Phi_p(\rho)=(1-p)\rho+pZ\rho Z, derive the matrix form of the qubit dephasing channel in the ZZ basis.
Solution

Since

Z(ρ00ρ01ρ10ρ11)Z=(ρ00−ρ01−ρ10ρ11),Z \begin{pmatrix} \rho_{00}&\rho_{01}\\ \rho_{10}&\rho_{11} \end{pmatrix} Z = \begin{pmatrix} \rho_{00}&-\rho_{01}\\ -\rho_{10}&\rho_{11} \end{pmatrix},

we get

Φp(ρ)=(ρ00(1−2p)ρ01(1−2p)ρ10ρ11).\Phi_p(\rho) = \begin{pmatrix} \rho_{00}&(1-2p)\rho_{01}\\ (1-2p)\rho_{10}&\rho_{11} \end{pmatrix}.

The populations are unchanged, and the coherences are multiplied by 1−2p1-2p.

  1. Amplitude damping is not unital. Use the amplitude-damping Kraus operators to compute Aγ(I/2)\mathcal A_\gamma(I/2).
Solution

Apply the matrix formula with ρ00=ρ11=1/2\rho_{00}=\rho_{11}=1/2 and ρ01=0\rho_{01}=0:

Aγ(I/2)=((1+γ)/200(1−γ)/2).\mathcal A_\gamma(I/2) = \begin{pmatrix} (1+\gamma)/2&0\\ 0&(1-\gamma)/2 \end{pmatrix}.

This equals I/2I/2 only when γ=0\gamma=0. Thus amplitude damping is not unital.

  1. Kraus operators for erasure. Let {∣j⟩}j=1d\{|j\rangle\}_{j=1}^d be an input basis and let VV embed the input Hilbert space into the non-erased output subspace. Show that
K0=1−p V,Kj=p ∣e⟩⟨j∣K_0=\sqrt{1-p}\,V, \qquad K_j=\sqrt p\,|e\rangle\langle j|

defines a trace-preserving erasure channel.

Solution

Compute the completeness relation:

K0†K0=(1−p)V†V=(1−p)I,K_0^\dagger K_0 = (1-p)V^\dagger V =(1-p)I,

and

∑j=1dKj†Kj=p∑j=1d∣j⟩⟨j∣=pI.\sum_{j=1}^dK_j^\dagger K_j = p\sum_{j=1}^d|j\rangle\langle j| = pI.

Therefore

K0†K0+∑j=1dKj†Kj=I.K_0^\dagger K_0 + \sum_{j=1}^dK_j^\dagger K_j =I.

The channel is trace preserving. Its output is the original state in the embedded subspace with probability 1−p1-p and the flagged erasure state with probability pp.