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 条
  • [1] Bulk locality and quantum error correction in AdS/CFT
    Almheiri, Ahmed
    Dong, Xi
    Harlow, Daniel
    [J]. JOURNAL OF HIGH ENERGY PHYSICS, 2015, (04):
  • [2] [Anonymous], 2014, ENTANGLEMENT DETECTI
  • [3] Agnostic active learning
    Balcan, Maria-Florina
    Beygelzimer, Alina
    Langford, John
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (01) : 78 - 89
  • [4] Bennett CH, 1996, PHYS REV A, V54, P3824, DOI 10.1103/PhysRevA.54.3824
  • [5] Unextendible product bases and bound entanglement
    Bennett, CH
    DiVincenzo, DP
    Mor, T
    Shor, PW
    Smolin, JA
    Terhal, BM
    [J]. PHYSICAL REVIEW LETTERS, 1999, 82 (26) : 5385 - 5388
  • [6] Minimax bounds for active learning
    Castro, Rui M.
    Nowak, Robert D.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) : 2339 - 2353
  • [7] A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
    Farhi, E
    Goldstone, J
    Gutmann, S
    Lapan, J
    Lundgren, A
    Preda, D
    [J]. SCIENCE, 2001, 292 (5516) : 472 - 476
  • [8] Fawzi H., 2018, FDN COMPUTATIONAL MA
  • [9] Efficient optimization of the quantum relative entropy
    Fawzi, Hamza
    Fawzi, Omar
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2018, 51 (15)
  • [10] Selective sampling using the query by committee algorithm
    Freund, Y
    Seung, HS
    Shamir, E
    Tishby, N
    [J]. MACHINE LEARNING, 1997, 28 (2-3) : 133 - 168