Quantum Foundations Lecture 15

Slides:



Advertisements
Similar presentations
Foundations of Cryptography Lecture 10 Lecturer: Moni Naor.
Advertisements

Quantum Computing MAS 725 Hartmut Klauck NTU
Lecture XXIII.  In general there are two kinds of hypotheses: one concerns the form of the probability distribution (i.e. is the random variable normally.
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 11 (2005) Richard Cleve DC 3524
Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.
Entropy in the Quantum World Panagiotis Aleiferis EECS 598, Fall 2001.
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 / RAC 2211 Lecture.
Short course on quantum computing Andris Ambainis University of Latvia.
Section 5.1 Eigenvectors and Eigenvalues. Eigenvectors and Eigenvalues Useful throughout pure and applied mathematics. Used to study difference equations.
Quantum Computing MAS 725 Hartmut Klauck NTU
Symmetric Matrices and Quadratic Forms
DENSITY MATRICES, traces, Operators and Measurements
Random Matrices Hieu D. Nguyen Rowan University Rowan Math Seminar
Chapter 3 Determinants and Matrices
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Dirac Notation and Spectral decomposition Michele Mosca.
BB84 Quantum Key Distribution 1.Alice chooses (4+  )n random bitstrings a and b, 2.Alice encodes each bit a i as {|0>,|1>} if b i =0 and as {|+>,|->}
Theory of Computing Lecture 22 MAS 714 Hartmut Klauck.
Lo-Chau Quantum Key Distribution 1.Alice creates 2n EPR pairs in state each in state |  00 >, and picks a random 2n bitstring b, 2.Alice randomly selects.
Stats & Linear Models.
1 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Richard Cleve QNC 3129 Lecture 18 (2014)
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 14 (2009)
CHAPTER SIX Eigenvalues
Review of basic concepts and facts in linear algebra Matrix HITSZ Instructor: Zijun Luo Fall 2012.
Principles of Pattern Recognition
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
Steering witnesses and criteria for the (non-)existence of local hidden state (LHS) models Eric Cavalcanti, Steve Jones, Howard Wiseman Centre for Quantum.
Quantum One: Lecture Representation Independent Properties of Linear Operators 3.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
A variational expression for a generlized relative entropy Nihon University Shigeru FURUICHI || Tsallis.
Analytical Approach to Optimal Discrimination with Unambiguous Measurements University of Tabriz M. Rezaei Karamaty Academic member of Tabriz University.
Risk Analysis & Modelling Lecture 2: Measuring Risk.
Monday, April 6, 2015PHYS , Spring 2015 Dr. Jaehoon Yu 1 PHYS 3313 – Section 001 Lecture #17 Monday, April 6, 2015 Dr. Jaehoon Yu Normalization.
Charles University FSV UK STAKAN III Institute of Economic Studies Faculty of Social Sciences Institute of Economic Studies Faculty of Social Sciences.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Lecture XXVII. Orthonormal Bases and Projections Suppose that a set of vectors {x 1,…,x r } for a basis for some space S in R m space such that r  m.
Systems of Identical Particles
MA2213 Lecture 8 Eigenvectors.
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
Markov Chains and Mixing Times
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2009) Richard.
Jean Christian Boileau (University of Toronto)
Postulates of Quantum Mechanics
PHYS 3313 – Section 001 Lecture #17
Quantum One.
Monte Carlo Methods in Scientific Computing
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Quantum Information Theory Introduction
Quantum One.
Quantum Foundations Lecture 20
Quantum Foundations Lecture 22
Singular Value Decomposition SVD
Chapter 3 Linear Algebra
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2011)
Generally Discriminant Analysis
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Quantum Foundations Lecture 3
Quantum Foundations Lecture 2
Linear Vector Space and Matrix Mechanics
PHYS 3313 – Section 001 Lecture #19
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
16. Mean Square Estimation
Eigenvalues and Eigenvectors
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Lecture 20 SVD and Its Applications
PHYS 3313 – Section 001 Lecture #18
PHYS 3313 – Section 001 Lecture #17
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Presentation transcript:

Quantum Foundations Lecture 15 April 2, 2018 Dr. Matthew Leifer leifer@chapman.edu HSC112

Announcements Schmid College Academic Advising: Tuesday April 3, 4:30pm-6:30pm AF209A (Prof. Leifer) Wednesday April 4, 4:30pm-6:30pm Henley Hall Basement (Prof. Dressel) Adam Becker is returning to Chapman: Book event and signing at 1888 center: Monday April 16. RSVP required https://bit.ly/AdamBecker Assignments First Draft due on Blackboard April 11. Peer review until April 16. Discussion in class April 16. Final Version due May 2. Homework 3 due April 11. I like lunch invitations

Application: Minimum Error Discrimination Alice has a preparation device that prepares the system in either the state 𝜌 or the state 𝜎. She chooses each with 50/50 probability and sends the system to Bob. Bob makes a measurement on the system and has to guess whether 𝜌 or 𝜎 was prepared. What is his maximum probability of success and what measurement should he make?

Classical Case Let’s look at the classical case first. There is a variable that can take 𝑑 possible values 𝑗=1,2,⋯,𝑑. Alice prepares the probability distributions 𝒑 or 𝒒 with 50/50 probability. Bob sees the value of 𝑗 and has to guess whether 𝒑 or 𝒒 was prepared. Bob decides on a subset 𝐸 𝒑 ⊆{1,2,⋯,𝑑}. If 𝑗∈ 𝐸 𝒑 he guesses 𝒑. If it is in the complement 𝐸 𝒒 = 1,2,⋯,𝑑 \ 𝐸 𝒑 , he guesses 𝒒.

Classical Case Therefore, 𝑝 succ ≤ 1 2 1+ {𝑗| 𝑝 𝑗 ≥ 𝑞 𝑗 } ( 𝑝 𝑗 − 𝑞 𝑗 ) = 1 2 1+ 1 2 {𝑗| 𝑝 𝑗 ≥ 𝑞 𝑗 } ( 𝑝 𝑗 − 𝑞 𝑗 ) + {𝑗| 𝑝 𝑗 < 𝑞 𝑗 } ( 𝑞 𝑗 − 𝑝 𝑗 ) = 1 2 1+ 1 2 𝑗=1 𝑑 𝑝 𝑗 − 𝑞 𝑗 = 1 2 1+ 𝐷 𝑐 (𝒑,𝒒) Where 𝐷 𝑐 𝒑,𝒒 = 1 2 𝑗=1 𝑑 𝑝 𝑗 − 𝑞 𝑗 is called the variational distance.

Quantum Case Theorem (Helstrom, Holevo): The optimal success probability in the quantum case is given by 𝑝 succ = 1 2 1+ 𝐷 𝑞 (𝜌,𝜎) where 𝐷 𝑞 𝜌,𝜎 = 1 2 Tr 𝜌−𝜎 is known as the trace distance, and the matrix norm is given by 𝑀 = 𝑀 † 𝑀 .

𝑀 = 𝑀 † 𝑀 = 𝑀 2 because 𝑀 is Hermitian. Quantum Case Lemma: If 𝑀 is a Hermitian operator then Tr 𝑀 = 𝑗 | 𝜆 𝑗 | where 𝜆 𝑗 are the eigenvalues of 𝑀. Proof: Let 𝑀= 𝑗 𝜆 𝑗 | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 | be the spectral decomposition of 𝑀 and write 𝑀= {𝑗| 𝜆 𝑗 ≥0} 𝜆 𝑗 | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 | − {𝑘| 𝜆 𝑘 <0} 𝜆 𝑘 | 𝜙 𝑘 ⟩⟨ 𝜙 𝑘 | Then, 𝑀 = 𝑀 † 𝑀 = 𝑀 2 because 𝑀 is Hermitian.

Quantum Case 𝑀 = 𝑀 2 = {𝑗| 𝜆 𝑗 ≥0} 𝜆 𝑗 | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 | − {𝑘| 𝜆 𝑘 <0} 𝜆 𝑘 | 𝜙 𝑘 ⟩⟨ 𝜙 𝑘 | {𝑙| 𝜆 𝑙 ≥0} 𝜆 𝑙 | 𝜙 𝑙 ⟩⟨ 𝜙 𝑙 | − {𝑚 |𝜆 𝑚 <0} 𝜆 𝑚 | 𝜙 𝑚 ⟩⟨ 𝜙 𝑚 | = {𝑗| 𝜆 𝑗 ≥0} {𝑙| 𝜆 𝑙 ≥0} 𝜆 𝑗 𝜆 𝑙 𝜙 𝑗 𝜙 𝑗 𝜙 𝑙 ⟩⟨ 𝜙 𝑙 | + {𝑘| 𝜆 𝑘 <0} {𝑚| 𝜆 𝑚 <0} 𝜆 𝑘 𝜆 𝑚 𝜙 𝑘 𝜙 𝑘 𝜙 𝑚 ⟩⟨ 𝜙 𝑚 | Note: cross terms are zero because the subspaces with 𝜆 𝑗 ≥0 and 𝜆 𝑗 <0 are orthogonal. 𝑀 = {𝑗| 𝜆 𝑗 ≥0} {𝑙| 𝜆 𝑙 ≥0} 𝜆 𝑗 𝜆 𝑙 𝛿 𝑗𝑙 𝜙 𝑗 ⟨ 𝜙 𝑙 | + {𝑘| 𝜆 𝑘 <0} {𝑚| 𝜆 𝑚 <0} 𝜆 𝑘 𝜆 𝑚 𝛿 𝑘𝑚 𝜙 𝑘 ⟨ 𝜙 𝑚 | = {𝑗| 𝜆 𝑗 ≥0} 𝜆 𝑗 2 𝜙 𝑗 𝜙 𝑗 + {𝑘| 𝜆 𝑘 <0} 𝜆 𝑘 2 𝜙 𝑘 𝜙 𝑘 = 𝑗 𝜆 𝑗 2 𝜙 𝑗 𝜙 𝑗 = 𝑗 𝜆 𝑗 𝜙 𝑗 𝜙 𝑗 And hence Tr 𝑀 = 𝑗 | 𝜆 𝑗 | .

Quantum Case Now consider Bob’s strategy. He has to choose a two-outcome POVM: 𝐸 𝜌 , 𝐸 𝜎 =𝐼− 𝐸 𝜌 , such that if he gets the outcome 𝐸 𝜌 he will guess 𝜌 and if he gets the outcome 𝐸 𝜎 he will guess 𝜎. His success probability is 𝑝 succ =Prob 𝜌 is prepared Prob( 𝐸 𝜌 |𝜌)+Prob 𝜎 is prepared Prob( 𝐸 𝜎 |𝜎) = 1 2 Tr 𝐸 𝜌 𝜌 +Tr( 𝐸 𝜎 𝜎) = 1 2 Tr 𝐸 𝜌 𝜌 +Tr 𝐼− 𝐸 𝜌 𝜎 = 1 2 Tr 𝜎 +Tr 𝐸 𝜌 (𝜌−𝜎) = 1 2 1+Tr 𝐸 𝜌 (𝜌−𝜎)

𝐸 𝜌 = 𝑃 + = {𝑗| 𝜆 𝑗 ≥0} | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 | Quantum Case Now let 𝜌−𝜎= 𝑗 𝜆 𝑗 𝜙 𝑗 𝜙 𝑗 be the spectral decomposition of 𝜌−𝜎. Tr 𝐸 𝜌 (𝜌−𝜎) =Tr 𝐸 𝜌 𝑗 𝜆 𝑗 𝜙 𝑗 𝜙 𝑗 = 𝑗 𝜆 𝑗 Tr 𝐸 𝜌 | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 | = 𝑗 𝜆 𝑗 ⟨ 𝜙 𝑗 | 𝐸 𝜌 | 𝜙 𝑗 ⟩ Now, 0≤ 𝜙 𝑗 𝐸 𝜌 𝜙 𝑗 ≤1, so this is clearly maximized if we can choose 𝜙 𝑗 𝐸 𝜌 𝜙 𝑗 =1 for 𝜆 𝑗 ≥0 and 𝜙 𝑗 𝐸 𝜌 𝜙 𝑗 =0 for 𝜆 𝑗 <0. This can be achieved if we choose 𝐸 𝜌 = 𝑃 + = {𝑗| 𝜆 𝑗 ≥0} | 𝜙 𝑗 ⟩⟨ 𝜙 𝑗 |

Quantum Case So we have Tr 𝐸 𝜌 (𝜌−𝜎) ≤Tr 𝑃 + (𝜌−𝜎) = 𝑗 𝜆 𝑗 ⟨ 𝜙 𝑗 | 𝑃 + | 𝜙 𝑗 ⟩ = 𝑗 {𝑘| 𝜆 𝑘 ≥0} 𝜆 𝑗 ⟨ 𝜙 𝑗 | 𝜙 𝑘 ⟩⟨ 𝜙 𝑘 | 𝜙 𝑗 ⟩ = {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | However, 𝜌 and 𝜎 are both density matrices, so Tr 𝜌−𝜎 =Tr 𝜌 −Tr 𝜎 =1−1=0 Therefore 𝑗 𝜆 𝑗 = {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | − {𝑗| 𝜆 𝑗 <0} | 𝜆 𝑗 | =0 or {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | = {𝑗| 𝜆 𝑗 <0} | 𝜆 𝑗 |

Quantum Case Hence, {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | = 1 2 {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | + {𝑗| 𝜆 𝑗 <0} | 𝜆 𝑗 | = 1 2 𝑗 | 𝜆 𝑗 | Now, if we apply the lemma, this gives {𝑗| 𝜆 𝑗 ≥0} | 𝜆 𝑗 | = 1 2 Tr 𝜌−𝜎 = 𝐷 𝑞 (𝜌,𝜎) Putting it all together gives 𝑝 succ ≤ 1 2 1+ 𝐷 𝑞 (𝜌,𝜎) with equality achieved if Bob chooses 𝐸 𝜌 = 𝑃 + , i.e. the projector onto the positive eigenspace of 𝜌−𝜎.

𝜌= 𝑗 𝑝 𝑗 |𝑗⟩⟨𝑗| and 𝜎= 𝑗 𝑞 𝑗 |𝑗⟩⟨𝑗| Special Cases Note that if 𝜌 and 𝜎 are diagonal in the same basis 𝜌= 𝑗 𝑝 𝑗 |𝑗⟩⟨𝑗| and 𝜎= 𝑗 𝑞 𝑗 |𝑗⟩⟨𝑗| then the eigenvalues of 𝜌−𝜎 are 𝑝 𝑗 − 𝑞 𝑗 and we get 𝐷 𝑞 𝜌,𝜎 = 1 2 𝑗 𝑝 𝑗 − 𝑞 𝑗 = 𝐷 𝑐 (𝒑,𝒒) recovering the classical result. If 𝜌=|𝜓⟩⟨𝜓| and 𝜎=|𝜙⟩⟨𝜙| are both pure states then (you will prove on Hwk. 4) 𝐷 𝑞 𝜌,𝜎 = 1− 𝜙 𝜓 2 Therefore, pure states are perfectly distinguishable iff 𝜙 𝜓 =0.

8.vi) The Lindblad Equation

Continuous Time Dynamics

The View from the Larger Church

The View from the Larger Church

Deriving the Lindblad Equation

Deriving the Lindblad Equation

Deriving the Lindblad Equation

Example: Decoherence

9) Ontological Models The aim of this section is to investigate the possibility of constructing a realist theory (known as an ontological model) that can reproduce the predictions of quantum theory. We start with a simple toy-model that reproduces many of the apparently puzzling phenomena we have studied so far: The Spekkens’ toy theory. These phenomena are naturally explained if there is a restriction on the amount of information we can have about the ontic state (an “epistemic restriction” or “epistriction”) and the quantum state is epistemic. After this we will present the general definition of an ontological model and prove a number of no-go theorems that imply that a realist theory underlying quantum theory cannot be like this.

9) Ontological Models Good references for this section include: David Jennings and Matthew Leifer, “No Return to Classical Reality”, Contemporary Physics, vol. 57, iss. 1, pp. 60-82 (2015) https://doi.org/10.1080/00107514.2015.1063233 preprint: https://arxiv.org/abs/1501.03202 Robert W. Spekkens, “Quasi-Quantization: Classical Statistical Theories with an Epistemic Restriction”, in “Quantum Theory: Informational Foundations and Foils”, Giulio Chiribella and Robert W. Spekkens (eds.), pp. 83-135, Springer (2015) preprint: https://arxiv.org/abs/1409.5041 Robert W. Spekkens, “Contextuality for preparations, transformations, and unsharp measurements”, Physical Review A, vol. 71 052108 (2005). Preprint: https://arxiv.org/abs/quant-ph/0406166 J. S. Bell, “Speakable and Unspeakable in Quantum Mechanics”, 2nd edition, Cambridge University Press (2004). Matthew Leifer, “Is the Quantum State Real? An Extended Review of ψ-ontology Theorems”, Quanta, vol. 3, no. 1, pp. 67-155 (2014). http://dx.doi.org/10.12743/quanta.v3i1.22

9) Ontological Models Ontological Models Epistricted Theories Definitions Examples Excess Baggage Contextuality Ψ-ontology Bell’s Theorem The Colbeck-Renner Theorem