Density matrix basics
Cette page n'a pas encore été traduite. Vous voyez la version originale en anglais.
We'll begin by describing what density matrices are in mathematical terms, and then we'll take a look at some examples. After that, we'll discuss a few basic aspects of how density matrices work and how they relate to quantum state vectors in the simplified formulation of quantum information.
Definition
Suppose that we have a quantum system named and let be the (finite and nonempty) classical state set of this system. Here we're mirroring the naming conventions used in the "Basics of quantum information" course, which we'll continue to do when the opportunity arises.
In the general formulation of quantum information, a quantum state of the system is described by a density matrix whose entries are complex numbers and whose indices (for both its rows and columns) have been placed in correspondence with the classical state set The lowercase Greek letter is a conventional first choice for the name of a density matrix, although and are also common choices.
Here are a few examples of density matrices that describe states of qubits:
To say that is a density matrix means that these two conditions, which will be explained momentarily, are both satisfied:
- Unit trace:
- Positive semidefiniteness:
The trace of a matrix
The first condition on density matrices refers to the trace of a matrix. This is a function that is defined, for all square matrices, as the sum of the diagonal entries:
The trace is a linear function: for any two square matrices and of the same size, and any two complex numbers and the following equation is always true.
The trace is an extremely important function and there's a lot more that can be said about it, but we'll wait until the need arises to say more.
Positive semidefinite matrices
The second condition refers to the property of a matrix being positive semidefinite, which is a fundamental concept in quantum information theory and in many other subjects. A matrix is positive semidefinite if there exists a matrix such that
Here we can either demand that is a square matrix of the same size as or allow it to be non-square — we obtain the same class of matrices either way.
There are several alternative (but equivalent) ways to define this condition, including these:
-
A matrix is positive semidefinite if and only if is Hermitian (that is, equal to its own conjugate transpose) and all of its eigenvalues are nonnegative real numbers. Checking that a matrix is Hermitian and all of its eigenvalues are nonnegative is a simple computational way to verify that it's positive semidefinite.
-
A matrix is positive semidefinite if and only if for every complex vector having the same indices as the rows and columns of
An intuitive way to think about positive semidefinite matrices is that they're like matrix analogues of nonnegative real numbers. That is, positive semidefinite matrices are to complex square matrices as nonnegative real numbers are to complex numbers. For example, a complex number is a nonnegative real number if and only if
for some complex number which matches the definition of positive semidefiniteness when we replace matrices with scalars. While matrices are more complicated objects than scalars in general, this is nevertheless a helpful way to think about positive semidefinite matrices.
This also explains the common notation which indicates that is positive semidefinite. Notice in particular that does not mean that each entry of is nonnegative in this context; there are positive semidefinite matrices having negative entries, as well as matrices whose entries are all positive that are not positive semidefinite.
Interpretation of density matrices
At this point, the definition of density matrices may seem rather arbitrary and abstract, as we have not yet associated any meaning with these matrices or their entries. The way density matrices work and can be interpreted will be clarified as the lesson continues, but for now it may be helpful to think about the entries of density matrices in the following (somewhat informal) way.
-
The diagonal entries of a density matrix give us the probabilities for each classical state to appear if we perform a standard basis measurement — so we can think about these entries as describing the "weight" or "likelihood" associated with each classical state.
-
The off-diagonal entries of a density matrix describe the degree to which the two classical states corresponding to that entry (meaning the one corresponding to the row and the one corresponding to the column) are in quantum superposition, as well as the relative phase between them.
It is certainly not obvious a priori that quantum states should be represented by density matrices. Indeed, there is a sense in which the choice to represent quantum states by density matrices leads naturally to the entire mathematical description of quantum information. Everything else about quantum information actually follows pretty logically from this one choice!
Connection to quantum state vectors
Recall that a quantum state vector describing a quantum state of is a column vector having Euclidean norm equal to whose entries have been placed in correspondence with the classical state set The density matrix representation of the same state is defined as follows.