Teleportation by using Reversible Quantum

Operations

Amina Mansha
mcs2200010

Division of Science and Technology,

University of Education,
Township Campus, Lahore

Supervisor: Dr. Nigum Arshed

28-03-2024

1 / 38
 Introduction

• We will focus on the teleportation scheme by Bennett et al.

• Formulate the general teleportation problem and its connection
to reversible quantum operations.
• Apply conditions for unitarily reversing ideal measurements to
characterize teleportation schemes.
• Explore the reversibility of measurements and information
gained in teleporting quantum states.
• Summarize the results of the characterization of teleportation
schemes based on reversible quantum operations.

Source : u8.gg/qu4jv

2 / 38
 Problem Statement

• Our Study aims to analyze teleportation by using reversible

quantum operations.
• By understanding the reversibility conditions for teleportation,
and also provide a deeper theoretical framework for
teleportation.

3 / 38
 Quantum State
Any possible state of a quantum system.
• State vector: A unit vector in the state space that represents
the state of the system
• State space: A complex vector space that contains all possible
states of the system.

Figure 1: Classical State Vs Quantum State

4 / 38
 Composite state

A composite state refers to the overall state of a system composed

of two or more smaller quantum subsystems.
• Separable states: These can be written as a product of the
individual states of the subsystems.

|00⟩ + |01⟩
|ψ⟩ = √ (1)
2
Because it can be written as
|0⟩ + |1⟩
|ψ⟩ = |0⟩ ⊗ ( √ ) (2)
2
Where ⊗ refers to the tensor product.

5 / 38
• Entangled State:
A composite quantum state where the individual states cannot
be described independently.
=⇒ It cannot be expressed as a simple product of individual
states
|00⟩ + |11⟩
|ψ⟩ = √ (3)
2

6 / 38
 Quantum Operation

Describe changes in a quantum state. Understand the evolution

and transformation of quantum systems.
• Represented by density matrices as initial state: ρ, final state:
ρ′ .
ρ′ = E(ρ) (4)
• Examples:
Unitary evolution,
E(ρ) = UρU † (5)
Non-unitary evolution.

E(ρ) = Trenv [U(ρ ⊗ ρenv )U † ] (6)

7 / 38
1. Reversible Quantum Operations:
The output state of the operation can be restored to the input
state by applying the operation.
 
E(ρ)
ρ = Ri (7)
Tr[E(ρ)]

2. Unitary Reversible Quantum:

These operations are reversible quantum operations that can
be reversed using unitary transformations.
 
E(ρ)
ρ=U U† (8)
Tr[E(ρ)]

8 / 38
1. Ideal Quantum Operations:
These operations represent a class of quantum transformations
characterized by perfect reversibility.

E(ρ) = AρA† (9)

where "A" is a single operator that completely specifies the

quantum operation

9 / 38
 Quantum Measurement
Measurement operators Mm reveal state ρ and determine outcome
probabilities.
• Measurement probability:
†
P(m) = Tr(Mm Mm ρ) (10)
• After the measurement:
†
Mm ρMm
ρ −→ †
(11)
Tr(Mm Mm ρ)

Figure 2: Quantum Measurement

Source : u8.gg/n8b66 10 / 38
Figure 3: Reversible Quantum Operations

11 / 38
 Quantum Teleportation
Quantum teleportation is transferring quantum information, using
entanglement and classical communication.
• A composite system having the composite state as;
ρ1 ⊗ σ 23 (12)

Figure 4: Composite system

12 / 38
Figure 5: Quantum Teleportation

13 / 38
Figure 6: Process of Teleportation

14 / 38
 Constructing Unitary Spaces
=⇒ Suppose a scenario such that

ρ̃1 ⊗ σ 23 (13)

=⇒ Assume that system 1 and system 3 share the same state

space as they are identical.

|ψ 3 ⟩ ←→ |ψ̃ 1 ⟩ (14)

and
A3 ←→ Ã1 (15)
=⇒ Now the one-to-one linear correspondence between state
spaces, linking systems 1 to 2 and 2 to 3.

|ψ 23 ⟩ ←→ |ψ̃ 12 ⟩ (16)

Source : u8.gg/5ifru
15 / 38
=⇒ By extending the correspondence further,

|ψ 123 ⟩ ←→ |ψ̃ 123 ⟩ = U13 |ψ 123 ⟩ (17)

=⇒ This unitary operator U13 does this mapping by acting on

product states by,

U13 |ã1 ⟩|b 2 ⟩|c 3 ⟩ = |c̃ 1 ⟩|b 2 ⟩|a3 ⟩ (18)

Unitary Operator U13 called a swap operator.

=⇒ when operators are included,
†
A123 ←→ Ã123 = U13 A123 U13 (19)

16 / 38
 Alice’s Measurement of Systems 1 and 2
=⇒ Measurement described by the operator: ((Ã12 3
ij ) ⊗ I ).
 
X   
†
ρ̂3i = Tr12  (Ã12 3
ρ̃1 ⊗ σ 23 (Ã12 3 


ij ) ⊗ I ij ) ⊗ I (20)
j

• Introducing the Quantum Operation E for Transforming ρ3

=⇒ Initially, we observe that
†
(ρ̃1 ⊗ σ 23 ) = U13 (σ̃ 12 ⊗ ρ3 )U13 (21)

so that
 
X n
†
o 
†
ρ̂3i = Tr12  (Ã12
ij ) ⊗ I
3
U13 (σ̃ 12 ⊗ ρ3 )U13 (Ã12
ij ) ⊗ I
3 

j
(22)
17 / 38
=⇒ Write X
σ̃ 12 = Pk |s̃k12 ⟩⟨s̃k12 | (23)
k

=⇒ By using eq. (21), (20)

 
†
X X
†
ρ̂3 = Tr12  ((Ã12 3
ij ) ⊗ I )[U13 ( Pk |s̃k12 ⟩⟨s̃k12 | ⊗ ρ3 )U13 ]((Ã12 3 
ij ) ⊗ I )
j k

=⇒ applying trace, finally we get;

X h  
†
i
†
ρ̂3 = Pk ⟨p̃l12 |(Ã12 3 12
ij ⊗ I )U13 |s̃k ⟩ ρ
3
⟨s̃k12 |U13 ((Ã12 3 12
ij ) ⊗ I )|p̃l ⟩
j,k,l
(24)
here, Π̃12 12 12
i = |P̃i ⟩⟨P̃i |
System 3 operators are defined,m −→ {j, k, l}

18 / 38
 p  
3
Bim = Pk ⟨p̃l12 |((Ã12
ij ) ⊗ I 3
)U |s̃
13 k
12
⟩

And p  
3 † † †
(Bim ) = Pk ⟨p̃l12 |U13 ((Ã12
ij ) ⊗ I 3
)|s̃ 12
k ⟩ (25)

The output state of system 3 can be expressed as

X
3 †
ρ̂3i = 3 3
Bim ρ (Bim ) = Ei (ρ3 ) (26)
m

ρ̂3i is associated with ρ3 through a unitary operation, as we want to

demonstrate.

19 / 38
 Bob Get the Original State

=⇒ Bob executes the deterministic reversible operation Ri on

target system 3 to get original state.

Ei (ρ3 )
 
Ri = ρ3 (27)
Tr[Ei (ρ3 )]

Ei (ρ3 )
 
Ui Ui† = ρ3 (28)
Tr[Ei (ρ3 )]
Non-ideal quantum operations (Ei ) arise even with ideal
measurements on systems 1 and 2.

20 / 38
Characterization of Teleportation Scheme

Figure 7: Successfull Teleportation

21 / 38
 Bennet et al.’s Quantum Teleportation Scheme
Suppose composite system (H 1 ⊗ H 2 ⊗ H 3 ) in d-dimensions.
=⇒ composite system’s state:

ρ̃1 ⊗ σ 23 (29)
=⇒ Process of measurement (ideal) by operator,
√
γi Π̃12
i ⊗I
3
(30)

Here Π̃12 12 12
i = |P̃i ⟩⟨P̃i |
−→ real constant,0 < γi ≤ 1.

Source : u8.gg/g81a5
22 / 38
=⇒ Conditions for the measurement operator:
1. Completeness relation:
X X
γi Π̃12
i = γi |P̃i12 ⟩⟨P̃i12 | = I 12 (31)
i i

2. γi = 1, ∀ orthogonal projection operators.

=⇒ operators in Bennett et. al. Scheme:
†
ρ̃1 ⊗ σ 23 = U13 (σ̃ 12 ⊗ ρ3 )U13 (32)

and
σ̃ 12 = |s̃ 12 ⟩⟨s̃ 12 | (33)

23 / 38
=⇒ Unnormalized state of target system 3 for given result "i":
 † 
3 √ 12 3

1 23

√ 12 3
ρ̂i = Tr γ i Π̃i ⊗ I ρ̃ ⊗ σ̃ γi Π̃i ⊗ I

Now, h i
12 3 †
ρ̂3i = γi Tr Π̃12
i U13 |s̃ 12
⟩⟨s̃ |ρ U13
h i
†
ρ̂3i = γi ⟨P̃i12 |U13 |s̃ 12 ⟩ρ3 ⟨s̃ 12 |U13 |P̃i12 ⟩ (34)

So finally,
ρ̂i 3 = A3i ρ3 (A3i )† (35)
and where A3i refers to an operator on system 3 alone,
√
A3i = γ i ⟨P̃i12 |U13 |s̃ 12 ⟩ (36)

24 / 38
We have shown that:
=⇒ If systems 2 and 3 constitute the joint system in its initial
pure state.
=⇒ If one-dimensional projectors describe the measurement on
systems 2 and 3.

ρ̂i 3 = Ei (ρ3 ) = A3i ρ3 (A3i )† (37)

An ideal quantum process transforms ρ3 to ρ̂3i

25 / 38
The probability of acquiring a specific measuring result "i" in the
teleportation process is as follows:
√ 3 √ 3 †
Pr (i) = Tr [(ρ̃1 ⊗ σ 23 )( γi Π̃12 12
i ⊗ I )( γi Π̃i ⊗ I ) ]

Using relations {Pi† = Pi , Pi2 = Pi } in the above equation,

Pr (i) = γi Tr [(ρ̃1 ⊗ σ 23 )(Π̃12 3

i ⊗ I )] (38)

Which is reduced to the probability,

Pr (i) = Tr (E(ρ3 )) = Tr (ρ̂3i ) = Tr [ρ3 (A3i )† A3i ] (39)

26 / 38
 Conditions for Successful Teleportation

Teleportation is achieved when:

1. Prepare the composite system so that the state of system 1 is
unknown, but the state of the joint system 2 and 3 is known
exactly, that is, is a pure state.
2. Perform an ideal measurement on the joint system 1 and 2
that gives complete information about the posterior state of
that system—that is, the joint system 1 and 2 is left in a pure
state—but that gives no information about the prior state ρ̃1
of system 1.
Bob uses measurement outcome "i" and unitary operation Ui on 3
to recover the state of 1.

27 / 38
Bennett et al.’s teleportation scheme fulfills these conditions

Measurement outcomes don’t depend on the unknown state.

h  i
pi /γi = Tr1 ρ̃1 Tr23 (I 1 ⊗ σ 23 )(Π̃12 3
i ⊗I ) (40)

we can write the above equation;

h i
(pi /γi )I 1 = Tr23 (I 1 ⊗ σ 23 )(Π̃12 ⊗ I 3 )

finally get,
(pi /γi )I 1 = ⟨s 23 |P̃i12 ⟩⟨P̃i12 |s 23 ⟩ (41)

28 / 38
=⇒ Using Schmidt Decomposition:
X
|s 23 ⟩ = αj |2j ⟩|3j ⟩ (42)
j

Now, let’s define the |Pi12 ⟩ that can be expand;

X
|P̃i12 ⟩ = βi,lm |1¯l ⟩|2m ⟩ (43)
l,m

So we can,
12 X
⟨s 23 |P̃i ⟩ = αj βlj |1¯l ⟩⟨3j | (44)
j,l

Equation (39) becomes,

X
∗
(pi /γi )I 1 = βi,lj α2 βi,l ′ j |1l ⟩⟨1j | (45)
j,l,l ′

29 / 38
An equivalent matrix expression

Bi A2 B†i = (pi /γi )I (46)

Where A refers to a non-negative matrix has elements Ajk = αj δjk .

Moreover, a Bi matrix including elements Bi,lm = βi,lm .
For orthonormal vectors, the normalization conditions;
• For |s 23 ⟩ is Tr (A2 ) = 1
12
• For |P̃i ⟩ is Tr (B†i Bi ) = 1

30 / 38
Now, to express Bi , use polar decomposition,

Bi = Vi Pi (47)

Here, Vi =⇒ unitary matrix, q

while Pi =⇒ positive matrix; Pi = B†i Bi . Substituting eq.(43)
into (42), also after some calculation, we get

Pi A2 P†i = (pi /γi )I (48)

• That pi /γi > 0 is assumed:

=⇒ Specifically, αj > 0 ∀ j .
P2i A2 = pi /γi (49)
Source : u8.gg/g613q

31 / 38
 P2i = (pi /γi ) A−2 (50)
We can conclude.
pi /γi A−1
p
Pi = (51)
12
By the implement of normalization condition of |P̃i ⟩, eq (49)
becomes
pi Tr(Pi2 ) 1
=⇒ = −2
= =k (52)
γi Tr(A ) Tr(A−2 )
where k −→ a constant;not depend upon "i".

32 / 38
Define a new orthonormal basis for system 1 for every "i".
X
|1i,j ⟩ = Vi,lj |1l ⟩ (53)
l

This causes the expansion of |P̃i12 ⟩ to evolve into a Schmidt

decomposition,
2
P
i |Pi,jm | = 1

12 X √ X −1
|P̃i ⟩ = Pi,jm |1i,j ⟩|2m ⟩ = k αj |1i,j ⟩|2j ⟩ (54)
j,m j

=⇒ The state of system 2 is identical.

33 / 38
Now the relationship of completeness creates the final component
(29).
I 1 = Tr2 (I 12 )
I 1 = ⟨2j |I 12 |2j ⟩
γi ⟨2j |P˜i12 ⟩⟨P˜i12 |2j ⟩
X
=
i
Using equation (50)
X √ X −1 √ X −1
= γi ⟨2j |( k αj |1i,j ⟩|2j ⟩)( k αj |1i,j ⟩|2j ⟩)† |2j ⟩
i j j
X
= γi kαj−2 |1i,j ⟩⟨1i,j |
i
From eq. (48), pi = γi k
1 X
I1 = pi |1i,j ⟩⟨1i,j | (55)
αj2
i

34 / 38
When one
√ takes the trace of both sides, one finds that for any j,
αj = 1/ d, =⇒ k = 1/d 2 and
γi
pi = (56)
d2
Consequently, we determine that the joint system 2 and 3’s initial
state vector,
1 X
|s 23 ⟩ = √ |2j ⟩|3j ⟩ (57)
d j

The vector of measurement states of joint systems 1 and 2,

1 X
|P̃i12 ⟩ = √ |1j ⟩|2j ⟩ (58)
d j

35 / 38
• Bennett et al.’s scheme relies on maximally entangled states
and ideal measurements.
• Measurement operators on joint systems 1 and 2 can be
constructed using any set of maximally entangled states
satisfying completeness.
• Any maximally entangled state of joint systems 2 and 3 can
serve as the initial state for both systems.

36 / 38
 Conclusion

we’ve thoroughly examined Bennett et al.’s teleportation scheme,

detailing its setup, measurement processes, and mathematical
formulations.
The scheme relies on maximally entangled states and ideal
measurements for successful teleportation.
By understanding the conditions and requirements outlined in
the chapter, we gain insights into the fundamental principles of
quantum teleportation as proposed by Bennett et al.

37 / 38
 References
Charles H Bennett, Gilles Brassard, and Claude Cr.
Teleporting an unknown quantum state via dual classical and
einstein-podolsky-rosen channels.
Phys. Rev. Lett, 70(13):18951899, 1993.
Charles H Bennett, Gilles Brassard, and Claude Crépeau.
Teleporting an unknown quantum state via dual classical.
Physical review letters, 70(13):1895, 1993.
Michael A Nielsen and Carlton M Caves.
Reversible quantum operations and their application to
teleportation.
Physical Review A, 55(4):2547, 1997.
Michael A Nielsen and Isaac L Chuang.
Quantum computation and quantum information.
Cambridge University Press, 2010.
38 / 38