Upper bounds for relative entropy of entanglement based on active learning

被引:4
作者
Hou, Shi-Yao [1 ,2 ]
Cao, Chenfeng [2 ]
Zhou, D. L. [3 ,4 ,5 ,6 ]
Zeng, Bei [2 ]
机构
[1] Sichuan Normal Univ, Coll Phys & Elect Engn, Ctr Computat Sci, Chengdu 610068, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Phys, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
[3] Chinese Acad Sci, Inst Phys, Beijing Natl Lab Condensed Matter Phys, Beijing 100190, Peoples R China
[4] Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China
[5] CAS Cent Excellence Topol Quantum Computat, Beijing 100190, Peoples R China
[6] Songshan Lake Mat Lab, Dongguan 523808, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
relative entropy of entanglement; active learning; upper bound; convex hull approximation; QUANTUM; INFORMATION; VOLUME; STATES; LIMITS; SET;
D O I
10.1088/2058-9565/abb412
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Quantifying entanglement for multipartite quantum state is a crucial task in many aspects of quantum information theory. Among all the entanglement measures, relative entropy of entanglement E-R is an outstanding quantity due to its clear geometric meaning, easy compatibility with different system sizes, and various applications in many other related quantity calculations. Lower bounds of E-R were previously found based on distance to the set of positive partial transpose states. We propose a method to calculate upper bounds of E-R based on active learning, a subfield in machine learning, to generate an approximation of the set of separable states. We apply our method to calculate E-R for composite systems of various sizes, and compare with the previous known lower bounds, obtaining promising results. Our method adds a reliable tool for entanglement measure calculation and deepens our understanding for the structure of separable states.
引用
收藏
页数:12
相关论文
共 39 条
  • [11] On convex optimization problems in quantum information theory
    Girard, Mark W.
    Gour, Gilad
    Friedland, Shmuel
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2014, 47 (50)
  • [12] Grant M., 2014, CVX MATLAB SOFTWARE
  • [13] Graph implementations for nonsmooth convex programs
    Stanford University, United States
    [J]. Lect. Notes Control Inf. Sci., 2008, (95-110): : 95 - 110
  • [14] Entanglement detection
    Guehne, Otfried
    Toth, Geza
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2009, 474 (1-6): : 1 - 75
  • [15] Gurvits L., 2003, P 35 ANN ACM S THEOR
  • [16] Information, relative entropy of entanglement, and irreversibility
    Henderson, L
    Vedral, V
    [J]. PHYSICAL REVIEW LETTERS, 2000, 84 (10) : 2263 - 2266
  • [17] Reduction criterion of separability and limits for a class of distillation protocols
    Horodecki, M
    Horodecki, P
    [J]. PHYSICAL REVIEW A, 1999, 59 (06): : 4206 - 4216
  • [18] Limits for entanglement measures
    Horodecki, M
    Horodecki, P
    Horodecki, R
    [J]. PHYSICAL REVIEW LETTERS, 2000, 84 (09) : 2014 - 2017
  • [19] Separability criterion and inseparable mixed states with positive partial transposition
    Horodecki, P
    [J]. PHYSICS LETTERS A, 1997, 232 (05) : 333 - 339
  • [20] Quantum entanglement
    Horodecki, Ryszard
    Horodecki, Pawel
    Horodecki, Michal
    Horodecki, Karol
    [J]. REVIEWS OF MODERN PHYSICS, 2009, 81 (02) : 865 - 942