Quantum Mechanics II: Examples

Size: px
Start display at page:

Download "Quantum Mechanics II: Examples"

Transcription

1 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 teleportation. 2. Revised form of postulates 2 (dynamics) and 3 (measurement). 3. Introduce more elements of the Dirac notation. 4. Discuss the philosophy underlying quantum information science.

2 Alice Superdense coding Bob ab ab Theorist s impression of a measuring device

3 Alice Superdense coding Bob ab ab

4 Alice Superdense coding Bob X Z 0 = 1 ; X 1 = 0 0 = 0 ; Z 1 = 1 ab 00 : Apply I 01 : Apply Z 10 : Apply X 11 : Apply XZ ab

5 Superdense coding can be viewed as a statement about the interchangeability of physical resources. 1 ebit + 1 qubit of communication 2 bits of classical communication

6 Worked exercise: Could Alice and Bob still communicate two bits using the superdense coding protocol if the initial state shared by Alice and Bob was? 2

7 1 Revised measurement postulate Recall postulate 3: If we measure ψ in an orthonormal basis e,..., e, then we obtain the result with probability d P( ) = e ψ. 2 The measurement disturbs the system, leaving it in a state determined by the outcome. e Problem: Imagine we measure a quantum system, A, in the orthonormal basis e,..., e. 1 d A Suppose system A is part of a larger system, consisting of two components, A and B. How should we describe the effect of the measurement on the larger system?

8 1 Revised measurement postulate Recall postulate 3: If we measure ψ in an orthonormal basis e,..., e, then we obtain the result with probability d P( ) = e ψ. 2 The measurement disturbs the system, leaving it in a state determined by the outcome. e The revised postulate replaces the orthogonal states e1,..., with a complete set of orthogonal subspaces V,..., V. V = V1 V2... V m. 1 m e d = ( ) + 3 ( e1 e2 e3 ) = ( e1 e2 ) ( e3 ) Example: ψ α e β e γ e sp,, sp, sp A general measurement can be thought of as asking the question " which of the subspaces V,..., V m are we in? " 1

9 1 Revised measurement postulate Recall postulate 3: If we measure ψ in an orthonormal basis e,..., e, then we obtain the result with probability d P( ) = e ψ. 2 The measurement disturbs the system, leaving it in a state determined by the outcome. e Mathematically, it is convenient to describe the subspaces V,..., V m in terms of their corresp onding proectors, P,..., P m. 1 1 ( ) ( 1 2 ) Example: The proector P onto sp e, e acts as P α e + β e + γ e = α e + β e In general, the proector P onto a subspace V acts as the identity on that subspace, and annihilates everything orthogonal to V.

10 Revised measurement postulate Let P1,..., P m be a set of proectors onto a complete set of orthogonal subspaces of state space. P = I ; P P =δ P k k This set of proectors defines a measurement. If we measure ψ then we get outcome with probability Pr( ) = ψ P ψ. The measurement unavoidably disturbs the system, leaving P ψ it in the post-measurement state ψ P ψ

11 Example: A two-outcome measurement on a qutrit A general state of a qutri t may be written ψ = α 0 + β 1 + γ 2. 1 ( ) ( ) P proects onto sp 0, 1 ; and P2 proects onto sp 2. α α 2 Pr(1) = ψ P1 ψ = β β = α + β γ 0 Pr(2) = ψ P 2 ψ = γ 2 2 ψ = P ψ α 0 + β 1 = ' ψ P1 ψ α + β ψ P ψ γ 2 = ~ 2 ψ P ψ = γ ' 2 2 2

12 1 2 Example: Measuring the first of two qubits Suppose we want to perform a measurement in the basis e, e for the first of two qubits. The rule is to first form the corresponding proectors PP 1, 2 onto the state space of that qubit, and then to tensor them with the identity on the second qubit, obtaining P I and P I. 1 ( ) = ψ ( P I ) 0 2 Example: If the state of two qubits is ψ = α α α α11 11 then measuring the first qubit in the computational basis gives the result 0 with probability Pr 0 ψ ( α00 00 α01 01 α10 10 α11 11 ) ( α00 00 α01 01 ) = = α + α 00 01

13 Example: Measuring the first two of three qubits Suppose we have three qubits in the state α e a + β e b + γ e c + δ e d e1, e2, e3, e4 is an orthonormal basis for the state space of the first two qubits. a, b, c, d are normalized states of the third qubit. Measuring the first two qubits in the basis e1, e2, e3, e4 gives the result 1 with probability Pr(1) = ψ ψ ( P I ) 1 ( α 1 ) = ψ e a 2 = α Post-measurement state is e a. 1

14 Alice Teleportation Bob

15 Alice Teleportation Bob 01 01

16 Alice Teleportation Bob α 0 + β α α β β 111 = 2 ( α 0 β 1 ) = = = =

17 Alice Teleportation Bob = ( α 0 β 1 ) ( α 0 β 1 ) ( α 1 β 0 ) ( α 1 β 0 ) I ( α 0 β 1 ) + ( 0 1 ) Z α + β ( 0 1 ) X α + β ( 0 1 ) ZX α + β

18 Teleportation can be viewed as a statement about the interchangeability of physical resources. 1 ebit + 2 classical bits of communication 1 qubit of communication Compare with superdense coding: 1 ebit + 1 qubit of communication 2 bits of classical communication 1 qubit of communication = 2 bits of communication (Mod 1 ebit)

19 The fundamental question of information science 1. Given a physical resource energy, time, bits, space, entanglement; and 2. Given an information processing task data compression, information transmission, teleportation; and 3. Given a criterion for success; We ask the question: How much of 1 do I need to achieve 2, while satisfying 3? Pursuing this question in the quantum case has led to, and presumably will continue to lead to, interesting new information processing capabilities. How to write a quant-ph Are there any fundamental scientific questions that can be addressed by this program?

20 What fundamental problems are addressed by quantum information science? You Your challenger Knowing the rules Understanding the game

21 Knowing the rules of quantum mechanics Understanding quantum mechanics What high-level principles are implied by quantum mechanics?

22 Robert B. Laughlin, 1998 Nobel Lecture I give my class of extremely bright graduate students, who have mastered quantum mechanics but are otherwise unsuspecting and innocent, a take-home exam in which they are asked to deduce superfluidity from first principles. There is no doubt a special place in hell being reserved for me at this very moment for this mean trick, for the task is impossible. Superfluidity, like the fractional quantum Hall effect, is an emergent phenomenon a low-energy collective effect of huge numbers of particles that cannot be deduced from the microscopic equations of motion in a rigorous way and that disappears completely when the system is taken apart (Anderson, 1972)

23 Quantum information science as an approach to the study of complex quantum systems Quantum processes Shor s algorithm teleportation communication theory of entanglement quantum phase transitions cryptography quantum error-correction Complexity

24 A few quanta of miscellanea The outer product notation The spectral theorem diagonalizing Hermitian matrices Historical digression on measurement The trace operation Quantum dynamics in continuous time: an alternative form of the second postulate

25 Let ψ and φ be vectors. ( ) Outer product notation Define a linear operation (matrix) ψ φ by ψ φ γ ψ φ γ ( ) Example: 1 0 α 0 + β 1 1 α = α 1 Connection to matrices: If a = a b = b a b k = b a *, and then k. a1 * * * But a 2 b1 b 2 1 = bk a. a1 * * * Thus a b = a 2 b1 b2 b3.

26 Outer product notation Example: Example: = = = = Example: Z = 0 1 = Example: 0 1 = = Example: 1 0 = = Exa mp le: X = = Exercise: Find an outer product representation for Y.

27 Outer product notation One of the advantages of the outer product notation is that it provides a convenient tool with which to describe proectors, and thus quantum measurements. ( ) ( 1 2 ) Recall: The proector P onto sp e, e acts as P α e + β e + γ e = α e + β e This gives us a simple explicit formula for P, since e e + e e α e + β e + γ e = α e + β e ( )( ) More generally, the proector onto a subspace spanned by orthonormal vectors e1,..., em is given by P = e e. Exercise: Suppose e1,..., e is an orthonormal basis for state d space. Prove that I = e e. Exer ci se: Prove that a b = b a.

28 The spectral theorem Theorem: A is diagonalizable, A = Udiag ( λ1,, λ ) U, d where U is unitary, and λ,, λ are the eigenvalues Suppose A is a Hermitian matrix, A = A. Then ( ) But diag λ1,, λ = λ. d Thus A = λ e e, where e U is the λ eigenvector of A, A e = λ e. 1 d of A. A = λkpk, where Pk is the proector onto the k λ eigenspace of A. k

29 Examples of the spectral theorem 1 0 Example: Z = = ± 1 Example: X = has eigenvectors 1 0 ± 2 corresponding eigenvlaues ± 1., with = = = 1 0

30 Historical digression: the measurement postulate formulated in terms of observables Our form: A complete set of proectors P onto orthogonal subspaces. Outcome occurs with probability Pr( ) = ψ P ψ. The corresponding post-measurement state is P ψ. ψ P ψ Old form: A measurement is described by an observable, a Hermitian operator M, with spectral decomposition M = λp. The possible measurement outcomes correspond to the eigenvalues λ, and the outcome λ occurs with probability Pr( ) = ψ P ψ. The corresponding post-measurement state is P ψ. ψ P ψ

31 An example of observables in action Example: Suppose we "measure Z". Z has spectral decomposition Z = , so this is ust like measuring in the computational basis, and calling the outcomes "1" and "-1", respectively, for 0 and 1. Exercise: Find the spectral decomposition of Z Z. Show that measuring Z Z corresponds to measuring the parity of two qubits, with the result +1 corresponding to even parity, and the result -1 corresponding to odd parity. Exercise: Suppose we measure the observable M for a state ψ which is an eigenstate of that observable. Show that, with certainty, the outcome of the measurement is the corresponding eigenvalue of the observable.

32 tr ( A) A The trace operation Examples: X = tr( X ) 0; I tr( I ) = = = 0 1 Cyclicity proper t tr( AB ) =t ( BA) tr ( AB ) ( AB ) y: r. = = A B k k k ( a b ) Exercise: Prove that tr =a b. = = ( BA) kk = tr( BA) B A k k k k

33 An alternative form of postulate 2 Postulate 2: The evolution of a closed quantum system is described by a unitary transformation. ψ ' = U ψ But quantum dynamics occurs in continuous time!

34 An alternate form of postulate 2 The evolution of a closed quantum system is described by Schroedinger's equation: d ψ i = H ψ dt where H is a constant Hermitian matrix known as the Hamiltonian of the system. The eigenvectors of H are known as the energy eigenstates of the system, and the corresponding eigenvalues are known as the energies. ( ) ( ) Example: H = ωx has energy eigenstates / 2 and 0 1 / 2, with corresponding energies ± ω

35 Connection to old form of postulate 2 The solution of Schroedinger's equation is ψ( t) = exp( iht) ψ(0) U exp( iht) ψ ' = U ψ

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

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

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

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

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

Quantum Information & Quantum Computing

Quantum Information & Quantum Computing Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read

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

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

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

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

Quantum Physics II (8.05) Fall 2002 Assignment 3

Quantum Physics II (8.05) Fall 2002 Assignment 3 Quantum Physics II (8.05) Fall 00 Assignment Readings The readings below will take you through the material for Problem Sets and 4. Cohen-Tannoudji Ch. II, III. Shankar Ch. 1 continues to be helpful. Sakurai

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

SUPERDENSE CODING AND QUANTUM TELEPORTATION

SUPERDENSE CODING AND QUANTUM TELEPORTATION SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood

More information

Quantum information and quantum computing

Quantum information and quantum computing Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement

More information

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

Ph 219/CS 219. Exercises Due: Friday 3 November 2006 Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure

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

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2 Quantum Computing 1 Multi-Qubit System Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.

More information

b) (5 points) Give a simple quantum circuit that transforms the state

b) (5 points) Give a simple quantum circuit that transforms the state C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish

More information

The Postulates of Quantum Mechanics

The Postulates of Quantum Mechanics p. 1/23 The Postulates of Quantum Mechanics We have reviewed the mathematics (complex linear algebra) necessary to understand quantum mechanics. We will now see how the physics of quantum mechanics fits

More information

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left

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

Quantum Teleportation Pt. 1

Quantum Teleportation Pt. 1 Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the

More information

Entanglement and Quantum Teleportation

Entanglement and Quantum Teleportation Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,

More information

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

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139 Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense

More information

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

1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12 C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12 In this and the next lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to

More information

5. Communication resources

5. Communication resources 5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation

More information

CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games

CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,

More information

Quantum Computing Lecture 2. Review of Linear Algebra

Quantum Computing Lecture 2. Review of Linear Algebra Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces

More information

A Refinement of Quantum Mechanics by Algorithmic Randomness and Its Application to Quantum Cryptography

A Refinement of Quantum Mechanics by Algorithmic Randomness and Its Application to Quantum Cryptography Copyright c 017 The Institute of Electronics, Information and Communication Engineers SCIS 017 017 Symposium on Cryptography and Information Security Naha, Japan, Jan. 4-7, 017 The Institute of Electronics,

More information

Some Introductory Notes on Quantum Computing

Some Introductory Notes on Quantum Computing Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best

More information

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of

More information

Entanglement Measures and Monotones

Entanglement Measures and Monotones Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying

More information

Asymptotic Pure State Transformations

Asymptotic Pure State Transformations Asymptotic Pure State Transformations PHYS 500 - Southern Illinois University April 18, 2017 PHYS 500 - Southern Illinois University Asymptotic Pure State Transformations April 18, 2017 1 / 15 Entanglement

More information

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

Unitary evolution: this axiom governs how the state of the quantum system evolves in time. CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the

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

Exercise Set 7.2. Skills

Exercise Set 7.2. Skills Orthogonally diagonalizable matrix Spectral decomposition (or eigenvalue decomposition) Schur decomposition Subdiagonal Upper Hessenburg form Upper Hessenburg decomposition Skills Be able to recognize

More information

Chapter 2 The Density Matrix

Chapter 2 The Density Matrix Chapter 2 The Density Matrix We are going to require a more general description of a quantum state than that given by a state vector. The density matrix provides such a description. Its use is required

More information

Quantum Statistics -First Steps

Quantum Statistics -First Steps Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.

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

Quantum Information & Quantum Computation

Quantum Information & Quantum Computation CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday

More information

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4 Linear Systems Math Spring 8 c 8 Ron Buckmire Fowler 9 MWF 9: am - :5 am http://faculty.oxy.edu/ron/math//8/ Class 7 TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5. Summary

More information

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.

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

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36 QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING

More information

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2 Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition

More information

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1

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

Lecture 20: Bell inequalities and nonlocality

Lecture 20: Bell inequalities and nonlocality CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the

More information

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

INTRODUCTORY NOTES ON QUANTUM COMPUTATION INTRODUCTORY NOTES ON QUANTUM COMPUTATION Keith Hannabuss Balliol College, Oxford Hilary Term 2009 Notation. In these notes we shall often use the physicists bra-ket notation, writing ψ for a vector ψ

More information

Lecture 2: Linear operators

Lecture 2: Linear operators Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study

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

CLASSIFICATION OF COMPLETELY POSITIVE MAPS 1. INTRODUCTION

CLASSIFICATION OF COMPLETELY POSITIVE MAPS 1. INTRODUCTION CLASSIFICATION OF COMPLETELY POSITIVE MAPS STEPHAN HOYER ABSTRACT. We define a completely positive map and classify all completely positive linear maps. We further classify all such maps that are trace-preserving

More information

Quantum Gates, Circuits & Teleportation

Quantum Gates, Circuits & Teleportation Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary

More information

Quantum Teleportation Pt. 3

Quantum Teleportation Pt. 3 Quantum Teleportation Pt. 3 PHYS 500 - Southern Illinois University March 7, 2017 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 3 March 7, 2017 1 / 9 A Bit of History on Teleportation

More information

Transmitting and Hiding Quantum Information

Transmitting and Hiding Quantum Information 2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents

More information

Homework 3 - Solutions

Homework 3 - Solutions Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator

More information

Instantaneous Nonlocal Measurements

Instantaneous Nonlocal Measurements Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.

More information

Basic concepts from quantum theory

Basic concepts from quantum theory B. BASIC CONCEPTS FROM QUANTUM THEORY 77 B Basic concepts from quantum theory B.1 Introduction B.1.a Bases In quantum mechanics certain physical quantities are quantized, such as the energy of an electron

More information

Lecture 11 September 30, 2015

Lecture 11 September 30, 2015 PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike

More information

1. Basic rules of quantum mechanics

1. Basic rules of quantum mechanics 1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled

More information

Chapter 2. Basic Principles of Quantum mechanics

Chapter 2. Basic Principles of Quantum mechanics Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical

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

Lecture 14: Quantum information revisited

Lecture 14: Quantum information revisited CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next

More information

Unitary Dynamics and Quantum Circuits

Unitary Dynamics and Quantum Circuits qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular

More information

CS/Ph120 Homework 4 Solutions

CS/Ph120 Homework 4 Solutions CS/Ph10 Homework 4 Solutions November 3, 016 Problem 1: Robustness of GHZ and W states, part Solution: Due to Bolton Bailey a For the GHZ state, we have T r N GHZ N GHZ N = 1 0 N 1 0 N 1 + 1 N 1 1 N 1

More information

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

More information

Ph 219b/CS 219b. Exercises Due: Wednesday 22 February 2006

Ph 219b/CS 219b. Exercises Due: Wednesday 22 February 2006 1 Ph 219b/CS 219b Exercises Due: Wednesday 22 February 2006 6.1 Estimating the trace of a unitary matrix Recall that using an oracle that applies the conditional unitary Λ(U), Λ(U): 0 ψ 0 ψ, 1 ψ 1 U ψ

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

Open quantum systems

Open quantum systems Chapter 4 Open quantum systems 4. Quantum operations Let s go back for a second to the basic postulates of quantum mechanics. Recall that when we first establish the theory, we begin by postulating that

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

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

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

Ph 219b/CS 219b. Exercises Due: Wednesday 20 November 2013 1 h 219b/CS 219b Exercises Due: Wednesday 20 November 2013 3.1 Universal quantum gates I In this exercise and the two that follow, we will establish that several simple sets of gates are universal for

More information

C/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12

C/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12 C/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12 In this lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to this course. Topics

More information

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,

More information

Short Course in Quantum Information Lecture 2

Short Course in Quantum Information Lecture 2 Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture

More information

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum Computing: Foundations to Frontier Fall Lecture 3 Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about

More information

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

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i. CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy

More information

Lecture 13. Principal Component Analysis. Brett Bernstein. April 25, CDS at NYU. Brett Bernstein (CDS at NYU) Lecture 13 April 25, / 26

Lecture 13. Principal Component Analysis. Brett Bernstein. April 25, CDS at NYU. Brett Bernstein (CDS at NYU) Lecture 13 April 25, / 26 Principal Component Analysis Brett Bernstein CDS at NYU April 25, 2017 Brett Bernstein (CDS at NYU) Lecture 13 April 25, 2017 1 / 26 Initial Question Intro Question Question Let S R n n be symmetric. 1

More information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states

More information

Lecture Notes. Quantum Cryptography Week 2: The Power of Entanglement

Lecture Notes. Quantum Cryptography Week 2: The Power of Entanglement Lecture Notes Quantum Cryptography Week : The Power of Entanglement This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Licence. Contents.1 Entanglement

More information

Quantum Mechanics and Quantum Computing: an Introduction. Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University

Quantum Mechanics and Quantum Computing: an Introduction. Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University Quantum Mechanics and Quantum Computing: an Introduction Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University Contents Preface page Introduction. Quantum mechanics (partly excerpted from Wikipedia).

More information

Lecture3 (and part of lecture 4).

Lecture3 (and part of lecture 4). Lecture3 (and part of lecture 4). Angular momentum and spin. Stern-Gerlach experiment Spin Hamiltonian Evolution of spin with time Evolution of spin in precessing magnetic field. In classical mechanics

More information

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

Representation theory of SU(2), density operators, purification Michael Walter, University of Amsterdam 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

More information

Solutions to exam : 1FA352 Quantum Mechanics 10 hp 1

Solutions to exam : 1FA352 Quantum Mechanics 10 hp 1 Solutions to exam 6--6: FA35 Quantum Mechanics hp Problem (4 p): (a) Define the concept of unitary operator and show that the operator e ipa/ is unitary (p is the momentum operator in one dimension) (b)

More information

Tutorial 5 Clifford Algebra and so(n)

Tutorial 5 Clifford Algebra and so(n) Tutorial 5 Clifford Algebra and so(n) 1 Definition of Clifford Algebra A set of N Hermitian matrices γ 1, γ,..., γ N obeying the anti-commutator γ i, γ j } = δ ij I (1) is the basis for an algebra called

More information

Time Independent Perturbation Theory Contd.

Time Independent Perturbation Theory Contd. Time Independent Perturbation Theory Contd. A summary of the machinery for the Perturbation theory: H = H o + H p ; H 0 n >= E n n >; H Ψ n >= E n Ψ n > E n = E n + E n ; E n = < n H p n > + < m H p n

More information

CS286.2 Lecture 15: Tsirelson s characterization of XOR games

CS286.2 Lecture 15: Tsirelson s characterization of XOR games CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,

More information

Lecture 3: Superdense coding, quantum circuits, and partial measurements

Lecture 3: Superdense coding, quantum circuits, and partial measurements CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two

More information

Lecture 6: Quantum error correction and quantum capacity

Lecture 6: Quantum error correction and quantum capacity Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem

More information

CS/Ph120 Homework 1 Solutions

CS/Ph120 Homework 1 Solutions CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement

More information

I. Multiple Choice Questions (Answer any eight)

I. Multiple Choice Questions (Answer any eight) Name of the student : Roll No : CS65: Linear Algebra and Random Processes Exam - Course Instructor : Prashanth L.A. Date : Sep-24, 27 Duration : 5 minutes INSTRUCTIONS: The test will be evaluated ONLY

More information

Detailed Assessment Report MATH Outcomes, with Any Associations and Related Measures, Targets, Findings, and Action Plans

Detailed Assessment Report MATH Outcomes, with Any Associations and Related Measures, Targets, Findings, and Action Plans Detailed Assessment Report 2015-2016 MATH 3401 As of: 8/15/2016 10:01 AM EDT (Includes those Action Plans with Budget Amounts marked One-Time, Recurring, No Request.) Course Description Theory and applications

More information

Statistical Interpretation

Statistical Interpretation Physics 342 Lecture 15 Statistical Interpretation Lecture 15 Physics 342 Quantum Mechanics I Friday, February 29th, 2008 Quantum mechanics is a theory of probability densities given that we now have an

More information

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

Chapter III. Quantum Computation. Mathematical preliminaries. A.1 Complex numbers. A.2 Linear algebra review 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,

More information

A Glimpse of Quantum Computation

A Glimpse of Quantum Computation A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation

More information

Quantum Data Compression

Quantum Data Compression PHYS 476Q: An Introduction to Entanglement Theory (Spring 2018) Eric Chitambar Quantum Data Compression With the basic foundation of quantum mechanics in hand, we can now explore different applications.

More information

C/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11

C/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11 C/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11 In this and the next lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to

More information

Quantum Mechanics Solutions. λ i λ j v j v j v i v i.

Quantum Mechanics Solutions. λ i λ j v j v j v i v i. Quantum Mechanics Solutions 1. (a) If H has an orthonormal basis consisting of the eigenvectors { v i } of A with eigenvalues λ i C, then A can be written in terms of its spectral decomposition as A =

More information

2 The Density Operator

2 The Density Operator In this chapter we introduce the density operator, which provides an alternative way to describe the state of a quantum mechanical system. So far we have only dealt with situations where the state of a

More information