Entanglement and information

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

Quantum Teleportation Pt. 3

Quantum Teleportation Pt. 1

Entanglement and Quantum Teleportation

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution

EPR paradox, Bell inequality, etc.

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

Quantum Gates, Circuits & Teleportation

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

Quantum information and quantum computing

+ = OTP + QKD = QC. ψ = a. OTP One-Time Pad QKD Quantum Key Distribution QC Quantum Cryptography. θ = 135 o state 1

Quantum Cryptography

Lecture 11 September 30, 2015

Teleporting an Unknown Quantum State Via Dual Classical and Einstein Podolsky Rosen Channels 1

Physics is becoming too difficult for physicists. David Hilbert (mathematician)

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Quantum Optical Communication

The controlled-not (CNOT) gate exors the first qubit into the second qubit ( a,b. a,a + b mod 2 ). Thus it permutes the four basis states as follows:

Bell s inequalities and their uses

Quantum Computing: Foundations to Frontier Fall Lecture 3

arxiv:quant-ph/ v2 3 Oct 2000

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels

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

Problem Set: TT Quantum Information

10. Physics from Quantum Information. I. The Clifton-Bub-Halvorson (CBH) Theorem.

Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.

A probabilistic quantum key transfer protocol

Security Implications of Quantum Technologies

Lecture 14, Thurs March 2: Nonlocal Games

10 - February, 2010 Jordan Myronuk

Entanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen

arxiv:quant-ph/ v1 27 Dec 2004

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

Lecture 21: Quantum communication complexity

Quantum Information & Quantum Computation

Eavesdropping or Disrupting a Communication On the Weakness of Quantum Communications

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Lecture 6: Quantum error correction and quantum capacity

Multiparty Quantum Remote Control

CS120, Quantum Cryptography, Fall 2016

CPSC 467b: Cryptography and Computer Security

Quantum Cryptography

Lecture: Quantum Information

Detection of Eavesdropping in Quantum Key Distribution using Bell s Theorem and Error Rate Calculations

Tutorial: Device-independent random number generation. Roger Colbeck University of York

Introduction to Quantum Key Distribution

Measuring Quantum Teleportation. Team 10: Pranav Rao, Minhui Zhu, Marcus Rosales, Marc Robbins, Shawn Rosofsky

CS/Ph120 Homework 1 Solutions

A single quantum cannot be teleported

Lecture 18: Quantum Information Theory and Holevo s Bound

Lecture 1: Perfect Secrecy and Statistical Authentication. 2 Introduction - Historical vs Modern Cryptography

CSE 599d - Quantum Computing The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding

Transmitting and Hiding Quantum Information

Lecture 38: Secure Multi-party Computation MPC

arxiv:quant-ph/ v2 2 Jan 2007

Cryptography in a quantum world

arxiv:quant-ph/ v1 13 Jan 2003

A Superluminal communication solution based on Four-photon entanglement

1 1D Schrödinger equation: Particle in an infinite box

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

An Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009

Perfectly secure cipher system.

Lecture Notes, Week 6

Week 11: April 9, The Enigma of Measurement: Detecting the Quantum World

An Introduction to Quantum Information and Applications

1 1D Schrödinger equation: Particle in an infinite box

Number theory (Chapter 4)

A New Wireless Quantum Key Distribution Protocol based on Authentication And Bases Center (AABC)

Lecture 11: Quantum Information III - Source Coding

Quantum sampling of mixed states

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

Quantum Entanglement Assisted Key Distribution

arxiv: v7 [quant-ph] 20 Mar 2017

Introduction to Cryptography Lecture 13

Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski

arxiv:quant-ph/ v1 6 Dec 2005

Notes 10: Public-key cryptography

Quantum Information Transfer and Processing Miloslav Dušek

Bit-Commitment and Coin Flipping in a Device-Independent Setting

Lecture 20: Bell inequalities and nonlocality

1 Indistinguishability for multiple encryptions

Introduction to Quantum Computing for Folks

Quantum Dense Coding and Quantum Teleportation

Introduction to Quantum Information Hermann Kampermann

INTRODUCTION TO QUANTUM COMPUTING

Technical Report Communicating Secret Information Without Secret Messages

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security

C. QUANTUM INFORMATION 99

Entanglement. Michelle Victora Advisor: Paul G. Kwiat. Physics 403 talk: March 13, 2017

The Relativistic Quantum World

Probabilistic exact cloning and probabilistic no-signalling. Abstract

PERFECTLY secure key agreement has been studied recently

Quantum key distribution with 2-bit quantum codes

Quantum Wireless Sensor Networks

Quantum key distribution for the lazy and careless

arxiv:quant-ph/ v1 13 Mar 2007

Realization of B92 QKD protocol using id3100 Clavis 2 system

5th March Unconditional Security of Quantum Key Distribution With Practical Devices. Hermen Jan Hupkes

Simple Math: Cryptography

Transcription:

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 quantum correlations that are basis-independent, and that they can be used to demonstrate violations of Bell Inequalities. Today we will consider the deceptively simple question of whether states like ab è can in any sense be used to transmit information from system A to system B. Technically the answer is no. However, we know of a small but growing number of ways in which entangled states can greatly facilitate the sharing or transmission of information. In recent years this has become a very active field of theoretical research, and some experiments are even starting to be done. Let s start by trying to construct an analogy between communication and the basis-independence of quantum correlations. Say we have two two-level systems, A and B. We prepare the initial joint state to be ab è 2 0 a b è Ý a 0 b è, then send system A to our friend Alice and B to our friend Bob. Let s say that Alice and Bob are located far apart from each other, and that Bob decides to make a measurement on the system we have sent him. If Bob performs the measurement specified by b P 0 0b èè0 b b, P b èè b, then the possible post-measurement states of the joint system are given by 0: ab è a å P b 0 ab è a 0 b è, è ab a å P b 0 ab è : ab è a å P b ab è 0 a b è. è ab a å P b ab è Hence, if Alice decides to perform the corresponding measurement a P 0 0a èè0 a a, P a èè a, on her system, her results is guarenteed to be perfectly (anti)correlated with Bob s. However, given the same initial preparation ab è, what if Bob decides to perform the alternative measurement

P x b xb èèx b, P x b yb èèy b, x b è 2 0 b è b è, y b è 2 0 b è Ý b è, instead? Noting that ab è 2 0 a b è Ý a 0 b è 2 2 2 2 x a è y a è x b è Ý y b è Ý 2 x a è Ý y a è x b è y b è x a x b è Ý x a y b è y a x b è Ý y a y b è Ý x a x b è Ý x a y b è y a x b è y a y b è Ý 2 x ay b è Ý y a x b è, the two possible post-measurement joint states will be given by x : ab è y : ab è a å P x b ab è è ab a å P x b ab è y a x b è, a å P y b ab è è ab a å P y b ab è x a y b è. Hence, immediately after Bob decides to perform the alternative measurement on system B, Alice s system knows to be correlated with Bob s result in the x,y basis instead of the 0, basis! For example, èy a x b P xa å b y a x b è 0, èy a x b P ya å b y a x b è, èy a x b P 0a å b y a x b è èy a x b P a å b y a x b è 2. Does this imply that some sort of communication, or transfer of information is taking place between A and B regarding Bob s choice of measurement basis? Does it mean that Bob might some how be able to communicate with Alice superluminally (instantaneously) by making use of this effect? Well the answer to the second question is definitely NO!! The reason for this is that whichever basis Bob chooses to measure, he still has absolutely no control over the result. So even though we know for sure that Alice s measurement result will be perfectly correlated with Bob s if and only if she uses the same measurement basis, the result she gets in any one measurement is still just a random binary variable just like Bob s! We can see this by noting that A 2 a, B 2 b, and Tr 2 P q 2 2

for any rank-one projector P q. Regardless of what Bob does in terms of choosing measurement basis during a sequence of preparations and measurements, Alice just gets a string of random bits that have no correlation whatsoever with Bob s choices of measurement bases. Alice s bits may be correlated with Bob s bits, but Bob s bits are totally random and no messages can be exchanged by this procedure. And what about the first question, of whether the basis-independence of quantum correlations might imply that some sort of transfer of information is taking place between A and B regarding Bob s choice of measurement basis? Even though it is impossible for Alice and Bob to utilize this effect for instantaneous communication, some people like to think that some sort of abstract information is indeed flying from B to A (or vice versa) in these sorts of scenarios. Given what we know about the interpretation of quantum states, however, it seems clear that no such magic need be invoked! The quantum collapse of the joint state vector immediately following Bob s measurement is simply a formal reflection of the fact that ab è 2 0 a b è Ý a 0 b è means that A and B are prepared in such a way that Alice s and Bob s measurement results will be perfectly anticorrelated if and only if they choose the same (but arbitrary) basis. Nevertheless, it does seem like one might be able to draw something useful from this loose analogy between communication and quantum correlations. For example, say Alice and Bob have some way of obtaining multiple pairs of systems prepared in the entangled joint state ab è 2 0 a b è Ý a 0 b è. If they agree beforehand on a fixed basis such as 0è, è, they can use the string of measurement results to establish a shared cryptographic key. Recall that Alice and Bob can send private messages over a public communication channel by encoding via one-time pad. If Alice s plaintext message is given as a sequence of 0 s and s (binary representation of ASCII codes, for example) then she can simply XOR this string with a random binary string of equal length (the cryptographic key) to produce an encoded cryptotext. This cryptotext can then be broadcast over public channels, and can only be decoded by someone who knows the cryptographic key. Decoding can be performed simply by XORing the cryptotext again with the key, so if Bob (and only Bob) knows the key it is easy for Alice to send him secret messages. Even if Alice and Bob are far apart, they can use quantum correlations to establish a cryptographic key. Alice, for instance, can produce pairs of entangled two-level systems in her lab and send only the B part to Bob through a public quantum channel. If the initial A, B 3

joint state is the singlet state discussed above and both Alice and Bob make measurements in the 0 è, è basis, Bob need only take the NOT of his sequence of measurement results to share a cryptographic key with Alice. Recall, however, that a public quantum channel is by definition one that an eavesdropper could perform measurements on. In the current scenario, this means that an eavesdropper Eve could perform measurements on system B while it is en route from Alice s lab to Bob s lab. How can Alice and Bob be sure that Eve doesn t end up knowing their cryptokey as well!? In 99 Artur Ekert published a very clever paper ( Quantum cryptography based on Bell s theorem, Phys. Rev. Lett. 67, 66) in which he argues that Alice and Bob can detect eavesdroppers by using a subset of their entangled quantum systems to test a Bell Inequality! Let s say that rather than agreeing on just one measurement basis, Alice uses two bases A,A and Bob uses two bases B,B as in our discussion of Bell Inequalities. Alice and Bob Ë Ë each switches bases randomly and independently from one round to the next. After a large number of measurements have taken place, Alice and Bob can reveal (over a public classical channel) which bases they used in each round of measurements. In the subset of cases where they chose the same basis, they know their results should be anticorrelated, so they can use most of them (without broadcasting them) to generate cryptokey. But Alice and Bob should set some of these same-basis results aside to compute a correlation function èabè, and likewise compute correlation functions èa Bè, èab è, èa B è, and Ë Ë Ë Ë èg è èabè èa Ë Bè èab Ë è Ý èa B è. Ë Ë If all is well, they should find èg è 2, in violation of Bell s Inequality (as we discussed in the previous lecture). But what about Eve? Let s say that Eve tries to tap into Alice and Bob s procedure by intercepting the B systems and performing standard measurements on them. Following Eve s measurement, we know that the A and B systems will be left in a factorizable state! Eve has to then send something on to Bob (or else he ll surely know that something is up), and even if she sends the post-measurement B there will be no entanglement left between Alice and Bob. And without entanglement, there are no violations of Bell Inequalities, implying that Alice and Bob will find èg è â 2 in their eavesdropper-detection protocol. If Eve is allowed to make generalized measurements, the proof of security is much more complicated. However, the latest word on the street is that the Ekert protocol can be generalized to make it unconditionally secure (see H. K. Lo and H. F. Chau, Unconditional security of quantum key distribution over arbitrarily long distances, Science 283, 2050 (999)). 4

Quantum-state teleportation Theory: C. H. Bennett et al, Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels, Phys. Rev. Lett. 70, 895 (993). Experiments: A. Furusawa et al, Unconditional quantum teleportation, Science 282, 706 (998); D. Bouwmeester et al, Experimental quantum teleportation, Nature 390, 575 (997); D. Boschi et al, Experimental realization of teleporting an unknown pure quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett. 80, 2 (998). Say Alice has a two-level quantum system A prepared in initial state a è a 0 0 a è a a è. She would like Bob to have a two-level quantum system B prepared in the identical state b è a 0 0 b è a b è. However, let s say she cannot directly send system A to Bob, nor can she communicate the coefficients a 0,a with sufficient precision for their liking. In fact, let s imagine that Alice does not even know these coefficients explicitly the initial state of system A could have been prepared by a third person Charlie, who has now asked her to send it somehow to Bob (without telling her the coefficients). The secret of quantum-state teleportation is that Alice and Bob need to have a shared quantum resource: entanglement. Let s say that the last time Alice and Bob got together, they prepared a pair of two-level quantum systems B,C in the entangled joint state Ý bc è 2 0 b c è Ý b 0 c è. A state of this form is often called a singlet. Alice keeps system C with her, and Bob takes B away with him. Recall that B eventually needs to end up in the state b è, whose coefficients are known only to Charlie. When Charlie finally gives Alice system A (prepared in the unknown state a è), there are three two-level systems in the picture: H A å H B å H C. The initial state of this three-part system is simply Ý a è å bc è. In order to accomplish quantum-state teleportation, Alice performs the following procedure:. Alice brings A together with C, and performs a joint measurement in the Bell basis 5

Ý 2 0 a c è Ý a 0 c è, 2 0 a c è a 0 c è, Ý 2 0 a0 c è Ý a c è, 2 0 a0 c è a c è. Note that this is a complete basis for H A å H C, and that these are all entangled states. The outcome probabilities can be computed explicitly by rewriting the three-part state of A, B, C in terms of the Bell states on A,C: a è Ý bc è 2 a 0 0 a è a a è å 0 b c è Ý b 0 c è 2 a 0 0 a 0 b c è Ý a 0 0 a b 0 c è a a 0 b c è Ý a a b 0 c è 2 a 0 0 b è Ý ac è Ý a 0 b è Ý ac è a 0 b è Ý ac è Ý Ý a b è Ý ac è Ý 2 a Ý 0 0 b è Ý a b è a 0 0 b è a b è. Ý è Ýa 0 b è Ý a 0 b è a 0 b è Ý a 0 b è ac Since a 0 2 a 2, we see that all four outcomes have probability. Also, we can easily 4 read off the post-measurement states for system B: : a 0 0 b è Ý a b è 0 0 Ý b è, Ý : a 0 0 b è a b è 0 0 b è, : a 0 b è Ý a 0 b è 0 Ý 0 b è, 0 Ý Ý : Ý a 0 b è Ý a 0 b è b è. Ý 0 Note that each of the four transformation operators are unitary, and therefore invertible. 2. Alice broadcasts a number from..4 corresponding to the result she actually obtained. Note that this is just two bits of classical information, versus an infinite number of bits that would be needed to transmit two complex coefficients (a 0,a ) with arbitrary precision. 3. When Bob learns the result, he knows which of the four post-measurement states B has been left in! To recover b è exactly, he need only apply the appropriate inverse 6

transformation. So when Alice and Bob implement this quantum-state teleportation protocol, they can be certain that Bob will end up with system B left in the state b è a 0 0 b è a b è, where a 0,a are arbitrary complex coefficients known only to Charlie! The total resource cost of the procedure is one entangled pair plus two bits of classical communication. In quantum information theory, we would say that teleportation demonstrates an equivalence between quantum bits (qubits), entanglement bits (e-bits), and classical bits (c-bits): qubit e-bit 2 c-bits. Here a qubit is implicitly defined as the amount of information represented by the state of a two-level quantum system. 7