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

Optimal Ensemble Length of Mixed Separable States

Robert B. Lockhart

Published Aug 17, 1999• 14 citations
OpenAlex

Abstract

The optimal (pure state) ensemble length of a separable state, A, is the minimum number of (pure) product states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest, the lower bounds are sharp. A consequence of our results is that for all two particle systems, except possibly those with a qubit and those with a nine dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with each particle having the same Hilbert space, with probablity 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system with p qubits with probability 1 it is greater than 2 2p /(1 + 2p), which is almost the maximal rank squared. 1

Related papers

Optimal ensemble length of mixed separable states

Robert Lockhart

The optimal (pure state) ensemble length of a separable state A is the minimum number of (pure) states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest the lower bounds are sharp. A consequence of our results is that for all two-particle systems, except possibly those with one qubit or those with a nine-dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with probabilty 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system of p qubits with probability 1 it is greater than 22p/(1+2p), i.e., almost the square of the rank.

arXiv:quant-ph/9908050•Journal of Mathematical Physics•Oct 1, 2000•18 citations

Optimal decompositions of barely separable states

David Peter Divincenzo, Barbara M. Terhal, Ashish V. Thapliyal

Two families of bipartite mixed quantum states are studied for which it is proved that the number of members in the optimal-decomposition ensemble—the ensemble realizing the entanglement of formation—is greater than the rank of the mixed state. We find examples for which the number of states in this optimal ensemble can be larger than the rank by an arbitrarily large factor. In one case the proof relies on the fact that the partial transpose of the mixed state has zero eigenvalues; in the other case the result arises from the properties of product bases that are completable only by embedding in a larger Hilbert space.

arXiv:quant-ph/9904005•Journal of Modern Optics•Feb 1, 2000•37 citations

Length filtration of the separable states

Lin Chen, Dragomir Ž. Djoković

We investigate the separable states ρ of an arbitrary multi-partite quantum system with Hilbert space H of dimension d . The length L ( ρ ) of ρ is defined as the smallest number of pure product states having ρ as their mixture. The length filtration of the set of separable states, S , is the increasing chain ∅ ⊊ S 1 ′ ⊆ S 2 ′ ⊆ ⋯ , where S i ′ = { ρ ∈ S : L ( ρ ) ≤ i } . We define the maximum length, L max = max ρ ∈ S L ( ρ ) , critical length, L crit , and yet another special length, L c , which was defined by a simple formula in one of our previous papers. The critical length indicates the first term in the length filtration whose dimension is equal to Dim S . We show that in general d ≤ L c ≤ L crit ≤ L max ≤ d 2 . We conjecture that the equality L crit = L c holds for all finite-dimensional multi-partite quantum systems. Our main result is that L crit = L c for the bipartite systems having a single qubit as one of the parties. This is accomplished by computing the rank of the Jacobian matrix of a suitable map having S as its range.

arXiv:1602.05278•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 1, 2016•2 citations

Separable decompositions of 2xn states with operator Schmidt rank three

Perrine Vantalon, Nicolas Macris

We prove that every bipartite state $ρ$ of a qubit coupled to an $n$-level system whose operator Schmidt rank equals three can be written as a mixture of $\text{rank}(ρ)$ pure product states, and as a mixture of at most $n+1$ mixed product states in general. The second result is tight in the sense that there exist states that cannot be decomposed with a smaller number of terms. Our proof gives constructive methods to obtain the decompositions. It involves eigendecompositions of suitable unitary dilations of an operator explicitly determined by the state. Our framework recovers previously known results for the length of decompositions into pure product states and is also able to deal with decompositions into mixed states. For pure product states, our decomposition is different from existing ones.

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

Tensor products of convex sets and the volume of separable states on N qudits

Guillaume Aubrun, Stanisław J. Szarek

This paper deals with estimating the volume of the set of separable mixed quantum states when the dimension of the state space grows to infinity. This has been studied recently for qubits; here we consider larger particles and conclude that, in all cases, the proportion of the states that are separable is superexponentially small in the dimension of the set. We also show that the partial transpose criterion becomes imprecise when the dimension increases, and that the lower bound ${6}^{\ensuremath{-}N∕2}$ on the (Hilbert-Schmidt) inradius of the set of separable states on $N$ qubits obtained recently by Gurvits and Barnum is essentially optimal. We employ standard tools of classical convexity, high-dimensional probability, and geometry of Banach spaces. One relatively nonstandard point is a formal introduction of the concept of projective tensor products of convex bodies, and an initial study of this concept.

arXiv:quant-ph/0503221•Physical Review A•Feb 14, 2006•75 citations

Randomized truncation of quantum states

Aram W. Harrow, Angus Lowe, Freek Witteveen

A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward, and maximizes the fidelity: keep the largest entries or singular values. On the other hand, random mixtures of sparse states can achieve quadratically improved trace distances, and yield nontrivial bounds on other distance measures like the robustness. In this work, we give efficient algorithms for finding mixtures of sparse states that optimally approximate a given pure state in either trace distance or robustness. These algorithms also yield descriptions of efficiently samplable ensembles of sparse, or less-entangled, states that correspond to these optimal mixed approximations. This can be used for the truncation step of algorithms for matrix product states, improving their accuracy while using no extra memory and no asymptotic increase in runtime, and we demonstrate this improvement numerically. Our proofs rely on tools from convex optimization and zero-sum games, as well as rigorous gurarantees for computing and sampling from maximum-entropy distributions. In particular, a key step in our construction is conditional Poisson sampling, which is the well-studied problem of drawing fixed-size subsets from a population with known inclusion probabilities. We give improved algorithms for carrying out this sampling, which may be of independent interest.

arXiv:2510.08518•Oct 9, 2025•6 citations
The optimal (pure state) ensemble length of a separable state, A, is the minimum number of (pure) product states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest, the lower bounds are sharp. A consequence of our results is that for all two particle systems, except possibly those with a qubit and those with a nine dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with each particle having the same Hilbert space, with probablity 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system with p qubits with probability 1 it is greater than 2 2p /(1 + 2p), which is almost the maximal rank squared. 1
The optimal (pure state) ensemble length of a separable state A is the minimum number of (pure) states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest the lower bounds are sharp. A consequence of our results is that for all two-particle systems, except possibly those with one qubit or those with a nine-dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with probabilty 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system of p qubits with probability 1 it is greater than 22p/(1+2p), i.e., almost the square of the rank.
Two families of bipartite mixed quantum states are studied for which it is proved that the number of members in the optimal-decomposition ensemble—the ensemble realizing the entanglement of formation—is greater than the rank of the mixed state. We find examples for which the number of states in this optimal ensemble can be larger than the rank by an arbitrarily large factor. In one case the proof relies on the fact that the partial transpose of the mixed state has zero eigenvalues; in the other case the result arises from the properties of product bases that are completable only by embedding in a larger Hilbert space.
We investigate the separable states ρ of an arbitrary multi-partite quantum system with Hilbert space H of dimension d . The length L ( ρ ) of ρ is defined as the smallest number of pure product states having ρ as their mixture. The length filtration of the set of separable states, S , is the increasing chain ∅ ⊊ S 1 ′ ⊆ S 2 ′ ⊆ ⋯ , where S i ′ = { ρ ∈ S : L ( ρ ) ≤ i } . We define the maximum length, L max = max ρ ∈ S L ( ρ ) , critical length, L crit , and yet another special length, L c , which was defined by a simple formula in one of our previous papers. The critical length indicates the first term in the length filtration whose dimension is equal to Dim S . We show that in general d ≤ L c ≤ L crit ≤ L max ≤ d 2 . We conjecture that the equality L crit = L c holds for all finite-dimensional multi-partite quantum systems. Our main result is that L crit = L c for the bipartite systems having a single qubit as one of the parties. This is accomplished by computing the rank of the Jacobian matrix of a suitable map having S as its range.
We prove that every bipartite state ρρρ of a qubit coupled to an nnn-level system whose operator Schmidt rank equals three can be written as a mixture of rank(ρ)\text{rank}(ρ)rank(ρ) pure product states, and as a mixture of at most n+1n+1n+1 mixed product states in general. The second result is tight in the sense that there exist states that cannot be decomposed with a smaller number of terms. Our proof gives constructive methods to obtain the decompositions. It involves eigendecompositions of suitable unitary dilations of an operator explicitly determined by the state. Our framework recovers previously known results for the length of decompositions into pure product states and is also able to deal with decompositions into mixed states. For pure product states, our decomposition is different from existing ones.
This paper deals with estimating the volume of the set of separable mixed quantum states when the dimension of the state space grows to infinity. This has been studied recently for qubits; here we consider larger particles and conclude that, in all cases, the proportion of the states that are separable is superexponentially small in the dimension of the set. We also show that the partial transpose criterion becomes imprecise when the dimension increases, and that the lower bound ${6}^{\ensuremath{-}N∕2}$ on the (Hilbert-Schmidt) inradius of the set of separable states on NNN qubits obtained recently by Gurvits and Barnum is essentially optimal. We employ standard tools of classical convexity, high-dimensional probability, and geometry of Banach spaces. One relatively nonstandard point is a formal introduction of the concept of projective tensor products of convex bodies, and an initial study of this concept.
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward, and maximizes the fidelity: keep the largest entries or singular values. On the other hand, random mixtures of sparse states can achieve quadratically improved trace distances, and yield nontrivial bounds on other distance measures like the robustness. In this work, we give efficient algorithms for finding mixtures of sparse states that optimally approximate a given pure state in either trace distance or robustness. These algorithms also yield descriptions of efficiently samplable ensembles of sparse, or less-entangled, states that correspond to these optimal mixed approximations. This can be used for the truncation step of algorithms for matrix product states, improving their accuracy while using no extra memory and no asymptotic increase in runtime, and we demonstrate this improvement numerically. Our proofs rely on tools from convex optimization and zero-sum games, as well as rigorous gurarantees for computing and sampling from maximum-entropy distributions. In particular, a key step in our construction is conditional Poisson sampling, which is the well-studied problem of drawing fixed-size subsets from a population with known inclusion probabilities. We give improved algorithms for carrying out this sampling, which may be of independent interest.