Title: Manipulating Multi-partite Entanglement Witnesses by using Linear Programming By: M.A. Jafarizadeh, G. Najarbashi, Y. Akbari, Hessam Habibian Department.

Slides:

Advertisements

Similar presentations

Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a mn *X n  b m X 1, X n  0 Standard form.

Advertisements

Enumerative Lattice Algorithms in any Norm via M-Ellipsoid Coverings Daniel Dadush (CWI) Joint with Chris Peikert and Santosh Vempala.

Detecting Genuine Multi-qubit Entanglement with Two Local Measurement Settings Géza Tóth (MPQ) Otfried Gühne (Innsbruck) Quantum Optics II, Cozumel, Dec.

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Convex Optimization Chapter 1 Introduction. What, Why and How  What is convex optimization  Why study convex optimization  How to study convex optimization.

Chapter 5 FUZZY NUMBER Chi-Yuan Yeh.

MA5233: Computational Mathematics

So far all our functions were linear. In many situations, it might not be the case. Example: Production cost. – c 1 = $11/unit for first 5 items – c 2.

1 Chapter 8: Linearization Methods for Constrained Problems Book Review Presented by Kartik Pandit July 23, 2010 ENGINEERING OPTIMIZATION Methods and Applications.

Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.

Support Vector Regression David R. Musicant and O.L. Mangasarian International Symposium on Mathematical Programming Thursday, August 10, 2000

Lecture 10: Support Vector Machines

Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.

1 OR II GSLM Outline  separable programming  quadratic programming.

Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.

Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,

Department of Biophysical and Electronic Engineering (DIBE)- Università di Genova- ITALY QUALITY ASSESSMENT OF DESPECKLED SAR IMAGES Elena Angiati, Silvana.

Geometry of Online Packing Linear Programs Marco Molinaro and R. Ravi Carnegie Mellon University.

FDA- A scalable evolutionary algorithm for the optimization of ADFs By Hossein Momeni.

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

Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,

Part 4 Nonlinear Programming 4.3 Successive Linear Programming.

“A fast method for Underdetermined Sparse Component Analysis (SCA) based on Iterative Detection- Estimation (IDE)” Arash Ali-Amini 1 Massoud BABAIE-ZADEH.

Multi-Partite Squeezing and SU (1,1) Symmetry Zahra Shaterzadeh Yazdi Institute for Quantum Information Science, University of Calgary with Peter S. Turner.

Soham Uday Mehta. Linear Programming in 3 variables.

Quality of LP-based Approximations for Highly Combinatorial Problems Lucian Leahu and Carla Gomes Computer Science Department Cornell University.

A TUTORIAL ON SUPPORT VECTOR MACHINES FOR PATTERN RECOGNITION ASLI TAŞÇI Christopher J.C. Burges, Data Mining and Knowledge Discovery 2, , 1998.

Absolute Separability and the Possible Spectra of Entanglement Witnesses Nathaniel Johnston — joint work with S. Arunachalam and V. Russo Mount Allison.

Damian Markham University of Tokyo Entanglement and Group Symmetries: Stabilizer, Symmetric and Anti-symmetric states IIQCI September 2007, Kish Island,

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.

1 Ellipsoid-type Confidential Bounds on Semi-algebraic Sets via SDP Relaxation Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.

Entanglement and Optimal Strings of Qubits for Memory Channels Laleh Memarzadeh Sharif University of Technology IICQI 7-10 Sept 2007 Kish Island.

OR Integer Programming ( 정수계획법 ). OR

Distillation and determination of unknown two-qubit entanglement: Construction of optimal witness operator Heung-Sun Sim Physics, KAIST ESF conference:

Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *

Linear Programming Chapter 1 Introduction.

Massive Support Vector Regression (via Row and Column Chunking) David R. Musicant and O.L. Mangasarian NIPS 99 Workshop on Learning With Support Vectors.

Quantum State Transferring through Spin Chains Abolfazl Bayat Sharif University of Technology Tehran, Iran. IICQI September 2007 Kish Island, Iran.

Minimal Kernel Classifiers Glenn Fung Olvi Mangasarian Alexander Smola Data Mining Institute University of Wisconsin - Madison Informs 2002 San Jose, California,

Entanglement Detection Gühne & Tóth, Physics Reports 474 (2009). Superradiance: … Theory of Collective Spontaneous Emission Gross & Haroche, Physics Reports.

Part 4 Nonlinear Programming 4.3 Successive Linear Programming.

Computational Approach for Adjudging Feasibility of Acceptable Disturbance Rejection Vinay Kariwala and Sigurd Skogestad Department of Chemical Engineering.

Observability-Based Approach to Optimal Design of Networks Atiye Alaeddini Spring 2016.

Maximally Multipartite Entangled States and Statistical Mechanics

Quantum algorithm for the Laughlin wave function

رؤية مستقبلية لتطوير كلية الزراعة جامعة الفيوم

Quantum random walk Mozhgan Torabifard Department of Physics, Sharif University of Technology Introduction Result Many classical algorithms are based.

Support Vector Machines Introduction to Data Mining, 2nd Edition by

Solving For User Equilibrium Chapter 5

FAM Mirko Rehmann March

دانشگاه شهیدرجایی تهران

تعهدات مشتری در کنوانسیون بیع بین المللی

بسمه تعالی کارگاه ارزشیابی پیشرفت تحصیلی

Decoupling with random diagonal-unitaries

SCDC A Descriptive, Succinct Title GEEE-2017

Solving simultaneous linear and quadratic equations

Who Wants to be an Equationaire?. Who Wants to be an Equationaire?

Numerical Simulation of East China Sea Tsunami by Boussinesq Equation

Heuristic Search Value Iteration

Witness for Teleportation

Part 4 Nonlinear Programming

Part 4 Nonlinear Programming

Title of The Study Authors & Affiliations

Minimal Kernel Classifiers

Title of Article First Author: Second Author: Third Author:

CS 514 Class presentation template [Replace it with the title of your project] Xiaowei Yang.

Presentation transcript:

Title: Manipulating Multi-partite Entanglement Witnesses by using Linear Programming By: M.A. Jafarizadeh, G. Najarbashi, Y. Akbari, Hessam Habibian Department of Theoretical Physics and Astrophysics, Tabriz University, Tabriz 51664, Iran Iran International Conference on Quantum Information Kish Island, Iran 7-10 September 2007

Outline  Motivation  Entanglement Witnesses & Convex Optimization  Manipulating Entanglement Witnesses by Linear Programming  Multi-partite Entanglement Witnesses  Optimality, Decomposability & Positive maps  Conclusion

Motivation

1. Entanglement Witnesses

Bounded entangled states(BES) which can be detected by Non-Decomposable EWs but not PPT criteria. NPPT PPT separable

3. Manipulating EWs by LP method

4. Multi-qudit Reduction type EWs Jafarizadeh, Najarbashi, Habibian: PRA_75_052326

4.1 Optimality and Decomposability of

Decomposable ? Non-Decomposable

4.2 Positive Maps

5. Stabilizer EWs Jafarizadeh, Najarbashi, Akbari, Habibian, arXiv: v1

Nonlinear Convex Optimization Conclusion  The advantage of reducing manipulation of EWs to LP problem is to find optimal (Decomposable or Non-decomposable) EWs and it leads to detect larger areas of entanglement even when we solve our problem with approximated LP ones.  Studying Decomposable and Non-decomposable regions in multi-partite systems are so difficult which might be simplified by this method.  Multi-partite EWs open a new aspects to introduce many positive maps. Thanks for your attention