J. Batle 1, M. Casas 1, A. R. Plastino 1,2 and A. Plastino 1,3 1 - Departament de Física, UIB, Spain 2 - Faculty of Astronomy and.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Quantum t-designs: t-wise independence in the quantum world Andris Ambainis, Joseph Emerson IQC, University of Waterloo.
Component Analysis (Review)
Lecture 3: A brief background to multivariate statistics
1 Separability and entanglement: what symmetries and geometry can say Helena Braga, Simone Souza and Salomon S. Mizrahi Departamento de Física, CCET, Universidade.
Fixing the lower limit of uncertainty in the presence of quantum memory Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata Collaborators:
(1) An ordered set of real numbers is called a sequence and is denoted by ( ). If the number of terms is unlimited, then the sequence is said to be an.
A spectral theoretic approach to quantum integrability Alberto Enciso and Daniel Peralta-Salas Departamento de Física Teórica II, Universidad Complutense.
Quantum One: Lecture 16.
Universal Uncertainty Relations Gilad Gour University of Calgary Department of Mathematics and Statistics Gilad Gour University of Calgary Department of.
Chapter 9 Gauss Elimination The Islamic University of Gaza
Technion – Israel Institute of Technology, Physics Department and Solid State Institute Entangled Photon Pairs from Semiconductor Quantum Dots Nikolay.
Advanced Computer Architecture Lab University of Michigan Quantum Operations and Quantum Noise Dan Ernst Quantum Noise and Quantum Operations Dan Ernst.
Networks, Lie Monoids, & Generalized Entropy Metrics Networks, Lie Monoids, & Generalized Entropy Metrics St. Petersburg Russia September 25, 2005 Joseph.
Solid state realisation of Werner quantum states via Kondo spins Ross McKenzie Sam Young Cho Reference: S.Y. Cho and R.H.M, Phys. Rev. A 73, (2006)
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Algorithmic Problems in Algebraic Structures Undecidability Paul Bell Supervisor: Dr. Igor Potapov Department of Computer Science
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
School of Physics & Astronomy FACULTY OF MATHEMATICAL & PHYSICAL SCIENCE Parallel Transport & Entanglement Mark Williamson 1, Vlatko Vedral 1 and William.
Entanglement Measures in Quantum Computing About distinguishable and indistinguishable particles, entanglement, exchange and correlation Szilvia Nagy Department.
VECTORS AND THE GEOMETRY OF SPACE 12. VECTORS AND THE GEOMETRY OF SPACE A line in the xy-plane is determined when a point on the line and the direction.
Quantum correlations. Adam W. Majewski. Quantum entanglement. Ghhjhjj Quantum entanglement is a phenomenon that occurs when particles (subsystems) are.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
LINEAR PROGRAMMING SIMPLEX METHOD.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
Quantum information Theory: Separability and distillability SFB Coherent Control €U TMR J. Ignacio Cirac Institute for Theoretical Physics University of.
Quantum Computers, Algorithms and Chaos - Varenna 2005 ENTANGLEMENT IN QUANTUM OPTICS Paolo Tombesi Department of Physics University of Camerino.
Steering witnesses and criteria for the (non-)existence of local hidden state (LHS) models Eric Cavalcanti, Steve Jones, Howard Wiseman Centre for Quantum.
Engineering of arbitrary U(N) transformation by quantum Householder reflections P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov.
Quantum One: Lecture Representation Independent Properties of Linear Operators 3.
Ch 9.8: Chaos and Strange Attractors: The Lorenz Equations
Experimental generation and characterisation of private states Paweł Horodecki Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska.
Multivariate Statistics Matrix Algebra I W. M. van der Veld University of Amsterdam.
Vacuum Entanglement B. Reznik (Tel Aviv Univ.) Alonso Botero (Los Andes Univ. Columbia) Alex Retzker (Tel Aviv Univ.) Jonathan Silman (Tel Aviv Univ.)
Section 2.3 Properties of Solution Sets
H ij Entangle- ment flow multipartite systems [1] Numerically computed times assuming saturated rate equations, along with the lower bound (solid line)
Víctor M. Castillo-Vallejo 1,2, Virendra Gupta 1, Julián Félix 2 1 Cinvestav-IPN, Unidad Mérida 2 Instituto de Física, Universidad de Guanajuato 2 Instituto.
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
Quantum Entanglement and Distillation in Information Processing Shao-Ming Fei
Chapter 9 Gauss Elimination The Islamic University of Gaza
A generalization of quantum Stein’s Lemma Fernando G.S.L. Brandão and Martin B. Plenio Tohoku University, 13/09/2008.
An Index of Data Size to Extract Decomposable Structures in LAD Hirotaka Ono Mutsunori Yagiura Toshihide Ibaraki (Kyoto Univ.)
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
IEN-Galileo Ferraris - Torino - 16 Febbraio 2006 Scheme for Entangling Micromeccanical Resonators by Entanglement Swapping Paolo Tombesi Stefano Mancini.
Absolute Separability and the Possible Spectra of Entanglement Witnesses Nathaniel Johnston — joint work with S. Arunachalam and V. Russo Mount Allison.
DYNAMICS OF OPEN Q-SYSTES FROM A PERSPECTIVE OF QIT IMS, Imperial College, London, 18 January 2007 Vladimír Bužek Research Center for Quantum Information.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Liouville Dynamics and Classical Analogues of Information-Related Quantum Impossible Processes A.R. Plastino University of Pretoria, South Africa A.Daffertshofer.
Some EOVSA Science Issues Gregory Fleishman 26 April 2011.
A Kernel Approach for Learning From Almost Orthogonal Pattern * CIS 525 Class Presentation Professor: Slobodan Vucetic Presenter: Yilian Qin * B. Scholkopf.
Non completely positive maps in physics Daniel R Terno Karol Życzkowski Hilary Carteret.
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
Density matrix and its application. Density matrix An alternative of state-vector (ket) representation for a certain set of state-vectors appearing with.
Chapter 3 Postulates of Quantum Mechanics. Questions QM answers 1) How is the state of a system described mathematically? (In CM – via generalized coordinates.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Entanglement Detection Gühne & Tóth, Physics Reports 474 (2009). Superradiance: … Theory of Collective Spontaneous Emission Gross & Haroche, Physics Reports.
Fernando G.S.L. Brandão and Martin B. Plenio
Twirling states to simplify separability
Generalized DMRG with Tree Tensor Network
Witness for Teleportation
Computational approaches for quantum many-body systems
Presentation transcript:

J. Batle 1, M. Casas 1, A. R. Plastino 1,2 and A. Plastino 1,3 1 - Departament de Física, UIB, Spain Faculty of Astronomy and Geophysics, UNLP, and CONICET, La Plata, Argentina. 3 - Department of Physics, UNLP, La Plata, Argentina Spectral decomposition based separability criteria: a numerical survey

Introduction A complete characterisation of quantum entanglement [1] has not yet been obtained, the associated separability problem being a difficult one indeed. The goal is to be in a position to assert whether a given state  describing a quantum system is useful or not for quantum information processing purposes. For bipartite Hilbert spaces of low dimensionality (d=NxM=2x2 and 2x3) the Positive Partial Transpose (PPT) criterion [2,3] is the strongest one, providing a necessary and sufficent condition for quantum separability and being only necessary for N>6. In the present endeavour we revisit the application of different separability criteria, such as the reduction, majorization and q- entropic, based upon a spectral decomposition and quantify the relations that link them by means of a Monte Carlo exploration in volving the (NM 2 -1)-dimensional space of pure and mixed states. All these criterions rely, in one way or another, on the spectra of matrices that involve either the partial transposition of the general density operator  AB, or some operator that includes the reduced matrices  A =Tr B [  AB ] and  B =Tr A [  AB ] of both subsystems, e.g the reduction criterion. Particular instances are i) the q-entropic criterion and ii) the majorization criterion. As we will see, the latter constitutes a lower bound to the former in the volume set of all mixed states. Although the separability issue is common to all these criterions, distillability is very important and so is reflected in the cases of reduction and majorization.

The criteria i) PPT This is a spectral criterion indeed (the information about non-separability is encoded in the negative eigenvalue of  PT ). Simple to operate, remains still the strongest necessary condition for separability. It is also sufficient for 2x2 and 2x3 systems. ii) Reduction A bit more complicated spectral criterion [4] (matrices obtained from operators O1 and O2 contain the reductions  A =Tr B [  AB ] and  B =Tr A [  AB ]). It is implied by PPT, that is, if  has PPT then must comply with reduction. The properties related to distillability will be discussed later on.  separable

iii) Majorization: if  AB in N=N 1 xN 2 is separable or classically correlated, then Majorization is closely related to reduction. vector eigenvalues in decreasing order iv) q-entropies: if  AB is separable, the classical entropic inequalities hold [5] R q is the Rényi entropy, with  q =Tr[  q ], q real, which reads as R q = ln (  q )/(1 - q). Conversely, one also can use the Tsallis entropy S q =(1-  q ) /(q - 1). We focus the very interesting case of

The numerical method A better understanding of these criteria can be quantified by computing in the space of the volume set of mixed states in arbitrary dimensions the number of states that comply with a given criterion. This is a very complex space with (NM 2 -1) dimensions and presents very interesting features. In other words, we find the a priori probability that a state complies with a given criterion. Even in the case of two-qubits this is clearly a non-trivial task. To such an end we make a survey on the space S of all states  following a recent work by Zyczkowski et al. [6,7]. A general state is expressed as  = U D[{ i }] U +, where the group of unitary matrices U(N) is endowed with a unique, uniform Haar [6-8] measure and the diagonal N-simplex D[{ i }] is naturally given by the standard Leguesbe measure on R N-1. Also, a systematic comparison between all criterions in any dimension allow us to describe and quantify the way they are related one to the other. By generating using a Monte Carlo method the states  according to this measure, we numerically compute those probabilities. The implication chain discussed previously translates into probabilities being smaller if a given criterion is weaker. Because all criterions are necessary for separability, the lesser the probability (or volume occupied), the stronger the criterion is. This is clearly seen in the next picture. There we plot the probabilities of a state complying with PPT, reduction, majorization or q-entropic.

Notice the exponential decay of PPT 2xN 2 and 3xN 2 Probability that a state  complies with one of the several criterions considered 2xN 2 PPT and reduction 3xN 2 PPT 3xN 2 reduction 2xN 2 majorization 2xN 2 q=infinity 3xN 2 majorization and q=infinity nearly coincide All criterions except PPT decay in a linear fashion

2xN 2 3xN 2 PPT-reduction PPT-majorization PPT-q=infinity Probability that a state  complies or violates PPT and some other critrerion The recovering means that as we increase N, all criterions will lead to the same conclusion about 

2xN 2 3xN 2 reduc-major reduc-q=infinity 2xN 2 3xN 2 Majorization-q= Probability of coincidence for reduction and majorization, and reduction and entropic q=infinity (a). This last one is also considered together with majorization (b). In 3xN 2, the recovering may occur for high N

Distillability Distillation is the process by which one concentrates the entanglement contained in an inseparable mixed state and converts it to active singlets by means of LOCC. Not all inseparable states can be distilled (bound entanglement). In 2x2 and 2x3 systems, all states  can be distilled. The problem comes in for higher dimensions. There is no general criterion to discriminate whose states can be distilled. However, two criterions are sufficient: reduction [4] and majorization. Their violation is sufficient for distillability. The implication reduction majorization with regard to separability also holds for distillability (recently shown in [9]). lower bound The computation using the present numerical procedure of the proportion of states that violate reduction and majorization can help us quantify giving a lower bound to the volume set occupied by those states that can be distilled, and thus useful for quantum information processing purposes. From figure one notices the steep growth in the 2xN 2 reduction case, to be compared with the linear behavior for majorization. The 3xN 2 reduction case is not that spectacular, and goes almost lineal with N. The implication reduction majorization is patent in the probability plot: the volume occupied by states violating reduction is greater than the one by majorization. It is worth stressing that around N=20 nearly all 2xN 2 states are distillable, whereas for 3xN 2 states more than 50% can be distilled.

2xN 2 3xN 2 violation of reduction violation of majorization Probability of finding a state that by violationg reduction or majorization is distillable

Conclusions By performing a Monte Carlo calculation, we compute the a priori probability that a mixed state  AB of a bipartite system in any dimension N=N 1 xN 2 complies with a given criterion. All criteria rely in one way or another in the spectra of some operator involving the state  AB and/or its reductions  A =Tr B [  AB ] and  B =Tr A [  AB ]. Very special cases are the majorization criterion and the q= -entropic criterion. Computing explicitely the volumes occupied by states according to a given criterion, and bearing in mind that the PPT is only a necessary separability criterion for N>6, one notices that PPT is the strongest criterion, implying all the others. The relations between several criterions are quantified by computing the ratios of coincidence in the volume set of states. We have numerically verified the assertion made in [10] that majorization is not implied by the relative entropic criteria. In general, majorization probabilities constitute lower bounds for relative q-entropic positivity. Finally, the issue of distillability is considered in the cases of reduction and majorization criterions, providing explicit lower bounds for any dimension to the volume of states that can be distilled.

References [1] E. Schrödinger, Naturwissenschaften 23 (1935) 807 [2] A. Peres, Phys. Rev. Lett. 77 (1996) 1413 [3] M. Horodecki, P. Horodecki and R. Horodecki, Phys. Lett. A 223 (1996) 1 [5] J. Batle, A. R. Plastino, M. Casas and A. Plastino, J. Phys. A 35 (2002) [6] K. Zyczkowski, P. Horodecki, A. Sanpera and M. Lewenstein, Phys. Rev A 58 (1998) 883 [7] J. Batle, M. Casas, A. R. Plastino and A. Plastino, Phys. Lett A 296 (2002) 251 [4] M. Horodecki and P. Horodecki, Phys. Rev. A 59 (1999) 4206 [10] K. G. H. Vollbrecht and M. M. Wolf, J. Math. Phys. 43 (2002) 4299 [9] T. Hiroshima, Majorization Criterion for Distillability of a Bipartite Quantum State (2003) quant-ph/ [8] M. Pozniak, K. Zyczkowski and M. Kus, J. Phys. A 31 (1998) 1059