Kapitza Fall 2017 NOISY QUANTUM MEASUREMENT
|
|
- Melissa Goodman
- 5 years ago
- Views:
Transcription
1 Kapitza Fall 2017 NOIY QUANTUM MEAUREMENT Ben altzman Q.I.T. TERM PAPER Professor arada Raeev December 10 th 2017
2 1 Introduction Not only does God play dice but... where they can t be seen. he sometimes throws them tephen Hawking Despite Albert Einstein s insistence that the world is deterministic, quantum mechanics introduces a probabilistic world view. Measuring a quantum becomes a delicate task: measurements inherently affect the system in question. In this paper, based on a lecture given to fellow Kapitza members on December 3 rd, 2017, I discuss the formulation of measurement in a noisy quantum system. 2 A New Description of Measurement Measurement is commonly described by defining a set of proection operators that are complete, i.e. Π = I Introducing a probe system, we can get information about the original system from the probe. Measurement can be described by the unitary interaction of the system with the probe, with operator U P. uppose we have a system in state Ψ and a probe P with dimension d and orthonormal basis { 0 P, 1 P,..., d 1 P }. Defining the probe s initial state as 0 P, we can write the initial state of the whole system as and measurement operators Ψ { P } {0,1,...,d l} The operator can be written in the probe s basis as U P =,k M,k k P (1 for operators {M,k }. The probability of outcome from the probe is p J ( = Ψ 0 P U P (I P U P Ψ (2 1
3 and the state of the system after measurement is (I P (U P Ψ pj ( (3 Note that I P is the measurement operator on the full system, since only the probe is measured. ince U P is unitary, we have U P U P = I P = I I P. Consider the case k = 0. For clarity, define M M,0. ( U P U k=0 ( P M 0 P M 0 P M M 0 0 P = = M M 0 0 P (4 But U P U P k=0 I 0 0 P. Using (4, we conclude that I = M M (5 Using the definition of U P, we can simplify (2 and (3. ubstituting (1 into (2: ( p J ( = Ψ 0 P M,k k P (I P ( M,k k P Ψ = Ψ M,k 0 k P (I P M,k Ψ k 0 P = Ψ M I P M Ψ P = Ψ M M Ψ 2
4 and therefore p J ( = Ψ M M Ψ (6 imilarly, we can simplify the post-measurement state to M Ψ P pj ( (7 The state of can be read off from (7 easily, since and P are in a pure product state. Measurement can therefore be described as a set of measurement operators {M }, instead of {Π }, that satisfy (5. ee Appendix A for discussion on the application of this process to ensembles. When transferring classical data over a quantum channel, the receiver doesn t need the post-measurement state to process the information in a quantum fashion. The relevant probability is the probability of error. For any such situation where the probability of an outcome matters and the postmeasurement state does not, we can describe a positive operator-valued measure (POVM with a set of operators {Λ } = {M M } that are non-negative and complete. Clearly, proection is a type of POVM. The probability of success of the POVM is p X (x Tr Λ x ρ x x X where ρ x is the density matrix for state ψ x. 3 Composite ystems uppose we have two indepedent ensembles, ε A = {p X (x, ψ x } and ε B = {p Y (Y, φ y }. The density matrix for the oint state ψ x φ y is E X,Y ( ψ X φ Y ( ψ X φ Y = E X,Y ψ X ψ X φ Y φ Y = x,y p X (xp Y (y ψ x ψ x φ y φ y = x p X (x ψ x ψ x y φ y φ y = ρ σ (8 where ρ and σ are the density matrices for ε A and ε B respectively. Now suppose we have a oint ensemble in which systems A and B are correlated classically. We d like a formulation to express this ensemble similarly to the independent situation above. To do this, we introduce a new random variable Z that X and Y are conditioned on. The two ensembles 3
5 are ε A = {p X Z (x z, ψ x,z } (density matrix ρ z and ε B = {p Y Z (y z, φ y,z } (density matrix σ z, and X Z and Y Z are independent. Using the same procedure as we did with (8, we obtain the density matrix of the total state: E X,Y,Z ( ψ X,Z φ Y,Z ( ψ X,Z φ Y,Z = x,y,z p Z (zp X Z (x zp Y Z (y z ψ x,z ψ x,z φ y,z φ y,z (9 Define a new random variable W = X Y Z. We can write the density matrix in (9 as p W (w φ w φ w φ w φ w (10 w o, we can write any state with the properties discussed in this paragraph as a product of pure states. This type of state is termed separable, and contains no entanglement. In other words, a separable state can always be prepared classically. ee Appendix B for an application involving separable states. 4 Local Density Operators uppose systems A and B are in an entangled Bell state Φ + AB. Take a POVM Λ on A. The measurement operators for the system are Λ A I B. The probability of outcome is p J ( = Φ + Λ A I B Φ + AB = 1 1 kk Λ A 2 I B ll AB k,l=0 1 = 1 k Λ A 2 l A k I B l B k,l=0 = Tr Λ 1 1 A ( k k 2 A k=0 = Tr Λ A π A (11 where the local density operator for A is the maximally mixed state π A = k=0 k k A. This process goes similarly for B. Thus, the following global state gives the same predictions in local measurements as Φ + AB : π A π B 4
6 We d like to define what we mean by a local density operator in order to describe the results of local measurements. To do this, we need to define the partial trace operation. uppose { k A } and { l B } are orthonormal bases for the Hilbert spaces of A and B. Then { k A l B } is an orthonormal basis for the product of the Hilbert spaces. For density operator ρ AB, the probability of outcome is p J ( = Tr (Λ A I Bρ AB = k,l k A l B (Λ A I Bρ AB k A l B = k A I A l B (Λ A I Bρ AB I A l B k A k,l = k A Λ A (I A l B ρ AB (I A l B k A k l = Tr (I A l B ρ AB (I A l B (12 Λ A l o, we define the partial trace for B as Tr B X AB = (I A l B X AB (I A l B l (13 and the local density operator for A as ρ A = Tr B ρ AB (14 Therefore, (12 becomes p J ( = Tr Λ A ρ A (15 Alice can predict the outcome of local measurements with (15. 5 Classical-Quantum Ensembles uppose Alice prepares a quantum system with density matrix ρ x A and probability distribution p X (x. he passes this ensemble to Bob, who must learn about it. There is a loss of information in X after preparation which is minimized if the state is pure. ρ A = x p x(x x x A for an orthonormal basis { x } x X. For a mixed state, ρ A = x p X(xρ x A is more difficult to extract information from. 5
7 One solution is for Alice is to prepare a classical-quantum ensemble: {p X (x, x x X ρ x A} x X This ensemble is so-called because system X is classical, while system A is quantum. The density operator for the entire system is ρ XA = x p X (x x x X ρ x A (16 uppose Bob makes a measurement of the system with {I X Λ A }. This is akin to Bob measuring an isolated system A with {Λ A }. Why? Tr ρ XA (I X Λ A = Tr ( p X (x x x X ρ x A(I X Λ A x = Tr p X (x( x x X I X ρ x AΛ A = x = x x = Tr ρ A Λ A Tr x x X I X Tr p X (xρ x AΛ A Tr p X (xρ x AΛ A o Bob can extract information about A from the whole system with a local measurement on A. 6 Conclusion At the heart of quantum mechanics is a rule that sometimes governs politicians or CEOs - as long as no one is watching, anything goes. Lawrence M. Krauss Measurement of quantum systems is tricky, and matters only get more complicated when you consider composite quantum systems. With udicious choices of measurement operators and careful preparation of a system or composite system, one can make quantum measurement seem more akin to the classical case. 6
8 Appendix A: Redefining Measurement for Ensembles uppose we have an ensemble {p X (x, ψ x } x X with density operator ρ = x X p X (x ψ x ψ x Using the same procedure as outlined in section 2: p J ( = ( p X (x ψ x 0 P M,k k P (I P x X ( M,k k P ψ x = p X (x ψ x M,k 0 k P (I P x X M,k ψ x k 0 P = p X (x ψ x M I P M ψ x P x X = x X p X (x ψ x M M ψ x p J ( = x X p X (x ψ x M M ψ x = M M = Tr M M ρ This is a reformulation of the Born Rule. The post-measurement state is M ρm p J ( 7
9 Appendix B: The CHH Game Consider a game with two players, Alice (A and Bob (B. Alice and Bob cannot communicate with each other, but they can communicate with a referee. The referee sends out two bits: x to Alice and y to Bob. Each player sends a bit back to the referee (a and b respectively. The win condition is x y = a b It is known that the maximum probability of success for any strategy that Alice and Bob agree to use beforehand is 0.75 for classical strategies and cos 2 (π/ for quantum strategies. The form of a classical strategy is p AB XY (a, b x, y = dλp Λ (λp A ΛX (a λ, xp B ΛY (b λ, y where Λ is a continuous index for their strategies. The density operator for the state of the system is ρ AB = dλp Λ (λ ψ λ ψ λ φ λ φ λ In this case, the classical strategy is p AB XY (a, b x, y = Tr (Π (x a Π (y b ρ AB = Tr dλp Λ (λ Π (x a ψ λ ψ λ A Π (y b φ λ φ λ B = dλp Λ (λ φ λ Π (x a φ λ φ λ Π (y b φ λ Therefore, we have p A ΛX (a λ, x = φ λ Π (x a φ λ and p B ΛY (b λ, y = φ λ Π (y b φ λ The above are classical strategies that simulate quantum strategies, provided that the initial system is in a separable state. This implies that the upper limit on the probability of winning for a separable states is 0.75, not cos 2 (π/8. References 1 Wilde, M. M. (2013. Quantum information theory. Cambridge University Press. 2 ándor, I. and Ferenc, B. Quantum Computing and Communications - An Engineering Approach, Chapter 3: Measurements. Accessed December
Lecture 6 Sept. 14, 2015
PHYS 7895: Quantum Information Theory Fall 205 Prof. Mark M. Wilde Lecture 6 Sept., 205 Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0
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 informationThe CHSH game as a Bell test thought experiment
The CHSH game as a Bell test thought experiment Logan Meredith December 10, 2017 1 Introduction The CHSH inequality, named after John Clauser, Michael Horne, Abner Shimony, and Richard Holt, provides an
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 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 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 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 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 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 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 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 informationMP 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 informationDecay of the Singlet Conversion Probability in One Dimensional Quantum Networks
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks Scott Hottovy shottovy@math.arizona.edu Advised by: Dr. Janek Wehr University of Arizona Applied Mathematics December 18,
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 informationCS/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 informationQuantum Hadamard channels (I)
.... Quantum Hadamard channels (I) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. July 8, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, 2010
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 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 informationEntanglement, games and quantum correlations
Entanglement, and quantum M. Anoussis 7th Summerschool in Operator Theory Athens, July 2018 M. Anoussis Entanglement, and quantum 1 2 3 4 5 6 7 M. Anoussis Entanglement, and quantum C -algebras Definition
More informationLecture 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 informationLecture 21: Quantum communication complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
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 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 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 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 informationLecture 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 informationEntanglement and information
Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit
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 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 informationFRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY
FRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY Emina Soljanin Mathematical Sciences Research Center, Bell Labs April 16, 23 A FRAME 1 A sequence {x i } of vectors in a Hilbert space with the property
More informationQuantum 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 informationBit-Commitment and Coin Flipping in a Device-Independent Setting
Bit-Commitment and Coin Flipping in a Device-Independent Setting J. Silman Université Libre de Bruxelles Joint work with: A. Chailloux & I. Kerenidis (LIAFA), N. Aharon (TAU), S. Pironio & S. Massar (ULB).
More informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
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 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 informationGrothendieck Inequalities, XOR games, and Communication Complexity
Grothendieck Inequalities, XOR games, and Communication Complexity Troy Lee Rutgers University Joint work with: Jop Briët, Harry Buhrman, and Thomas Vidick Overview Introduce XOR games, Grothendieck s
More informationExplicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)
Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum
More information6.1 Main properties of Shannon entropy. Let X be a random variable taking values x in some alphabet with probabilities.
Chapter 6 Quantum entropy There is a notion of entropy which quantifies the amount of uncertainty contained in an ensemble of Qbits. This is the von Neumann entropy that we introduce in this chapter. In
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 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 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 informationQuantum 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 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 informationQuantum Information Theory Tutorial
Quantum Information Theory Tutorial Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State University, Baton
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 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 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 informationarxiv: v3 [quant-ph] 5 Jun 2015
Entanglement and swap of quantum states in two qubits Takaya Ikuto and Satoshi Ishizaka Graduate School of Integrated Arts and Sciences, Hiroshima University, Higashihiroshima, 739-8521, Japan (Dated:
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 informationEntanglement: concept, measures and open problems
Entanglement: concept, measures and open problems Division of Mathematical Physics Lund University June 2013 Project in Quantum information. Supervisor: Peter Samuelsson Outline 1 Motivation for study
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 informationSuperqubits. Leron Borsten Imperial College, London
Superqubits Leron Borsten Imperial College, London in collaboration with: K. Brádler, D. Dahanayake, M. J. Duff, H. Ebrahim, and W. Rubens Phys. Rev. A 80, 032326 (2009) arxiv:1206.6934 24 June - 3 July
More informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
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 informationTransmitting 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 informationA no-go theorem for theories that decohere to quantum mechanics
A no-go theorem for theories that decohere to quantum mechanics Ciarán M. Lee University College London Joint work with John H. Selby arxiv:1701.07449 Motivation The more important fundamental laws and
More 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 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 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 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 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 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 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 informationSome limits on non-local randomness expansion
Some limits on non-local randomness expansion Matt Coudron and Henry Yuen December 12, 2012 1 Introduction God does not play dice. Albert Einstein Einstein, stop telling God what to do. Niels Bohr One
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 informationStructure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture. Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev
Structure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev The Superposition Principle (Physicists): If a quantum
More informationQuantum 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 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 informationNonlocal games and XOR games
Nonlocal games and XOR games In previous lectures, we discussed a few fairly direct connections between quantum information theoretic notions and semidefinite programs. For instance, the semidefinite program
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 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 informationQuantum Pseudo-Telepathy
Quantum Pseudo-Telepathy Michail Lampis mlambis@softlab.ntua.gr NTUA Quantum Pseudo-Telepathy p.1/24 Introduction In Multi-Party computations we are interested in measuring communication complexity. Communication
More informationEntanglement 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 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 informationQuantum Information Theory
Quantum Information Theory Lectures 15 17 Quantum dynamics. III V. Superoperators and completely positive maps. 2002 November 5; modified 2005 September 30 and 2009 February 3 and 2014 October 3 1 Measurement
More informationLecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States
Lecture 13B: Supplementary Notes on Advanced Topics Outer Products, Operators, Density Matrices In order to explore the complexity of many particle systems a different way to represent multiparticle states
More informationarxiv: v2 [quant-ph] 26 Mar 2012
Optimal Probabilistic Simulation of Quantum Channels from the Future to the Past Dina Genkina, Giulio Chiribella, and Lucien Hardy Perimeter Institute for Theoretical Physics, 31 Caroline Street North,
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 informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
More informationTsirelson s problem and linear system games
IQC, University of Waterloo October 10th, 2016 includes joint work with Richard Cleve and Li Liu Non-local games x Referee y Win/lose based on outputs a, b and inputs x, y Alice Bob Alice and Bob must
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 informationQuantum Measurements: some technical background
Quantum Measurements: some technical background [From the projection postulate to density matrices & (introduction to) von Neumann measurements] (AKA: the boring lecture) First: One more example I wanted
More 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 informationPort-based teleportation and its applications
2 QUATUO Port-based teleportation and its applications Satoshi Ishizaka Graduate School of Integrated Arts and Sciences Hiroshima University Collaborator: Tohya Hiroshima (ERATO-SORST) Outline Port-based
More informationNonlocal Quantum XOR Games for Large Number of Players
onlocal Quantum XOR Games for Large umber of Players Andris Ambainis, Dmitry Kravchenko, ikolajs ahimovs, Alexander Rivosh Faculty of Computing, University of Latvia Abstract onlocal games are used to
More informationIntroduction To Information Theory
Introduction To Information Theory Edward Witten PiTP 2018 We will start with a very short introduction to classical information theory (Shannon theory). Suppose that you receive a message that consists
More informationConcentration of Measure Effects in Quantum Information. Patrick Hayden (McGill University)
Concentration of Measure Effects in Quantum Information Patrick Hayden (McGill University) Overview Superdense coding Random states and random subspaces Superdense coding of quantum states Quantum mechanical
More informationOther Topics in Quantum Information
p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.
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 informationLecture 18: Quantum Information Theory and Holevo s Bound
Quantum Computation (CMU 1-59BB, Fall 2015) Lecture 1: Quantum Information Theory and Holevo s Bound November 10, 2015 Lecturer: John Wright Scribe: Nicolas Resch 1 Question In today s lecture, we will
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 informationarxiv:quant-ph/ v1 13 Jan 2003
Deterministic Secure Direct Communication Using Ping-pong protocol without public channel Qing-yu Cai Laboratory of Magentic Resonance and Atom and Molecular Physics, Wuhan Institute of Mathematics, The
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 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 and non-signalling graph isomorphisms
Quantum and non-signalling graph isomorphisms Albert Atserias 1, Laura Mančinska 2, David E. Roberson 3, Robert Šámal4, Simone Severini 5, and Antonios Varvitsiotis 6 1 Universitat Politècnica de Catalunya,
More informationarxiv: v3 [quant-ph] 9 Jul 2018
Operational nonclassicality of local multipartite correlations in the limited-dimensional simulation scenario arxiv:70.0363v3 [quant-ph] 9 Jul 08 C. Jebaratnam E-mail: jebarathinam@bose.res.in S. N. Bose
More informationSquashed entanglement
Squashed Entanglement based on Squashed Entanglement - An Additive Entanglement Measure (M. Christandl, A. Winter, quant-ph/0308088), and A paradigm for entanglement theory based on quantum communication
More informationQuantum Simultaneous Contract Signing
Quantum Simultaneous Contract Signing J. Bouda, M. Pivoluska, L. Caha, P. Mateus, N. Paunkovic 22. October 2010 Based on work presented on AQIS 2010 J. Bouda, M. Pivoluska, L. Caha, P. Mateus, N. Quantum
More information