Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Numerical estimation of the relative entropy of entanglement

Yuriy Zinchenko, Shmuel Friedland, Gilad Gour

Published Nov 29, 2010• 33 citations
Publisher

Abstract

We propose a practical algorithm for the calculation of the relative entropy of entanglement (REE), defined as the minimum relative entropy between a state and the set of states with positive partial transpose. Our algorithm is based on a practical semidefinite cutting plane approach. In low dimensions the implementation of the algorithm in matlab provides an estimation for the REE with an absolute error smaller than ${10}^{\ensuremath{-}3}$.

DOI
10.1103/physreva.82.052336

Related papers

Towards an entanglement measure for mixed states in CFTs based on relative entropy

Tadashi Takayanagi B, Tomonori Ugajin, Koji Umemoto

Abstract Relative entropy of entanglement (REE) is an entanglement measure of bipartite mixed states, defined by the minimum of the relative entropy S(ρ AB ||σ AB ) between a given mixed state ρ AB and an arbitrary separable state σ AB . The REE is always bounded by the mutual information I AB = S(ρ AB ||ρ A ⊗ ρ B ) because the latter measures not only quantum entanglement but also classical correlations. In this paper we address the question of to what extent REE can be small compared to the mutual information in conformal field theories (CFTs). For this purpose, we perturbatively compute the relative entropy between the vacuum reduced density matrix ρ AB 0 on disjoint subsystems A ∪ B and arbitrarily separable state σ AB in the limit where two subsystems A and B are well separated, then minimize the relative entropy with respect to the separable states. We argue that the result highly depends on the spectrum of CFT on the subsystems. When we have a few low energy spectrum of operators as in the case where the subsystems consist of finite number of spins in spin chain models, the REE is considerably smaller than the mutual information. However in general our perturbative scheme breaks down, and the REE can be as large as the mutual information.

arXiv:1807.09448•Journal of High Energy Physics•Oct 1, 2018•12 citations

Detecting entanglement by pure bosonic extension

Xuanran Zhu, Chao Zhang, Chenfeng Cao +3 more

In the realm of quantum information theory, the detection and quantification of quantum entanglement stand as paramount tasks. The relative entropy of entanglement (REE) serves as a prominent measure of entanglement, with extensive applications spanning numerous related fields. The positive partial transpose (PPT) criterion, while providing an efficient method for the computation of REE, unfortunately, falls short when dealing with bound entanglement. In this study, we propose a method termed “pure bosonic extension” to enhance the practicability of k -bosonic extensions, which approximates the set of separable states from the “outside”, through a hierarchical structure. It enables efficient characterization of the set of k -bosonic extendible states, facilitating the derivation of accurate lower bounds for REE. Compared to the semi-definite programming (SDP) approach, such as the symmetric/bosonic extension function in QETLAB, our algorithm supports much larger dimensions and higher values of extension k . Published by the American Physical Society 2024

arXiv:2209.10934•Physical Review Research•Mar 7, 2024•0 citations

Asymptotic Relative Entropy of Entanglement

K. Audenaert, Jens Eisert, E. Jané +3 more

We present an analytical formula for the asymptotic relative entropy of entanglement with respect to positive partial transpose states for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. This is the first case in which the asymptotic value of a subadditive entanglement measure has been calculated.

arXiv:quant-ph/0103096•Physical Review Letters•Nov 6, 2001•99 citations

Comparison of the relative entropy of entanglement and negativity

Adam Miranowicz, Satoshi Ishizaka, Bohdan Horst +1 more

It is well known that for two qubits the upper bounds of the relative entropy of entanglement (REE) for a given concurrence as well as the negativity for a given concurrence are reached by pure states. We show that, by contrast, there are two-qubit mixed states for which the REE for some range of a fixed negativity is higher than that for pure states. Moreover, we demonstrate that a mixture of a pure entangled state and pure separable state orthogonal to it is likely to give the maximal REE. By noting that the negativity is a measure of entanglement cost under operations preserving positivity of partial transpose, our results provide an explicit example of operations such that, even though the entanglement cost for an exact preparation is the same, the entanglement of distillation of a mixed state can exceed that of pure states. This means that the entanglement manipulation via a pure state can result in a larger entanglement loss than that via a mixed state.

arXiv:quant-ph/0409009•Physical Review A•Nov 5, 2008•31 citations

Upper bounds for relative entropy of entanglement based on active learning

Shi‐Yao Hou, Chenfeng Cao, D L Zhou +1 more

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.

arXiv:1909.02335•Quantum Science and Technology•Sep 1, 2020•6 citations

Relative Entropy of Entanglement of One Class of Two-Qubit System

Lin-Mei Liang, Ping‐Xing Chen, Cheng-Zu Li +1 more

The relative entropy of entanglement of a mixed state σ for a bipartite quantum system can be defined as the minimum of the quantum relative entropy over the set of completely disentangled states. Vedral et al. [Phys. Rev. A 57(1998)1619] have recently proposed a numerical method to obtain the relative entropy of entanglement E re for two-qubit systems. This letter shows that the convex programming method can be applied to calculate E re of two-qubit systems analytically, and discusses the conditions under which the method can be adopted.

Chinese Physics Letters•Feb 8, 2001•12 citations
We propose a practical algorithm for the calculation of the relative entropy of entanglement (REE), defined as the minimum relative entropy between a state and the set of states with positive partial transpose. Our algorithm is based on a practical semidefinite cutting plane approach. In low dimensions the implementation of the algorithm in matlab provides an estimation for the REE with an absolute error smaller than 10\ensuremath−3{10}^{\ensuremath{-}3}10\ensuremath−3.
Abstract Relative entropy of entanglement (REE) is an entanglement measure of bipartite mixed states, defined by the minimum of the relative entropy S(ρ AB ||σ AB ) between a given mixed state ρ AB and an arbitrary separable state σ AB . The REE is always bounded by the mutual information I AB = S(ρ AB ||ρ A ⊗ ρ B ) because the latter measures not only quantum entanglement but also classical correlations. In this paper we address the question of to what extent REE can be small compared to the mutual information in conformal field theories (CFTs). For this purpose, we perturbatively compute the relative entropy between the vacuum reduced density matrix ρ AB 0 on disjoint subsystems A ∪ B and arbitrarily separable state σ AB in the limit where two subsystems A and B are well separated, then minimize the relative entropy with respect to the separable states. We argue that the result highly depends on the spectrum of CFT on the subsystems. When we have a few low energy spectrum of operators as in the case where the subsystems consist of finite number of spins in spin chain models, the REE is considerably smaller than the mutual information. However in general our perturbative scheme breaks down, and the REE can be as large as the mutual information.
In the realm of quantum information theory, the detection and quantification of quantum entanglement stand as paramount tasks. The relative entropy of entanglement (REE) serves as a prominent measure of entanglement, with extensive applications spanning numerous related fields. The positive partial transpose (PPT) criterion, while providing an efficient method for the computation of REE, unfortunately, falls short when dealing with bound entanglement. In this study, we propose a method termed “pure bosonic extension” to enhance the practicability of k -bosonic extensions, which approximates the set of separable states from the “outside”, through a hierarchical structure. It enables efficient characterization of the set of k -bosonic extendible states, facilitating the derivation of accurate lower bounds for REE. Compared to the semi-definite programming (SDP) approach, such as the symmetric/bosonic extension function in QETLAB, our algorithm supports much larger dimensions and higher values of extension k . Published by the American Physical Society 2024
It is well known that for two qubits the upper bounds of the relative entropy of entanglement (REE) for a given concurrence as well as the negativity for a given concurrence are reached by pure states. We show that, by contrast, there are two-qubit mixed states for which the REE for some range of a fixed negativity is higher than that for pure states. Moreover, we demonstrate that a mixture of a pure entangled state and pure separable state orthogonal to it is likely to give the maximal REE. By noting that the negativity is a measure of entanglement cost under operations preserving positivity of partial transpose, our results provide an explicit example of operations such that, even though the entanglement cost for an exact preparation is the same, the entanglement of distillation of a mixed state can exceed that of pure states. This means that the entanglement manipulation via a pure state can result in a larger entanglement loss than that via a mixed state.
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.
The relative entropy of entanglement of a mixed state σ for a bipartite quantum system can be defined as the minimum of the quantum relative entropy over the set of completely disentangled states. Vedral et al. [Phys. Rev. A 57(1998)1619] have recently proposed a numerical method to obtain the relative entropy of entanglement E re for two-qubit systems. This letter shows that the convex programming method can be applied to calculate E re of two-qubit systems analytically, and discusses the conditions under which the method can be adopted.