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

arXiv:2209.10934 · Physical Review Research

Detecting entanglement by pure bosonic extension

Xuanran Zhu, Chao Zhang, Chenfeng Cao, Youning Li, Yiu‐Tung Poon, Bei Zeng

Published Mar 7, 2024• 0 citations
arXivHTMLPDF

Abstract

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

DOI
10.1103/physrevresearch.6.013249

Related papers

Power of symmetric extensions for entanglement detection

Miguel Navascués, Masaki Owari, Martin Bodo Plenio

In this paper, we present progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order $O(1/N)$ is sufficient and, in general, necessary to destroy the entanglement of any state admitting an $N$ Bose-symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from $N$ Bose-symmetric extensions with positive partial transpose (PPT) decreases at least as fast as $O(1/{N}^{2})$. From these results, we derive upper bounds on the time and space complexity of the weak membership problem of separability when attacked via algorithms that search for PPT-symmetric extensions. Finally, we show how to estimate the error we incur when we approximate the set of separable states by the set of (PPT) $N$-extendable quantum states in order to compute the maximum average fidelity in pure state estimation problems, the maximal output purity of quantum channels, and the geometric measure of entanglement.

arXiv:0906.2731•Physical Review A•Nov 6, 2009•89 citations

Numerical estimation of the relative entropy of entanglement

Yuriy Zinchenko, Shmuel Friedland, Gilad Gour

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}$.

Physical Review A•Nov 29, 2010•33 citations

Entanglement Benchmarking in Quantum Simulations of Spin Systems

Anshumitra Baul, Phillip C. Lotshaw

We simulate quantum spin systems and measure entanglement using circuits tailored for near-term quantum computers. Traditional tools like entanglement entropy are limited to pure states and require full state tomography, making them impractical on current hardware. Instead, we employ the novel approach, Positive Partial Transpose (PPT) criterion to efficiently detect pairwise entanglement from two-spin reduced density matrices, applicable to both pure and mixed states. This method enables scalable entanglement detection, providing a practical route to study quantum correlations, phase transitions, and benchmark quantum devices.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

Entanglement Quantification via Symmetric Extensions: A Resource Theory Hierarchy

Enmin Shao, Lin Chen, Huixia He

We introduce a hierarchy of entanglement measures Ek based on k-symmetric PPT extensions. Each Ek, defined via a minimal eigenvalue shift and computed by semidefinite programming, is faithful, convex, and monotone under free operations. The hierarchy strictly refines PPT-robustness at k = 1, detects bound entanglement at k = 2, and converges exactly to the separability measure as k -> infinity. Numerical experiments on Horodecki, Werner, UPB, and random states demonstrate practical scalability. Our framework unifies computational efficiency with operational fidelity in a single tunable family -- a combination previously believed to be fundamentally incompatible in entanglement quantification. It supplies, for the first time, a systematically improvable resource-theoretic yardstick that accounts for all entangled states, including the bound entangled ones that have long resisted quantitative treatment.

quant-pharXiv:2607.16960•Jul 21, 2026•0 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

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations
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
In this paper, we present progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N)O(1/N)O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state admitting an NNN Bose-symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from NNN Bose-symmetric extensions with positive partial transpose (PPT) decreases at least as fast as O(1/N2)O(1/{N}^{2})O(1/N2). From these results, we derive upper bounds on the time and space complexity of the weak membership problem of separability when attacked via algorithms that search for PPT-symmetric extensions. Finally, we show how to estimate the error we incur when we approximate the set of separable states by the set of (PPT) NNN-extendable quantum states in order to compute the maximum average fidelity in pure state estimation problems, the maximal output purity of quantum channels, and the geometric measure of entanglement.
We simulate quantum spin systems and measure entanglement using circuits tailored for near-term quantum computers. Traditional tools like entanglement entropy are limited to pure states and require full state tomography, making them impractical on current hardware. Instead, we employ the novel approach, Positive Partial Transpose (PPT) criterion to efficiently detect pairwise entanglement from two-spin reduced density matrices, applicable to both pure and mixed states. This method enables scalable entanglement detection, providing a practical route to study quantum correlations, phase transitions, and benchmark quantum devices.
We introduce a hierarchy of entanglement measures Ek based on k-symmetric PPT extensions. Each Ek, defined via a minimal eigenvalue shift and computed by semidefinite programming, is faithful, convex, and monotone under free operations. The hierarchy strictly refines PPT-robustness at k = 1, detects bound entanglement at k = 2, and converges exactly to the separability measure as k -> infinity. Numerical experiments on Horodecki, Werner, UPB, and random states demonstrate practical scalability. Our framework unifies computational efficiency with operational fidelity in a single tunable family -- a combination previously believed to be fundamentally incompatible in entanglement quantification. It supplies, for the first time, a systematically improvable resource-theoretic yardstick that accounts for all entangled states, including the bound entangled ones that have long resisted quantitative treatment.
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 main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.