Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.

Slides:



Advertisements
Similar presentations
University of Queensland
Advertisements

Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Component Analysis (Review)
Introduction to Entanglement Allan Solomon, Paris VI.
1 Separability and entanglement: what symmetries and geometry can say Helena Braga, Simone Souza and Salomon S. Mizrahi Departamento de Física, CCET, Universidade.
Quantum Computing MAS 725 Hartmut Klauck NTU
Entanglement in fermionic systems M.C. Bañuls, J.I. Cirac, M.M. Wolf.
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Frustration of Decoherence and Entanglement-sharing in the Spin-bath Andrew Hines Christopher Dawson Ross McKenzie Gerard Milburn.
Detecting Genuine Multi-qubit Entanglement with Two Local Measurement Settings Géza Tóth (MPQ) Otfried Gühne (Innsbruck) Quantum Optics II, Cozumel, Dec.
1 Multiphoton Entanglement Eli Megidish Quantum Optics Seminar,2010.
Eigenvalues and Eigenvectors
Quantum One: Lecture Canonical Commutation Relations 3.
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.
Technion – Israel Institute of Technology, Physics Department and Solid State Institute Entangled Photon Pairs from Semiconductor Quantum Dots Nikolay.
Classical capacities of bidirectional channels Charles Bennett, IBM Aram Harrow, MIT/IBM, Debbie Leung, MSRI/IBM John Smolin,
DENSITY MATRICES, traces, Operators and Measurements
QEC’07-1 ASF 6/13/2015 MIT Lincoln Laboratory Channel-Adapted Quantum Error Correction Andrew Fletcher QEC ‘07 21 December 2007.
STBC BASED STTC CODES OPTIMIZED DESIGNS FOR THREE TRANSMIT ANTENNA SYSTEMS CANCES Jean-Pierre XLIM - Dépt. C 2 S 2 UMR CNRS 6172 ENSIL Parc ESTER - BP.
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Dirac Notation and Spectral decomposition Michele Mosca.
CSEP 590tv: Quantum Computing
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Dirac Notation and Spectral decomposition
School of Physics & Astronomy FACULTY OF MATHEMATICAL & PHYSICAL SCIENCE Parallel Transport & Entanglement Mark Williamson 1, Vlatko Vedral 1 and William.
Quantum correlations. Adam W. Majewski. Quantum entanglement. Ghhjhjj Quantum entanglement is a phenomenon that occurs when particles (subsystems) are.
Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
Generalized Deutsch Algorithms IPQI 5 Jan Background Basic aim : Efficient determination of properties of functions. Efficiency: No complete evaluation.
Motivation and goals One particle, two particles: previous work Three particles: flow through particles Many particles: flow along networks Application:
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.
What is being plotted?. Answer: Number of papers with “quantum entanglement” in title or abstract N. D. Mermin, Phys. Rev. Lett. (1990) Entanglement is.
Vacuum Entanglement B. Reznik (Tel Aviv Univ.) Alonso Botero (Los Andes Univ. Columbia) Alex Retzker (Tel Aviv Univ.) Jonathan Silman (Tel Aviv Univ.)
Matching Users and Items Across Domains to Improve the Recommendation Quality Created by: Chung-Yi Li, Shou-De Lin Presented by: I Gde Dharma Nugraha 1.
H ij Entangle- ment flow multipartite systems [1] Numerically computed times assuming saturated rate equations, along with the lower bound (solid line)
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
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
Marcos Curty 1,2 Coauthors: Tobias Moroder 2,3, and Norbert Lütkenhaus 2,3 1.Center for Quantum Information and Quantum Control (CQIQC), University of.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
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 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.
On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.
When are Correlations Quantum?: Verification and Quantification of Entanglement with simple measurements Imperial College London Martin B Plenio Koenraad.
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.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Experimental Quantification of Entanglement in low dimensional Spin Systems Chiranjib Mitra IISER-Kolkata Quantum Information Processing and Applications.
Non classical correlations of two interacting qubits coupled to independent reservoirs R. Migliore CNR-INFM, Research Unit CNISM of Palermo Dipartimento.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Distillation and determination of unknown two-qubit entanglement: Construction of optimal witness operator Heung-Sun Sim Physics, KAIST ESF conference:
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Entanglement Detection Gühne & Tóth, Physics Reports 474 (2009). Superradiance: … Theory of Collective Spontaneous Emission Gross & Haroche, Physics Reports.
Twirling states to simplify separability
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2009) Richard.
M. Stobińska1, F. Töppel2, P. Sekatski3,
Quantum mechanics from classical statistics
Nuclear Norm Heuristic for Rank Minimization
Quantum entanglement measures and detection
Witness for Teleportation
Finite Heisenberg group and its application in quantum computing
Presentation transcript:

Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral fellow of Prof. Hoi-Kwong Lo‘s group in Dept. of Physics University of Toronto We develop a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. It shows dramatic ability to identify many of the bounded entangled states discussed in the literature. Based on this criterion and the Peres-Horodecki criterion [i.e., PPT (positive partial transposition) criterion], we develop further a more powerful method to identify entangled states for any bipartite system through a universal construction of the witness operator. The method also gives a new family of positive but non-completely positive maps of arbitrary high dimensions, which provide a much better test than the witness operators themselves. References: quant-ph/ , , , In cooperation with Ling-An Wu Institute of Physics, Beijing, P.R. China Sergio Albeverio Bonn Univ. Germany Shao-Ming Fei Bonn Univ. Germany and Capital Normal University, Beijing

environment Decoherence A B The separability problem: one of the basic and emergent problems in present and future quantum information processing Is a quantum state entangled? How entangled is it still after interacting with a noisy environment? (Werner 89) A separable state is a quantum state which can be prepared in a local or classical way (LOCC): (local operations and classical communications) Otherwise, it is entangled

A strong separability criterion for mixed state Positive partial transpositions(PPT) (Peres 96) An example of 2x2 state :

Present status for the separability problem (Horodecki and Peres 96) 2x2 and 2x3 separable=PPT Bounded entangled states (BES) which can not be distilled to be EPR pair: un-distillable Bell inequalities (Bell, 1964) Entanglement of formation for two qubits (Wootters,1998) The reduction criterion (Horodecki, Cerf et al 1999) Low rank cases (Lewenstein,Cirac,Horodecki, Albeverio, Fei et al 2000, 2001) The necessary and sufficient criterion(Y.D. Zhang and C.Z. Li 2000,2001) The majorization criterion (Nielsen and Kempe,2001) Entanglement witnesses (Horodecki, Terhal, Lewenstein et al,1996,2000) PPT extension (Doherty et al,2002) The main progress : (Lewenstein, Cirac, Horodecki, Albeverio, Fei et al,2000, 2001) -Low rank -Operational necessary or sufficient conditions Generic state NPPT PPT separable Most of them are weaker than PPT and are unable to distinguish BES! Some of them are operationally complicated.

A matrix realignment method for recognizing entanglement A 2x2 example: define realignment operation: If Z is an mxm block matrix with block size nxn,

The realignment criterion For any bipartite separable state, we have Here is the sum of all the singular values of, or sum of the square roots of eigenvalue for. This criterion is strong enough to distinguish many of BES in the literature! is entangled Recognizing entangled states necessary criterion for separability sufficient criterion for entanglement

Universal construction of the witness operator 1. Universal construction of the witness operator from the realignment criterion W = I d ¡ ( R ¡ 1 ( U ¤ V T )) T where U,V are unitary matrices that yield the singular value decomposition (SVD) of i.e., 2. Universal construction of the witness operator from the PPT criterion where U,V are unitary matrices that yield the singular value decomposition (SVD) of i.e., W = I d ¡ ( VU y ) T A

Positive maps connected to entanglement witnesses w h ere P m + = j © ih © j an d j © i = 1 p m P m i = 1 j ii i ¤ ( j i ih j j ) = h i j W j j i Thus If ( I d A ­ ¤ ) ½ ® 0 is entangled

Results 1. Entanglement witness operators generated from the realignment criterion and PPT criterion are more powerful than the two criteria to identify entanglement 2. Positive map (not completely positive) constructed from these entanglement witnesses (EW) are further powerful than the EWs Significance 1.Offer a more power operational method to recognize entanglement, in particular, the bounded entanglement 2.Provide a powerful new method to detect entanglement, since the entanglement witnesses are physical observables and may be measured locally 3.Gives a new systematic way to obtain positive but non-CP maps

Comparison of separability criteria separable PPT Our criterion Generic quantum state

Conclusions and discussions The separability of a quantum state and quantitative character for entanglement become two of the most basic problems in quantum Information theory Multipartite systems and higher dimensions make a rich structure but with more complexity The realignment criterion and the corresponding witness operators and positive maps significantly expand our ability to recognize directly the entanglement The final solution needs better ideas and is still full of challenge Kai Chen, Ling-An Wu, Quantum Information and Computation, Vol.3, No.3 (2003) , quant- ph/ ; Physics Letters A 306 (2002) 14-20, quant-ph/ ; Phys. Rev. A 69, (2004), quant-ph/ S. Albeverio, K. Chen, S.M. Fei, Phys. Rev. A 68 (2003) , quant-ph/ Note: It should be remarked that Rudolph has independently done work similar to quant- ph/ in quant-ph/ [Oliver Rudolph, “Further results on the cross norm criterion for separability”] where he called it the computable cross norm criterion.