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:1504.06459 · Random Matrices Theory and Application

k-Extendibility of high-dimensional bipartite quantum states

Cécilia Lancien

Published Jul 1, 2016• 11 citations
arXivHTMLPDF

Abstract

The idea of detecting the entanglement of a given bipartite state by searching for symmetric extensions of this state was first proposed by Doherty et al. The complete family of separability tests it generates, often referred to as the hierarchy of [Formula: see text]-extendibility tests, has already proved to be most promising. The goal of this paper is to try and quantify the efficiency of this separability criterion in typical scenarios. For that, we essentially take two approaches. First, we compute the average width of the set of [Formula: see text]-extendible states, in order to see how it scales with the one of separable states. And second, we characterize when random-induced states are, depending on the ancilla dimension, with high probability violating or not the [Formula: see text]-extendibility test, and compare the obtained result with the corresponding one for entanglement vs separability. The main results can be precisely phrased as follows: on [Formula: see text], when [Formula: see text] grows, the average width of the set of [Formula: see text]-extendible states is equivalent to [Formula: see text], while random states obtained as partial traces over an environment [Formula: see text] of uniformly distributed pure states are violating the [Formula: see text]-extendibility test with probability going to [Formula: see text] if [Formula: see text]. Both statements converge to the conclusion that, if [Formula: see text] is fixed, [Formula: see text]-extendibility is asymptotically a weak approximation of separability, even though any of the other well-studied separability relaxations is outperformed by [Formula: see text]-extendibility as soon as [Formula: see text] is above a certain (dimension independent) value.

DOI
10.1142/s2010326316500118

Related papers

On the equivalence of separability and extendability of quantum states

B. V. Rajarama Bhat, Kalyanapuram Rangachari Parthasarathy, Ritabrata Sengupta

Motivated by the notions of [Formula: see text]-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al. [Complete family of separability criteria, Phys. Rev. A 69 (2004) 022308], we introduce parallel definitions in the context of Gaussian states and using only properties of their covariance matrices, derive necessary and sufficient conditions for their complete extendability. It turns out that the complete extendability property is equivalent to the separability property of a bipartite Gaussian state. Following the proof of quantum de Finetti theorem as outlined in Hudson and Moody [Locally normal symmetric states and an analogue of de Finetti’s theorem, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 33(4) (1975/76) 343–351], we show that separability is equivalent to complete extendability for a state in a bipartite Hilbert space where at least one of which is of dimension greater than 2. This, in particular, extends the result of Fannes, Lewis, and Verbeure [Symmetric states of composite systems, Lett. Math. Phys. 15(3) (1988) 255–260] to the case of an infinite dimensional Hilbert space whose C* algebra of all bounded operators is not separable.

arXiv:1601.02365•Reviews in Mathematical Physics•Mar 20, 2017•12 citations

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

Complete family of separability criteria

Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri

We introduce a family of separability criteria that are based on the existence of extensions of a bipartite quantum state \ensuremath{\rho} to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the nonexistence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program. Whenever an extension does not exist, the dual optimization constructs an explicit entanglement witness for the particular state. These separability tests can be ordered in a hierarchical structure whose first step corresponds to the well-known positive partial transpose (Peres-Horodecki) criterion, and each test in the hierarchy is at least as powerful as the preceding one. This hierarchy is complete, in the sense that any entangled state is guaranteed to fail a test at some finite point in the hierarchy, thus showing it is entangled. The entanglement witnesses corresponding to each step of the hierarchy have well-defined and very interesting algebraic properties that, in turn, allow for a characterization of the interior of the set of positive maps. Coupled with some recent results on the computational complexity of the separability problem, which has been shown to be NP hard, this hierarchy of tests gives a complete and also computationally and theoretically appealing characterization of mixed bipartite entangled states.

arXiv:quant-ph/0308032•Physical Review A•Feb 18, 2004•467 citations

Moment-based PPT criteria for random bipartite states

Cécilia Lancien, Kieran McShane

Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on $\mathbb C^d\otimes\mathbb C^d$, obtained as the marginal over an environment $\mathbb C^s$ of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level $m\in\mathbb N$ in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension $s=λ_md^2$ at which the behavior of the associated random state switches from violating to satisfying it, with probability going to $1$ as $d$ grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension $d$ is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.

quant-pharXiv:2607.11369•Jul 14, 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•41 citations

Entanglement witness criteria of strong-k-separability for multipartite quantum states

Siqing Yan, Jinchuan Hou

Quantum Information Processing•Jun 11, 2018•1 citation
The idea of detecting the entanglement of a given bipartite state by searching for symmetric extensions of this state was first proposed by Doherty et al. The complete family of separability tests it generates, often referred to as the hierarchy of [Formula: see text]-extendibility tests, has already proved to be most promising. The goal of this paper is to try and quantify the efficiency of this separability criterion in typical scenarios. For that, we essentially take two approaches. First, we compute the average width of the set of [Formula: see text]-extendible states, in order to see how it scales with the one of separable states. And second, we characterize when random-induced states are, depending on the ancilla dimension, with high probability violating or not the [Formula: see text]-extendibility test, and compare the obtained result with the corresponding one for entanglement vs separability. The main results can be precisely phrased as follows: on [Formula: see text], when [Formula: see text] grows, the average width of the set of [Formula: see text]-extendible states is equivalent to [Formula: see text], while random states obtained as partial traces over an environment [Formula: see text] of uniformly distributed pure states are violating the [Formula: see text]-extendibility test with probability going to [Formula: see text] if [Formula: see text]. Both statements converge to the conclusion that, if [Formula: see text] is fixed, [Formula: see text]-extendibility is asymptotically a weak approximation of separability, even though any of the other well-studied separability relaxations is outperformed by [Formula: see text]-extendibility as soon as [Formula: see text] is above a certain (dimension independent) value.
Motivated by the notions of [Formula: see text]-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al. [Complete family of separability criteria, Phys. Rev. A 69 (2004) 022308], we introduce parallel definitions in the context of Gaussian states and using only properties of their covariance matrices, derive necessary and sufficient conditions for their complete extendability. It turns out that the complete extendability property is equivalent to the separability property of a bipartite Gaussian state. Following the proof of quantum de Finetti theorem as outlined in Hudson and Moody [Locally normal symmetric states and an analogue of de Finetti’s theorem, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 33(4) (1975/76) 343–351], we show that separability is equivalent to complete extendability for a state in a bipartite Hilbert space where at least one of which is of dimension greater than 2. This, in particular, extends the result of Fannes, Lewis, and Verbeure [Symmetric states of composite systems, Lett. Math. Phys. 15(3) (1988) 255–260] to the case of an infinite dimensional Hilbert space whose C* algebra of all bounded operators is not separable.
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 introduce a family of separability criteria that are based on the existence of extensions of a bipartite quantum state \ensuremath{\rho} to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the nonexistence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program. Whenever an extension does not exist, the dual optimization constructs an explicit entanglement witness for the particular state. These separability tests can be ordered in a hierarchical structure whose first step corresponds to the well-known positive partial transpose (Peres-Horodecki) criterion, and each test in the hierarchy is at least as powerful as the preceding one. This hierarchy is complete, in the sense that any entangled state is guaranteed to fail a test at some finite point in the hierarchy, thus showing it is entangled. The entanglement witnesses corresponding to each step of the hierarchy have well-defined and very interesting algebraic properties that, in turn, allow for a characterization of the interior of the set of positive maps. Coupled with some recent results on the computational complexity of the separability problem, which has been shown to be NP hard, this hierarchy of tests gives a complete and also computationally and theoretically appealing characterization of mixed bipartite entangled states.
Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd, obtained as the marginal over an environment Cs\mathbb C^sCs of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level m∈Nm\in\mathbb Nm∈N in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension s=λmd2s=λ_md^2s=λm​d2 at which the behavior of the associated random state switches from violating to satisfying it, with probability going to 111 as ddd grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension ddd is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.
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.