Irreversibility for all bound entangled states



Similar documents
Generalizing the degree sequence problem

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

PERRON FROBENIUS THEOREM

Recurrence. 1 Definitions and main statements

A Probabilistic Theory of Coherence

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

We are now ready to answer the question: What are the possible cardinalities for finite fields?

The descriptive complexity of the family of Banach spaces with the π-property

Embedding lattices in the Kleene degrees

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Extending Probabilistic Dynamic Epistemic Logic

On Leonid Gurvits s proof for permanents

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

Supply network formation as a biform game

COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

arxiv:quant-ph/ v3 4 Jan 2007

BERNSTEIN POLYNOMIALS

Downlink Power Allocation for Multi-class. Wireless Systems

1 Example 1: Axis-aligned rectangles

Economic Interpretation of Regression. Theory and Applications

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

Stability, observer design and control of networks using Lyapunov methods

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Natural hp-bem for the electric field integral equation with singular solutions

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t

Ring structure of splines on triangulations

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

Global stability of Cohen-Grossberg neural network with both time-varying and continuous distributed delays

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole

How To Calculate The Accountng Perod Of Nequalty

The Noether Theorems: from Noether to Ševera

Loop Parallelization

Interchangeability of the median operator with the present value operator

8 Algorithm for Binary Searching in Trees

Upper Bounds on the Cross-Sectional Volumes of Cubes and Other Problems

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

Do Hidden Variables. Improve Quantum Mechanics?

Blind Estimation of Transmit Power in Wireless Networks

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

2 When is a 2-Digit Number the Sum of the Squares of its Digits?

Equlbra Exst and Trade S effcent proportionally

F-Rational Rings and the Integral Closures of Ideals

The quantum mechanics based on a general kinetic energy

0.1 Phase Estimation Technique

Fisher Markets and Convex Programs

Solving Linear Systems, Continued and The Inverse of a Matrix

Support Vector Machines

Nonbinary quantum error-correcting codes from algebraic curves

Research Article Some Existence Results for Impulsive Nonlinear Fractional Differential Equations with Closed Boundary Conditions

arxiv:quant-ph/ v1 11 Jul 1996

Subexponential time relations in the class group of large degree number fields

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

Chapter 17. Orthogonal Matrices and Symmetries of Space

When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services

Pareto Optimality in Coalition Formation

Duality for nonsmooth mathematical programming problems with equilibrium constraints

COLLOQUIUM MATHEMATICUM

Fixed income risk attribution

General Auction Mechanism for Search Advertising

The Power of Slightly More than One Sample in Randomized Load Balancing

THE HIT PROBLEM FOR THE DICKSON ALGEBRA

This paper can be downloaded without charge from the Social Sciences Research Network Electronic Paper Collection:

Pricing Overage and Underage Penalties for Inventory with Continuous Replenishment and Compound Renewal Demand via Martingale Methods

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

Factorization in Polynomial Rings

A Practical Method for Weak Stationarity Test of Network Traffic with Long-Range Dependence

Math 319 Problem Set #3 Solution 21 February 2002

On the Interaction between Load Balancing and Speed Scaling

Equation of motion for incompressible mixed fluid driven by evaporation and its application to online rankings

APPLICATION OF COMPUTER PROGRAMMING IN OPTIMIZATION OF TECHNOLOGICAL OBJECTIVES OF COLD ROLLING

GREATEST COMMON DIVISOR

Arbitrage and viability in securities markets with fixed trading costs

26 Integers: Multiplication, Division, and Order

The literature on many-server approximations provides significant simplifications toward the optimal capacity

SIMPLE LINEAR CORRELATION

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

Continued Fractions and the Euclidean Algorithm

Allocating Collaborative Profit in Less-than-Truckload Carrier Alliance

α = u v. In other words, Orthogonal Projection

Uniform topologies on types

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Efficient Reinforcement Learning in Factored MDPs

arxiv: v1 [cs.dc] 11 Nov 2013

Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

A Lyapunov Optimization Approach to Repeated Stochastic Games

Existence of an infinite particle limit of stochastic ranking process

The University of Texas at Austin. Austin, Texas December Abstract. programs in which operations of dierent processes mayoverlap.

Imperial College London

Transcription:

Irreversblty for all bound entangled states Barbara Synak-Radtke Insttute of Theoretcal Physcs and Astrophyscs Unversty of Gdańsk Cooperaton: D. Yang, M. Horodeck, R.Horodeck [PRL 95, 190501 (2005, quant/ph- 0506138] RSQ (2003-2005, QUPRODIS (2003-2005, PBZ-MIN (2003

ntangled states Mathematcal defnton: s entangled t cannot be decomposed as the A B separable form p Operatonal asymptotc defnton: s entangled t cannot be prepared by Local Operaton and Classcal Communcaton (LOCC n asymptotc regme Maxmally entangled state (snglet 1 ψ _ = ( 01 10 2

Dstllaton of nosy entanglement [Bennett,Brassard,Popescu, Schumacher, Smoln,Wooters PRL 76 722-725 (1996 ] Alce Bob n pars Arbtrary local operatons : Classcal communcaton n Optmal transton from to snglet (asymptotc regme Alce Bob m pars (snglets Dstllable entanglement: optmal rate D ( =m/n (of snglets Ψ - m

Formaton of entanglement [Bennett, DVncenzo, Smoln,Wootters, PRA 54, 3824 3851 (1996] Alce Bob n pars Arbtrary local operatons : Classcal communcaton n Optmal transton from snglet to (asymptotc regme Alce Bob m pars (snglets ntanglement cost : optmal rate C ( =m/n (of pars Ψ - m

Reversblty for pure and separable states Separable (dsentangled states 1 No snglets needed to create state: C = 0 3 No snglets can be drawn from state: D = 0 Pure entangled states n ψ + m n D ( = ( = S( A C

Mxed states: rreversblty n entanglement theory Bound entangled states: [M.,P.,R. Horodeccy PRL 80 5239-5242 (1998 ] s entangled but n No pure entangled states Generc mxed state: [Rgorously: Vdal, Crac PRL 86 5803 (2001 ] ψ + k n ψ + k ' k < k D < C

Problem of rreversblty for bound entangled states Are the processes of formaton and dstllaton reversble or rreversble? c( d = ( reversblty ( c > d ( rreversblty

ntanglement needed to create one copy of state From bound entangled states, we cannot dstll entanglement D = 0 but we need entanglement to create one copy of them, what refers nonzero value of F > ntanglement of formaton 0 F ( = nf { p, ϕ } p S( ϕ ϕ A where p ϕ ϕ =

Problem of addtvty for F Relatonshp between F and C ( = lm ( / n c n F n [Hayden, M.Horodeck, Terhal, J.Phys.A, Math.Gen.2001] If F s addtve then C = F and for all entangled states C = F > 0 Problem We do not know f F s addtve

Other approaches to solve problem of rreversblty: To fnd a new entanglement measure: >? > C D To fnd lower bound of C : C G G > 0 for bound entangled states

Towards constructon of G Lets recall a measure of classcal correlaton of bpartte state: [Henderson, Vedral JPA 34, 6899 (2001] C( = max { BB + } S( A p S( A where p A 1 + = TrB ( I A B I A B p + = Tr( I A B ( I A B

Propertes of C C( = 0 ff = A B C s nvarant under local untary operatons C s non-ncreasng under local operatons, n partcular C( AA' : B C( A: B

For a trpartte pure state ϕ C, the followng dualty relaton s satsfed: Dualty relaton [M. Koash and A.Wnter, PRA 69, 022309(2004] where = Tr C ϕ C, s dual to AC = Tr B ϕ C and vce versa. ( ( ( AC F A C S + = ( mn ( ( ( mn ( }, { }, { + = A p A A p A S p S S p S Note: F C

Defnton a canddate for bound on C Lets defne some new quanttes for G( = nf { p, } p C( where nfmum s taken over all n general mxed ensemble realzng state = A: B p A: B

G s postve for all entangled state Theorem G( = 0 A: B A: B s separable state Proof. " " If G s equal to zero then C must be zero for every element of ensemble { p, } realzng, so all states A B n ensemble must be product { = }

For all separable state G=0 C( :B s contnuous A ths comes from dualty relaton but t s also a consequence of proposton proved n our paper about asymptotc contnuty: [see: B.Synak-Radtke, M.Horodeck, quant-ph/0507126 ] Basng on Caratheodory theorem we can show that for G, beng convex roof of other contnuous functon, there exsts optmal decomposton { p, If the state s entangled, there must be a non-product state n decomposton and C n nonzero on ths state. } G > 0 for entangled states and G = 0 for separable states

Inequalty relatng C and F Lemma For any four-partte pure state ψ AA BB the followng nequalty of entanglement s satsfed: where F = ( ψ ( + C( AA BB' F A' ' TrA' B' ψ ': A B : B AA' BB' and : = A' B' Tr ψ AA' BB' Proof. We apply a dualty relaton to a 4-partte state S( = ( + C( AA' F AA': B AA': B' F ( + C( A : B A': B' ψ AA' B B'

Inequalty relatng G and F Proposton For a mxed four-partte state A B ( ( + G( F AA' : BB' F A : B A' : B' Proof. Let { p, ϕ AA'BB' } be the optmal realzaton of F of state then AA' : BB' F ( = p S( AA': BB' AA' F ( + p C( A : B A': B' p ( + p C( F A : B A': B' F ( + G( A : B A': B'

G s lower bound of C Theorem For any entangled state C ( B G( > A : B A : 0 Proof. So n c F / n Notce that = lm ( n, then F ( =... ( + ( n 1 G( F n F ( n n n Let n then n F ( n 1 1 G( F ( n 1 C ( A B : + G( : G( A B > 0...

Irreversblty for all bound entangled state For any entangled state C ( > A: B 0 For all bound entangled states D = 0, but C > 0 Irreversblty between process of formaton and dstllaton for all bound entangles states!!!! D. Yang, M. Horodeck, R.Horodeck and B. Synak-Radtke Irreversblty for all bound entangled states, PRL 95, 190501 (2005, quant/ph- 0506138,

Applcaton 1 C ( > entangled 0 Mathematcal defnton of entangled states s equvalent to operatonal asymptotc one!!!

Applcaton 2 For a four-partte state AA'BB' F ( AA' : BB' F ( A: B + G( A': B' f the reduced state s A'B' entangled then F ( > ( AA' : BB' F A: B It s mpossble to clone a known entangled state by LOCC. [See: M. Horodeck, A.Sen (De, U. Sen, Phys.Rev.A 70 052326 (2004]

Thank you for your attenton!