1 / 11

Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871

Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871. Lecture 15 (2009). Richard Cleve DC 2117 cleve@cs.uwaterloo.ca. Simulations among operations.  0  +  1 .  0 . Simulations among operations (1).

buelow
Download Presentation

Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Introduction to Quantum Information ProcessingCS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2009) Richard Cleve DC 2117 cleve@cs.uwaterloo.ca

  2. Simulations among operations

  3. 0 +1 0 Simulations among operations (1) Fact 1: any general quantum operation can be simulated by applying a unitary operation on a larger quantum system: U   output input 0 discard 0 0 Example: decoherence

  4. Simulations among operations (2) Fact 2: any POVM measurement can also be simulated by applying a unitary operation on a larger quantum system and then measuring: U   quantum output input 0 j classical output 0 0

  5. Separable states

  6. Separable states A bipartite (i.e. two register) state  is a: • product state if = • separablestate if (p1 ,…,pm 0) (i.e. a probabilistic mixture of product states) Question: which of the following states are separable?

  7. Distance measures for quantum states

  8. Distance measures Some simple (and often useful) measures: • Euclidean distance:  ψ − φ 2 • Fidelity: φψ  Small Euclidean distance implies “closeness” but large Euclidean distance need not (for example, ψvs −ψ) Not so clear how to extend these for mixed states … … though fidelity does generalize, to Tr√1/21/2

  9. Trace norm – preliminaries (1) For a normal matrix M and a function f : CC, we define the matrix f(M)as follows: M = U†DU, where D is diagonal (i.e. unitarily diagonalizable) Now, define f(M) = U†f(D) U, where

  10. Trace norm – preliminaries (2) For a normal matrix M = U†DU, define |M| in terms of replacing D with This is the same as defining |M|=√M†M and the latter definition extends to all matrices (since M†M is positive definite)

  11. Trace norm/distance – definition ||M||tr= Tr|M|=Tr√M†M The trace norm of M is Intuitively, it’s the 1-norm of the eigenvalues (or, in the non-normal case, the singular values) of M The trace distance between  and  is|| − ||tr Why is this a meaningful distance measure between quantum states? Theorem: for any two quantum states  and , the optimal measurement procedure for distinguishing between them succeeds with probability ½ + ¼|| − ||tr

More Related