Representation theory of SU(2), density operators, purification Michael Walter, University of Amsterdam

Size: px
Start display at page:

Download "Representation theory of SU(2), density operators, purification Michael Walter, University of Amsterdam"

Transcription

1 Symmetry and Quantum Information Feruary 6, 018 Representation theory of S(), density operators, purification Lecture 7 Michael Walter, niversity of Amsterdam Last week, we learned the asic concepts of group representation theory (Lecture 5) and we proved that the symmetric suspaces are irreducile representations of S() (Lecture 6). Today, we will discuss how the symmetric suspaces fit in the representation theory of S() more generally, and we will discuss how to decompose an aritrary representation of S() into irreduciles. In the second half of the lecture, we will switch gears and introduce density operators, which is a generalization of the notion of a quantum state. 7.1 Representation theory of S() We start y introducing some notation. For reasons that will ecome clear soon, it will e convenient to use k instead of n. So we will write Sym k (C ) for the symmetric suspace of the k-th tensor power. Let us also denote y T (k) the restriction of T = k to the symmetric suspace. That is, T (k) is given y the same formula k, ut we only plug in vectors in the symmetric suspace and rememer that the result will automatically y in the symmetric suspace. For k = 0, we define Sym 0 (C ) = C as the trivial representation, with T (0) = I. Thus, the Hilert space Sym k (C ) together with the operators {T (k) } S() defines a representation of S(), and it is this representation that we proved to e irreducile in Lecture 6. A asic question in the representation theory of any group is to ask aout the possile irreducile representations, up to equivalence. For the group S(), one can show that every irreducile representation is equivalent to a symmetric suspace (we will not prove this fact). That is, if H is an aritrary irreducile representation of S(), with corresponding operators {R }, then there exists k 0 and a unitary intertwiner J H Sym k (C ) such that JR J = T (k) S(). We will areviate this situation y the notation H Sym k (C ) and R T (k) introduced last lecture. Moreover, the symmetric suspaces are inequivalent for k l, i.e., Sym k (C ) / Sym l (C ). This follows directly from the fact that dim Sym k (C ) = k + 1, so there cannot e a unitary map etween different symmetric suspaces. To summarize, any irreducile representation H of S() is equivalent to exactly one of the symmetric suspaces Sym k (C ), up to equivalence, and can therefore y laeled y an integer k. We can determine k directly from the dimension formula as k = dim H 1. You may know from your quantum mechanics class that the irreducile representations can also e laeled y their spin j, which is a half-integer. As you might expect, the connection is precisely that j = k/. Let us discuss some examples. A good source of S()-representations are the various tensor powers of C, i.e., (C ) n, so this is what we shall consider. For n = 0, we have the trivial representation and for n = 1, we have (C ) 0 = Sym 0 (C ), (C ) 1 = Sym 1 (C ) = C 47

2 so this is again irreducile (and not very interesting). The first interesting examples is n =, since here we know that (C ) is not irreducile. In fact: (C ) = C C = Sym (C ) C Ψ, where Ψ = 1 ( ) is the singlet state. Both summands are the irreducile the former ecause it is a symmetric suspace, and the latter since it is a one-dimensional invariant suspace. Which symmetric suspace is the latter isomorphic to? Clearly, this must e the one-dimensional Sym 0 (C ). To see this more concretely, recall that in Prolem.1 you showed that ( ) Ψ = det() Ψ for all unitaries. If S() then det() = 1, so Ψ spans indeed a trivial representation. We can summarize this as follows: C C Sym (C ) Sym 0 (C ). (7.1) Is there a systematic way of decomposing higher tensor powers (C ) n for n >? We will discuss this next. 7. Decomposing representations of S() In fact, let us consider a more general question: Suppose we are given an aritrary S()- representation H, with operators {R } S(). We know that we can always decompose a representation into irreduciles, so that H Sym k 1 (C ) Sym k (C )... Sym km (C ), ut how can we determine the numers k 1,..., k m that appear? In other words, how can we figure out how many times a certain irreducile representation Sym k (C ) appears in H? We can solve this y a similar procedure as we used last time in class. Start y defining the operator r = i s=0 [R e is ]. (7.) Note that e is = ( eis 0 ) S(), so this definition makes sense assuming R 0 e is is differentiale as a function of. In general, the operator r will always e Hermitian. (As mentioned in the previous lecture, this definition can e understood more conceptually in terms of the action of the Lie algera of S().) For example, if H = (C ) n with R = n, then r = = I... I + + I... I in the notation of yesterday s lecture, which was one of the ingredients for proving that the symmetric suspaces are irreducile. In particular, we proved that the operator preserves the symmetric suspace. Let us denote its restriction y t (k). Yesterday, we proved that each of the asis vectors ω m,k m for m = 0,..., k are eigenvectors of t (k), with associated eigenvalue m k. Thus, the operator t (k) has eigenvalues { k, k +,..., k, k}, each with multiplicity one. Now assume that H is irreducile and equivalent to some Sym k (C ) y a unitary intertwiner J H Sym k (C ). Then, Jr J = i s=0 [JR e is J ] = i s=0 [T (k) e is ] = t (k), 48

3 and so we see that r has likewise eigenvalues { k, k +,..., k, k}, each with multiplicity one. How aout the general case, where H Sym k 1 (C ) Sym k (C )... Sym km (C )? Here we have a unitary intertwiner J such that JR J = T (k 1) T (k ) T (km) and hence Jr J = t (k 1) t (k ) t (km) for the same reason as aove. It follows that the eigenvalue spectrum of r is given y the multiset { k 1, k 1 +,..., k 1, k 1 } { k, k +,..., k, k } { k m, k m +,..., k m, k m }. It is not hard to see that one can inductively reverse-engineer the numers k 1, k,..., k m from this multiset: Start y taking the largest numer; it must e one of the k i s. Remove the corresponding { k i, k i +,..., k i, k i } from the set, and repeat the procedure. Let us discuss some examples. First, we can use this to reprove the decomposition in Eq. (7.1). Here, H = C C and r = = I + I as explained aove. Thus, r is diagonal in the computational asis and the eigenvalues of r are This decomposition makes it clear that {, 0, 0, } = {, 0, } {0}. (C ) = C C Sym (C ) Sym 0 (C ), (7.3) which confirms our previous decomposition. Next, let us consider H = C C C, where r = = I I + I I + I I. Here the eigenvalues are which implies that {3, 1, 1, 1, 1, 1, 1, 3} = {3, 1, 1, 3} {1, 1} {1, 1}, (C ) 3 = C C C Sym 3 (C ) Sym 1 (C ) Sym 1 (C ). (7.4) At least in principle it is now clear how to proceed for aritrary tensor powers (C ) n. However, the counting gets more involved the larger n, so it is desirale to figure out an inductive way of computing this decomposition. The asic prolem that we have to solve is the following. 49

4 Suppose that we have an irreducile representation Sym k (C ) and we tensor it with an additional quit C, i.e., we consider the representation H = Sym k (C ) C, R = T (k). How does it decompose into irreduciles? The answer is the following: H = Sym k (C ) C Sym k+1 (C ) Sym k 1 (C ) if k > 0 C if k = 0. (7.5) To confirm this formula, note that r = t (k) I + I, so that the eigenvalues are { k ± 1, k + ± 1,..., k ± 1, k ± 1} = { (k + 1), (k 1),..., k 1, k + 1} { (k 1),..., k 1}; the second set is empty if k = 0. See Fig. 14 for an illustration. Equation (7.5) is as special case of the so-called Clesch-Gordan rule that you might know from a quantum mechanics class. It tells you more generally how to decompose Sym k (C ) Sym l (C ). We will not need the general result ut it can e proved just like aove. Let s quickly check that Eq. (7.5) reproduces the same results that we derived aove. We start y (C ) = Sym 1 (C ) C Sym (C ) Sym 0 (C ). The last step is using the Clesch-Gordan rule and the result is in agreement with Eqs. (7.1) and (7.3). Next, we decompose the third tensor power y tensoring with an additional quit: (C ) 3 = (C ) C (Sym (C ) Sym 0 (C )) C (Sym (C ) C ) (Sym 0 (C ) C ) (Sym 3 (C ) Sym 1 (C )) (Sym 1 (C )) = Sym 3 (C ) Sym 1 (C ) Sym 1 (C ), which confirms Eq. (7.4). Here we first used the two-quit result, then the distriutivity law, and finally the Clesch-Gordan rule. Similarly, (C ) 4 (Sym 3 (C ) Sym 1 (C ) Sym 1 (C )) C Sym 4 (C ) Sym (C ) Sym (C ) Sym (C ) Sym 0 (C ) Sym 0 (C ). It is now clear how to decompose (C ) n for aritrary n in an inductive fashion. We will use this to great effect in two weeks in Lectures 11 and 1. There, we will also learn how to extend our considerations from S() to (). 7.3 Density operators Before we proceed with entanglement and symmetries, we need to introduce another it of formalism to our toolox that allows us talk aout ensemles of quantum states. Suppose that we have a device let s call it a quantum information source that emits different quantum states ψ i with proaility p i each, where i ranges in some index set, as in the following picture: 50

5 We call {p i, ψ i } an ensemle of quantum states on some Hilert space H. Importantly, the state ψ i need not e orthogonal. What are the statistics that we otain when we measure a POVM {Q x } x Ω? Clearly this is given y Pr(outcome x) = i p i Pr ψi (outcome x) = i p i ψ i Q x ψ i = i p i tr [ ψ i ψ x Q x ] = tr[ p i ψ i ψ x Q x ], i = ρ where we first used the fact that state ψ i is emitted with proaility p i and then the usual Born s rule. The operator ρ defined aove is called a density operator (or a density matrix) or simply a quantum state on H. It satisfies ρ 0 and tr ρ = 1, and any such operator arises from some ensemle of quantum states (think of the spectral decomposition!). Thus, Born rule for density operators reads Pr ρ (outcome x) = tr[ρ Q x ], as we just calculated. Similarly, if X = x P x is an oservale then its expectation value can likewise e computed in terms of the density operator: E ρ [outcome] = tr[ρ X] as is easily verified. In Prolem 3.4 you will verify that if we perform a projective measurement {P x } x Ω on an ensemle with density operator ρ and we otain the outcome x, then the postmeasurement state corresponds to an ensemle with density operator ρ = P xρp x tr[ρ P x ] If ρ = ψ ψ then we say that it is a pure state and it is not uncommon to also write ρ = ψ in this case (in agreement with our previous definition). Note that ρ is pure iff rk ρ = 1 iff the eigenvalues of ρ are {1, 0,..., 0} iff ρ = ρ. If ρ is not pure then it is called a mixed state (ut this is also often used synonymously with density operator ). Example 7.1 (Warning!). In general, the ensemle that determines a density operator is not unique. E.g., the density operator τ = I/ can e written in an infinite numer of ways: τ = 1 ( ) = 1 ( ) = 1 ( ) =... 4 The first two expressions are two different spectral decompositions, which is possily only ecause the operator has a degenerate eigenspace. The last expression, however, is not a spectral decomposition since the states used are not all pairwise orthogonal and the proaility 1/4 is not an eigenvalue of τ. There are infinitely many other ensemles that give rise to τ. More generally, if H is a Hilert space then τ H = I H / dim H is known as the maximally mixed state on H. It is the analog of a uniform distriution in proaility theory. Density operators arise in a numer of places. For example, they descrie quantum information sources (as we saw aove) and ensemles in statistical physics (e.g., Gis states). They also 51

6 allow us to emed classical proaility distriutions into quantum theory: E.g., if {p x } d x=1 is an ordinary proaility distriution then it makes sense to associate it with the ensemle {p x, x } on C d (since classical states should e perfectly distinguishale and hence orthogonal), and this ensemle in turn gives rise to the density operator p 1 ρ X = p x x x = ( p ). (7.6) x p d More generally, if p(x 1,..., x n ) is a joint proaility distriution then we may consider the ensemle {p(x 1,..., x n ), x 1... x n }. The corresponding density operator is ρ X1...X n = p(x 1,..., x n ) x 1 x 1... x n x n. (7.7) x 1,...,x n We call quantum states as in Eqs. (7.6) and (7.7) classical states. Note that if all proailities p(x 1,..., x n ) are the same then ρ X1,...,X n is a maximally mixed state, ρ = τ. Importantly, density operators also arise descriing the state of quantum susystems, as we will discuss in the following section. 7.4 Reduced density operators and partial trace Suppose that ρ AB is a quantum state on H A H B. We could like to find the mathematical oject (hopefully, a density operator) that descries the state of susystem A, as illustrated elow: As efore, we consider a POVM measurement {Q A,x } x Ω on H A. According to our postulates, we know that we need to consider the POVM {Q A,x I B } when we want to perform this measurement on a joint system ρ AB. Thus, Pr ρab (outcome x) = tr[ρ AB (Q A,x I B )] = a ρ AB (Q A,x I B ) a a, = a (I A )ρ AB (I A )Q A,x a a, = a a (I A )ρ AB (I A )Q A,x a = tr[ (I A ) ρ AB (I A ) Q A,x ] = tr B [ρ AB ] The operation tr B just introduced is called the partial trace over B. If ρ AB is a quantum state then tr B [ρ AB ] is called the reduced density operator (or reduced density matrix of ρ AB. We will often denote it y ρ A = tr B [ρ AB ] (even though this can at times seem amiguous). Conversely, ρ AB is said to e an extension of ρ A. By construction, tr[ρ AB (X A I B )] = tr[ρ A X A ], (7.8) 5

7 and so the reduced density operator ρ A is the appropriate oject when compuitng proailities and expectation values for measurements on A. E.g., as we derived aove, for every POVM measurement {Q A,x } on H A we have Pr ρab (outcome x) = Pr ρa (outcome x) = tr[ρ A Q A,x ] and, similarly, for every oservale X A on H A, E ρab [outcome] = E ρab [outcome] = tr[ρ A X A ]. Thus, the reduced density operator faithfully descries the state of the susystem A if the overall system is in state ρ AB. We can also compute partial traces of operator that are not quantum states: If M AB is an aritrary operator on H A H B then its partial trace over B is defined just as efore y the formula tr B [M AB ] = (I A ) M AB (I A ). However, if M AB is not a state then we will never denote this partial trace y M A. The following useful rule tells us how to compute partial traces of tensor product operators M A N B and justifies the term partial trace : It follows directly from the definition: tr B [M A N B ] = Other useful properties are tr B [M A N B ] = M A tr[n B ] (7.9) (I A ) (M A N B ) (I A ) = M A N B = M A tr[n B ]. tr B [(M A I B )X AB (M A I B)] = M A tr B [O AB ]M B (we can pull out operators on A), tr B [(I M B )O AB ] = tr B [O AB (I M B )] (the partial trace is cyclic for operators on B). Remark. A useful convention that you will often find in the literature is that tensor products with the identity operator are omitted. E.g., instead of X A I B we would write X A, since the suscripts already convey the necessary information. Thus, instead of Eqs. (7.8) and (7.9) we would write which is argualy easier to read. tr[ρ AB X A ] = tr[ρ A X A ], tr B [M A N B ] = M A tr[n B ] Let us close today s lecture with an example in which we explicitly compute the reduced density operator of the eit. Example (Warning!). Even if ρ AB is a pure state, ρ A can e mixed! Consider the eit state ψ AB = 1 ( ). The corresponding density operator is ρ AB = ψ ψ AB = 1 ( ) ( ) = 1 ( ) = 1 ( ), 53

8 and so the reduced density operator ρ A is given y ρ A = tr B [ ψ ψ AB ] = 1 ( ) = ( where we used Eq. (7.9). Thus ρ A is a mixed state. In fact, ρ A is the maximally mixed state τ A introduced in/elow Example 7.1. Note that this matches precisely our calculation in Eq. (.) in Lecture. ), 54

SU(N) representations

SU(N) representations Appendix C SU(N) representations The group SU(N) has N 2 1 generators t a which form the asis of a Lie algera defined y the commutator relations in (A.2). The group has rank N 1 so there are N 1 Casimir

More information

Instantaneous Measurement of Nonlocal Variables

Instantaneous Measurement of Nonlocal Variables Instantaneous Measurement of Nonlocal Variales Richard A. Low richard@wentnet.com August 006 Astract We ask the question: is it possile to measure nonlocal properties of a state instantaneously? Relativistic

More information

The Framework of Quantum Mechanics

The Framework of Quantum Mechanics The Framework of Quantum Mechanics We now use the mathematical formalism covered in the last lecture to describe the theory of quantum mechanics. In the first section we outline four axioms that lie at

More information

Lecture 12: Grover s Algorithm

Lecture 12: Grover s Algorithm CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 12: Grover s Algorithm March 7, 2006 We have completed our study of Shor s factoring algorithm. The asic technique ehind Shor

More information

10 Lorentz Group and Special Relativity

10 Lorentz Group and Special Relativity Physics 129 Lecture 16 Caltech, 02/27/18 Reference: Jones, Groups, Representations, and Physics, Chapter 10. 10 Lorentz Group and Special Relativity Special relativity says, physics laws should look the

More information

Density Matrices. Chapter Introduction

Density Matrices. Chapter Introduction Chapter 15 Density Matrices 15.1 Introduction Density matrices are employed in quantum mechanics to give a partial description of a quantum system, one from which certain details have been omitted. For

More information

Quivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006

Quivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006 Quivers Virginia, Lonardo, Tiago and Eloy UNICAMP 28 July 2006 1 Introduction This is our project Throughout this paper, k will indicate an algeraically closed field of characteristic 0 2 Quivers 21 asic

More information

Compression and entanglement, entanglement transformations

Compression and entanglement, entanglement transformations PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read

More information

MP 472 Quantum Information and Computation

MP 472 Quantum Information and Computation MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density

More information

PHYS 705: Classical Mechanics. Introduction and Derivative of Moment of Inertia Tensor

PHYS 705: Classical Mechanics. Introduction and Derivative of Moment of Inertia Tensor 1 PHYS 705: Classical Mechanics Introduction and Derivative of Moment of Inertia Tensor L and N depends on the Choice of Origin Consider a particle moving in a circle with constant v. If we pick the origin

More information

Introduction to Quantum Information Hermann Kampermann

Introduction to Quantum Information Hermann Kampermann Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................

More information

The Principles of Quantum Mechanics: Pt. 1

The Principles of Quantum Mechanics: Pt. 1 The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018

More information

The AKLT Model. Lecture 5. Amanda Young. Mathematics, UC Davis. MAT290-25, CRN 30216, Winter 2011, 01/31/11

The AKLT Model. Lecture 5. Amanda Young. Mathematics, UC Davis. MAT290-25, CRN 30216, Winter 2011, 01/31/11 1 The AKLT Model Lecture 5 Amanda Young Mathematics, UC Davis MAT290-25, CRN 30216, Winter 2011, 01/31/11 This talk will follow pg. 26-29 of Lieb-Robinson Bounds in Quantum Many-Body Physics by B. Nachtergaele

More information

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

Ph 219/CS 219. Exercises Due: Friday 20 October 2006 1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and

More information

INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS

INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS HANMING ZHANG Abstract. In this paper, we will first build up a background for representation theory. We will then discuss some interesting topics in

More information

Unit 2, Section 3: Linear Combinations, Spanning, and Linear Independence Linear Combinations, Spanning, and Linear Independence

Unit 2, Section 3: Linear Combinations, Spanning, and Linear Independence Linear Combinations, Spanning, and Linear Independence Linear Combinations Spanning and Linear Independence We have seen that there are two operations defined on a given vector space V :. vector addition of two vectors and. scalar multiplication of a vector

More information

Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2

Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2 Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum

More information

Stochastic Quantum Dynamics I. Born Rule

Stochastic Quantum Dynamics I. Born Rule Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible

More information

1 2 2 Circulant Matrices

1 2 2 Circulant Matrices Circulant Matrices General matrix a c d Ax x ax + cx x x + dx General circulant matrix a x ax + x a x x + ax. Evaluating the Eigenvalues Find eigenvalues and eigenvectors of general circulant matrix: a

More information

Ph12b Solution Set 4

Ph12b Solution Set 4 Ph Solution Set 4 Feruary 5, 00 The state ψ S un E is transforme to p ψ S un E + p a 0 S γ E + S η E Since γ E an η E aren t mutually orthogonal, we can t use this equation irectly to compute the new ensity

More information

Math 216 Second Midterm 28 March, 2013

Math 216 Second Midterm 28 March, 2013 Math 26 Second Midterm 28 March, 23 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that

More information

Lecture 10: A (Brief) Introduction to Group Theory (See Chapter 3.13 in Boas, 3rd Edition)

Lecture 10: A (Brief) Introduction to Group Theory (See Chapter 3.13 in Boas, 3rd Edition) Lecture 0: A (Brief) Introduction to Group heory (See Chapter 3.3 in Boas, 3rd Edition) Having gained some new experience with matrices, which provide us with representations of groups, and because symmetries

More information

Introduction to Group Theory

Introduction to Group Theory Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)

More information

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Upper Bounds for Stern s Diatomic Sequence and Related Sequences Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:

More information

Quantum Mechanics II: Examples

Quantum Mechanics II: Examples Quantum Mechanics II: Examples Michael A. Nielsen University of Queensland Goals: 1. To apply the principles introduced in the last lecture to some illustrative examples: superdense coding, and quantum

More information

1 Systems of Differential Equations

1 Systems of Differential Equations March, 20 7- Systems of Differential Equations Let U e an open suset of R n, I e an open interval in R and : I R n R n e a function from I R n to R n The equation ẋ = ft, x is called a first order ordinary

More information

THE INFLATION-RESTRICTION SEQUENCE : AN INTRODUCTION TO SPECTRAL SEQUENCES

THE INFLATION-RESTRICTION SEQUENCE : AN INTRODUCTION TO SPECTRAL SEQUENCES THE INFLATION-RESTRICTION SEQUENCE : AN INTRODUCTION TO SPECTRAL SEQUENCES TOM WESTON. Example We egin with aelian groups for every p, q and maps : + (here, as in all of homological algera, all maps are

More information

arxiv:quant-ph/ v3 13 Sep 2004

arxiv:quant-ph/ v3 13 Sep 2004 Self testing quantum apparatus arxiv:quant-ph/0307205v3 13 Sep 2004 Dominic Mayers and Andy Yao * Caltech, Pasasena, USA ** Princeton University, Princeton, USA (Dated: Feruary 1, 2008) We study, in the

More information

Polynomial Degree and Finite Differences

Polynomial Degree and Finite Differences CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial

More information

CS286.2 Lecture 13: Quantum de Finetti Theorems

CS286.2 Lecture 13: Quantum de Finetti Theorems CS86. Lecture 13: Quantum de Finetti Theorems Scribe: Thom Bohdanowicz Before stating a quantum de Finetti theorem for density operators, we should define permutation invariance for quantum states. Let

More information

Incompatibility Paradoxes

Incompatibility Paradoxes Chapter 22 Incompatibility Paradoxes 22.1 Simultaneous Values There is never any difficulty in supposing that a classical mechanical system possesses, at a particular instant of time, precise values of

More information

Lecture 4: Postulates of quantum mechanics

Lecture 4: Postulates of quantum mechanics Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying

More information

Schur-Weyl duality, quantum data compression, tomography

Schur-Weyl duality, quantum data compression, tomography PHYSICS 491: Symmetry and Quantum Information April 25, 2017 Schur-Weyl duality, quantum data compression, tomography Lecture 7 Michael Walter, Stanford University These lecture notes are not proof-read

More information

8.04 Spring 2013 March 12, 2013 Problem 1. (10 points) The Probability Current

8.04 Spring 2013 March 12, 2013 Problem 1. (10 points) The Probability Current Prolem Set 5 Solutions 8.04 Spring 03 March, 03 Prolem. (0 points) The Proaility Current We wish to prove that dp a = J(a, t) J(, t). () dt Since P a (t) is the proaility of finding the particle in the

More information

138. Last Latexed: April 25, 2017 at 9:45 Joel A. Shapiro. so 2. iψ α j x j

138. Last Latexed: April 25, 2017 at 9:45 Joel A. Shapiro. so 2. iψ α j x j 138. Last Latexed: April 25, 2017 at 9:45 Joel A. Shapiro The Hamiltonian for a noninteracting fermion 1 is H = d 3 x H 1, with H 1 = iψ j α ψ j + mψ j βψ j j Chapter 13 Local Symmetry So far, we have

More information

On the structure of a reversible entanglement generating set for three partite states

On the structure of a reversible entanglement generating set for three partite states On the structure of a reversile entanglement generating set for three partite states A. Acín 1, G. Vidal and J. I. Cirac 3 1 GAP-Optique, University of Geneva, 0, Rue de l École de Médecine, CH-111 Geneva

More information

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

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 6 Postulates of Quantum Mechanics II (Refer Slide Time: 00:07) In my last lecture,

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information

More information

Each element of this set is assigned a probability. There are three basic rules for probabilities:

Each element of this set is assigned a probability. There are three basic rules for probabilities: XIV. BASICS OF ROBABILITY Somewhere out there is a set of all possile event (or all possile sequences of events which I call Ω. This is called a sample space. Out of this we consider susets of events which

More information

Ensembles and incomplete information

Ensembles and incomplete information p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system

More information

Chapter 5. Density matrix formalism

Chapter 5. Density matrix formalism Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature

More information

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS NEEL PATEL Abstract. The goal of this paper is to study the irreducible representations of semisimple Lie algebras. We will begin by considering two

More information

Solving Systems of Linear Equations Symbolically

Solving Systems of Linear Equations Symbolically " Solving Systems of Linear Equations Symolically Every day of the year, thousands of airline flights crisscross the United States to connect large and small cities. Each flight follows a plan filed with

More information

PHY305: Notes on Entanglement and the Density Matrix

PHY305: Notes on Entanglement and the Density Matrix PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and

More information

Mathematics I: Algebra

Mathematics I: Algebra Mathematics I: lgera Prolem. Solve the following system of equations y using the reduced row echelon form of its augmented matrix: x + x x x x + x ; x x + 6x Solution: The augmented matrix is 6 F FF F;

More information

Quantum Information Types

Quantum Information Types qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction

More information

Real representations

Real representations Real representations 1 Definition of a real representation Definition 1.1. Let V R be a finite dimensional real vector space. A real representation of a group G is a homomorphism ρ VR : G Aut V R, where

More information

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition

More information

5 Irreducible representations

5 Irreducible representations Physics 29b Lecture 9 Caltech, 2/5/9 5 Irreducible representations 5.9 Irreps of the circle group and charge We have been talking mostly about finite groups. Continuous groups are different, but their

More information

Quantum Mechanics Basic Principles

Quantum Mechanics Basic Principles What is quantum mechanics? It is a framework for the evelopment of physical theories. It is not a complete physical theory in its own right. Quantum Mechanics Basic Principles QM slies y Michael A. Nielsen,

More information

Introduction to quantum information processing

Introduction to quantum information processing Introduction to quantum information processing Measurements and quantum probability Brad Lackey 25 October 2016 MEASUREMENTS AND QUANTUM PROBABILITY 1 of 22 OUTLINE 1 Probability 2 Density Operators 3

More information

3.5 Solving Quadratic Equations by the

3.5 Solving Quadratic Equations by the www.ck1.org Chapter 3. Quadratic Equations and Quadratic Functions 3.5 Solving Quadratic Equations y the Quadratic Formula Learning ojectives Solve quadratic equations using the quadratic formula. Identify

More information

MAT265 Mathematical Quantum Mechanics Brief Review of the Representations of SU(2)

MAT265 Mathematical Quantum Mechanics Brief Review of the Representations of SU(2) MAT65 Mathematical Quantum Mechanics Brief Review of the Representations of SU() (Notes for MAT80 taken by Shannon Starr, October 000) There are many references for representation theory in general, and

More information

Introduction to Quantum Mechanics

Introduction to Quantum Mechanics Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics

More information

MP463 QUANTUM MECHANICS

MP463 QUANTUM MECHANICS MP463 QUANTUM MECHANICS Introduction Quantum theory of angular momentum Quantum theory of a particle in a central potential - Hydrogen atom - Three-dimensional isotropic harmonic oscillator (a model of

More information

WOMP 2001: LINEAR ALGEBRA. 1. Vector spaces

WOMP 2001: LINEAR ALGEBRA. 1. Vector spaces WOMP 2001: LINEAR ALGEBRA DAN GROSSMAN Reference Roman, S Advanced Linear Algebra, GTM #135 (Not very good) Let k be a field, eg, R, Q, C, F q, K(t), 1 Vector spaces Definition A vector space over k is

More information

Consistent Histories. Chapter Chain Operators and Weights

Consistent Histories. Chapter Chain Operators and Weights Chapter 10 Consistent Histories 10.1 Chain Operators and Weights The previous chapter showed how the Born rule can be used to assign probabilities to a sample space of histories based upon an initial state

More information

Introduction to Quantum Spin Systems

Introduction to Quantum Spin Systems 1 Introduction to Quantum Spin Systems Lecture 2 Sven Bachmann (standing in for Bruno Nachtergaele) Mathematics, UC Davis MAT290-25, CRN 30216, Winter 2011, 01/10/11 2 Basic Setup For concreteness, consider

More information

arxiv: v1 [cond-mat.str-el] 3 Apr 2012

arxiv: v1 [cond-mat.str-el] 3 Apr 2012 Detection of Symmetry Protected Topological Phases in 1D Frank Pollmann Max-Planck-Institut für Physik komplexer Systeme, 01187 Dresden, Germany Ari M. Turner University of Amsterdam, 1090 GL Amsterdam,

More information

Summation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant

Summation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant Computer Science Dept Va Tech August 005 005 McQuain WD Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant g f g f ) ) ))

More information

Physics 557 Lecture 5

Physics 557 Lecture 5 Physics 557 Lecture 5 Group heory: Since symmetries and the use of group theory is so much a part of recent progress in particle physics we will take a small detour to introduce the basic structure (as

More information

Quantum Measurements: some technical background

Quantum Measurements: some technical background Quantum Measurements: some technical background [From the projection postulate to density matrices & (introduction to) von Neumann measurements] (AKA: the boring lecture) First: One more example I wanted

More information

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

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 4 Postulates of Quantum Mechanics I In today s lecture I will essentially be talking

More information

Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003

Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003 Handout V for the course GROUP THEORY IN PHYSICS Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003 GENERALIZING THE HIGHEST WEIGHT PROCEDURE FROM su(2)

More information

Journal Club: Brief Introduction to Tensor Network

Journal Club: Brief Introduction to Tensor Network Journal Club: Brief Introduction to Tensor Network Wei-Han Hsiao a a The University of Chicago E-mail: weihanhsiao@uchicago.edu Abstract: This note summarizes the talk given on March 8th 2016 which was

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

A PRIMER ON SESQUILINEAR FORMS

A PRIMER ON SESQUILINEAR FORMS A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form

More information

Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1)

Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1) Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: k Cf ( k) C k S: factor out constant f ( k) k ( f ( k) ± g( k)) k S: separate summed terms f ( k) ± k g(

More information

Differential Geometry of Surfaces

Differential Geometry of Surfaces Differential Geometry of urfaces Jordan mith and Carlo équin C Diision, UC Berkeley Introduction These are notes on differential geometry of surfaces ased on reading Greiner et al. n. d.. Differential

More information

Eigenvectors and Hermitian Operators

Eigenvectors and Hermitian Operators 7 71 Eigenvalues and Eigenvectors Basic Definitions Let L be a linear operator on some given vector space V A scalar λ and a nonzero vector v are referred to, respectively, as an eigenvalue and corresponding

More information

MCS 115 Exam 2 Solutions Apr 26, 2018

MCS 115 Exam 2 Solutions Apr 26, 2018 MCS 11 Exam Solutions Apr 6, 018 1 (10 pts) Suppose you have an infinitely large arrel and a pile of infinitely many ping-pong alls, laeled with the positive integers 1,,3,, much like in the ping-pong

More information

The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector

The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector 1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input

More information

The Cayley-Hamilton Theorem and the Jordan Decomposition

The Cayley-Hamilton Theorem and the Jordan Decomposition LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal

More information

Physics 221A Fall 1996 Notes 14 Coupling of Angular Momenta

Physics 221A Fall 1996 Notes 14 Coupling of Angular Momenta Physics 1A Fall 1996 Notes 14 Coupling of Angular Momenta In these notes we will discuss the problem of the coupling or addition of angular momenta. It is assumed that you have all had experience with

More information

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

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical

More information

Solutions Final exam 633

Solutions Final exam 633 Solutions Final exam 633 S.J. van Enk (Dated: June 9, 2008) (1) [25 points] You have a source that produces pairs of spin-1/2 particles. With probability p they are in the singlet state, ( )/ 2, and with

More information

Borromean Entanglement Revisited

Borromean Entanglement Revisited Borromean Entanglement Revisited Ayumu SUGITA Abstract An interesting analogy between quantum entangled states and topological links was suggested by Aravind. In particular, he emphasized a connection

More information

Quantum Noise. Michael A. Nielsen. University of Queensland

Quantum Noise. Michael A. Nielsen. University of Queensland Quantum Noise Michael A. Nielsen University of Queensland Goals: 1. To introduce a tool the density matrix that is used to describe noise in quantum systems, and to give some examples. Density matrices

More information

Problems in Linear Algebra and Representation Theory

Problems in Linear Algebra and Representation Theory Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific

More information

Chapter 2 The Group U(1) and its Representations

Chapter 2 The Group U(1) and its Representations Chapter 2 The Group U(1) and its Representations The simplest example of a Lie group is the group of rotations of the plane, with elements parametrized by a single number, the angle of rotation θ. It is

More information

A no-go theorem for theories that decohere to quantum mechanics

A no-go theorem for theories that decohere to quantum mechanics A no-go theorem for theories that decohere to quantum mechanics Ciarán M. Lee University College London Joint work with John H. Selby arxiv:1701.07449 Motivation The more important fundamental laws and

More information

1 Mathematical preliminaries

1 Mathematical preliminaries 1 Mathematical preliminaries The mathematical language of quantum mechanics is that of vector spaces and linear algebra. In this preliminary section, we will collect the various definitions and mathematical

More information

EE201/MSE207 Lecture 10 Angular momentum

EE201/MSE207 Lecture 10 Angular momentum EE20/MSE207 Lecture 0 Angular momentum (A lot of mathematics; I will try to explain as simple as possile) Classical mechanics r L = r p (angular momentum) Quantum mechanics The same, ut p x = iħ x p =

More information

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

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing

More information

Checking Consistency. Chapter Introduction Support of a Consistent Family

Checking Consistency. Chapter Introduction Support of a Consistent Family Chapter 11 Checking Consistency 11.1 Introduction The conditions which define a consistent family of histories were stated in Ch. 10. The sample space must consist of a collection of mutually orthogonal

More information

Page 404. Lecture 22: Simple Harmonic Oscillator: Energy Basis Date Given: 2008/11/19 Date Revised: 2008/11/19

Page 404. Lecture 22: Simple Harmonic Oscillator: Energy Basis Date Given: 2008/11/19 Date Revised: 2008/11/19 Page 404 Lecture : Simple Harmonic Oscillator: Energy Basis Date Given: 008/11/19 Date Revised: 008/11/19 Coordinate Basis Section 6. The One-Dimensional Simple Harmonic Oscillator: Coordinate Basis Page

More information

CHAPTER 5. Linear Operators, Span, Linear Independence, Basis Sets, and Dimension

CHAPTER 5. Linear Operators, Span, Linear Independence, Basis Sets, and Dimension A SERIES OF CLASS NOTES TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS LINEAR CLASS NOTES: A COLLECTION OF HANDOUTS FOR REVIEW AND PREVIEW OF LINEAR THEORY

More information

2. Introduction to quantum mechanics

2. Introduction to quantum mechanics 2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian

More information

GEOMETRY FINAL CLAY SHONKWILER

GEOMETRY FINAL CLAY SHONKWILER GEOMETRY FINAL CLAY SHONKWILER 1 a: If M is non-orientale and p M, is M {p} orientale? Answer: No. Suppose M {p} is orientale, and let U α, x α e an atlas that gives an orientation on M {p}. Now, let V,

More information

Parvati Shastri. 2. Kummer Theory

Parvati Shastri. 2. Kummer Theory Reciprocity Laws: Artin-Hilert Parvati Shastri 1. Introduction In this volume, the early reciprocity laws including the quadratic, the cuic have een presented in Adhikari s article [1]. Also, in that article

More information

Algebraic Theory of Entanglement

Algebraic Theory of Entanglement Algebraic Theory of (arxiv: 1205.2882) 1 (in collaboration with T.R. Govindarajan, A. Queiroz and A.F. Reyes-Lega) 1 Physics Department, Syracuse University, Syracuse, N.Y. and The Institute of Mathematical

More information

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

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding. CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as

More information

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2 Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,

More information

Finding Complex Solutions of Quadratic Equations

Finding Complex Solutions of Quadratic Equations y - y - - - x x Locker LESSON.3 Finding Complex Solutions of Quadratic Equations Texas Math Standards The student is expected to: A..F Solve quadratic and square root equations. Mathematical Processes

More information

Generalized eigenspaces

Generalized eigenspaces Generalized eigenspaces November 30, 2012 Contents 1 Introduction 1 2 Polynomials 2 3 Calculating the characteristic polynomial 5 4 Projections 7 5 Generalized eigenvalues 10 6 Eigenpolynomials 15 1 Introduction

More information

Group theory - QMII 2017

Group theory - QMII 2017 Group theory - QMII 7 Daniel Aloni References. Lecture notes - Gilad Perez. Lie algebra in particle physics - H. Georgi. Google... Motivation As a warm up let us motivate the need for Group theory in physics.

More information

1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS

1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS 1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing

More information

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line Chapter 27: Inferences for Regression And so, there is one more thing which might vary one more thing aout which we might want to make some inference: the slope of the least squares regression line. The

More information

Lecture: Quantum Information

Lecture: Quantum Information Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers

More information

22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes

22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one

More information