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 exchangedamping population relaxation, usually with energy exchangedepolarizing symmetric benchmark randomizationPauli noise stochastic Pauli conjugationserasure/loss known loss event or attenuation into inaccessible modesGaussian noise continuous-variable noise preserving Gaussian statesThis 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 – 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.
Channel Language
Section titled “Channel Language”A deterministic noise model is a completely positive, trace-preserving map
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 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.
Quick Comparison
Section titled “Quick Comparison”| Channel | Basic action | Physical reading | Main caution |
|---|---|---|---|
| dephasing | suppresses off-diagonal terms in a preferred basis | phase randomization, unread which-path information, low-frequency noise | basis dependent |
| Pauli | applies stochastic conjugations | error models, stabilizer simulations, twirled noise | unital and often approximate |
| depolarizing | shrinks the state toward | symmetric benchmark noise | rarely microscopic |
| amplitude damping | transfers excited population to lower states | zero-temperature relaxation, spontaneous emission, process | not a Pauli channel |
| thermal damping | relaxes toward a Gibbs state | finite-temperature bath | needs bath temperature and detailed balance |
| erasure | replaces the state by a flagged loss state | known loss event | output Hilbert space changes |
| bosonic loss | attenuates field amplitude | photon loss, imperfect transmission | not the same as qubit erasure |
| Gaussian additive noise | broadens quadrature uncertainty | continuous-variable classical noise or thermal background | convention 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 Channel
Section titled “Dephasing Channel”Dephasing suppresses coherence in a preferred basis while leaving populations fixed. For a qubit in the basis, a common phase-flip form is
For
the output is
Often one writes the coherence factor as :
For Markovian pure dephasing, 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.
Depolarizing Channel
Section titled “Depolarizing Channel”The depolarizing channel is an isotropic benchmark model. In the replacement-probability convention for a -dimensional system,
For a qubit Bloch vector,
this gives
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
Section titled “Amplitude Damping”Amplitude damping models irreversible relaxation from an excited state to a lower state. For a qubit with excited and ground, a standard zero-temperature Kraus representation is
The channel is
It maps
Amplitude damping is trace preserving but not unital. It moves the maximally mixed state toward the ground state. For exponential relaxation one often writes
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
Section titled “Thermal Damping”Thermal damping describes relaxation toward a finite-temperature equilibrium state
For a qubit, this means both downward and upward transitions occur, with rates constrained by detailed balance:
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.
Erasure and Flagged Loss
Section titled “Erasure and Flagged Loss”The erasure channel represents a known loss event. The output space contains the original Hilbert space plus an orthogonal flag state :
For erasure probability ,
The receiver knows whether erasure occurred because 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.
Bosonic Loss
Section titled “Bosonic Loss”For an optical or oscillator mode, loss is often modeled by coupling the mode to an environment mode through a beam splitter of transmissivity . In the Heisenberg picture,
where 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.
Gaussian Channels
Section titled “Gaussian Channels”Continuous-variable systems are often described by quadratures
A Gaussian channel maps Gaussian states to Gaussian states. At the level of first moments and covariance matrices , it has the form
The matrices and must satisfy a complete-positivity inequality determined by the symplectic form and the convention for . 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.
Pauli Channels
Section titled “Pauli Channels”For a qubit, a Pauli channel has the form
where and are .
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.
Coherent Errors and Stochastic Errors
Section titled “Coherent Errors and Stochastic Errors”A coherent control error may be a unitary channel:
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.
How to Choose a Model
Section titled “How to Choose a Model”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.
Common Mistakes
Section titled “Common Mistakes”- 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.
References
Section titled “References”- 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).
Exercises
Section titled “Exercises”- Dephasing matrix form. Starting from , derive the matrix form of the qubit dephasing channel in the basis.
Solution
Since
we get
The populations are unchanged, and the coherences are multiplied by .
- Amplitude damping is not unital. Use the amplitude-damping Kraus operators to compute .
Solution
Apply the matrix formula with and :
This equals only when . Thus amplitude damping is not unital.
- Kraus operators for erasure. Let be an input basis and let embed the input Hilbert space into the non-erased output subspace. Show that
defines a trace-preserving erasure channel.
Solution
Compute the completeness relation:
and
Therefore
The channel is trace preserving. Its output is the original state in the embedded subspace with probability and the flagged erasure state with probability .