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:1609.01698 · Physical Review A

Quantitative bound entanglement in two-qutrit states

Gael Sentís, Christopher Eltschka, Jens Siewert

Published Aug 31, 2016• 12 citations
arXivHTMLPDF

Abstract

Among the many facets of quantum correlations, bound entanglement has remained one the most enigmatic phenomena, despite the fact that it was discovered in the early days of quantum information. Even its detection has proven to be difficult, let alone its precise quantitative characterization. In this work, we present the exact quantification of entanglement for a two-parameter family of highly symmetric two-qutrit mixed states, which contains a sizable part of bound entangled states. We achieve this by explicitly calculating the convex-roof extensions of the linear entropy as well as the concurrence for every state within the family. Our results provide a benchmark for future quantitative studies of bipartite entanglement in higher-dimensional systems.

DOI
10.1103/physreva.94.020302

Related papers

Geometric Characterization and Feasible Region Analysis of Bipartite Qutrit Bound Entanglement

Mazhar Ali

We characterize bound entanglement in bipartite qutrit systems by combining the Positive Partial Transpose (PPT) criterion with a structural, non-completely positive map. Focusing on a comprehensive three-parameter bipartite qutrit family $ρ_{a,b,c}$, we present an exact analytical and geometric partitioning of the physical state space simplex. We derive the closed-form quadratic boundary governing the leaf-like PPT region $(a^2+ab+b^2-b \leq 0)$ over the domain $0 < a \leq \frac{1}{3}$, and identify the exact linear threshold $(a > c)$ that characterizes the PPT bound entangled sub-region. This family strictly generalizes the well-known Horodecki bound entangled states, which appear as a single slice of the three-dimensional leaf. Applying the structural map to this decomposition, we show that it certifies bound entanglement throughout the entire threshold region, accounting for $14.76\%$ of the total PPT leaf area.

quant-pharXiv:2609.39141•Oct 1, 2026•0 citations

Quantifying Entanglement of Maximal Dimension in Bipartite Mixed States

Gael Sentís, Christopher Eltschka, Otfried Gühne +2 more

The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is important both from a theoretical and a practical point of view, it is considerably more difficult, and methods beyond estimates for the concurrence are elusive. In particular this holds for a quantitative assessment of the most valuable resource, the forms of entanglement that can only exist in high-dimensional systems. We derive a framework for lower bounding the appropriate measure of entanglement, the so-called G-concurrence, through few local measurements. Moreover, we show that these bounds have relevant applications also for multipartite states.

arXiv:1605.09783•Physical Review Letters•Nov 4, 2016•25 citations

Bounds on the entanglement of two-qutrit systems from fixed marginals

Giuseppe Baio, Dariusz Chruściński, Paweł Horodecki +2 more

We discuss the problem of characterizing upper bounds on entanglement in a bipartite quantum system when only the reduced density matrices (marginals) are known. In particular, starting from the known two-qubit case, we propose a family of candidates for maximally entangled mixed states with respect to fixed marginals for two qutrits. These states are extremal in the convex set of two-qutrit states with fixed marginals. Moreover, it is shown that they are always quasidistillable. As a by-product we prove that any maximally correlated state that is quasidistillable must be pure. Our observations for two qutrits are supported by numerical analysis.

arXiv:1904.07650•Physical Review A•Jun 11, 2019•5 citations

Separability criteria and lower bounds of entanglement via realignment

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.

quant-pharXiv:2610.15664•Oct 13, 2026•0 citations

Free versus bound entanglement, a NP-hard problem tackled by machine learning

Beatrix C. Hiesmayr

Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.

arXiv:2106.03977•Scientific Reports•Oct 5, 2021•35 citations

Two-parameter bipartite entanglement measure

Chen-Ming Bai, Yu Luo

Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified $(q,s)$-concurrence. Both the standard entanglement concurrence and the recently proposed $q$-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified $(q,s)$-concurrence in the cases of isotropic and Werner states under the constraint $q>1$ and $qs\geq 1$. Furthermore, we explore the monogamy properties of the unified $(q,s)$-concurrence for $q\geq 2$, $0\leq s\leq 1$ and $1\leq qs\leq 3$, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified $(q,s)$-concurrence with $q\geq 1$ and $qs\geq 1$, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.

quant-pharXiv:2601.22568•Feb 2, 2026•0 citations
Among the many facets of quantum correlations, bound entanglement has remained one the most enigmatic phenomena, despite the fact that it was discovered in the early days of quantum information. Even its detection has proven to be difficult, let alone its precise quantitative characterization. In this work, we present the exact quantification of entanglement for a two-parameter family of highly symmetric two-qutrit mixed states, which contains a sizable part of bound entangled states. We achieve this by explicitly calculating the convex-roof extensions of the linear entropy as well as the concurrence for every state within the family. Our results provide a benchmark for future quantitative studies of bipartite entanglement in higher-dimensional systems.
We characterize bound entanglement in bipartite qutrit systems by combining the Positive Partial Transpose (PPT) criterion with a structural, non-completely positive map. Focusing on a comprehensive three-parameter bipartite qutrit family ρa,b,cρ_{a,b,c}ρa,b,c​, we present an exact analytical and geometric partitioning of the physical state space simplex. We derive the closed-form quadratic boundary governing the leaf-like PPT region (a2+ab+b2−b≤0)(a^2+ab+b^2-b \leq 0)(a2+ab+b2−b≤0) over the domain 0<a≤130 < a \leq \frac{1}{3}0<a≤31​, and identify the exact linear threshold (a>c)(a > c)(a>c) that characterizes the PPT bound entangled sub-region. This family strictly generalizes the well-known Horodecki bound entangled states, which appear as a single slice of the three-dimensional leaf. Applying the structural map to this decomposition, we show that it certifies bound entanglement throughout the entire threshold region, accounting for 14.76%14.76\%14.76% of the total PPT leaf area.
The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is important both from a theoretical and a practical point of view, it is considerably more difficult, and methods beyond estimates for the concurrence are elusive. In particular this holds for a quantitative assessment of the most valuable resource, the forms of entanglement that can only exist in high-dimensional systems. We derive a framework for lower bounding the appropriate measure of entanglement, the so-called G-concurrence, through few local measurements. Moreover, we show that these bounds have relevant applications also for multipartite states.
We discuss the problem of characterizing upper bounds on entanglement in a bipartite quantum system when only the reduced density matrices (marginals) are known. In particular, starting from the known two-qubit case, we propose a family of candidates for maximally entangled mixed states with respect to fixed marginals for two qutrits. These states are extremal in the convex set of two-qutrit states with fixed marginals. Moreover, it is shown that they are always quasidistillable. As a by-product we prove that any maximally correlated state that is quasidistillable must be pure. Our observations for two qutrits are supported by numerical analysis.
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified (q,s)(q,s)(q,s)-concurrence. Both the standard entanglement concurrence and the recently proposed qqq-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified (q,s)(q,s)(q,s)-concurrence in the cases of isotropic and Werner states under the constraint q>1q>1q>1 and qs≥1qs\geq 1qs≥1. Furthermore, we explore the monogamy properties of the unified (q,s)(q,s)(q,s)-concurrence for q≥2q\geq 2q≥2, 0≤s≤10\leq s\leq 10≤s≤1 and 1≤qs≤31\leq qs\leq 31≤qs≤3, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified (q,s)(q,s)(q,s)-concurrence with q≥1q\geq 1q≥1 and qs≥1qs\geq 1qs≥1, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.