基于正映射的并发度下界（英文）  

Lower Bound of Concurrence Based on Positive Maps

作　　者：常景美 崔美钰 黄晓芬[1,2] 张廷桂 CHANG Jingmei;CUI Meiyu;HUANG Xiaofen;ZHANG Tinggui(School of Mathematics and Statistics,Hainan Normal University,Haikou 571158,China;Hainan Center for Mathematical Research,Hainan Normal University,Haikou 571158,China)

机构地区：[1]海南师范大学数学与统计学院,海南海口571158 [2]海南省数学研究中心,海南海口571158

出　　处：《海南师范大学学报（自然科学版）》2018年第1期60-67,共8页Journal of Hainan Normal University（Natural Science）

基　　金：国家自然科学基金(11501153,11661031);海南省自然科学基金(20161006);海南省教育厅项目(Hnky2015-18);2017海南省研究生创新科研课题(Hys2017-138)

摘　　要：文章通过构造一个正的但不是完全正的3×3的含参数的矩阵映射Φ来得到一个新的并发度下界.在对具体态分析时,选择不同的参数将给出不同的新的映射,进而得到不同的并发度下界.结果表明,在相同的条件下,由特定参数构造的映射所得到的新的并发度下界能够判断的纠缠态的数量比已知的某些可分判据更多,例如PPT判据,重排判据.In this paper,we construct a 3 X 3 parametric matrix map O which is positive but not completely positive to get a new lower bound of the concurrence.In the analysis of the specific state,we give a new different map by choosing appropriate parameter values,and then the different lower bound of concurrence can be obtained.The results show that under the same conditions the amount of entangled states detected under the new lower bound of concurrence,obtained from the map con-structed by specific parameters,is more than some known separability criteria,such as the PPT criteria,the realignment cri-teria,and so on.

关 键 词：矩阵映射 并发度下界 纠缠判据 

分 类 号：O413.1[理学—理论物理]