Scribd
Upload
49 views3 pages

Teleportation and Entanglement Transformations

1. The document discusses quantum teleportation, which allows transmitting a qubit from Alice to Bob using only classical communication if they share entanglement. It does this by Alice measuring her qubit and the entangled pair in a Bell basis and communicating the outcome to Bob, who applies a correction. 2. Teleportation can also be used to create shared entanglement between Alice and Bob by teleporting one half of an entangled pair. 3. The document introduces LOCC (local operations and classical communication) and discusses how it allows manipulating and distilling pure entanglement from noisy states in the asymptotic limit as the error goes to zero.

Uploaded by

Daniel Sebastian Perez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views3 pages

Teleportation and Entanglement Transformations

1. The document discusses quantum teleportation, which allows transmitting a qubit from Alice to Bob using only classical communication if they share entanglement. It does this by Alice measuring her qubit and the entangled pair in a Bell basis and communicating the outcome to Bob, who applies a correction. 2. Teleportation can also be used to create shared entanglement between Alice and Bob by teleporting one half of an entangled pair. 3. The document introduces LOCC (local operations and classical communication) and discusses how it allows manipulating and distilling pure entanglement from noisy states in the asymptotic limit as the error goes to zero.

Uploaded by

Daniel Sebastian Perez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

The Mathematics of Entanglement - Summer 2013

28 May, 2013

Teleportation and entanglement transformations


Lecturer: Fernando G.S.L. Brand
ao

Lecture 4

Prologue: Post-measurement states


One loose thread from the previous lecture is to explain what happens to a quantum state after
we measurement. Consider a projective measurement {Pk }. (We saw yesterday in lecture 2 that
in fact these can simulate even generalized measurements.) Recall that outcome k occurs with
probability Pr[k] = tr(Pk ). Then if this measurement outcome occurs, we are left with the state
Pk Pk
.
tr(Pk )

(1)

Observe that this has the property that repeated measurements always produce the same answer
(although the same is not necessarily true of generalized measurements).
For a pure state |i, the post-measurement state is
Pk |i
.
kPk |i k

(2)

Equivalently, we can write Pk |i = p |i, where |i is a unit vector representing the postmeasurement state, and p is the probability of that outcome.

Teleportation

Suppose that Alice has a qubit |iA0 = c0 |0i + c1 |1i that she would like to transmit to Bob. If
they have access to a quantum channel, such as an optical fiber, she can of course simply give Bob
the physical system A0 whose state is |i. This approach is referred to as quantum communication.
However, if they have access to shared entanglement, then this communication can be replaced
with classical communication (while using up the entanglement). This is called teleportation.
The procedure is as follows. Suppose Alice and Bob share the state
+

AB

|0, 0i + |1, 1i

,
2

and Alice wants to transmit |iA0 to Bob. Then Alice first measures systems AA0 in the basis
{|+ i , | i , | + i , | i}, defined as
|0, 0i |1, 1i
=

2
|0, 1i |1, 0i
=

2
For ease of notation, define {|0 i , |1 i , |2 i , |3 i} := {|+ i , | i , | + i , | i}.
Outcome 0 corresponds to the unnormalized state
+
+


1

A0 A IB (|iA0 + AB ) = + A0 A |iB ,
2
4-1

meaning the outcome occurs with probability 1/4 and when it does, Bob gets |i.
One can show (calculation omitted) that outcome i (for i {0, 1, 2, 3}) corresponds to

1
(|i i hi | IB ) |iA0 + AB = |i iA0 A i |iB ,
2
where {0 , 1 , 2 , 3 } denote the four Pauli matrices {I, x , y , z }. The 1/2 means that each
outcome occurs with probability 1/4. Thus, transmitting the outcome i to Bob allows him to apply
the correction i and recover the state |i.
This protocol has achieved the following transformation of resources:
1bit entanglement + 2 bits classical communication 1 qubit quantum communication.
As a sanity check, we should verify that entanglement alone cannot be used to communicate.
To check this, the joint state after the measurement is
3

A0 AB =

1X
|i i hi |A0 A i |i h| i .
4
i=0

Bobs state specifically is


3

B =

I
1X
i |i h| i = .
4
2
i=0

Teleporting entanglement. This protocol also works if applied to qubits that are entangled
with other states. For example, Alice might locally prepare an entangled state |iRA0 and then
teleport qubit A0 to Bob. Then the state |i will be shared between Alices system R and Bobs
system B. Thus, teleportation can be used to create shared entanglement. Of course, it consumes
entanglement at the same rate, so we are not getting anything for free here.

LOCC entanglement manipulation

Suppose that Alice and Bob can freely communicate classically and can manipulate quantum systems under their control, but are limited in their ability to communicate quantumly. This class
of operations is called LOCC, meaning local operations and classical communication. It often
makes sense to study entanglement in this setting, since LOCC can modify entanglement from one
type to another, but cannot create it where it didnt exist before. What types of entanglement
manipulations are possible with LOCC?
One example is to map a pure state |iAB to (UA VB ) |iAB , for some choice of unitaries
UA , VB .
A more complicated example is that Alice might measure her state with a projective measurement {Pk } and transmit the oucome to Bob, who performs a unitary Uk depending on the outcome.
This is essentially the structure of teleportation. The resulting map is
X
AB 7
(Pk Uk )(Pk Uk ).
k

One task for which we might like to use LOCC is to extract pure entangled states from a
noisy state. For example, we might want to map AB to |+ i h+ |. This problem is in general
4-2

called entanglement distillation since we are distilling pure entanglement out of noisy entanglement.
However, we typically consider it with a few variations. First, as with many information-theoretic
m
problems, we will consider asymptotic transformations in which we map n
, and
AB to |+ i h+ |
seek to maximize the ratio m/n as n . Additionally, we will allow a small error (to be
formalized later) that goes to zero as n . Semi-formally, the distillable entanglement of is
nm
o
LOCC
ED (AB ) = lim max
: n m |+ i h+ |m .
n
n

Distinguishing quantum states

The maximum distinguishing bias that any measurement can achieve between a pair of states ,
is
D(, ) = max | tr(M ( ))|.
{M,IM }
0M I

It turns out that D(, ) = 12 kk1 , where kXk1 is the trace norm, defined as kXk1 = tr( X X).
For this reason, the distance D(, ) is also called the trace distance.
Using this language, we can define ED properly as
nm
o
LOCC
ED (AB ) = lim lim max
: n m , km |+ i h+ |m k1  .
0 n
n

Entanglement dilution

Suppose we wish to create a general entangled state AB out of pure EPR pairs. As with distillation,
we will aim to maximize the asymptotic ratio achievable while the error goes to zero. Define the
entanglement cost
nm
o
Ec (AB ) = lim lim min
k


: LOCC, k(|+ i h+ |m ) n
AB 1
0 n
n
In general, Ec and ED are both hard to compute. However, if AB is pure then there is a simple
beautiful formula.
Theorem 1. For any pure state |iAB ,
Ec (|i h|AB ) = ED (|i h|AB ) = S(A ) = S(B ),
where S() = tr log .

4-3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy