quantum entanglement and implications in information processing: quantum teleportation k. mangala...

44
QUANTUM ENTANGLEMENT AND IMPLICATIONS IN INFORMATION PROCESSING: Quantum TELEPORTATION K. Mangala Sunder Department of Chemistry IIT Madras

Upload: milton-underwood

Post on 26-Dec-2015

217 views

Category:

Documents


1 download

TRANSCRIPT

QUANTUM ENTANGLEMENTAND IMPLICATIONS IN INFORMATION PROCESSING:

Quantum TELEPORTATION

K. Mangala SunderDepartment of ChemistryIIT Madras

Contents

1. Introduction

2. Bits / Qubits/ Quantum Gates

3. Entanglement

4. Teleportation / Teleportation through gates/ Experimental Realization

5. Application of teleportation

Introduction

• What are quantum computation and quantum information processing?

• They are concerned with computations and the study of the information processing tasks that can be accomplished using quantum mechanical systems

V. Vedral et al, Prog. Quantum Electron 22 (1998), 1-39

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

44

Introduction

• One must understand the difference between classical computation and quantum computation.

V. Vedral et al, Prog. Quantum Electron 22 (1998), 1-39

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

55

Introduction

• However, quantum computation offers an enormous advantage over classical computation in terms of the available data that a computer can handle.

• conventional computer can do anything a quantum computer is capable of.

V. Vedral et al, Prog. Quantum Electron 22 (1998), 1-39

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

66

Introduction

• Also by Moore’s Law quantum effects will show up in the functioning of electronic devices as they are made smaller and smaller

V. Vedral et al, Prog. Quantum Electron 22 (1998), 1-39

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

77

Bits / Qubits

• bit is a fundamental unit of classical computation and classical information

• only possible values for a classical bit are and

• quantum analogue of classical bit : quantum bit or qubit

0 1

Bits / Qubits

• qubits are correctly described by two quantum states – can be a linear combination of and . The two states here are the only possible outcomes when you measure the state of the qubit.

a b

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

99

Bits / Qubits

where1

0

and

0

1

Remember that there are other quantum stateswhere the number of outcomes can be one of many rather than one of two. Those are notconsidered here.

a matrix representation for the states.

a

b

where and are complex numbers such that a b

2 2| | | | 1a b

• state of a qubit is a vector of unit length in a two dimensional complex vector space

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

1111

• state of a qubit cannot be determined : i.e. a and b cannot be determined from a single measurement.

cos sin2 2

ie

• using the normalization condition

• there is nothing one can experimentally do to them to reveal their states

The result above can be derived from simple quantum mechanics of spins

z

x y

• single qubit operation can be described within the Bloch sphere picture

where and represent a point on the unit three dimension sphere known as Bloch sphere

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press

Multiple Qubits

• two classical bits can take four different possible values

• two qubit system has four computational basis states

, , ,

• thus the state can be represented as

12 12 12 12 12+ +a b c d

such that2 2 2 2

1a b c d

00, 01, 10, 11

• Bell States : play an important role in information processing schemes

12 1212 2

12 1212 2

and

2n

Bits qubits

0,1

00,01,10,11

000,001,010,100,

011,101,110,111

a b

12 12 12 12+ +a b c d

0 1 2 3

1234 5 6 7 123

x x x x

x x x x

This means that quantum computer can, in only one computational step,

perform the same mathematical operation on different input numbers

encoded in coherent superposition of n qubits

• what distinguishes classical and quantum computing is how the information is encoded and manipulated

• conventional gates are irreversible in operation. Quantum gates are reversible. (will elaborate later)

• existing real world computers dissipate energy as they run

• quantum parallelism

1

2

3

4

a

a

a

a

1

2

3

4

a F

a F

a F

a F

F=

1

2

3

4

b

b

b

b

Quantum Gates

• quantum computer : quantum circuit containing wires and elementary quantum gates

• classical computer : electrical circuit containing wires and logic gates

Irreversible (except NOT Gate)

reversible

• quantum analogue of NOT Gate is X-Gate

• it acts on the state of the qubit to interchange the role of computational basis state

X

a b X a b

• in matrix form

0 1

1 0X

Z Gate :

• it leaves unchanged but flips the sign of

a b a b Z

• in matrix form

1 0

0 1Z

Z

• its operation is just a rotation of about the y-axis followed by a reflection through x-y plane

• Hadamard Gate H

• turns and halfway between and

2

2

and

• in matrix form

1 11

1 12H

0 90

• can all 2 dimensional matrices be appropriate for quantum gates for single qubits? Think about it.

• matrix representing the single qubit gate must be unitary

Controlled Not gateU U I

U

• two qubit gate : consists of two input qubits known as controlled qubit and target qubit

'AA

B 'B

control wire target wire

A B A’ B’

0 0 0 0

0 1 0 1

1 0 1 1

1 1 1 0

• in matrix form

1 0 0 0

0 1 0 0

0 0 0 1

0 0 1 0

CNU

• operation will be reversed by merely repeating the gate

A

B

A

'B B

B’ = A XOR B

Entanglement

• entanglement is a quantum mechanical phenomena in which the quantum states of two or more particles have to be described collectively without being able to identify individual states

• entanglement is at the heart of the quantum computation and information processing

• it introduces the correlation between the particles such that measurement on one particle will affect the state of other

• algebraically if a composite state is not separable it is called as an entangled state

A B separable state

AB A B Non-separable for specific values of coeffs.

A. Peres, Phys. Rev. Lett. 77 (1996), 1413-15 M. Horodecki et al, Phys. Lett. A 223 (1996), 1-8

2. with probability ½ and post measurement state

• responsible for the exponential nature of quantum parallelism

singlet state

12 1212 2

1 12

• neither of the subsystem in singlet state can be attributed by a pure state

• any measurement on subsystem one leads to two possibilities for the first qubit

• any subsequent measurement on second sub system will yield in former case and in latter case respectively

2

2

E. Rieffel et al, ACM Computing Surveys, 32 (2000) ,300-335

1. with probability ½ and post measurement state1

12

Quantum network to prepare two and three particle entangled states

H

Bell states

,

,

H,

, GHZ states

,

G. Brassard et al, Physics D, 120 (1998), 43-47

Quantum Teleportation and multiphoton Entanglement, Thesis by J. W. Pan, Univ. of Sc. And Tech., China

• using single qubit operations and controlled not gates a suitable quantum network can be constructed to produce maximally entangled states

e.g. Bell states for two particle system

12

12 12

1

2

H gate C-NOT 1212 12

1

2

input output

• in a similar way all the four Bell states can be visualized

12 12

1

2

12 12

1

2

12

12

12 12 12

1

2

1

Play a flash movie here for one of them)

121 2

1 1

0 0

H Gate

on 1st 1 2

1 1 1 11

1 1 0 02

1 2

1 11

1 02

C-NOT

on 1-2

12

1 0 0 0 1

0 1 0 0 01

0 0 0 1 12

0 0 1 0 0

12

1

01

02

1

1 2

1 0

0 01

0 02

0 1

12 12

1

2

Entangled state analysis

• photon 1 is in input mode e and photon 2 is in input mode f

state of photon 1 1 1a b

2 2c d state of photon 2

• each photon has the same probability to get either reflected or transmitted by beam splitter

Photon 1

Photon 2

e

f

g

h

• four different possibilities are:

Teleportation

• branch of quantum information processing

• transmission of information and reconstruction of the quantum state of the system over arbitrary distances

• process in which an object can be transported from one location to another remote location without transferring the medium containing the unknown information and without measuring the information content on either side of transport

• techniques for moving things around, even in the absence of communication channels linking the sender of quantum state to the recipient

• process in which an object disintegrates at one place and its perfect replica occurs at some other location – no cloning

C. H. Bennett et al, Phys. Rev. Lett. 70 (1993), 1895-99

Bob (receiver)Alice (sender)

• Alice wants to communicate enough information about to Bob 1

• how to do this?

• quantum systems cannot be fully determined by measurements

1 1 1 a b

unknown state

23 23 23

1

2

particle 3 particle 2

• to couple her particle 1 with EPR pair Alice performs Bell state measurement on her particles

• complete state of three particles before Alice’s measurement is

123 1 2 3 1 2 3 1 2 3 1 2 32 2

a b

23

Quantum carrier to be used

• measurement basis

12 12 12

1

2 12 12 12

1

2

• expressing each direct product in Bell operator basis 1 2

3 3 3 312 12

123

3 3 3 312 12

1

2

a b a b

b a b a

• all the four outcomes are equally likely, occurring with equal probability 1/4

• having Alice tell Bob her measurement outcome, he can recover the unknown state

• If the outcome is Bob has to do nothing12

• in all other cases Bob has to use appropriate unitary transformation

12 12 123 3 3

- 1 0 - -

0 -1Za a a

b b b

12 12 12

0 1

1 0Xb b a

a a b

Y

12 12 12 12

- 0 - - -

0

b i b ia ai

a i a ib b

Teleportation through gates

2MX 1MZ1

1 H 1M

2M

23

• Quantum circuit for teleporting a qubit

here is the unknown state to be teleported and M is probabilistic classical bit

1

23 2323

1

2

G. Brassard et al, Physics D, 120 (1998), 43-47

• the state input into the circuit is

where first two qubits belongs to Alice and third qubit belongs to Bob

• Alice sends her qubits through a C-NOT gate, obtaining

• she then sends the first qubit through the Hadamard gate, obtaining

0 1 23 23 1 23 23

1

2a b

1 1 23 23 1 23 23

1

2a b

2 1 1 23 23 1 1 23 23

1

2a b

12 12 123 3 32

12 3

1

2

a b a b a b

a b

i.e.

• if Alice performs a measurement and obtain a result then Bob’s qubit will be in state which is identical to input state with Alice

thus

• knowing the measurement outcome Bob can fix up his state by the application of appropriate gate operation as

• depending on Alice’s measurements Bob’s qubit will end up in one of these four equally likely possible states with probabilities 1/4

3

,

,

a b a b

a b a b

Xa b a b Za b a b

XZ

a b a b

C-NOT on qubit 12 with 3 remaining unchanged:

The unitary transformation is

1 0 0 0 0 0 0 0

0 1 0 0 0 0 0 0

1 0 0 0 0 0 1 0 0 0 0 0

0 1 0 0 1 0 0 0 0 1 0 0 0 0

0 0 0 1 0 1 0 0 0 0 0 0 1 0

0 0 1 0 0 0 0 0 0 0 0 1

0 0 0 0 1 0 0 0

0 0 0 0 0 1 0 0

Use this in the next two transparencies!!

• the state input into the circuit is

0 12 12 12 12

1

2a b

0

1 1

23 23

1 1

1 0 0 0

0 0 1 02 2

1 1

a b

123 123

1 0 0 0 0 0 0 0 1 0

0 1 0 0 0 0 0 0 0 0

0 0 1 0 0 0 0 0 0 0

0 0 0 1 0 0 0 0 1 0

0 0 0 0 0 0 1 0 0 12 2

0 0 0 0 0 0 0 1 0 0

0 0 0 0 1 0 0 0 0 0

0 0 0 0 0 1 0 0 0 1

a b

123 123

1 0

0 0

0 0

1 0

0 02 2

0 1

0 1

0 0

a b

C-NOT

1-2

H gate on 1

123 123 123

1 0 0 0 1 0 0 0 1 0

0 1 0 0 0 1 0 0 0 0

0 0 1 0 0 0 1 0 0 0

0 0 0 1 0 0 0 1 1 01

1 0 0 0 1 0 0 0 0 02 2 2

0 1 0 0 0 1 0 0 0 1

0 0 1 0 0 0 1 0 0 1

0 0 0 1 0 0 0 1 0 0

a b

1 0

0 1

0 1

1 0

1 02 2

0 1

0 1

1 0

a b

3 3 3 3 3 3 3 3

12 12 12 12

1 0 0 0

0 1 0 1 0 1 0 1 0 0 0 1

0 0 1 0 1 0 1 0 1 0 1 02 2 2 2 2 2 2 2

0 0 0 1

a b a b a b a b

2

1

2

a b a b a b

a b

Experimental Quantum Teleportation

Pictorial representation of original scheme

ClickD. Bouwmeester et al, Nature 390 (1997), 575

Pictorial representation of actual set-upD. Bouwmeester et al, Nature 390 (1997), 575 P. G. Kwait et al, Phys. Rev. Lett. 75 (1995), 4337-4341

Application

• quantum communication is centered on the ability to send data over large distances quickly

• teleportation has practical application in the field of quantum information processing that hold promises for making computing both much faster and secure

• it exploits the concept of quantum entanglement which is at the heart of quantum computing

• during the process the quantum state of an object will be destroyed and not the original object

The most obvious practical application of teleportation is in cryptography.

It can provide a completely secure communication between two distant

components. Sending photons entangled in a quantum state makes it

impossible for an eavesdropper to intercept the message because even

if intercepted the message would be unintelligible unless it was intended

for a specific recipient.

Toc H Institute of Science anToc H Institute of Science and Technology, Keralad Technology, Kerala

4444

I wish to thank Mr. Atul Kumar, my I wish to thank Mr. Atul Kumar, my Ph. D. Scholar for his enthusiasm to Ph. D. Scholar for his enthusiasm to learn this and do further research in learn this and do further research in

this area.this area.Thank you all. Thank you all.