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

Refuting the X-MEMS closest-separable-state conjecture in arXiv:2209.01430v2, Appendix A, Eq. (A11)

Haobo Ma, Wenlin Zhang

Published Nov 3, 2026• 0 citations
Publisher

Abstract

We refute the closest-fully-separable-state shape conjecture of Consiglio, Apollaro and Wieśniak, arXiv:2209.01430v2, Appendix A, Eq. (A11), already for three qubits on the low branch at gamma = 11/112. Every fully separable state of the proposed shape has squared Hilbert–Schmidt distance at least 109/23520, whereas an explicit mixture of ten pure product states has distance 417965512477/90316800000000. The counterexample and exact restricted minimum have self-contained written proofs, as do related counterexamples to the full-separability and concurrence comparisons in the posing source. An elementary bound also establishes its large-qubit limit without the conjectured shape.

DOI
10.5281/zenodo.23904463

Related papers

On the geometry of entangled states

Frank Verstraete, Jeroen Dehaene, Bart De Moor

The basic question that is addressed in this paper is finding the closest separable state for a given entangled state, measured with the Hilbert-Schmidt distance. While this problem is in general very difficult, we show that the following strongly related problem can be solved: find the Hilbert-Schmidt distance of an entangled state to the set of all partially transposed states. We prove that this latter distance can be expressed as a function of the negative eigenvalues of the partial transpose of the entangled state, and show how it is related to the distance of a state to the set of positive, partially transposed (PPT) states. We illustrate this by calculating the closest biseparable state to the W state and give a simple and very general proof for the fact that the set of W-type states is not of measure zero. Next we show that all surfaces with states whose partial transposes have constant minimal negative eigenvalue are similar to the boundary of PPT states. We illustrate this with some examples on bipartite qubit states, where contours of constant negativity are plotted on two-dimensional intersections of the complete state space.

arXiv:quant-ph/0107155•Journal of Modern Optics•Jul 1, 2002•75 citations

Closest separable state when measured by a quasi-relative entropy

Anna Vershynina

Abstract It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask the same question for a quasi-relative entropy of entanglement, which is an entanglement measure defined as the minimum distance to the set of separable state, when the distance is measured by the quasi-relative entropy. First, we consider a maximally entangled state, and show that the closest separable state is the same for any quasi-relative entropy as for the relative entropy of entanglement. Then, we show that this also holds for a certain class of functions and any pure state. And at last, we consider any pure state on two qubit systems and a large class of operator convex function. For these, we find the closest separable state, which may not be the same one as for the relative entropy of entanglement.

arXiv:2009.04982•Journal of Physics A Mathematical and Theoretical•Jan 28, 2021•1 citation

Building separable approximations for quantum states via neural networks

Antoine Girardin, Nicolas Brunner, Tamás Kriváchy

Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the method on a variety of well-known classes of bipartite states and find excellent agreement, even up to local dimension of $d=10$, while providing conjectures and analytic insight for isotropic and Werner states. Moreover, we show our method to be efficient in the multipartite case, considering different notions of separability. Examining three- and four-party GHZ and W states, we recover known bounds and obtain additional ones, for instance, for triseparability.

arXiv:2112.08055•Physical Review Research•Jun 24, 2022•31 citations

A counterexample to the Shannon conjecture following Eq. (69) in Tarabunga et al., Section V.C

Haobo Ma, Wenlin Zhang

The Shannon conjecture following Eq. (69) in Section V.C of Tarabunga et al., arXiv:2411.05766v1, is false. An explicit three-qubit state has stabilizer-basis entropy log 4, whereas the proposed absolute-amplitude lower bound is log 16 - (9/8) log 3 > log 4. The same construction refutes the bound for nonnegative amplitudes, and continuity gives strictly positive examples. It extends to every N >= 3 and to a range of Renyi indices containing one. The collision entropy of the comparison distribution remains a valid Shannon lower bound for arbitrary affine supports. For amplitudes of constant modulus on each affine coset, the original bound holds at every Renyi index; this includes the source's Figure 1 product states.

•Nov 3, 2026•0 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

Symmetric Halves of the 8/33-Probability that the Joint State of Two Quantum Bits is Disentangled

Paul B. Slater

Compelling evidence-though yet no formal proof--has been adduced that the probability that a generic two-qubit state ($ρ$) is separable is $\frac{8}{33}$ (arXiv:1301.6617, arXiv:1109.2560, arXiv:0704.3723). Proceeding in related analytical frameworks, using a further determinantal moment formula of C. Dunkl (Appendix), we reach the conclusion that one-half of this probability arises when the determinantal inequality $|ρ^{PT}|>|ρ|$, where $PT$ denotes the partial transpose, is satisfied, and, the other half, when $|ρ|>|ρ^{PT}|$. These probabilities are taken with respect to the flat, Hilbert-Schmidt measure on the fifteen-dimensional convex set of $4 \times 4$ density matrices. We find fully parallel bisection/equipartition results for the previously adduced, as well, two-"re[al]bit" and two-"quater[nionic]bit"separability probabilities of $\frac{29}{64}$ and $\frac{26}{323}$, respectively. The computational results reported lend strong support to those obtained earlier--including the "concise formula" that yields them--most conspicuously amongst those findings being the $\frac{29}{64}, \frac{8}{33}$ and $\frac{26}{323}$ probabilities noted.

arXiv:1403.1825•Mar 7, 2014•0 citations
We refute the closest-fully-separable-state shape conjecture of Consiglio, Apollaro and Wieśniak, arXiv:2209.01430v2, Appendix A, Eq. (A11), already for three qubits on the low branch at gamma = 11/112. Every fully separable state of the proposed shape has squared Hilbert–Schmidt distance at least 109/23520, whereas an explicit mixture of ten pure product states has distance 417965512477/90316800000000. The counterexample and exact restricted minimum have self-contained written proofs, as do related counterexamples to the full-separability and concurrence comparisons in the posing source. An elementary bound also establishes its large-qubit limit without the conjectured shape.
The basic question that is addressed in this paper is finding the closest separable state for a given entangled state, measured with the Hilbert-Schmidt distance. While this problem is in general very difficult, we show that the following strongly related problem can be solved: find the Hilbert-Schmidt distance of an entangled state to the set of all partially transposed states. We prove that this latter distance can be expressed as a function of the negative eigenvalues of the partial transpose of the entangled state, and show how it is related to the distance of a state to the set of positive, partially transposed (PPT) states. We illustrate this by calculating the closest biseparable state to the W state and give a simple and very general proof for the fact that the set of W-type states is not of measure zero. Next we show that all surfaces with states whose partial transposes have constant minimal negative eigenvalue are similar to the boundary of PPT states. We illustrate this with some examples on bipartite qubit states, where contours of constant negativity are plotted on two-dimensional intersections of the complete state space.
Abstract It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask the same question for a quasi-relative entropy of entanglement, which is an entanglement measure defined as the minimum distance to the set of separable state, when the distance is measured by the quasi-relative entropy. First, we consider a maximally entangled state, and show that the closest separable state is the same for any quasi-relative entropy as for the relative entropy of entanglement. Then, we show that this also holds for a certain class of functions and any pure state. And at last, we consider any pure state on two qubit systems and a large class of operator convex function. For these, we find the closest separable state, which may not be the same one as for the relative entropy of entanglement.
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the method on a variety of well-known classes of bipartite states and find excellent agreement, even up to local dimension of d=10d=10d=10, while providing conjectures and analytic insight for isotropic and Werner states. Moreover, we show our method to be efficient in the multipartite case, considering different notions of separability. Examining three- and four-party GHZ and W states, we recover known bounds and obtain additional ones, for instance, for triseparability.
The Shannon conjecture following Eq. (69) in Section V.C of Tarabunga et al., arXiv:2411.05766v1, is false. An explicit three-qubit state has stabilizer-basis entropy log 4, whereas the proposed absolute-amplitude lower bound is log 16 - (9/8) log 3 > log 4. The same construction refutes the bound for nonnegative amplitudes, and continuity gives strictly positive examples. It extends to every N >= 3 and to a range of Renyi indices containing one. The collision entropy of the comparison distribution remains a valid Shannon lower bound for arbitrary affine supports. For amplitudes of constant modulus on each affine coset, the original bound holds at every Renyi index; this includes the source's Figure 1 product states.
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.
Compelling evidence-though yet no formal proof--has been adduced that the probability that a generic two-qubit state (ρρρ) is separable is 833\frac{8}{33}338​ (arXiv:1301.6617, arXiv:1109.2560, arXiv:0704.3723). Proceeding in related analytical frameworks, using a further determinantal moment formula of C. Dunkl (Appendix), we reach the conclusion that one-half of this probability arises when the determinantal inequality ∣ρPT∣>∣ρ∣|ρ^{PT}|>|ρ|∣ρPT∣>∣ρ∣, where PTPTPT denotes the partial transpose, is satisfied, and, the other half, when ∣ρ∣>∣ρPT∣|ρ|>|ρ^{PT}|∣ρ∣>∣ρPT∣. These probabilities are taken with respect to the flat, Hilbert-Schmidt measure on the fifteen-dimensional convex set of 4×44 \times 44×4 density matrices. We find fully parallel bisection/equipartition results for the previously adduced, as well, two-"re[al]bit" and two-"quater[nionic]bit"separability probabilities of 2964\frac{29}{64}6429​ and 26323\frac{26}{323}32326​, respectively. The computational results reported lend strong support to those obtained earlier--including the "concise formula" that yields them--most conspicuously amongst those findings being the 2964,833\frac{29}{64}, \frac{8}{33}6429​,338​ and 26323\frac{26}{323}32326​ probabilities noted.