Threshold entanglement sharing: quantum states with absolutely separable marginals
Pith reviewed 2026-05-10 14:43 UTC · model grok-4.3
The pith
Threshold entanglement states exist for 4 and 7 qubits but not 8, with SDP-derived bounds showing they must carry substantial average entanglement and magic.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
TE states exist for four and seven qubits; TE states of eight qubits cannot exist; the SDP relaxations improve the best known bounds on minimal purity of pure-state marginals and maximal purity of mixed absolutely separable states.
Load-bearing premise
The SDP relaxations used to bound purity are sufficiently tight to decide existence or non-existence of TE states for the qubit numbers considered; the numerical evidence for significant entanglement and magic is representative of the actual states.
read the original abstract
Motivated to understand how entanglement resources can be distributed in quantum networks, we introduce threshold entanglement (TE) states. These are multipartite quantum states whose entanglement across bipartitions forces all marginals of half or less local systems to be (absolutely) separable. First, in contrast to states used for quantum secret sharing, we demonstrate that TE states exist for four and seven qubits. Second, between four and nine qubits, we delimit the average entanglement that TE states must have by combining two semidefinite programming relaxations: (i) lower bounds on the minimal purity of pure state marginals, and (ii) upper bounds on the maximal purity of mixed absolutely separable states. Besides delimiting the existence regions of TE states, our approach independently improves the best known bounds on both of the above problems. Moreover, these improved bounds show that TE states of eight qubits cannot exist. Numerical evidence suggests that TE states accommodate significant amounts of entanglement and magic, which are resources needed for quantum advantage in quantum computing.
Editorial analysis
A structured set of objections, weighed in public.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Semidefinite programming relaxations yield valid lower/upper bounds on the purity quantities considered
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.