Q-function
Statistics function

In statistics, the Q-function is the tail distribution function of the standard normal distribution. In other words, is the probability that a normal (Gaussian) random variable will obtain a value larger than
standard deviations. Equivalently,
is the probability that a standard normal random variable takes a value larger than
.
If is a Gaussian random variable with mean
and variance
, then
is standard normal and
where .
Other definitions of the Q-function, all of which are simple transformations of the normal cumulative distribution function, are also used occasionally.
Because of its relation to the cumulative distribution function of the normal distribution, the Q-function can also be expressed in terms of the error function, which is an important function in applied mathematics and physics.
01Definition and basic properties
Formally, the Q-function is defined as
Thus,
where is the cumulative distribution function of the standard normal Gaussian distribution.
The Q-function can be expressed in terms of the error function, or the complementary error function, as
An alternative form of the Q-function known as Craig's formula, after its discoverer, is expressed as:
The above proper integral form of Q-function, has been incorrectly credited to Craig. This form of Q-function was implied in earlier works by Wiesten , and explicitly stated by Pawula, Rice and Roberts.
This expression is valid only for positive values of x, but it can be used in conjunction with Q(x) = 1 − Q(−x) to obtain Q(x) for negative values. This form is advantageous in that the range of integration is fixed and finite.
Craig's formula was later extended by Behnad (2020) for the Q-function of the sum of two non-negative variables, as follows:

02Bounds and approximations
- The Q-function is not an elementary function. However, it can be upper and lower bounded as,
- where
is the density function of the standard normal distribution, and the bounds become increasingly tight for large x.
- Using the substitution v =u2/2, the upper bound is derived as follows:
- Similarly, using
and the quotient rule,
- Solving for Q(x) provides the lower bound.
- The geometric mean of the upper and lower bound gives a suitable approximation for
:
- Tighter bounds and approximations of
can also be obtained by optimizing the following expression
- For
, the best upper bound is given by
and
with maximum absolute relative error of 0.44%. Likewise, the best approximation is given by
and
with maximum absolute relative error of 0.27%. Finally, the best lower bound is given by
and
with maximum absolute relative error of 1.17%.
- The Chernoff bound of the Q-function is
- Improved exponential bounds and a pure exponential approximation are
- The above were generalized by Tanash & Riihonen (2020), who showed that
can be accurately approximated or bounded by
- In particular, they presented a systematic methodology to solve the numerical coefficients
that yield a minimax approximation or bound:
,
, or
for
. With the example coefficients tabulated in the paper for
, the relative and absolute approximation errors are less than
and
, respectively. The coefficients
for many variations of the exponential approximations and bounds up to
have been released to open access as a comprehensive dataset.
- Another approximation of
for
is given by Karagiannidis & Lioumpas (2007) who showed for the appropriate choice of parameters
that
- The absolute error between
and
over the range
is minimized by evaluating
- Using
and numerically integrating, they found the minimum error occurred when
which gave a good approximation for
- Substituting these values and using the relationship between
and
from above gives
- Alternative coefficients are also available for the above 'Karagiannidis-Lioumpas approximation' for tailoring accuracy for a specific application or transforming it into a tight bound.
- A tighter and more tractable approximation of
for positive arguments
is given by López-Benítez & Casadevall (2011) based on a second-order exponential function:
- The fitting coefficients
can be optimized over any desired range of arguments in order to minimize the sum of square errors (
,
,
for
) or minimize the maximum absolute error (
,
,
for
). This approximation offers some benefits such as a good trade-off between accuracy and analytical tractability (for example, the extension to any arbitrary power of
is trivial and does not alter the algebraic form of the approximation).
- A pair of tight lower and upper bounds on the Gaussian Q-function for positive arguments
was introduced by Abreu (2012) based on a simple algebraic expression with only two exponential terms:
These bounds are derived from a unified form , where the parameters
and
are chosen to satisfy specific conditions ensuring the lower (
,
) and upper (
,
) bounding properties. The resulting expressions are notable for their simplicity and tightness, offering a favorable trade-off between accuracy and mathematical tractability. These bounds are particularly useful in theoretical analysis, such as in communication theory over fading channels. Additionally, they can be extended to bound
for positive integers
using the binomial theorem, maintaining their simplicity and effectiveness.
03Inverse Q
The inverse Q-function can be related to the inverse error functions:
The function finds application in digital communications. It is usually expressed in dB and generally called Q-factor:
where y is the bit-error rate (BER) of the digitally modulated signal under analysis. For instance, for quadrature phase-shift keying (QPSK) in additive white Gaussian noise, the Q-factor defined above coincides with the value in dB of the signal to noise ratio that yields a bit error rate equal to y.

04Values
The Q-function is well tabulated and can be computed directly in most of the mathematical software packages such as R and those available in Python, MATLAB and Mathematica. Some values of the Q-function are given below for reference.
|
|
|
|
05Generalization to high dimensions
The Q-function can be generalized to higher dimensions:
where follows the multivariate normal distribution with covariance
and the threshold is of the form
for some positive vector
and positive constant
. As in the one dimensional case, there is no simple analytical formula for the Q-function. Nevertheless, the Q-function can be approximated arbitrarily well as
becomes larger and larger.
Sources and credits
This article is adapted from the Wikipedia article “Q-function”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Images, from Wikimedia Commons:
- Q-function.png by Zvika, Public domain
- Q function complex plot plotted with Mathematica 13.1 ComplexPlot3D.svg by WalkingRadiance, CC BY-SA 4.0
- Q-factor vs BER.png by Paolostar, CC BY-SA 4.0
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.