arXiv:2609.18570
Catalytic Activation of Genuine Multipartite Entanglement and Nonlocality
Eliot Donnadieu, Pavel Sekatski, Nicolas Brunner, Victor Barizien
Abstract
We demonstrate the possibility to activate genuine multipartite entanglement (GME), the strongest form of entanglement for multipartite states, within the framework of quantum catalysis. Specifically, we show that any biseparable state (i.e. not GME) that is not partition separable can be deterministically transformed into a GME state via the help of a catalyst and local operations, without any classical communication. In turn, we construct a catalytic protocol tailored to the multipartite case. The protocol is termed "sum-to-product", as it transforms a mixture of states into their tensor product in a heralded manner. We apply this protocol to random network entangled states, which are biseparable by construction, and demonstrate catalytic activation of both GME and genuine multipartite Bell nonlocality.
AI Summary
The paper asks when local operations assisted by an unchanged catalyst can activate genuine multipartite entanglement (GME) or genuine multipartite nonlocality (GMNL). It uses **correlated catalysis**: the catalyst’s marginal is restored exactly, but correlations with the output are allowed; no classical communication is required. For biseparable inputs, it establishes an exact characterization: catalytic activation of GME is possible if and only if the input is not separable across any fixed bipartition. A biseparable catalyst suffices. Sufficiency combines known finite-copy GME activation with a catalytic protocol producing a locally flagged branch $\rho^{\otimes k}$ with probability $1/k$. The entire flagged output is deterministically GME. Necessity follows from faithfulness and catalytic monotonicity of bipartite squashed entanglement. A “sum-to-product” construction converts a locally flagged mixture $\sum_i\alpha_i\rho_i\otimes[i]$ into an output containing $\bigotimes_i\rho_i$ with heralded probability $1/\sum_i\alpha_i^{-1}$, equal to $1/n^2$ for uniform weights. Explicit catalysts and flag-controlled local swaps establish the transformation. Applied to flagged random networks of pure entangled states, connectedness of the union network enables GME activation. Concatenation with finite-copy GMNL activation gives a GMNL branch with probability $1/(kn^2)$ for uniform weights, with $k\leq N-1$. A separate theorem shows that mixing a GMNL distribution with locally orthogonal-output distributions preserves GMNL under the stated nonsignaling definition. GMNL activation is established for these network states, not arbitrary non-partition-separable inputs. Stability of genuine multipartite network entanglement under catalytic local operations remains open.
Error found: Section 4 incorrectly gives success probabilities 1/n^2 and 1/(k n^2) for arbitrary ensemble weights; these should be 1/C_alpha and 1/(k C_alpha), respectively, which remain positive. Appendix A's permuted-catalyst formula fails to permute the inverse ensemble weights along with the component states, making the formula invalid as stated for nonuniform weights. The general concatenation theorem is not established by Appendix B because its proof assumes conditional system–catalyst factorization that does not follow from the theorem's classical-flag hypothesis, although the explicit activation protocols satisfy this stronger condition.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6+5 pages; 1+2 figures