Lecture 3: Hilbert spaces, tensor products

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

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

Quantum Gates, Circuits & Teleportation

1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8

C/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).

Quantum Computing Lecture 2. Review of Linear Algebra

Linear Algebra and Dirac Notation, Pt. 1

Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

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

Principles of Quantum Mechanics Pt. 2

Lecture 4: Postulates of quantum mechanics

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

Linear Algebra and Dirac Notation, Pt. 3

Chapter 10. Quantum algorithms

1 Dirac Notation for Vector Spaces

QLang: Qubit Language

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

Mathematical Methods wk 1: Vectors

Mathematical Methods wk 1: Vectors

Short Course in Quantum Information Lecture 2

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

The quantum state as a vector

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Single qubit + CNOT gates

Quantum Information & Quantum Computation

Quantum Entanglement and the Bell Matrix

Categories and Quantum Informatics: Hilbert spaces

Review of Linear Algebra

Quantum Entanglement and Error Correction

2. Introduction to quantum mechanics

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

Ph 219/CS 219. Exercises Due: Friday 20 October 2006

The following definition is fundamental.

Introduction to Quantum Computing

Quantum Information & Quantum Computing

Vector spaces and operators

Some Introductory Notes on Quantum Computing

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

1 The Dirac notation for vectors in Quantum Mechanics

Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,

6.896 Quantum Complexity Theory September 9, Lecture 2

Lecture 6: Vector Spaces II - Matrix Representations

Linear Algebra using Dirac Notation: Pt. 2

LECTURE 6: LINEAR VECTOR SPACES, BASIS VECTORS AND LINEAR INDEPENDENCE. Prof. N. Harnew University of Oxford MT 2012

Chapter 11 Evolution by Permutation

Chapter 2. Basic Principles of Quantum mechanics

Lecture 2: Linear operators

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Factoring on a Quantum Computer

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9

1 Mathematical preliminaries

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Unitary Dynamics and Quantum Circuits

Formalism of Quantum Mechanics

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

Linear Algebra in Hilbert Space

Ph 219b/CS 219b. Exercises Due: Wednesday 20 November 2013

1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12

Lecture 11 September 30, 2015

Clifford Algebras and Spin Groups

The Framework of Quantum Mechanics

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

Lecture 2: From Classical to Quantum Model of Computation

Vector Spaces in Quantum Mechanics

Multilinear Singular Value Decomposition for Two Qubits

Linear Algebra Massoud Malek

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks

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

Basics on quantum information

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

PLEASE LET ME KNOW IF YOU FIND TYPOS (send to

Quantum Physics II (8.05) Fall 2002 Assignment 3

Linear Algebra Review. Vectors

II. The Machinery of Quantum Mechanics

Lecture If two operators A, B commute then they have same set of eigenkets.

Ph 219b/CS 219b. Exercises Due: Wednesday 21 November 2018 H = 1 ( ) 1 1. in quantum circuit notation, we denote the Hadamard gate as

5. Orthogonal matrices

MAT 445/ INTRODUCTION TO REPRESENTATION THEORY

Basics on quantum information

Mathematical Foundations of Quantum Mechanics

1 Measurements, Tensor Products, and Entanglement

Lecture # 3 Orthogonal Matrices and Matrix Norms. We repeat the definition an orthogonal set and orthornormal set.

Outline 1. Real and complex p orbitals (and for any l > 0 orbital) 2. Dirac Notation :Symbolic vs shorthand Hilbert Space Vectors,

Assignment 2 Solutions. 1. The general state of a spin half particle with spin component S n = S ˆn = 1 2 can be shown to be given by

A Course in Quantum Information Theory

Linear Algebra Review

Lecture 3: Constructing a Quantum Model

Private quantum subsystems and error correction

Linear Algebra: Matrix Eigenvalue Problems

The Spectral Theorem for normal linear maps

MP 472 Quantum Information and Computation

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

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

Quantum information and quantum computing

Quantum computing! quantum gates! Fisica dell Energia!

Vectors in Function Spaces

Transcription:

CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second lecture. 1 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (e.g. a system that can be in one of k distinct energy states. The state of such a system is a unit vector in a k dimensional complex vector space C k. The k distinguishable states form an orthogonal basis for the vector space - say denoted by { 1,..., k. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i i and ψ = i β i i is i ᾱiβ i. Dirac s Braket Notation We have already introduced the ket notation for vectors. If v = i α i i and w = i β i i, then we have already observed that ( ) ( v, w) = α 1 α α d We denote the row vector (α 1 α d ) by v and the inner product ( v, w) by v w. v is a bra, and w is a ket, so v w is a braket. To demonstrate the utility of this notation, let v be a vector of norm 1. Define P = v v. Then for any w we have P w = v v w, so P is the projection operator onto v (see diagram.) Note that P = v v v v = P since v has norm 1. More abstractly, the state of a quantum system is a unit vector in a Hilbert space. A Hilbert space is a complex vector space endowed with an inner-product and which is complete under the induced norm. The vector space axioms give us notions of span and linear independence of a set of vectors. However, to endow the vector space with geometry the notion of angle between two vectors and the norm or length of a vector, we must define an inner-product whose properties are listed below. The third property completeness is trivially satisfied for a finite dimensional system, so we will not bother to define it here. β 1 β β d. An inner product on a (complex) vector space V is a map (, ) : V V C satisfying for each u, v, w V and α, β C: (i) ( v, v) 0, and ( v, v) = 0 if and only if v = 0; (ii) (α u + β v, w) = α( u, w) + β( v, w); (iii) ( v, w) = ( w, v). 1

An inner product space is a vector space together with an inner product. Vectors v, w V are orthogonal if ( v, w) = 0. A basis for V is a set { v 1,, v d } such that each v V can be written uniquely in the form v = α 1 v 1 + + α n v n. The basis is said to be orthonormal if ( v i, v j ) = δ ij for each i, j. (Here δ ij = 1 if i = j and 0 if i j.) Note that we can associate to each inner product space a canonical norm, defined by v = ( v, v). A Hilbert space is an inner product space which is complete with respect to its norm. If V is finite-dimensional (i.e. it has a finite basis), then completeness is automatically satisfied. Furthermore, there is only one Hilbert space of each dimension (up to isomorphism.) Tensor Products Consider two quantum systems - the first with k distinguishable (classical) states (associated Hilbert space C k ), and the second with l distinguishable states (associated Hilbert space C l ). What is the Hilbert space associated with the composite system? We can answer this question as follows: the number of distinguishable states of the composite system is kl since for each distinct choice of basis (classical) state i of the first system and basis state j of the second system, we have a distinguishable state of the composite system. Thus the Hilbert space associated with the composite system is C kl. The tensor product is a general construction that shows how to go from two vector spaces V and W of dimension k and l to a vector space V W (pronounced V tensor W ) of dimension kl. Fix bases v 1,..., v k and w 1,..., w l for V, W respectively. Then a basis for V W is given by { v i w j : 1 i k, 1 j l}, so that dim(v W ) = kl. So a typical element of V W will be of the form ij α ij( v i w j ). We can define an inner product on V W by ( v 1 w 1, v w ) = ( v 1, v ) ( w 1, w ), which extends uniquely to the whole space V W. For example, consider V = C C. V is a Hilbert space of dimension 4, so V = C 4. So we can write 00 alternatively as 0 0. More generally, for n qubits we have C (n times) C = C n. A typical element of this space is of the form x {0,1} n α x x. A word of caution: Not all elements of V W can be written as v w for v V, w W. As an example, consider the Bell state φ + = 1 ( 00 + 11 ).

3 The Significance of Tensor Products Classically, if we put together a subsystem that stores k bits of information with one that stores l bits of information, the total capacity of the composite system is k + l bits. From this viewpoint, the situation with quantum systems is extremely paradoxical. We need k complex numbers to describe the state of a k-level quantum system. Now consider a system that consists of a k-level subsystem and an l-level subsystem. To describe the composite system we need kl complex numbers. One might wonder where nature finds the extra storage space when we put these two subsystems together. An extreme case of this phenomenon occurs when we consider an n qubit quantum system. The Hilbert space associated with this system is the n-fold tensor product of C C n. Thus nature must remember of n complex numbers to keep track of the state of an n qubit system. For modest values of n of a few hundred, n is larger than estimates on the number of elementary particles in the Universe. This is the fundamental property of quantum systems that is used in quantum information processing. Finally, note that when we actually a measure an n-qubit quantum state, we see only an n-bit string - so we can recover from the system only n, rather than n, bits of information. 4 Unitary Operators and Quantum Gates 4.1 Unitary Operators A postulate of quantum physics is that quantum evolution is unitary. That is, if we have some arbitrary quantum system U that takes as input a state φ and outputs a different state U φ, then we can describe U as a unitary linear transformation, defined as follows. If U is any linear transformation, the adjoint of U, denoted U, is defined by (U v, w) = ( v, U w). In a basis, U is the conjugate transpose of U; for example, for an operator on C, U = ( ) a b c d U = ( ) ā c b d. We say that U is unitary if U = U 1. For example, rotations and reflections are unitary. Also, the composition of two unitary transformations is also unitary (Proof: U, V unitary, then (UV ) = V U = V 1 U 1 = (UV ) 1 ). Some properies of a unitary transformation U: The rows of U form an orthonormal basis. The colums of U form an orthonormal basis. U preserves inner products, i.e. ( v, w) = (U v, U w). Indeed, (U v, U w) = (U v ) U w = v U U w = v w. Therefore, U preserves norms and angles (up to sign). The eigenvalues of U are all of the form e iθ (since U is length-preserving, i.e., ( v, v) = (U v, U v)). 3

U can be diagonalized into the form e iθ 1 0 0. 0..... 0........ 0 0 e iθ d 4. Quantum Gates We give some examples of simple unitary transforms, or quantum gates. Some quantum gates with one qubit: Hadamard Gate. Can be viewed as a reflection around π/8, or a rotation around π/4 followed by a reflection. H = 1 ( ) 1 1 1 1 The Hadamard Gate is one of the most important gates. Note that H = H since H is real and symmetric and H = I. Rotation Gate. This rotates the plane by θ. ( ) cos θ sin θ U = sin θ cos θ NOT Gate. This flips a bit from 0 to 1 and vice versa. ( ) 0 1 NOT = 1 0 Phase Flip. Z = ( 1 0 0 1 The phase flip is a NOT gate acting in the + = 1 ( 0 + 1 ), = 1 ( 0 1 ) basis. Indeed, Z + = and Z = +. And a two-qubit quantum gate: Controlled Not (CNOT). CNOT = ) 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 The first bit of a CNOT gate is the control bit; the second is the target bit. The control bit never changes, while the target bit flips if and only if the control bit is 1. The CNOT gate is usually drawn as follows, with the control bit on top and the target bit on the bottom: 4

4.3 Tensor product of operators Suppose v and w are unentangled states on C m and C n, respectively. The state of the combined system is v w on C mn. If the unitary operator A is applied to the first subsystem, and B to the second subsystem, the combined state becomes A v B w. In general, the two subsystems will be entangled with each other, so the combined state is not a tensor-product state. We can still apply A to the first subsystem and B to the second subsystem. This gives the operator A B on the combined system, defined on entangled states by linearly extending its action on unentangled states. (For example, (A B)( 0 ) = A 0 B 0. (A B)( 1 1 ) = A 1 B 1. Therefore, we define (A B)( 1 00 + 1 11 ) to be 1 (A B) 00 + 1 (A B) 11 = ( 1 A 0 B 0 + A 1 B 1 ).) Let e 1,..., e m be a basis for the first subsystem, and write A = m i,j=1 a ij e i ej (the i,jth element of A is a ij ). Let f 1,..., f n be a basis for the second subsystem, and write B = n k,l=1 b kl fk fl. Then a basis for the combined system is ei fj, for i = 1,..., m and j = 1,..., n. The operator A B is ( ) A B = a ij e i ej b kl f k fl ij = ijkl a ij b kl e i ej f k fl kl = ijkl a ij b kl ( e i f k )( ej f l ). Therefore the (i, k), (j, l)th element of A B is a ij b kl. If we order the basis e i f j lexicographically, then the matrix for A B is a 11 B a 1 B a 1 B a B ;..... in the i, jth subblock, we multiply a ij by the matrix for B. 5