On Discrimination of Quantum Operations Indrani Chattopadhyay - - PowerPoint PPT Presentation

on discrimination of quantum operations
SMART_READER_LITE
LIVE PREVIEW

On Discrimination of Quantum Operations Indrani Chattopadhyay - - PowerPoint PPT Presentation

On Discrimination of Quantum Operations Indrani Chattopadhyay Department of Applied Mathematics, University of Calcutta Email: icappmath@caluniv.ac.in, ichattopadhyay@yahoo.co.in Outline: Kraus Representation of General Quantum Operations


slide-1
SLIDE 1

On Discrimination of Quantum Operations

Indrani Chattopadhyay

Department of Applied Mathematics, University of Calcutta

Email: icappmath@caluniv.ac.in, ichattopadhyay@yahoo.co.in

slide-2
SLIDE 2

Outline:

 Kraus Representation of General

Quantum Operations

 Concept of Discrimination of Quantum

  • perators

 Some discrimination schemes

slide-3
SLIDE 3

Quantum Operations

 A quantum operation ξ:T(H) → T(H’) is a linear

trace- nonincreasing, completely positive map represented as where the set {Ek} satisfies

+

=

k k k E

E ρ ρ ξ ) (

H k k k

I E E ≤

+

slide-4
SLIDE 4

Quantum Channel

 Probability of occurrence of the Quantum

Operator

 is given by  A quantum channel is a trace preserving map ξ,

whose probability of occurrence is unit .

            =

+

ρ ρ ξ

n n n E

E Tr Tr )] ( [ )] ( [ ) ( ' : ρ ξ ρ ξ ρ ρ ξ Tr =

slide-5
SLIDE 5

 There exists an unitary operator U (not

unique), acting on some larger space formed by system and environment, corresponding to every quantum

  • peration.

 The initial state of the environment can

chosen without any loss of generality to be a pure state. [ ]

+

⊗ = U e e U TrEnv ) ( ) ( ρ ρ ξ

slide-6
SLIDE 6

Realization

 A purification scheme for achieving the unitary operator

corresponding to a quantum operation ξ:T(H) → T(H’) is given in the Heisenberg picture.

 A quantum operation ξ:T(H) → T(H’) has Kraus form

Then all unitary dilation for this operation satisfy the majorization relation forms an orthonormal basis for Range(Σ ), Σ is a nonvanishing projector on a subspace of ancillary system.

ij i i j i k k k

E E Tr E E Tr E E δ ρ ρ ξ ] [ ] [ with ) (

+ + +

= = ∑ [ ]

( ) ( )

φ σ | | A where ] [

i U

E E Tr A A Tr

i i

=

+ +

  • {

}

i

σ

slide-7
SLIDE 7

Discrimination of Quantum Operations

 Discrimination of quantum operations performed

through discriminating the action of them on some quantum state.

 Discrimination of quantum operations is not

equivalent with discrimination of quantum states.

Non-orthogonal quantum states are not perfectly distinguishable with finite no of copies of the states, while two unitary operators can be perfectly distinguished with finite no of copies.

  • A. Acin, PRL 87, 177901, 2001.
slide-8
SLIDE 8

Scheme

 Two unitary operators U1 , U2 are perfectly

distinguishable with a finite no of copies, say N, if there exists a state |Ψ〉 such that the states |Ψ1〉 and |Ψ2〉 are orthogonal, where

 It is an Entanglement-assisted scheme, but

does entanglement is always necessary?

( ) Ψ

⊗ = Ψ

I U

N i i

slide-9
SLIDE 9

 No, the discrimination may be processed

by a separable input state also.

 R. Y. Duan, Y. Feng and M.S. Ying, Phys. Rev. Lett. 98, 100503, 2007.

slide-10
SLIDE 10

Discrimination of general quantum operations

Two schemes have been proposed.  Minimum error discrimination

 The process terminate with a define result that may be

incorrect and probability of obtaining an erroneous result is minimized

M.F. Sacchi, Phys. Rev. A 71, 062340 (2005)

 Unambiguous discrimination

 The process fails for a non-zero probability and

  • therwise the result obtained is correct
  • G. Wang and M. Ying, Phys. Rev. A, 73, 042301 (2006).
slide-11
SLIDE 11

Minimum error discrimination

 The minimum error discrimination of two

quantum operations ξ1 , ξ2 is the process

  • f finding a suitable state ρ in Hilbert

space H such that the error probability of discriminating the output states ξ1(ρ) , ξ2(ρ) is minimum.

slide-12
SLIDE 12

Minimum error discrimination with use of entanglement

 By choosing the input to be a bipartite

state ρ of H⊗K, the minimum error discrimination of two quantum operations ξ1 , ξ2 is done by discriminating the output states (ξ1 ⊗IK)ρ , (ξ2 ⊗IK) ρ .

 Does entanglement scheme always

improve the probability of discrimination?

slide-13
SLIDE 13

 For any two Pauli channels

the minimum error probability of unambiguous discrimination can be achieved by non-entanglement strategy also.

 For discriminating the Depolarizing

channel and identity map, the use of entanglement necessarily improves the minimum error probability.

( )

∑ ∑

= =

= =

3 3

1 ;

i i i i i i

q q σ ρ σ ρ ξ

slide-14
SLIDE 14

Mini-max discrimination

 A process of optimal discrimination of a

given set of quantum operations is by maximizing the smallest of the probabilities of correct identification of the channel.

 M.F. Sacchi, Phys. Rev. A 71, 062340 (2005)  G. M. D’Ariano, M.F. Sacchi and J. Kahn, Phys. Rev. A 72, 052302 (2005)

slide-15
SLIDE 15

Unambiguous discrimination

Support of a quantum operation

is given by span{Ek} of bounded operators in its Kraus form. As each set {Ek} chosen, is unitarily connected with another, so support is independent of a specific choice

  • f {Ek}.

The condition for unambiguous discrimination of a finite number of quantum operations {ξ1, ξ2,…, ξn} is supp(ξi) ⊄ ∑k=1

n supp(ξk) for each i=1,2,…,n

+

=

k k k E

E ρ ρ ξ ) (

slide-16
SLIDE 16

Condition for perfect distinguishability

 Dual et.al provide a scheme for perfectly

distinguishability of two quantum operations

 In that scheme the operators are perfectly

distinguishable, iff

 The operators are disjoint 

1,2 i , ) (

1

= = ∑

= +

i

n k k i k i i

E E ρ ρ ξ

{ }

2 1 j i d

E E span I

+

slide-17
SLIDE 17

 The scheme thus cannot perfectly

discriminate a minimum number of two arbitrary quantum operation acting on same system.

slide-18
SLIDE 18

Class of Pauli Channels

 A class of operators acting on single-qubit

system defined as

 Then there exists unitary operator

such that We may choose environment as 2 qubit system with basis

3

∑ =

⊗ =

i i i i

e e q U σ

( )

∑ ∑

= =

= =

3 3

1 ;

i i i i i i

q q σ ρ σ ρ ξ

( )

( )

[ ]

+

⊗ = U e e U Tr

E S E

ρ ρ ξ

{ }

11 , 10 , 01 , 00

3 2 1

= = = = e e e e

slide-19
SLIDE 19

Discrimination

 Though any two operators of this class

can not be perfectly discriminated with finite no of copies, the unitary operators corresponding to this two operators, acting

  • n a larger system are one-copy perfectly

distinguishable.

slide-20
SLIDE 20

 Consider two Pauli operators

with

 Then U1 , U2 can be perfectly distinguishable by

any state of the form as

 We may choose a product input state

3 ) (

∑ =

⊗ =

i i i k i k

e e q U σ

( )

3 (k) i i i i k

q σ ρ σ ρ ξ

∑ =

=

= =

= Ψ

3 , 2 , 1 1 , j i j ij

e i p

| |

2 1

= Ψ Ψ

+U

U

01 = Ψ

slide-21
SLIDE 21

Generalized Pauli Operations

 Class of operators  The 2nd Kraus representation of this operator is

where environment can be a d² dimensional system with basis

( )

∑ ∑

− = + − =

= =

1 1

2 2

1 ; U

d n n d n n n n

q U q ρ ρ ξ

U V

1 n

2

− =

⊗ =

d n n n

e e q

{ }

1 , 1 , 01 , 00 − − d d 

slide-22
SLIDE 22

Discrimination

 The unitary operators

corresponding to two General Pauli operators can be perfectly discriminated with a single copy by a product state

( )

1,2 k ; U

1 (k)

2

= =

+ − =

d n n n n k

U q ρ ρ ξ

U V

1 n ) ( k

2

− =

⊗ =

d n n k n

e e q

01 ⊗ = Ψ φ

slide-23
SLIDE 23

For discriminating two general quantum

  • perations we consider both of them to be acting
  • n same system. Adding a pure product state as

ancilla (environment), if we consider the evolution to be an unitary operator, then we may proceed to discriminate the given operation by discriminating the orthogonal output states

  • btain by acting the unitary operators on a

product input state, the ancillary part of the state is chosen to be orthogonal to the initial state of ancilla system(in preparing the unitary operator).

slide-24
SLIDE 24

Thank you