Matrices: A beginner's guide

Matrices as Operations on Quantum States

Recall that we represent the states of our quantum system as

	$\left\vert {\psi }\right\rangle =\alpha _{0}\left\vert {0}\right\rangle +\alpha _{1}\left\vert {1}\right\rangle ,$	(m.1)

where $\alpha _{0}\,\!$ and $\alpha _{1}\,\!$ are complex numbers. Our objective is to use these two states to store and manipulate information. Because $|\alpha _{0}|^{2}\,\!$ and $|\alpha _{1}|^{2}\,\!$ are probabilities and must add up to one,

	$|\alpha _{0}|^{2}+|\alpha _{1}|^{2}=1.\,\!$	(m.2)

This means that this vector is normalized, i.e. its magnitude (or length) is one. (Appendix B contains a basic introduction to complex numbers.) The basis vectors for such a space are the two vectors $\left\vert {0}\right\rangle$ and $\left\vert {1}\right\rangle$ which are called computational basis states. These two basis states are represented by

	$\left\vert {0}\right\rangle =\left({\begin{array}{c}1\\0\end{array}}\right),\;\;\left\vert {1}\right\rangle =\left({\begin{array}{c}0\\1\end{array}}\right).$	(m.3)

Thus, the qubit state can be rewritten as

	$\left\vert {\psi }\right\rangle =\left({\begin{array}{c}\alpha _{0}\\\alpha _{1}\end{array}}\right).$	(m.4)

A very common operation in computing is to change a $0$ to a $1$ and a $1$ to a $0$. The operation that does this is denoted a $X$. This operator does both. It changes $0$ a $1$ and $1$ to $0$. So we write,

	$X\left|0\right\rangle =\left|1\right\rangle ,{\mbox{ and }}X\left|1\right\rangle =\left|0\right\rangle .\,\!$	(m.1)

Notice that this means that acting with $X$ again means that you get back the original state. To represent these operations, we use matrices. It turns out that these are the way to represent all of operations in quantum mechanics and this will be show in this section.

	$X=\left({\begin{array}{cc}0&1\\1&0\end{array}}\right),\,\!$	(m.1)

	$Z=\left({\begin{array}{cc}1&0\\0&-1\end{array}}\right),\,\!$	(m.2)

	$N=\left({\begin{array}{cc}0&-i\\i&0\end{array}}\right),\,\!$	(m.3)

	$M=\left({\begin{array}{cc}a&b\\c&d\end{array}}\right),\,\!$	(m.4)

Matrices

Basic Definition and Representations

A matrix is an array of numbers of the following form with columns, col. 1, col. 2, etc., and rows, row 1, row 2, etc. The entries for the matrix are labeled by the row and column. So the entry of a matrix $A$ will be $a_{ij}$ where $i$ is the row and $j$ is the column where the number $a_{ij}$ is found. This is how it looks:

$A={\begin{array}{c}{\scriptstyle {row\;1}}\\{\scriptstyle {row\;2}}\\\vdots \\{\scriptstyle {row\;m}}\end{array}}{\overset {{\scriptstyle {col.\;1}}\;\;\;{\scriptstyle {col.\;2}}\;\;\;\;{\displaystyle {\cdots }}\;\;\;\;\;{\scriptstyle {col.\;n}}}{\left({\begin{array}{cccc}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{array}}\right)}}.\,\!$

Notice that we represent the whole matrix with a capital letter $A$. We could also represent it using all of the entries, this array of numbers seen in the equation above. Another way to represent it is to write it as $(a_{ij})$. By this we mean that it is the array of numbers in the parentheses.

Examples

Add examples here.

Matrix Addition

Matrix addition is performed by adding each element of one matrix with the corresponding element in another matrix. Let our two matrices be $A$ as above, and $B$. To represent these in an array,

$A=\left({\begin{array}{cccc}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{array}}\right),\;\;\;\;B=\left({\begin{array}{cccc}b_{11}&b_{12}&\cdots &b_{1n}\\b_{21}&b_{22}&\cdots &b_{2n}\\\vdots &\vdots &\ddots &\vdots \\b_{m1}&b_{m2}&\cdots &b_{mn}\end{array}}\right).\,\!$

The the sum, which we could call $C=A+B$ is given by

$A+B=\left({\begin{array}{cccc}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{array}}\right)+\left({\begin{array}{cccc}b_{11}&b_{12}&\cdots &b_{1n}\\b_{21}&b_{22}&\cdots &b_{2n}\\\vdots &\vdots &\ddots &\vdots \\b_{m1}&b_{m2}&\cdots &b_{mn}\end{array}}\right)=\left({\begin{array}{cccc}a_{11}+b_{11}&a_{12}+b_{12}&\cdots &a_{1n}+b_{1n}\\a_{21}+b_{21}&a_{22}+b_{22}&\cdots &a_{2n}+b_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}+b_{m1}&a_{m2}+b_{m2}&\cdots &a_{mn}+b_{mn}\end{array}}\right).\,\!$

In other words, the sum gives $c_{11}=a_{11}+b_{11}\,\!$, etc. We add them component by component like we do vectors.

Multiplying a Matrix by a Number

When multiplying a matrix by a number, each element of the matrix gets multiplied by that number. Seem familiar? This is what was done for vectors.

Let $k$ be some number. Then

$kA=k\left({\begin{array}{cccc}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{array}}\right)=\left({\begin{array}{cccc}ka_{11}&ka_{12}&\cdots &ka_{1n}\\ka_{21}&ka_{22}&\cdots &ka_{2n}\\\vdots &\vdots &\ddots &\vdots \\ka_{m1}&ka_{m2}&\cdots &ka_{mn}\end{array}}\right)\,\!$

Multiplying two Matrices

The the sum, which we could call $C=A+B$ is given by

$A+B=\left({\begin{array}{cccc}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{array}}\right)\left({\begin{array}{cccc}b_{11}&b_{12}&\cdots &b_{1n}\\b_{21}&b_{22}&\cdots &b_{2n}\\\vdots &\vdots &\ddots &\vdots \\b_{m1}&b_{m2}&\cdots &b_{mn}\end{array}}\right)=\left({\begin{array}{cccc}a_{11}b_{11}+&a_{12}+b_{12}&\cdots &a_{1n}+b_{1n}\\a_{21}+b_{21}&a_{22}+b_{22}&\cdots &a_{2n}+b_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}+b_{m1}&a_{m2}+b_{m2}&\cdots &a_{mn}+b_{mn}\end{array}}\right).\,\!$

Notation

There are many aspects of linear algebra that are quite useful in quantum mechanics. We will briefly discuss several of these aspects here. First, some definitions and properties are provided that will be useful. Some familiarity with matrices will be assumed, although many basic definitions are also included.

Let us denote some $m\times n\,\!$ matrix by $A\,\!$. The set of all $m\times n\,\!$ matrices with real entries is $M(m\times n,\mathbb {R} )\,\!$. Such matrices are said to be real since they have all real entries. Similarly, the set of $m\times n\,\!$ complex matrices is $M(m\times n,\mathbb {C} )\,\!$. For the set of square $n\times n\,\!$ complex matrices, we simply write $M(n,\mathbb {C} )\,\!$.

We will also refer to the set of matrix elements, $a_{ij}\,\!$, where the first index ($i\,\!$ in this case) labels the row and the second $(j)\,\!$ labels the column. Thus the element $a_{23}\,\!$ is the element in the second row and third column. A comma is inserted if there is some ambiguity. For example, in a large matrix the element in the 2nd row and 12th column is written as $a_{2,12}\,\!$ to distinguish between the 21st row and 2nd column.

The Identity Matrix

An identity matrix has the property that when it is multiplied by any matrix, that matrix is unchanged. That is, for any matrix $A\,\!$,

$\mathbb {I} A=A\mathbb {I} =A.\,\!$

Such an identity matrix always has ones along the diagonal and zeroes everywhere else. For example, the $3\times 3\,\!$ identity matrix is

$\mathbb {I} =\left({\begin{array}{ccc}1&0&0\\0&1&0\\0&0&1\end{array}}\right).\,\!$

It is straight-forward to verify that any $3\times 3\,\!$ matrix is not changed when multiplied by the identity matrix.

Complex Conjugate

The complex conjugate of a matrix is the matrix with each element replaced by its complex conjugate. In other words, to take the complex conjugate of a matrix, one takes the complex conjugate of each entry in the matrix. We denote the complex conjugate with a star, like this: Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A^*\,\!} . For example,

	${\begin{aligned}A^{*}&=&\left({\begin{array}{ccc}a_{11}&a_{12}&a_{13}\\a_{21}&a_{22}&a_{23}\\a_{31}&a_{32}&a_{33}\end{array}}\right)^{*}\\&=&\left({\begin{array}{ccc}a_{11}^{*}&a_{12}^{*}&a_{13}^{*}\\a_{21}^{*}&a_{22}^{*}&a_{23}^{*}\\a_{31}^{*}&a_{32}^{*}&a_{33}^{*}\end{array}}\right).\end{aligned}}\,\!$	(C.2)

(Notice that the notation for a matrix is a capital letter, whereas the entries are represented by lower case letters.)

Transpose

The transpose of a matrix is the same set of elements, but now the first row becomes the first column, the second row becomes the second column, and so on. Thus the rows and columns are interchanged. For example, for a square Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 3\times 3\,\!} matrix, the transpose is given by

	${\begin{aligned}A^{T}&=&\left({\begin{array}{ccc}a_{11}&a_{12}&a_{13}\\a_{21}&a_{22}&a_{23}\\a_{31}&a_{32}&a_{33}\end{array}}\right)^{T}\\&=&\left({\begin{array}{ccc}a_{11}&a_{21}&a_{31}\\a_{12}&a_{22}&a_{32}\\a_{13}&a_{23}&a_{33}\end{array}}\right).\end{aligned}}\,\!$	(C.3)

Hermitian Conjugate

The complex conjugate and transpose of a matrix is called the Hermitian conjugate, or simply the dagger of a matrix. It is called the dagger because the symbol used to denote it, ($\dagger \,\!$):

	$(A^{T})^{*}=(A^{*})^{T}\equiv A^{\dagger }.\,\!$	(C.4)

For our $3\times 3\,\!$ example,

$A^{\dagger }=\left({\begin{array}{ccc}a_{11}^{*}&a_{21}^{*}&a_{31}^{*}\\a_{12}^{*}&a_{22}^{*}&a_{32}^{*}\\a_{13}^{*}&a_{23}^{*}&a_{33}^{*}\end{array}}\right).\,\!$

If a matrix is its own Hermitian conjugate, i.e. $A^{\dagger }=A\,\!$, then we call it a Hermitian matrix. (Clearly this is only possible for square matrices.) Hermitian matrices are very important in quantum mechanics since their eigenvalues are real. (See Sec.(Eigenvalues and Eigenvectors).)

Index Notation

Very often we write the product of two matrices $A\,\!$ and $B\,\!$ simply as $AB\,\!$ and let $C=AB\,\!$. However, it is also quite useful to write this in component form. In this case, if these are $n\times n\,\!$ matrices, the component form will be

$c_{ik}=\sum _{j=1}^{n}a_{ij}b_{jk}.\,\!$

This says that the element in the $i^{\mbox{th}}\,\!$ row and $j^{\mbox{th}}\,\!$ column of the matrix $C\,\!$ is the sum $\sum _{j=1}^{n}a_{ij}b_{jk}\,\!$. The transpose of $C\,\!$ has elements

$c_{ki}=\sum _{j=1}^{n}a_{kj}b_{ji}.\,\!$

Now if we were to transpose $A\,\!$ and $B\,\!$ as well, this would read

$c_{ki}=\sum _{j=1}^{n}(a_{jk})^{T}(b_{ij})^{T}=\sum _{j=1}^{n}b_{ij}^{T}a_{jk}^{T}.\,\!$

This gives us a way of seeing the general rule that

$C^{T}=B^{T}A^{T}.\,\!$

It follows that

$C^{\dagger }=B^{\dagger }A^{\dagger }.\,\!$

The Trace

The trace of a matrix is the sum of the diagonal elements and is denoted ${\mbox{Tr}}\,\!$. So for example, the trace of an $n\times n\,\!$ matrix $A\,\!$ is

${\mbox{Tr}}(A)=\sum _{i=1}^{n}a_{ii}\,\!$.

Some useful properties of the trace are the following:

1. ${\mbox{Tr}}(AB)={\mbox{Tr}}(BA)\,\!$
2. ${\mbox{Tr}}(A+B)={\mbox{Tr}}(A)+{\mbox{Tr}}(B)\,\!$.

Using the first of these results,

${\mbox{Tr}}(UAU^{-1})={\mbox{Tr}}(U^{-1}UA)={\mbox{Tr}}(A).\,\!$

This relation is used so often that we state it here explicitly.

The Determinant

For a square matrix, the determinant is quite a useful thing. For example, an $n\times n\,\!$ matrix is invertible if and only if its determinant is not zero. So let us define the determinant and give some properties and examples.

The determinant of a $2\times 2\,\!$ matrix,

	$N=\left({\begin{array}{cc}a&b\\c&d\end{array}}\right),\,\!$	(C.5)

is given by

	$\det(N)=ad-bc.\,\!$	(C.6)

Higher-order determinants can be written in terms of smaller ones in a recursive way. For example, let

$M=\left({\begin{array}{ccc}m_{11}&m_{12}&m_{13}\\m_{21}&m_{22}&m_{23}\\m_{31}&m_{32}&m_{33}\end{array}}\right).\,\!$

Then

$\det(M)=m_{11}\det \left({\begin{array}{cc}m_{22}&m_{23}\\m_{32}&m_{33}\end{array}}\right)-m_{12}\det \left({\begin{array}{cc}m_{21}&m_{23}\\m_{31}&m_{33}\end{array}}\right)+m_{13}\det \left({\begin{array}{cc}m_{21}&m_{22}\\m_{31}&m_{32}\end{array}}\right).\,\!$

The determinant of a matrix $A\,\!$ can be also be written in terms of its components as

	$\det(A)=\sum _{i,j,k,l,...}\epsilon _{ijkl...}a_{1i}a_{2j}a_{3k}a_{4l}...,\,\!$	(C.7)

where the symbol

	$\epsilon _{ijkl...}={\begin{cases}+1,\;{\mbox{if }}\;ijkl...=1234...({\mbox{in order, or any even number of permutations}}),\\-1,\;{\mbox{if }}\;ijkl...=2134...({\mbox{or any odd number of permutations}}),\\\;\;\;0,\;{\mbox{otherwise}},\;({\mbox{meaning any index is repeated}}).\end{cases}}\,\!$	(C.8)

Let us consider the example of the $3\times 3\,\!$ matrix $A\,\!$ given above. The determinant can be calculated by

$\det(A)=\sum _{i,j,k}\epsilon _{ijk}a_{1i}a_{2j}a_{3k},\,\!$

where, explicitly,

	$\epsilon _{ijk}={\begin{cases}+1,\;{\mbox{if }}\;ijk=123,231,\;{\mbox{or}}\;312,({\mbox{These are even permutations of }}123),\\-1,\;{\mbox{if }}\;ijk=213,132,\;{\mbox{or}}\;321({\mbox{These are odd permuations of }}123),\\\;\;\;0,\;{\mbox{otherwise}},\;({\mbox{meaning any index is repeated}}),\end{cases}}\,\!$	(C.9)

so that

	${\begin{aligned}\det(A)&=&\epsilon _{123}a_{11}a_{22}a_{33}+\epsilon _{132}a_{11}a_{23}a_{32}+\epsilon _{231}a_{12}a_{23}a_{31}\\&&+\epsilon _{213}a_{12}a_{21}a_{33}+\epsilon _{312}a_{13}a_{21}a_{32}+\epsilon _{321}a_{13}a_{22}a_{31}.\end{aligned}}\,\!$	(C.10)

Now given the values of $\epsilon _{ijk}\,\!$ in Eq. C.9, this is

$\det(A)=a_{11}a_{22}a_{33}-a_{11}a_{23}a_{32}+a_{12}a_{23}a_{31}-a_{12}a_{21}a_{33}+a_{13}a_{21}a_{32}-a_{13}a_{22}a_{31}.\,\!$

The determinant has several properties that are useful to know. A few are listed here:

1. The determinant of the transpose of a matrix is the same as the determinant of the matrix itself: $\det(A)=\det(A^{T}).\,\!$
2. The determinant of a product is the product of determinants: $\det(AB)=\det(A)\det(B).\,\!$

From this last property, another specific property can be derived. If we take the determinant of the product of a matrix and its inverse, we find

$\det(UU^{-1})=\det(U)\det(U^{-1})=\det(\mathbb {I} )=1,\,\!$

since the determinant of the identity is one. This implies that

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \det(U^{-1}) = \frac{1}{\det(U)}. \,\!}

The Inverse of a Matrix

The inverse of an Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n\times n\,\!} square matrix Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A\,\!} is another $n\times n\,\!$ square matrix, denoted Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A^{-1}\,\!} , such that

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle AA^{-1} = A^{-1}A = \mathbb{I}, \,\!}

where Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbb{I}\,\!} is the identity matrix consisting of zeroes everywhere except the diagonal, which has ones. For example, the $3\times 3\,\!$ identity matrix is

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbb{I}_3 = \left(\begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{array}\right). \,\!}

It is important to note that a matrix is invertible if and only if its determinant is nonzero. Thus one only needs to calculate the determinant to see if a matrix has an inverse or not.

Hermitian Matrices

Hermitian matrices are important for a variety of reasons; primarily, it is because their eigenvalues are real. Thus Hermitian matrices are used to represent density operators and density matrices, as well as Hamiltonians. The density operator is a positive semi-definite Hermitian matrix (it has no negative eigenvalues) that has its trace equal to one. In any case, it is often desirable to represent Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N\times N\,\!} Hermitian matrices using a real linear combination of a complete set of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N\times N\,\!} Hermitian matrices. A set of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N\times N\,\!} Hermitian matrices is complete if any Hermitian matrix can be represented in terms of the set. Let Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \{\lambda_i\}\,\!} be a complete set. Then any Hermitian matrix can be represented by Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \sum_i a_i \lambda_i\,\!} . The set can always be taken to be a set of traceless Hermitian matrices and the identity matrix. This is convenient for the density matrix (its trace is one) because the identity part of an Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N\times N\,\!} Hermitian matrix is Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (1/N)\mathbb{I}\,\!} if we take all others in the set to be traceless. For the Hamiltonian, the set consists of a traceless part and an identity part where identity part just gives an overall phase which can often be neglected.

One example of such a set which is extremely useful is the set of Pauli matrices. These are discussed in detail in Chapter 2 and in particular in Section 2.4.

Unitary Matrices

A unitary matrix Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U\,\!} is one whose inverse is also its Hermitian conjugate, Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U^\dagger = U^{-1}\,\!} , so that

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U^\dagger U = UU^\dagger = \mathbb{I}. \,\!}

If the unitary matrix also has determinant one, it is said to be a special unitary matrix. The set of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n\times n\,\!} unitary matrices is denoted Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U(n)\,\!} and the set of special unitary matrices is denoted Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle SU(n)\,\!} .

Unitary matrices are particularly important in quantum mechanics because they describe the evolution of quantum states. They have this ability due to the fact that the rows and columns of unitary matrices (viewed as vectors) are orthonormal. (This is made clear in an example below.) This means that when they act on a basis vector of the form

	Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\vert j\right\rangle = \left(\begin{array}{c} 0 \\ 0 \\ \vdots \\ 1 \\ \vdots \\ 0 \end{array}\right), \,\!}	(C.11)

with a single 1, in say the $j$th spot, and zeroes everywhere else, the result is a normalized complex vector. Acting on a set of orthonormal vectors of the form given in Eq.(C.11) will produce another orthonormal set.

Let us consider the example of a Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 2\times 2\,\!} unitary matrix,

	$U=\left({\begin{array}{cc}a&b\\c&d\end{array}}\right).\,\!$	(C.12)

The inverse of this matrix is the Hermitian conjugate,

	Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U ^{-1} = U^\dagger = \left(\begin{array}{cc} a^* & c^* \\ b^* & d^* \end{array}\right), \,\!}	(C.13)

provided that the matrix Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle U\,\!} satisfies the constraints

	${\begin{aligned}|a|^{2}+|b|^{2}=1,\;&\;ac^{*}+bd^{*}=0\\ca^{*}+db^{*}=0,\;&\;|c|^{2}+|d|^{2}=1,\end{aligned}}\,\!$	(C.14)

and

	Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \begin{align} |a|^2 + |c|^2 = 1, \; & \; ba^*+dc^* =0 \\ b^*a+d^*c=0, \; & \; |b|^2 + |d|^2 =1. \end{align}\,\!}	(C.15)

Looking at each row as a vector, the constraints in Eq.(C.14) are the orthonormality conditions for the vectors forming the rows. Similarly, the constraints in Eq.(C.15) are the orthonormality conditions for the vectors forming the columns.

Inner and Outer Products

Now that we have a definition for the Hermitian conjugate, we consider the case for a Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1\times n\,\!} matrix, i.e. a vector. In Dirac notation, this is

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\vert\psi\right\rangle = \left(\begin{array}{c} \alpha \\ \beta \end{array}\right). \,\!}

The Hermitian conjugate comes up so often that we use the following notation for vectors:

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\langle \psi\right\vert = (\left\vert\psi\right\rangle)^\dagger = \left(\begin{array}{c} \alpha \\ \beta \end{array}\right)^\dagger = \left( \alpha^*, \; \beta^* \right). \,\!}

This is a row vector and in Dirac notation is denoted by the symbol Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\langle\cdot \right\vert\!} , which is called a bra. Let us consider a second complex vector,

$\left\vert \phi \right\rangle =\left({\begin{array}{c}\gamma \\\delta \end{array}}\right).\,\!$

The inner product between Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\vert\psi\right\rangle\,\!} and Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\vert\phi\right\rangle\,\!} is computed as follows:

	${\begin{aligned}\left\langle \phi \mid \psi \right\rangle &\equiv (\left\vert \phi \right\rangle )^{\dagger }\left\vert \psi \right\rangle \\&=(\gamma ^{*},\delta ^{*})\left({\begin{array}{c}\alpha \\\beta \end{array}}\right)\\&=\gamma ^{*}\alpha +\delta ^{*}\beta .\end{aligned}}$	(C.16)

The outer product between these same two vectors is

${\begin{aligned}(\left\vert \phi \right\rangle )(\left\vert \psi \right\rangle )^{\dagger }&=\left\vert \phi \right\rangle \left\langle \psi \right\vert \\&=\left({\begin{array}{c}\gamma \\\delta \end{array}}\right)\left({\begin{array}{c}\alpha \\\beta \end{array}}\right)^{\dagger }\\&=\left({\begin{array}{c}\gamma \\\delta \end{array}}\right)\left({\begin{array}{cc}\alpha ^{*}&\beta ^{*}\end{array}}\right)\\&=\left({\begin{array}{cc}\gamma \alpha ^{*}&\gamma \beta ^{*}\\\delta \alpha ^{*}&\delta \beta ^{*}\end{array}}\right)\end{aligned}}\;\!$