Chapter III. Quantum Computation. Mathematical preliminaries. A.1 Complex numbers. A.2 Linear algebra review

Similar documents
Quantum Computing Lecture 2. Review of Linear Algebra

Lecture 3: Hilbert spaces, tensor products

Chapter 2. Linear Algebra. rather simple and learning them will eventually allow us to explain the strange results of

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

Linear Algebra and Dirac Notation, Pt. 1

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Linear Algebra in Hilbert Space

Mathematical Methods wk 1: Vectors

Mathematical Methods wk 1: Vectors

Page 52. Lecture 3: Inner Product Spaces Dual Spaces, Dirac Notation, and Adjoints Date Revised: 2008/10/03 Date Given: 2008/10/03

Quantum Information & Quantum Computing

1 Dirac Notation for Vector Spaces

Recitation 1 (Sep. 15, 2017)

Vector spaces and operators

Supplementary information I Hilbert Space, Dirac Notation, and Matrix Mechanics. EE270 Fall 2017

The quantum state as a vector

1 Mathematical preliminaries

Consistent Histories. Chapter Chain Operators and Weights

Unitary Dynamics and Quantum Circuits

Categories and Quantum Informatics: Hilbert spaces

The following definition is fundamental.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

2. Introduction to quantum mechanics

II. The Machinery of Quantum Mechanics

Linear Algebra using Dirac Notation: Pt. 2

Spectral Theorem for Self-adjoint Linear Operators

Review of linear algebra

Lecture 2: Linear operators

The Spectral Theorem for normal linear maps

Elementary maths for GMT

Some Introductory Notes on Quantum Computing

LINEAR ALGEBRA REVIEW

Quantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)

Mathematical Methods wk 2: Linear Operators

Linear Algebra Review. Vectors

Fourier and Wavelet Signal Processing

MATHEMATICS 217 NOTES

Math Linear Algebra II. 1. Inner Products and Norms

Mathematical Formulation of the Superposition Principle

Mathematical Introduction

1. General Vector Spaces

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

Mathematical Foundations of Quantum Mechanics

5 Compact linear operators

PLEASE LET ME KNOW IF YOU FIND TYPOS (send to

MP463 QUANTUM MECHANICS

October 25, 2013 INNER PRODUCT SPACES

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Foundations of Matrix Analysis

Linear Algebra March 16, 2019

Chem 3502/4502 Physical Chemistry II (Quantum Mechanics) 3 Credits Fall Semester 2006 Christopher J. Cramer. Lecture 5, January 27, 2006

Linear Algebra: Matrix Eigenvalue Problems

CS 246 Review of Linear Algebra 01/17/19

Lecture notes: Applied linear algebra Part 1. Version 2

Mathematical foundations - linear algebra

Elementary linear algebra

Chapter 8 Integral Operators

Linear Algebra. Min Yan

Review problems for MA 54, Fall 2004.

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

Quantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.

Basic concepts from quantum theory

Image Registration Lecture 2: Vectors and Matrices

Eigenvectors and Hermitian Operators

Designing Information Devices and Systems II

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

EE731 Lecture Notes: Matrix Computations for Signal Processing

Real symmetric matrices/1. 1 Eigenvalues and eigenvectors

Introduction to Quantum Mechanics Physics Thursday February 21, Problem # 1 (10pts) We are given the operator U(m, n) defined by

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Review

Exercise Sheet 1.

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice

Linear Algebra 2 Spectral Notes

Basic concepts from quantum theory

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

Math 108b: Notes on the Spectral Theorem

Matrix Representation

Lecture 4: Postulates of quantum mechanics

ECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence)

Lecture 7. Econ August 18

Math 291-2: Lecture Notes Northwestern University, Winter 2016

Math 307 Learning Goals

Notes on basis changes and matrix diagonalization

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Lecture 6: Vector Spaces II - Matrix Representations

1. Quantum Mechanics, Cohen Tannoudji, Chapters Linear Algebra, Schaum Series 3. Quantum Chemistry Ch. 6

1. Foundations of Numerics from Advanced Mathematics. Linear Algebra

Linear algebra 2. Yoav Zemel. March 1, 2012

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Comprehensive Introduction to Linear Algebra

Quantum Mechanics for Scientists and Engineers. David Miller

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Quantum Physics II (8.05) Fall 2002 Assignment 3

MATH 583A REVIEW SESSION #1

Formalism of Quantum Mechanics

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x

Transcription:

Chapter III Quantum Computation These lecture notes are exclusively for the use of students in Prof. MacLennan s Unconventional Computation course. c 2017, B. J. MacLennan, EECS, University of Tennessee, Knoxville. Version of August 30, 2017. A Mathematical preliminaries [I]nformation is physical, and surprising physical theories such as quantum mechanics may predict surprising information processing abilities. (Nielsen &Chuang,2010,p.98) A.1 Complex numbers If you go to the course webpage, and look under Quantum Computation in the Topics section, you will see a link to complex number review [FFCch4]. Depending on how familiar you are with complex numbers, read or skim it through section 4.4.2.1 (pp. 41 53). This should tell you all you need to know (and a little more). A.2 Linear algebra review A.2.a Dirac bracket notation Much of the math of quantum computation is just elementary linear algebra, but the notation is di erent (and of course there is a physical interpretation). The Dirac bracket notation will seem peculiar if you are not used to it, but 67

68 CHAPTER III. QUANTUM COMPUTATION it is elegant and powerful, as are all good notations. Think of it like a new programming language. First, the notation i represents an n-dimensional vector, which we can write in a particular basis as a n 1complexcolumnvector, i = (v 1,...,v n ) T.Wepronounce i ket psi or psi ket. Normally the vectors are finite-dimensional, but they can be infinite-dimensional if the vectors have a finite magnitude (their components are square-summable), P k v k 2 < 1. The Dirac notation has the advantage that we can use arbitrary names for vectors, for example: excitedi, zeroi, onei, "i, %i, 1i, 101i, 5i, f(x)i, 1 g(1)i. It may be easier to remember if you notice that it looks kind of like an arrow; compare vi and ~v. The notation h represents a 1 n complex row vector, h =(u 1,...,u n ) in a particular basis. We pronounce h bra psi or psi bra. If i = (v 1,...,v n ) T,thenh =(v 1,...,v n ), where v k is the complex conjugate of v k.recallthat x + iy = x iy and re i = re i. We define the adjoint (conjugate transpose, Hermitian transpose) M of amatrixm by (M ) jk = M kj. We pronounce it M dagger, M adjoint, etc. Note that corresponding bras and kets are adjoints: h = i and i = h. A.2.b Inner product Suppose i =(u 1,...,u n ) T and i =(v 1,...,v n ) T in the same basis. Then the complex inner product of the vectors is defined P k u kv k = h i. Thus, the inner product of two vectors is the conjugate transpose of the first times the second. This is the convention in physics, which we will follow; mathematicians usually put the complex conjugate on the second argument. It doesn t make any di erence so long as you are consistent. Since the inner product multiplies a 1 n matrix by an n 1matrix,theresultisa1 1 matrix, or scalar. This product of a bra and a ket is usually abbreviated h i = h i, whichcanbepronounced -bra ket- or bra-ket. The complex inner product satisfies several important properties:

A. MATHEMATICAL PRELIMINARIES 69 1. It is positive definite: h i > 0, if i 6= 0, h i = 0, if i = 0. 2. It has conjugate symmetry: h i = h i. 3. It is linear in its second argument (the one that s not conjugated): h c i = ch i, for c 2 C, h + i = h i + h i. Note that conjugate symmetry and linearity in the second argument together imply that hc i = ch i (antilinearity in the first argument). The complex inner product is called sesquilinear, which means one-and-a-half linear (in contrast to the inner product of real vectors, which is linear in both arguments, i.e., bilinear). The norm or magnitude of a vector is defined k ik = p h i. That is, k ik 2 = v 1 2 + v n 2.Avectorisnormalized if k ik = 1. Note that normalized vectors fall on the surface of an n-dimensional hypersphere. A.2.c Bases and Generalized Fourier Series Vectors i and i are orthogonal if h i = 0. Asetofvectorsisor- thogonal if each vector is orthogonal to all the others. An orthonormal (ON) set of vectors is an orthogonal set of normalized vectors. A set of vectors 1i, 2i,... spans avectorspaceifforeveryvector i in the space there are complex coe cients c 1,c 2,... such that i = P k c k ki. A basis for a vector space is a linearly independent set of vectors that spans the space. Equivalently, a basis is a minimal generating set for the space; that is, all of the vectors in the space can be generated by linear combinations of the basis vectors. An (orthonormal) basis for a vector space is an (orthonormal) set of vectors that spans the space. In general, when I write basis I mean orthonormal basis. Any vector in the space has a unique representation as alinearcombinationofthebasisvectors. A Hilbert space is a complete inner-product space. Complete means that all Cauchy sequences of vectors (or functions) have a limit in the space. (In a Cauchy sequence, kx m x n k!0asm, n!1.) Hilbert spaces may

70 CHAPTER III. QUANTUM COMPUTATION be finite- or infinite-dimensional. Suppose 1i, 2i,... is an ON basis for a Hilbert space H. Note, that these are just the names of the basis vectors (we could have used e 1 i, e 2 i,... orsomethingsimilar),andhavenothingtodo with the integers 1, 2, etc. Given such a basis, any i in H can be expanded in a generalized Fourier series: i = X k c k ki. The generalized Fourier coe cients c k can be determined by taking inner products with the corresponding basis vectors: hk i = hk X j c j ji = X j c j hk ji = c k. Therefore, c k = hk i. Hence, i = X k c k ki = X k hk i ki = X k kihk i. This is just the vector s representation in a particular basis. (Note that this equation implies the identity matrix I = P k kihk.) A linear operator L : H!Ĥ satisfies L(c i + d i) =cl( i)+dl( i) for all i, i2hand c, d 2 C. For example, di erentiation is a linear operator. AlinearoperatorL : H!Ĥ can be represented by a (possibly infinitedimensional) matrix relative to bases for H and Ĥ. Toseethis,suppose 1i, 2i,...isabasisforH and ˆ1i, ˆ2i,...isabasisforĤ. Consider i = L i and represent the vectors in these bases by their Fourier coe cients: b j = hˆ i and c k = hk i. Hence i is represented by the vector b =(b 1,b 2,...) T and i by the vector c =(c 1,c 2,...) T. Apply the linearity of L: b j = hˆ i = hˆ L i! = hˆ L X c k ki k! X = hˆ c k L ki = X k k hˆ L kic k.

A. MATHEMATICAL PRELIMINARIES 71 Therefore, define the matrix M jk def = hˆ L ki and we see b = Mc. For this reason, an expression of the form hˆ L ki is sometimes called a matrix element of the operator L. Note that the matrix depends on the bases we choose. A.2.d Outer product or dyad We can form the product of a ket and a bra, which is called a dyad or outer product. Considerfirstthefinitedimensionalcase.If i is an m 1column vector, and i is an n 1columnvector(sothath is a 1 n row vector), then the outer product ih is an m n matrix. In most cases of interest m = n. Sincematrixmultiplicationisassociative,( ih ) i = ih i. More generally, we can form outer products of infinite-dimensional vectors in Hilbert spaces. If i2h 0 and i 2H,then ih is the linear operator L : H!H 0 defined, for any i2h: L i =( ih ) i = ih i. That is, ih is the operator that returns i scaled by the inner product of i and its argument. To the extent that the inner product h i measures the similarity of i and i, theresult i is weighted by this similarity. The product of a ket and a bra ih can be pronounced -ket bra- or ket-bra, and abbreviated ih. Thisproductisalsocalledadyad. The special case of ih in which i is normalized is called a projector onto i. This is because ih i = ih i, thatis, i scaled by the projection of i on i. More generally, if 1 i,..., m i are orthonormal, then P m k=1 kih k projects into the m-dimensional subspace spanned by these vectors. Any linear operator can be represented as a weighted sum of outer products. To see this, suppose L : H!Ĥ, ˆ i is a basis for Ĥ, and ki is a basis for H. Consider i = L i. We know from Sec. A.2.c that hˆ i = X k M jk c k,wherem jk = hˆ L ki, andc k = hk i. Hence, i = X j ˆ i hˆ i

72 CHAPTER III. QUANTUM COMPUTATION = X! X ˆ i M jk hk i j k X = ˆ i X! M jk hk i j k! X = M jk ˆ ihk i. jk Hence, we have a sum-of-outer-products representation of the operator in terms of its matrix elements: L = X jk M jk ˆ ih k, wherem jk = hˆ L ki. A.2.e Tensor products In this section we define the tensor product, whichisofcentralimportancein quantum computation. To see where we are headed, suppose i and i are the quantum states of two objects (e.g., the states of two qubits, or quantum bits). Then the state of the composite system (e.g., the pair of qubits) will be represented by the tensor product i i, whichwecanthinkofasa sort of concatenation or structure formed of i and i. IfH and H 0 are the Hilbert spaces from which these states are drawn, then the tensor product space H H 0 is the space of all possible states of the two-qubit system (i.e., all such pairs or structures). We can apply the tensor product to operators as well: L M is the operator that applies, in parallel, L to the first qubit of the pair and M to the second qubit: (L M)( i i) =(L i) (M i). For vectors, operators, and spaces, we pronounce L M as L tensor M. As we will see, the tensor product is essential to much of the power of quantum computation. Next we develop these ideas more formally. Suppose that j i is an ON basis for H and 0 k i is an ON basis for H0. For every pair of basis vectors, define the tensor product j i 0 k i as a sort of couple or pair of the two basis vectors; that is, there is a one-to-one correspondence between the j i 0 k i and the pairs in { 0i, 1 i,...} { 0 0i, 0 1i,...}. Define the tensor product space H H 0 as the space spanned

A. MATHEMATICAL PRELIMINARIES 73 by all linear combinations of the basis vectors j i k 0 i. Therefore each element of H H 0 is represented by a unique sum P jk c jk j i k 0 i.inorder to make H H 0 a Hilbert space, we need an inner product: h 1 2 1 2 i = h 1 1 ih 2 2 i. That is, we multiply the inner products of the corresponding elements of the tensor product pairs. Usually, we are dealing with finite-dimensional spaces, in which case the tensor products can be defined less abstractly in terms of matrices. Suppose in a given basis i =(u 1,...,u m ) T and i =(v 1,...,v n ) T,thentheirtensor product in that basis can be defined by the Kronecker product: 0 1 i i = B @ u 1 i. u m i C A = u 1 i T,...,u m i T T = (u 1 v 1,...,u 1 v n,...,u m v 1...,u m v n ) T. Note that this is an mn 1columnvectorandthat ( i i) (j 1)n+k = u j v k. This combinatorial explosion of dimension is what gives quantum computation its power. The following abbreviations are frequent: i =, i = i i = i i. Notethat i i can only be a tensor product because it would not be a legal matrix product. These are some useful properties of the tensor product (which is bilinear): (c i) i = c( i i) = i (c i), ( i + i) i = ( i i)+( i i), i ( i + i) = ( i i)+( i i). The tensor product of linear operators is defined (L M) ( i i) =L i M i.

74 CHAPTER III. QUANTUM COMPUTATION Using the fact that i = P jk c jk j i k 0 i you can compute (L M) i for an arbitrary i2h H 0 (exercise). If M is a k m matrix and N is a l n matrix, then their Kronecker product is a kl mn matrix: 0 1 M 11 N M 12 N M 1m N M 21 N M 22 N M 2m N M N = B @..... C. A. M k1 N M k2 N M km N Matrices, of course, are linear operators and satisfy (M N) ( i i) = M i N i. For a vector, operator, or space M, wedefinethetensor power M n to be M tensored with itself n times: A.2.f M n = n z } { M M M. Properies of operators and matrices Several properties of operators and matrices are important in quantum computation. An operator L : H!His normal if L L = LL.Thesameapplies to square matrices. That is, normal operators commute with their adjoints. An operator L : H!His Hermitian or self-adjoint if L = L. Thesame applies to square matrices. (Hermitian matrices are the complex analogues of symmetric matrices.) Note that Hermitian operators are normal. It is easy to see that L is Hermitian if and only if h L i = h L i for all i, i (since h L i = h L i = h L i). A normal matrix is Hermitian if and only if it has real eigenvalues (exercise). This is important in quantum mechanics, since measurement results are usually assumed to be real. An operator U is unitary if U U = UU = I. Thatis,aunitaryoperator is invertible and its inverse is its adjoint: if U is unitary, then U 1 = U. Obviously every unitary operator is also normal. (A normal matrix is unitary if and only if its spectrum themultisetofitseigenvalues iscontained in the unit circle in the complex plane.) Unitary operators are like rotations of a complex vector space (analogous to orthogonal operators, which are rotations of a real vector space). Just as orthogonal transformations preserve the angles between vectors, unitary operators preserve their inner products (which are analogous to angles).

A. MATHEMATICAL PRELIMINARIES 75 Consider the inner product between U i and U i: (U i) U i = h U U i = h i. Hence, the inner product of U i and U i is the same as the inner product of i and i. Therefore, unitary operators are isometric, that is, they preserve norms: ku ik 2 = h U U i = h i = k ik 2. Unitary operators are important in quantum computation because the evolution of quantum systems is unitary. A.2.g Spectral decomposition and operator functions (supplementary) For any normal operator on a finite-dimensional Hilbert space, there is an ON basis that diagonalizes the operator, and conversely, any diagonalizable operator is normal. This is called a spectral decomposition of the operator. The ON basis comprises its set of eigenvectors, which we can write 0i, 1i,..., ni and the corresponding eigenvalues k are the diagonal elements (cf. Sec. A.2.d, p. 72): L = P n k=1 k kih k. Therefore, a matrix is normal if and only if it can be diagonalized by a unitary transform (see A.2.f, above). That is, it is normal if and only if there is a unitary U such that L = U U,where =diag( 1,... n). If 0i, 1i,..., ni is the basis, then U =( 0i, 1i,..., ni) and 0 U = B @ (More generally, this property holds for compact normal operators.) It is often convenient to extend various complex functions (e.g., ln, exp, p ) to normal matrices and operators. If f : C! C and L : H!H,thenwe define: f(l) def = h0 h1. hn 1 C A. nx f( k ) kih k, k=1

76 CHAPTER III. QUANTUM COMPUTATION where L = P n k=1 k kih k is the spectral decomposition of L. Therefore, for anormallinearoperatorormatrixl we can write p L,lnL, e L,etc.Thisis not an arbitrary extension, but follows from the power series expansion for f.