processes by local quantum
play

processes by Local Quantum Uncertainty Indrani Chattopadhyay - PowerPoint PPT Presentation

Characterization of local quantum processes by Local Quantum Uncertainty Indrani Chattopadhyay Department of Applied Mathematics, University of Calcutta Quantum Disentanglement This is a local quantum process . It is defined on


  1. Characterization of local quantum processes by Local Quantum Uncertainty Indrani Chattopadhyay Department of Applied Mathematics, University of Calcutta

  2. Quantum Disentanglement • This is a local quantum process . • It is defined on composite system consists of two or more subsystems, so that resulting state is separable. The disentangling machine(DM) is then defined as    DM d ρ e ρ • • It assumed to preserve the local properties of the state, by preserving the state of each subsystem.       e d ρ ρ ρ Tr Tr A B B       e d ρ Tr ρ Tr ρ B A A

  3. • An exact universal disentangling process may defined in two ways. (i) The process may defined to convert every entangled input states to some product states.      AB A B (ii) Disentangling process, that transforms any entangled input state to some separable states .                   i i Tr Tr Tr Tr ; ( ) ( ), ( ) ( ) AB AB i A B A A B B i •

  4. No-Disentanglement Theorem • Exact universal disentangling machine doesn’t exist in either process. • Hence disentangling process is defined to be either state-dependent exact disentanglement or it can be universal inexact disentanglement.

  5. Results on state-dependent exact disentanglement • Any set of perfectly distinguishable states can be disentangled. • Any set of states with identical reduced density matrices can be disentangled. • Any set of maximally entangled states can be disentangled.

  6. Inexact Universal Disentanglement • An inexact universal disentangling machine can disentangle any entangled state, and for which the local system are related by the reduction factors η A and η B as       1      d   A Tr I B A A A   2       1      d   B Tr I A B B B   2 • Where the reduction factors are independent of   η A η the initial entangled state and 0 , 1 B

  7. Universal Disentangling Machine • Suppose two parties A and B share an entangled state of two qubit system given by |ψ  = α |00  + β |11  , where | α| 2 + |β| 2 = 1. • A disentangling machine will then assumed to be some unitary operation acting on any one subsystem with some Machine state or two Local unitary operation acting of the two subsystems.

  8. Local Cloning induces Disentanglement • Bandyopadhyay et.al. proposed that entanglement of bipartite system H AB , can be reduced by introducing local isopropic cloner to any subsystem (Say A).          U b M a M b M 0 0 0 0 1 1 0             A Á A Á A Á A Á   M        U b M a M b 1 1 1 0 1 1 0             A Á A Á A Á A Á • The process spilt the entanglement of the joint system between two joint system( H A’B and H A’’B ) each having a less amount of entanglement.

  9. Symmetric Optimal Universal Machine • If reduction factors are chosen to be equal, i.e.      , the final state remain entangled for all A B   1 initial state, if . Fidelity of cloner is related   3    F 1 with the reduction factor by 1 2 • It is possible to disentangle arbitrary pure two-qubit entangled state, by applying universal isotropic  2 cloner whose Fidelity in one subsystem. F 3 • If isotropic local cloning machine is applied on both of the subsystem, then the any pure bipartite state entangled states can be disentangled, if the common    reduction factor 1 3      1 F i.e.,   3   2 3

  10. Asymmetric Optimal Universal Machine • When the disentangling machine is allowed to operate locally on both the subsystems, and reduction factors are not bound to be equal(asymmetric case) then it is shown that for optimal disentanglement process the reduction factors η A and η B satisfy the following relation:  1 η A η B 3

  11. Disentanglement resulting from Decoherence Process in Open System Dynamics • Decoherence process is the destruction of quantum interference. • Disentanglement and Decoherence phenomena are shown to be connected by Dodd et.al. for open quantum dynamics. All possible initial state of the two particle system become separable after a finite time, under the evolution process that produce decoherence of both particles.

  12. Disentangling Capacity of a Joint Unitary In evolution of pure bipartite system, the Entangling E ↑ (U AB ) and Disentangling (E ↓ (U AB )) Capacity of a joint unitary U AB are               E U E U E sup                E U E E U sup  U’ is the extension of U in the extended Hilbert space(H’ AB =H’ AaBb ) of bipartite system, introducing ancillary spaces to both subsystem, |  be an arbitrary state of H’. For any 2  2 unitary E ↑ (U) =E ↓ (U) whereas from 2  3 dimension the two capacities are not always equal.

  13. Discord • A measure of non-classicality of bipartite correlation. • Consider a composite quantum system     H H H H d H d , dim( ) , dim( ) AB A B A A B B • The total correlation of a density matrix  AB of the composite system is characterized by the quantum mutual information • I( ρ) = H( ρ A ) + H( ρ B ) − H(ρ) , (1) • where H(.) is the von Neumann entropy function. • ρ A and ρ B are local subsystems of parties A and B respectively. where H(.) is the von Neumann entropy function. • ρ A and ρ B are local subsystems of parties A and B respectively.

  14. • A generalization of the classical conditional entropy is H( ρ B|A ), where ρ B|A is the state of the subsystem B given a measurement on subsystem A. By optimizing over all possible measurements in A, we get an alternative version of mutual information as •           Q ρ Η ρ ρ Η ρ ) min • , (2)     Α Β Ε κ κ Β κ k  Tr E I ρ ( )  ρ A k B  B k Tr E I ρ • Where is the state of B ( ) k B • conditioned on outcome k of the measurement performed on subsystem A and { E k } represents the set of positive operator valued measure(POVM) elements.

  15. • Then the discrepancy between the two measures of information defined above in equations (1) and (2) will be termed as Quantum Discord : D A ( ρ) = I( ρ) − Q A ( ρ) (3) • States having highly mixed in this sense, though not have much entanglement, but may used as resource for performing some information theoretic tasks exponentially faster than any classical algorithm. • Even separable states having this resource are shown to be powerful than classical system.

  16. • The discord is always non-negative. • The value of this measure reaches zero for classically correlated states. • Discord is not a symmetric quantity D A (ρ) and D B (ρ) denotes the left discord and right discord of ρ . • If D A (ρ) = D B (ρ) = 0 , then the state ρ is said to be completely classically correlated.

  17. Classical Quantum States • The states of a quantum system with zero value of quantum discord, are known as Classical-Quantum states. • A state ρ has zero-discord if and only if there exist a von       k Neumann measurement ; k k k      such that,    Π ρ Π ρ I I k B k B (4) k • The zero-discord state is of the form        p AB k k k k k   ψ • Where is some orthonormal basis set, ρ k are the k quantum states of subsystem B and p k are non-negative numbers such that  k p k = 1. • The set of zero-discord states is not convex.

  18. • We consider the singular value decomposition of  as diag[ c 1 , c 2 , . . . ]. Singular value decomposition defines new basis in local Hilbert-Schmidt spaces   ,   S U A F W B n nn n n mm m ' ' ' ' n m ' ' • The state ρ in the new basis is of the form L    ρ c S F n n n  n 1 where L is the rank of correlation matrix R (i.e., the number of non-zero eigenvalues c n ). • The necessary and sufficient condition (4) becomes    Π S Π S  ; n 1,2, L k n k n k     • This is equivalent to : S Π , 0 ; k, n n k

  19. • This means that the set of operators { S n } have common eigenbasis defined by the set of projectors {  k }. Therefore, the set {  k } exists if and only if:      S m S  , 0 m, n 1,2, , L n • By checking a maximum of L(L − 1) / 2 number of these commutators, one may identify the zero discord 2 , d B 2 }. states , where L = rank(R) ≤ min{d A • Now zero-discord state ρ is a sum of d A product operators. This bounds the rank of the correlation tensor to L ≤ d A . • Thus, the rank of the correlation tensor is itself the discord witness: If L > d A , the state has a non-zero discord.

Recommend


More recommend