Lecture 4: Postulates of quantum mechanics
|
|
- Christopher Garrett
- 5 years ago
- Views:
Transcription
1 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 quantum computing, it gives the basic laws on which any quantum system (or a quantum computer) works. These postulates were agreed upon after a lot of trial and error. We won t be concerned about the physical motivation of these postulates. Most of the material for this lecture is taken from [1]. It is a very good reference for more details too. 1 State of a system The first postulates specifies what is meant mathematically by the state of a system. Postulate 1: A physically isolated system is associated with a Hilbert space, called the state space of the system. The system is completely described by a unit vector in this Hilbert space. Intuitively, Hilbert space is the vector space with enough structure so that we can apply algebra and analysis on it. For this course, we will only be dealing with vector spaces over complex numbers with inner product defined over them. Exercise 1. Read more about Hilbert spaces. It is not clear which Hilbert space should we be taking. For us, the simplest state space would be C, the state space of a qubit. It will be spanned by two vectors, 0 and 1. Exercise. Find another basis of C. Any state in this system is, ψ = α 0 + β 1, α + β = 1. The coefficients α, β are called the amplitude. Specifically, α (β) is the amplitude of the state ψ for 0 ( 1 ) respectively. Note 1. Many people interpret this as, the state ψ is in state 0 with probability α and in state 1 with probability β. This is only a consequence of ψ = α 0 + β 1 and not equivalent to it. Exercise 3. Why is it not equivalent? In general, if there are n different classical states, the quantum state would be a unit vector with orthonormal basis { 0, 1,, n 1 } or { 1,,, n }. Evolution of the system The next postulate specifies how a closed quantum system evolves. This is the very famous Schrödinger s equation. It is a partial differential equation which describes the how a quantum state evolves with time. The evolution is described by a Hamiltonian, which is a Hermitian matrix for us. Given the Hamiltonian H, i d ψ = H ψ, dt describes how the quantum system will change its state with time. For readers who are already familiar with it, we have assumed that Planck s constant can be absorbed in the Hamiltonian. This can be thought of as the second postulate of quantum mechanics. But we will modify it a little bit to get rid of partial differential equation and write it in terms of unitary operators.
2 Exercise 4. Read about Schrödinger s equation. Suppose the quantum system is in state ψ(t 1 ) at time t 1. Then using the previous equation, ψ(t ), the state at time t is, ψ(t ) = e ih(t t1) ψ(t 1 ). Exercise 5. Show that the matrix e ih(t t1) is unitary. Using the previous exercise, ψ(t ) = U(t, t 1 ) ψ(t 1 ). This gives us the working second postulate. Postulate : A closed quantum system evolves unitarily. The unitary matrix only depends on time t 1 and t. If the state at t 1 is ψ(t 1 ) then the state at time t is, ψ(t ) = U(t, t 1 ) ψ(t 1 ). Note. Unitary operators preserve the norm. What operators do you know which are unitary? Exercise 6. Show that all the Pauli matrices and H is unitary. Exercise 7. Guess the eigenvalues and eigenvectors of H. Check, if not, find the actual ones. 3 Measurement of the system We have talked about the state of the system and how it evolves. To be able to compute, we should be able to observe/measure the properties of this system too. It turns out that measurement is an integral part of quantum mechanics. Not only does it allow us to determine properties of the quantum system but it significantly alters the system too. Before we discuss the third postulate describing the measurements, have we seen any measurement in this course before? Yes, we said that if the state is ψ = α 0 + β 1 then it will be in 0 with probability α and in 1 with probability β. That meant, if we measure the state in the basis { 0, 1 }, then the output will be 0 with probability α and similarly for 1. The final state will be 0 if the output is 0, and 1 if the output is 1. It is as though the state ψ is projected by 0 0 or 1 1. This idea gives us the definition of projective measurements (a subclass of general measurements we will define later). Any partition of the vector space (where the state lives) is a possible measurement. Suppose P 1, P,, P k are the projectors onto these spaces. A measurement on kψ using these projection will give state Pi ψ P with probability P i ψ i ψ. We divide by P i ψ so that the resulting state is a unit vector. Exercise 8. Check that this definition matches with one qubit projection in the standard basis defined above. More formally, a projective measurement is described by a Hermitian operator M = i m ip i. Here P i s are projectors, s.t., i P i = I and for all pairs P i P j = 0. In other words, P i are orthogonal projectors which span the entire space. Exercise 9. Show that 0 P i I. Where A B means A B is positive semidefinite matrix.
3 If we measure state ψ with M. We get value m i with probability P i ψ = ψ P i ψ and the resulting P state is i ψ P. i ψ We will not answer why this happens. This and the subsequent definition of projective measurements is taken as a postulate. Though it agrees with the intuition we had about measurement (projecting into subspaces). When we say that the state is measured in the basis v 1, v,, v n ; it means the projections are v 1 v 1, v v,, v k v k In this case, it is easy to come up with the average value of the measurement. You will show in the assignment, the average value of measurement M on ψ is ψ M ψ. As we hinted above, a more general class of measurements can be defined. This gives us our third postulate. Postulate 3: A state ψ can be measured with measurement operators {M 1, M,, M k }. The linear operators M i s should satisfy i M i M i = I. Exercise 10. Prove that the condition i M i M i = I is equivalent to the fact that measurement probabilities sum up to 1. If probability of obtaining outcome i is = ψ M i M i ψ and then the state after measurement is M i ψ. Exercise 11. Show that projective measurements are a special case of measurements defined in the postulate. Exercise 1. Find a measurement that is not projective. Notice that individual measurement operators are not unitary. We made the resulting vector a unit vector by dividing it with its norm. It turns out that given ancilla (another system) we can simulate any general measurement operator using unitary operators and projective measurements POVM For the complete specification of measurement postulate, we defined with what probability we get the outcome and what is the state of the system after that. Sometimes, we are not interested in the state after the measurement (say measurement is the last step in the algorithm), in that case there is an easier description of measurements. Notice that the probability only depends upon M i M i and not M i. So we only need to specify E i = M i M i. These E i s are called the POVM elements. Given {E 1, E,, E k }, such that i E i = I and i : E i 0. The POVM measurement on ψ gives outcome i with probability ψ E i ψ. Exercise 13. What are the POVM elements for the projective measurement. Exercise 14. Show that ψ and e iθ ψ have the same measurement statistics. 4 Composite Systems The final postulate deals with composite systems. In the last lecture, we motivated tensor products for the sake of describing multiple systems. So the use of tensor product in the final postulate does not come as a surprise. Postulate 4: Suppose the state space of Alice is H A and Bob is H B then the state space of their combined system is H A H B. If Alice prepares her system in state ψ and Bob prepares it in φ then the combined state is ψ φ succinctly written as ψ φ. Similarly, if operator A is applied on Alice s system and operator B is applied on Bob s system, then operator A B is applied to the combined system. This follows from the property, (A B)( a b ) = A a B b. 3
4 Exercise 15. Calculate the quadratic form of the Bell state, , on the operator X 1 Z. Generally, it is quite clear which part of the system belongs to which party. In case of confusion, we will use subscripts to resolve it. So if A is on first system and B is applied on second system, the combined operator is A 1 B. The tensor product structure of the composite system gives rise to very interesting property called entanglement. As explained before, there are states in the composite system which cannot be decomposed into the states of their constituent systems. Such states are called entangled. The most famous example of an entangled state is called the Bell state, 1 ( ). Exercise 16. Show that the Bell state can t be written as ψ φ. It is clear that every state in the composite system H 1 H can be written as n i=1 ψ i φ i (Why?). Exercise 17. Prove a bound of dim(h 1 ) dim(h ) on n for any state in the composite system. Can you give a better bound? Read about Schmidt decomposition for a better bound. We have defined when a state is entangled and when is it not. But how can we quantify entanglement? In other words, how entangled is an state? This is a very interesting question. 4.1 General measurements using projective measurements We would like to perform measurements {M i : 1 i k} on a system H. Consider a state space M with basis { 1,,, k }. Pick a fixed state 0 in the state space M and define a unitary U, U ψ 0 = i M i ψ i. Exercise 18. Show that U preserves the norm between states of the form ψ 0. Exercise 19. Show that U can be extended to a unitary operator on the entire space. Then the projective measurements are P i = I H i i. Exercise 0. Show that the probability of obtaining i using the general measurement on ψ is same as the probability of getting i when U ψ 0 is measured with {P i }. Hence the probability of obtaining the outcome i matches. The combined state of the system using the postulate is, P i U ψ 0 = M i ψ i. So, if outcome i is obtained, the state of system M is i and state of system H is Mi ψ. Since the state and the probability both match, we are able to simulate general measurement using ancilla, unitary and projective measurements. 4
5 5 Quantum Teleportation To motivate ourselves, let us look at one of the applications of quantum computing. Quantum teleportation is a technique to transfer quantum bits without using quantum communication. In other words, suppose Alice and Bob have quantum computers but don t have a channel which can transfer quantum bits. Using entanglement, we can transfer quantum bits from one party to another with just classical communication. This is called quantum teleportation. Exercise 1. Why could this be useful? The protocol requires the use of entanglement. Alice and Bob can meet before and keep one part (qubit) of the Bell state with each of them. Suppose Alice wants to transfer state ψ to Bob. Suppose the state Alice wants to transfer (state ψ ) is the first qubit and the part of Bell state is the second qubit. Alice applies CNOT gate to these two qubits. CNOT gate is a -qubit gate, which applies NOT gate to the second qubit if and only if the first qubit is in state 1. Exercise. Write the matrix representation of CNOT. Show that CNOT is unitary. Then she applies Hadamard gate to the second qubit. Exercise 3. Suppose ψ = α 0 + β 1, what is the state of the three qubits now? It can be shown that the resulting state is, 1 ( 00 (α 0 + β 1 ) + 01 (α 1 + β 0 ) + 10 (α 0 β 1 ) + 11 (α 1 β 0 )). Now Alice measures her two qubits and sends them to Bob. Exercise 4. Convince yourself that Bob can recover ψ using Pauli operators. This completes the quantum teleportation. Alice is able to transfer one quantum bit using two classical bits of communication. Exercise 5. We said that we can transfer and not copy the quantum bit. Why? (look at question 31 of assignment) In quantum computing we can t copy qubits, this is known as no-cloning theorem. 6 Assignment Exercise 6. Give sufficient condition for e A+B = e A e B. Exercise 7. Show that for every unitary U, there exist Hermitian H, such that, U = e ih. Exercise 8. Show that the average value of measurement M on ψ is ψ M ψ. Exercise 9. What are the projectors on the eigenspace of v 1 X + v Y + v 3 Z where {v 1, v, v 3 } is a unit vector. Exercise 30. Remember that there exist POVM operators E i = M i M i for measurement operators M i. Given measurement operators M i s, show that there exists unitaries U i, s.t., M i = U i Ei. Exercise 31. Show that an operator which takes ψ 0 to ψ ψ for all ψ is not a unitary operator. What does this show? Exercise 3. Prove Schmidt decomposition using the singular value decomposition. Exercise 33. Read about superdense coding. References 1. M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge, S. Arora and B. Barak. Computational Complexity: A modern approach. Cambridge,
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 information2. 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 informationLecture 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 informationHilbert 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 informationInstantaneous 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 informationIntroduction 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 informationSUPERDENSE 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 informationIntroduction 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 informationQuantum 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 informationQuantum 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 informationIntroduction 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 informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
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.
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 informationPh 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 informationAn 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 informationQuantum 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 informationDECAY 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 informationLecture 3: Hilbert spaces, tensor products
CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second
More informationQuantum 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 informationC/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
More informationUnitary 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 information1. 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 informationQuantum 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 informationPh 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 informationQuantum 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 informationQUANTUM 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 informationLecture 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 informationQuantum 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 informationThe 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 informationLecture 1: Introduction to Quantum Computing
Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These
More informationBasic Notation and Background
Department of Mathematics, The College of William and Mary, Williamsburg, Virginia, USA; Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi, P.R. of China. Hilbert spaces The
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationEntanglement Manipulation
Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the
More informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationQuantum 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 informationLecture 1: Introduction to Quantum Computing
Lecture 1: Introduction to Quantum Computing Rajat Mittal IIT Kanpur Whenever the word Quantum Computing is uttered in public, there are many reactions. The first one is of surprise, mostly pleasant, and
More informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationLecture 2: Introduction to Quantum Mechanics
CMSC 49: Introduction to Quantum Computation Fall 5, Virginia Commonwealth University Sevag Gharibian Lecture : Introduction to Quantum Mechanics...the paradox is only a conflict between reality and your
More information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
More informationQuantum state discrimination with post-measurement information!
Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE! Quantum states! A state is a mathematical object describing the
More informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationLecture: 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 informationEnsembles 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 informationb) (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 informationTensor product Take two tensors, get together enough inputs to feed into both, and take the product of their results.
1 Tensors Tensors are a representation of linear operators. Much like with bra-ket notation, we want a notation which will suggest correct operations. We can represent a tensor as a point with n legs radiating
More informationChapter 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 informationEntanglement 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 informationQuantum 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 informationOpen 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 informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More informationCS120, Quantum Cryptography, Fall 2016
CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions
More informationCS286.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 informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationLecture 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 information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationTutorial 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 informationReview 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 informationCompression 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 informationQuantum 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 informationBasic 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 informationBasic concepts from quantum theory
B. BASIC CONCEPTS FROM QUANTUM THEORY 59 Figure III.1: Probability density of first six hydrogen orbitals. The main quantum number (n =1, 2, 3) and the angular momentum quantum number (` =0, 1, 2=s,p,d)areshown.
More informationQuantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
More informationLecture 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 informationAn Introduction to Quantum Information and Applications
An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationA Course in Quantum Information Theory
A Course in Quantum Information Theory Ofer Shayevitz Spring 2007 Based on lectures given at the Tel Aviv University Edited by Anatoly Khina Version compiled January 9, 2010 Contents 1 Preliminaries 3
More informationQuantum 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 informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
More informationQuantum computing and mathematical research. Chi-Kwong Li The College of William and Mary
and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationA Study of Topological Quantum Error Correcting Codes Part I: From Classical to Quantum ECCs
A Study of Topological Quantum Error Correcting Codes Part I: From Classical to Quantum ECCs Preetum Nairan preetum@bereley.edu Mar 3, 05 Abstract This survey aims to highlight some interesting ideas in
More informationBasic concepts from quantum theory
80 CHAPTER III. QUANTUM COMPUTATION Figure III.1: Probability density of first six hydrogen orbitals. The main quantum number (n =1, 2, 3) and the angular momentum quantum number (` =0, 1, 2=s,p,d)areshown.
More informationLecture 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 informationLecture 2: Linear Algebra
Lecture 2: Linear Algebra Rajat Mittal IIT Kanpur We will start with the basics of linear algebra that will be needed throughout this course That means, we will learn about vector spaces, linear independence,
More informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationA Simple Model of Quantum Trajectories. Todd A. Brun University of Southern California
A Simple Model of Quantum Trajectories Todd A. Brun University of Southern California Outline 1. Review projective and generalized measurements. 2. A simple model of indirect measurement. 3. Weak measurements--jump-like
More informationCSE 599d - Quantum Computing The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
CSE 599d - Quantum Computing The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding Dave Bacon Department of Computer Science & Engineering, University of Washington
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More informationThe 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 informationSome 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 informationUnitary 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 informationQuantum 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 informationCS286.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 informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More information5. 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 informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009 Preface The title of the book sounds a bit mysterious. Why should anyone read this
More information1 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 informationChapter 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 informationLecture 6: QUANTUM CIRCUITS
1. Simple Quantum Circuits Lecture 6: QUANTUM CIRCUITS We ve already mentioned the term quantum circuit. Now it is the time to provide a detailed look at quantum circuits because the term quantum computer
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationShort 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 informationThe 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 informationStochastic 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 informationDensity Operators and Ensembles
qitd422 Density Operators and Ensembles Robert B. Griffiths Version of 30 January 2014 Contents 1 Density Operators 1 1.1 Introduction.............................................. 1 1.2 Partial trace..............................................
More informationQuantum 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 informationChapter 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 informationBaby's First Diagrammatic Calculus for Quantum Information Processing
Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38 Quantum computing ˆ Quantum computing is usually
More information