# Quantum Computation Preliminaries- Hilbert Spaces (Part 2)

Page 1 of 1

## 0 Replies - 13714 Views - Last Post: 07 January 2019 - 11:29 PMRate Topic:     //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'https://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=414373&amp;s=7f0b3cb1079817f16a210f1e521b3d65&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

### #1 macosxnerd101 • • Games, Graphs, and Auctions
•     Reputation: 12769
• Posts: 45,954
• Joined: 27-December 08

# Quantum Computation Preliminaries- Hilbert Spaces (Part 2)

Posted 07 January 2019 - 11:29 PM

Quantum Computation Preliminaries- Hilbert Spaces (Part 2)

Here is a LaTeX version of this tutorial, which will be easier to read. Linear_Algebra.pdf (186.05K)

In this tutorial, we continue introducing mathematical preliminaries necessary to discuss quantum computation. The goal of this tutorial is to introduce notions from linear algebra, including Hilbert spaces, orthonormal bases and the Gram-Schmidt orthonormalization procedure. This tutorial assumes knowledge of abstract linear algebra at the undergraduate level, such as outlined in the linear algebra tutorials here or in the text of Friedberg, Insel, and Spence. Some familiarity with basic group theory will also be helpful.

Linear Algebra

Introduction

Linear algebra is the core mathematical tool for quantum computation. In order to model physical systems like qubits, we use a specific type of vector space known as Hilbert space, which has useful geometric properties. Namely, a Hilbert space is a complete metric space, which is a useful property to have later when we wish to approximate certain operators, like the Quantum Fourier Transform. We will also introduce the notion of an orthonormal basis. Using an orthonormal basis to represent vectors is quite useful in quantum computation, as the inner product of two orthogonal vectors is 0. This property is quite useful in simplifying key calculations in quantum algorithms and their proofs of correctness. The fact that an orthonormal basis consists solely of unit vectors is also desirable, as the basis vectors are all quantum states. We conclude with the Gram-Schmidt orthogonalization procedure, which allows us to construct an orthonormal basis from an arbitrary basis.

Hilbert Spaces

Definition (Hilbert Space)
A Hilbert space H is a vector space over the field F = R or F = C that has an inner product < . | . > : H x H -> F satisfying the following. For every u, v, w in H and any k in F, we have:
• Linearity in the Second Argument: < u|v + kw> = < u|v> + k< u|w >.
• Conjugate Symmetry: < u | v > = < v |u >^{*}.
• Positive Semidefiniteness: < u, u > >= 0, with < u, u > = 0 if and only if u = 0.

Remark: For the purpose of quantum computing, attention is restricted to complex Hilbert spaces. In particular, for quantum computation, only finite-dimensional Hilbert spaces are considered. Unless explicitly stated otherwise, we assume all Hilbert spaces are finite dimensional from here on out.

Lemma 2.1. Let H be a Hilbert space, and let u, v in H. We have that < u | v > in R.

Proof: Let z = < u | v >. By the definition of < . | . >, z is in C, so we may write z = a + bi for some a, b in R. As < . | . > is conjugate symmetric, we have that a + bi = z = z* = a - bi. Necessarily, b = 0. So z in R. QED.

Remark: Lemma 2.1 asserts that the inner product returns a real number, even when working with a complex Hilbert space. The positive semidefiniteness condition then yields that the inner product always returns a non-negative real number. These two conditions are necessary for using the inner product to define a metric.

We now introduce the notions of orthogonality and normality.

Definition (Orthogonality). Let H be a Hilbert space, and let u, v in H. We say that u, v are orthogonal if < u|v > = 0.

Remark: The inner product < u | v> measures how parallel the vectors u and v are. So if u and v are orthogonal (perpendicular), they share no parallel component. This is the geometric intuition as to why for orthogonal vectors u, v, < u | v > = 0.

Definition (Norm). Let V be a vector space over a field F \subset C. A norm is a function || . || : V -> [0, Infinity) satisfying the following properties. For every k in F and every u, v in V, we have:
• Triangle Inequality: ||u + v|| <= ||u|| + ||v||.
• ||ku|| = |k| . ||u||.
• ||u|| = 0 if and only if u = 0.

There are a number of different norms that can be imposed on a vector space. The canonical norm we consider on a Hilbert space H is ||u|| = \sqrt{ < u|u >}. We note that as the inner product of H is positive semidefinite, the norm ||u|| = 0 if and only if u = 0. It is also routine to verify that ||ku|| = |k| . ||u||.

Lemma 2.2. Let H be a Hilbert space with the norm ||u|| = \sqrt{ < u|u| > }. For any k in C, we have that ||ku|| = |k| . ||u||.

Proof: Observe that:

||ku||2 = < ku | ku >
= k < ku | u >
= k < u | ku >*
= kk* < u | u >*
= |k|2 * < u|u >
= |k|2 * ||u||2.

Here, the second and fourth lines follow from the fact that the inner product is linear in the second argument. We have that third line follows from the fact that the inner product is conjugate symmetric. Now the fifth line follows from the fact that that kk* = |k|2, as well as Lemma 2.1. QED.

The proof that the ||u|| = sqrt(< u | u >) satisfies the triangle inequality is somewhat technical and offers little insight into quantum computation. So we omit it. However, it is worth pointing out that the triangle inequality axiom of a norm is the missing component for constructing a metric on a Hilbert space H. That is, H together with the metric d(u, v) = ||u - v|| forms a metric space. In particular, the distance function d(u, v) = ||u - v|| satisfies the following:
• d(u, v) >= 0, with d(u, v) = 0 if and only if u = v.
• Symmetry: d(u, v) = d(v, u) for all u, v in H.
• Triangle Inequality: d(u, v) <= d(u, w) + d(w, v) for all u, v, w in H.

Orthonormal Bases

In this section, we introduce the notion of an orthonormal basis, including some basic results and techniques. In quantum computation, it is preferable for several reasons to select orthonormal bases for our Hilbert spaces. Each vector in an orthonormal basis is a unit vector, and therefore a quantum state. Additionally, any two vectors in an orthonormal basis are orthogonal. This latter point is of key importance in quantum computation, as it provides key cancellation in a number of important calculations.

Definition (Orthonormal Basis).
Let H be a Hilbert space. We say that { \beta1, \beta2, ..., \betan } is an orthonormal basis if the following conditions hold:
• For each i in {1, ..., n}, ||\betai|| = 1.
• For any distinct i, j in {1, ..., n}, < \betai| \betaj > = 0.

Example:
Let H = C2 with the inner product < u|v > = u*v. We refer to { (1, 0), (0, 1) } as the standard basis of H. Observe that < (1, 0), (0, 1) > = 1(0) + 0(1) = 0. So the basis vectors are orthogonal. Now ||(1, 0)|| = \sqrt{12 + 02} = 1. Similarly, ||(0, 1)|| = \sqrt{02 + 12} = 1. So each basis vector is a unit vector. Thus, { (1, 0), (0, 1) } is an orthonormal basis of H.

Example:
Let H be an n-dimensional Hilbert space. For i in {1, 2, ..., n}, let ei denote the vector where every component is 0 except for the ith component, which is 1. The basis { e1, e2, ..., en } is the standard basis of H. Observe that ||ei|| = 1 for all i. Furthermore, for distinct indices i, j, we have that:

< ei | ej > = \sum_{h=0}^{n} (ei)h* (ej)h = 1(0) + 0(1) = 0.

We note that ei = 1 precisely at component i, while ej = 0 at component i. This yields the term 1(0). By considering component j of ei and ej, we obtain the term 0(1). So < ei | ej > = 0. We conclude that the standard basis is orthonormal. The standard basis is a helpful example to keep in mind when considering orthonormal bases. It is in fact, considered the canonical example of an orthonormal basis. Note that this example generalizes the previous example.

In the next section, we will discuss in greater detail how to construct an orthonormal basis from an arbitrary basis. We conclude this section by examining how orthogonal sets of vectors, and orthonormal bases in particular, come in to play. Recall that for the Hilbert space H = Cn, we stated that the inner product:

< u | v > = \sum_{i=1}n ui*vi.

The above equation actually follows from the definition of a Hilbert space. We introduce the Kronecker delta function to make the calculations clearer.

Definition (Kronecker Delta Function). Let { v1, ..., vn } be a set of orthogonal vectors in a Hilbert space H. The Kronecker delta function

deltaij = 1 if i = j,
deltaij = 0 if i != j.

In particular, if v1, ..., vn are unit vectors, then we have that: < vi | vj > = deltaij.

Lemma 2.3. Let H be an n-dimensional Hilbert space, and let \beta = { \beta1, ..., \betan } be an orthonormal basis for H. Then for any u, v in H:

< u | v > = \sum_{i=1}n ui*vi.

Proof: As \beta is a basis for H, we may write: u = \sum_{i=1}^{n} ui\betai and v = \sum_{i=1}n vi\betai, where u1, ..., un, v1, ..., vn in C. We have that:

< u|v > &= < v | u >*
= < v | \sum_{i=1}^{n} ui \betai >*
= \sum_{i=1}^{n} ui* < v |\betai >*
= \sum_{i=1}^{n} ui* < \betai | \sum_{j=1}^{n} vj\betaj >
= \sum_{i=1}^{n} ui* \sum_{j=1}^{n} vj < \betai | \betaj >
= \sum_{i=1}^{n} ui* \sum_{j=1}^{n} vj deltaij
= \sum_{i=1}^{n} ui*vi.

We note that the first and and fourth lines follow from the conjugate symmetry of the inner product. Now third and fifth lines follow from the fact that the inner product is linear in the second argument. As \beta is an orthonormal basis, we have that < \betai | \betaj > = deltaij, which yields the sixth line. Finally, the last line follows from the fact that deltaij = 0 whenever i != j and deltaii = 1 for all i in {1, ..., n}. QED.

It is also helpful to note that any orthogonal set of non-zero vectors is linearly independent. The proof is similar as above.

Lemma 2.4. Let \beta = { \beta1, ..., \betan } be an orthogonal set of non-zero vectors in a Hilbert space H. Then \beta is linearly independent.

Proof: Let v = \sum_{i=1}^{n} ci\betai = 0. We have that:

< v | v > = \left < v \biggr | \sum_{i=1}n ci\betai >
= \sum_{i=1}^{n} ci < v | \betai >
= \sum_{i=1}^{n} ci < \betai | \sum_{j=1}^{n} cj \betaj >*
= \sum_{i=1}^{n} ci \sum_{j=1}^{n} cj* < \betai | \betaj >
= \sum_{i=1}^{n} cici* < \betai | \betai >.

Here, the second and fourth lines follow from the fact that the inner product is linear in the second argument. Now the third line follows from the fact that the inner product is conjugate symmetric. As the vectors in \beta are orthogonal, < \betai | \betaj > = 0 whenever i != j, which yields the last line.

By assumption the vectors of \beta are non-zero. So for all i in {1, ..., n}, < \betai | \betai > != 0. Note as well that cici* = |ci|2 = 0 if and only if ci = 0. As v = 0, it follows that each ci = 0. So \beta is linearly independent.
QED.

Gram-Schmidt Orthogonalization

In this section, we examine the Gram-Schmidt procedure to construct an orthonormal basis from an arbitrary basis. The only requirement is that our vector space has an inner product, such as a Hilbert space. The Gram-Schmidt procedure takes as input a basis \beta = { \beta1, ..., \betan}, and returns an orthonormal basis y = { y1, ..., yn} for the same space as \beta. The Gram-Schmidt algorithm proceeds iteratively. We begin by setting:

x1 := \beta1
y1 := x1 / ||x1||.

That is, y1 is just a normalized \beta1. As 1/||x1|| is a constant, y1 is a scalar multiple of \beta1. So y1 and \beta1 span the same space (i.e., generate the same set of vectors). Now for i > 1, we set:

xi := \betai - \sum_{k=1}^{i-1} < yk|\betai > yk
yi := xi / ||xi||.

We similarly note that yi is a unit vector and a scalar multiple of xi. So xi and yi span the same space. In particular, we have that span({ x1, ..., xn }) = span({y1, ..., yn}). Now the intuition for the right-hand side of xi := \betai - \sum_{k=1}^{i-1} < yk|\betai > yk is that we start with \betai and subtract out the components of y1, ..., y_{i-1} that are not orthogonal with \betai.

Before offering a proof of correctness for the Gram-Schmidt procedure, we first work through an example.

Example: Let \beta = { (1, 3), (-1, 2) } be a basis of R2. We construct an orthonormal basis y from \beta.
• We have that \beta1 = (1, 3). So ||\beta1|| = \sqrt{12 + 32} = sqrt{10}. Thus,

y1 = \beta1 / ||\beta1|| = ( 1/sqrt(10), 3/sqrt(10) ).

• Now x2 = \beta2 - < y1 | \beta2 > y1. We note that:

< y1 | \beta2 > = -1/sqrt(10) + 6/sqrt(10) = 5/sqrt(10).

So < y1 | \beta2 > y1 = 5 ( 1/10, 3/10 ). Thus, x2 = (-1, 2) - ( 5/10, 15/10 ) = ( -3/2, 1/2 ). We now normalize x2 to obtain y2. That is:

y2 = x2 / ||x2|| = ( -3/sqrt(10), 1/sqrt(10) ).

So y = {y1, y2 } is our orthonormal basis constructed from \beta.

Theorem 3.1. Let \beta = { \beta1, ..., \betan } be a set of linearly independent vectors. The set of vectors produced by the Gram-Schmidt procedure y = { y1, ..., yn } is orthonormal and spans the same space as \beta.

Proof: The proof is by induction on i in {1, ..., n}. We have the base case of i = 1. So y1 = \beta1 / ||\beta1||. As \beta is a set of linearly independent vectors, \beta != 0. So ||\beta|| > 0, and y1 is well-defined. Observe that y1 is a scalar multiple of \beta1. So span({ y1 }) = span({\beta1 }). By construction, y1 is a unit vector. So the theorem holds. Now fix 1 <= k < n, and suppose the theorem holds. We prove true for the k+1 case.

By the inductive hypothesis, we have that { y1, ..., yk } is an orthonormal set that spans the same space as { \beta1, ..., \betak}. As \beta is linearly independent, \betak+1 \not in span({ \beta1, ..., \betak}) = span({ y1, ..., yk}). Note that < yj | \betak+1 > is a constant for each j in {1, ..., k}. Thus,

\sum_{j=1}^{k} < yj | \betak > yj in span({ y1, ..., yk }).

As \betak+1 is not in span({y1, ..., yk}), it follows that \betak+1 is not equal to the above expression. So:

xk+1 = \betak+1 - \sum_{j=1}^{k} < yj | \betak+1 > yj != 0.

Thus, yk+1 = xk+1 / ||xk+1|| is well-defined and a unit vector. It remains to show the following:
• (a) { y1, ..., yk+1 } is an orthogonal set of vectors.
• (b) span({ \beta1, ..., \betak+1 }) = span({ y1, ..., yk+1}).

Proof of (a). We first show that {y1, ..., yk+1} is an orthogonal set of vectors. By the inductive hypothesis, we have that { y1, ..., yk} is an orthogonal set of vectors. So it suffices to show that for all i in {1, ..., k}, < yi | yk+1 > = 0. Fix such an i in {1, ..., k}. We have that:

< yi | yk+1 > = 1/||xk+1|| * < yi | xk+1 >
= 1/||xk+1|| * < yi \biggr| \betak+1 - \sum_{j=1}^{k} < yj | \betak+1 > yj >
= 1/||xk+1|| * ( < yi | \betak+1 > - \sum_{j=1}^{k} < yj | \betak+1 > < yi | yj > )

Here, the second line follows from the definition of xk+1 and the third line follows from the fact that the inner product is conjugate linear in the second argument. Now as { y1, ..., yk} is an orthonormal set, we have that for distinct i, j in {1, ..., k}, < yi | yj > = 0. Thus, the third line simplifies to:

1/||xk+1|| * ( < yi | \betak+1 > - < yi | \betak+1 > ) = 0.

So {y1, ..., yk+1 } is an orthogonal set of vectors, as desired.

Proof of (b). We now show that span({ \beta1, ..., \betak+1 }) = span({ y1, ..., yk+1}). By the inductive hypothesis, we have that span({ \beta1, ..., \betak }) = span({ y1, ..., yk}). We first show that \betak+1 in span({ y1, ..., yk+1 }). Recall that:

yk+1 = 1/||xk+1|| * ( \betak+1 - \sum_{i=1}^{k} < yi|\betak+1> yi ).

Solving for \betak+1, we obtain:

\betak+1 = ||xk+1|| * yk+1 + \sum_{i=1}^{k} < yi|\betak+1> yi.

So \betak+1 in span({y1, ..., yk+1}), and we have that span({ \beta1, ..., \betak+1 }) \subset span({y1, ..., yk+1}).

Now by assumption, {\beta1, ..., \betak+1} is a set of k+1 linearly independent vectors. As {y1, ..., yk+1} is an orthogonal set of vectors, {y1, ..., yk+1} is linearly independent. Thus, as span({ \beta1, ..., \betak+1 }) \subset span({y1, ..., yk+1}) and |{\beta1, ..., \betak+1}| = |{y1, ..., yk+1}| = k+1, we in fact have span({ \beta1, ..., \betak+1 }) = span({y1, ..., yk+1}). This completes the proof of part (b), as well as the main theorem.
QED.

Conclusion
In this tutorial, we introduced the setting for quantum computation- the Hilbert space. We also examined the notion of an orthonormal basis, as well as the Gram-Schmidt procedure for constructing orthonormal bases. In the next tutorial, we will examine Hermitian and unitary operators, projectors, and tensor products, which provide the remaining linear algebraic tools needed to discuss quantum computation.

This post has been edited by macosxnerd101: 07 January 2019 - 11:57 PM

Is This A Good Question/Topic? 1

Page 1 of 1

 .related ul { list-style-type: circle; font-size: 12px; font-weight: bold; } .related li { margin-bottom: 5px; background-position: left 7px !important; margin-left: -35px; } .related h2 { font-size: 18px; font-weight: bold; } .related a { color: blue; }