5.1: Introduction to the Density Matrix
- Page ID
- 107237
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)The density matrix or density operator is an alternate representation of the state of a quantum system for which we have previously used the wavefunction. Although describing a quantum system with the density matrix is equivalent to using the wavefunction, one gains significant practical advantages using the density matrix for certain time-dependent problems—particularly relaxation and nonlinear spectroscopy in the condensed phase.
The density matrix is defined as the outer product of the wavefunction with its conjugate.
\[\rho (t) \equiv | \psi (t) \rangle \langle \psi (t) | \label{4.1}\]
This implies that if you specify a state \(| x \rangle\), then \(\langle x | \rho | x \rangle\) gives the probability of finding a particle in the state \(| x \rangle\). Its name derives from the observation that it plays the quantum role of a probability density. If you think of the statistical description of a classical observable obtained from moments of a probability distribution \(P\), then \(ρ\) plays the role of \(P\) in the quantum case:
\[ \begin{align} \langle A \rangle &= \int A P ( A ) d A \label{4.2} \\[4pt] &= \langle \psi | A | \psi \rangle = \operatorname {Tr} [ A \rho ] \label{4.3} \end{align}\]
where \(Tr[…]\) refers to tracing over the diagonal elements of the matrix,
\[T r [ \cdots ] = \sum _ {a} \langle a | \cdots | a \rangle.\]
The last expression is obtained as follows. If the wavefunction for the system is expanded as
\[| \psi (t) \rangle = \sum _ {n} c _ {n} (t) | n \rangle \label{4.4}\]
the expectation value of an operator is
\[\langle \hat {A} (t) \rangle = \sum _ {n , m} c _ {n} (t) c _ {m} ^{*} (t) \langle m | \hat {A} | n \rangle \label{4.5}\]
Also, from Equation \ref{4.1} we obtain the elements of the density matrix as
\[\left.\begin{aligned} \rho (t) & {= \sum _ {n , m} c _ {n} (t) c _ {m} ^{*} (t) | n \rangle \langle m |} \\[4pt] & {\equiv \sum _ {n , m} \rho _ {n m} (t) | n \rangle \langle m |} \end{aligned} \right. \label{4.6}\]
We see that \(\rho_{nm}\), the density matrix elements, are made up of the time-evolving expansion coefficients. Substituting into Equation \ref{4.5} we see that
\[\left.\begin{aligned} \langle \hat {A} (t) \rangle & = \sum _ {n , m} A _ {m n} \rho _ {n m} (t) \\[4pt] & = \operatorname {Tr} [ \hat {A} \rho (t) ] \end{aligned} \right. \label{4.7}\]
In practice this makes evaluating expectation values as simple as tracing over a product of matrices.
What information is in the density matrix elements, \(\rho_{nm}\)? The diagonal elements (\(n = m\)) give the probability of occupying a quantum state:
\[\rho _ {n n} = c _ {n} c _ {n} ^{*} = p _ {n} \geq 0 \label{4.8}\]
For this reason, diagonal elements are referred to as populations. The off-diagonal elements (\(n \neq m\)) are complex and have a time-dependent phase factor
\[ \rho _ {n m} = c _ {n} (t) c _ {m} ^{*} (t) = c _ {n} c _ {m} ^{*} \mathrm {e} ^{- i \omega _ {nm} t} \label{4.9}\]
Since these describe the coherent oscillatory behavior of coherent superpositions in the system, these are referred to as coherences.
So why would we need the density matrix? It becomes a particularly important tool when dealing with mixed states, which we take up later. Mixed states refer to statistical mixtures in which we have imperfect information about the system, for which me must perform statistical averages in order to describe quantum observables. For mixed states, calculations with the density matrix are greatly simplified. Given that you have a statistical mixture, and can describe \(p_k\), the probability of occupying quantum state \(| \psi _ {k} \rangle\), evaluation of expectation values is simplified with a density matrix:
\[\langle \hat {A} (t) \rangle = \sum _ {k} p _ {k} \left\langle \psi _ {k} (t) | \hat {A} | \psi _ {k} (t) \right\rangle \label{4.10}\]
\[\rho (t) \equiv \sum _ {k} p _ {k} | \psi _ {k} (t) \rangle \langle \psi _ {k} (t) | \label{4.11}\]
\[\langle \hat {A} (t) \rangle = \operatorname {Tr} [ \hat {A} \rho (t) ] \label{4.12}\]
Evaluating expectation value is the same for pure or mixed states.
Properties of the Density Matrix
We can now summarize some properties of the density matrix, which follow from the definitions above:
- \(\rho\) is Hermitian since \(\rho _ {n m} ^{*} = \rho _ {m n}\)
- Since probability must be normalized, \(\operatorname {Tr} ( \rho ) = 1\)
- We can ascertain the degree of “pure-ness” of a quantum state from \[\operatorname {Tr} \left( \rho ^{2} \right) \left\{\begin{array} {l} {= 1 \text { for pure state}} \\[4pt] {< 1 \text { for mixed state}} \end{array} \right.\]
In addition, when working with the density matrix it is convenient to make note of these trace properties:
- The trace over a product of matrices is invariant to cyclic permutation of the matrices: \[\operatorname {Tr} ( A B C ) = \operatorname {Tr} ( C A B ) = \operatorname {Tr} ( B C A )\]
- From this result we see that the trace is invariant to unitary transformation: \[\operatorname {Tr} \left( S ^{\dagger} A S \right) = \operatorname {Tr} \left( S ^{- 1} A S \right) = \operatorname {Tr} ( A )\]