Common Noise Channels
A noise channel predicts how a state changes when uncontrolled degrees of freedom are ignored. Dephasing changes relative phases, amplitude damping transfers population, and erasure produces an identifiable loss flag. Choosing among them requires specifying the system, its basis, and what is observed. This page compares the models; the linked articles derive each channel in detail.
Helpful background. Kraus operators express a channel as a sum of matrix operations. Density operators describe both pure and mixed input states.
For device parameters, combined – models, and leakage rates, see Common Noise Models.
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.
Comparing channel actions
Section titled “Comparing channel actions”| Channel | Action | Physical interpretation and limits |
|---|---|---|
| dephasing | preserves populations in a chosen basis | No energy change only when that basis is compatible with the Hamiltonian. |
| Pauli | randomly conjugates by Pauli operators | Unital; multiqubit errors may still be correlated. |
| depolarizing | contracts all directions equally | A symmetric benchmark, seldom a complete microscopic model. |
| amplitude damping | transfers excited population downward | Approximates relaxation with negligible upward transitions. |
| thermal damping | includes upward and downward transitions | Gibbs equilibration requires appropriate bath and weak-coupling assumptions. |
| erasure | replaces the input by an orthogonal flag | The output space is larger, and the loss event can be identified. |
| bosonic loss | attenuates a mode through environmental coupling | Photon loss is not automatically flagged. |
| Gaussian additive noise | adds random quadrature displacements | Distinct from attenuation; covariance conventions matter. |
One input is not enough to identify a channel. For an input , phase flips with and depolarization with both give
Try instead: phase flips leave it unchanged, while depolarization gives . Both channels preserve , whereas amplitude damping with sends it to . Testing several inputs distinguishes mechanisms that a single decay curve cannot.
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 a time-homogeneous pure-dephasing semigroup, in a frame removing the Hamiltonian phase, defines the coherence-decay rate . Complete dephasing occurs at ; is the reversible unitary , not maximal decoherence. See Dephasing Channel for complex coherence factors and dynamical assumptions.
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.
Dephasing is always defined relative to a basis. It preserves mean energy when its projectors commute with the system Hamiltonian; otherwise it can change energy. 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 displayed state formula assumes ; the linear map on arbitrary operators uses . 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 derivation and the reference model card for a compact formula.
Amplitude Damping
Section titled “Amplitude Damping”Amplitude damping describes transfer from an excited state to a lower state, with the transfer probability. For a qubit with excited and ground, a standard zero-temperature Kraus representation is
The channel is
It maps
For , 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 derivation and the reference model card for a compact formula.
Thermal Damping
Section titled “Thermal Damping”For a system weakly coupled to one stationary thermal bath, an appropriate detailed-balance master equation can describe relaxation toward the Gibbs state
For a qubit with level spacing , both downward and upward transitions occur at finite temperature. For , detailed balance gives:
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.
Zero-temperature amplitude damping omits these upward transitions. Strong coupling, driving, or multiple baths need not produce the Gibbs state of the bare system Hamiltonian.
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 , with embedded in the non-erased output subspace,
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,
Here , and is an independent environment-mode annihilation operator, initially uncorrelated with the input. Its contribution is essential: it preserves . Merely replacing by would not.
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
Here , , and are .
Pauli channels are unital and diagonal in the Pauli operator basis. They are useful in quantum error correction and randomized noise models. Nonunital relaxation and general coherent rotations are not Pauli channels; leakage also requires a larger state space. Spatially correlated Pauli errors are possible and must not be confused with independent single-qubit errors.
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.
Choosing a model from the experiment
Section titled “Choosing a model from the experiment”Start with the states and records that the experiment can distinguish. If population leaves the modeled space, decide whether it becomes an observable erasure flag or an unobserved leakage state. If populations relax, determine whether upward transitions matter. If only phase coherence decays, identify the basis and test whether a single exponential describes the relevant time interval.
A one-step channel does not specify correlations between successive uses. Repeating it independently is an additional assumption, as explained in Channel Composition and Fixed Points. Noise, Channels, and Error Mitigation connects these distinctions to experimental diagnostics and correction strategies. For numerical examples, use Simulating Quantum Channels.
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 .
References
Section titled “References”- H.-P. Breuer and F. Petruccione, The Theory of Open Quantum Systems, Oxford University Press (2002). Publisher.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary edition, Cambridge University Press (2010).
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018). Author’s text.