pith. sign in

arxiv: 1909.02335 · v2 · pith:2HLVUIIYnew · submitted 2019-09-05 · 🪐 quant-ph

Upper bounds for relative entropy of entanglement based on active learning

classification 🪐 quant-ph
keywords entanglementboundslearningmethodstatesactivecalculateentropy
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.