arXiv:2609.36336
Separability rigidity of Gaussian states under positive domination
Evgeny Shchukin, Peter van Loock
Abstract
We prove a separability rigidity theorem for finite-mode Gaussian states. Let $ρ_G$ be Gaussian and let $\mathcal I$ be a fixed partition of the modes. If $ρ_G$ dominates a nonzero positive operator $T$ that is separable across $\mathcal I$, $0\neq T\preccurlyeq ρ_G$, then $ρ_G$ itself is separable across $\mathcal I$. The dominated operator is arbitrary and need not be Gaussian. The theorem has three applications. First, any Gaussian channel admitting a nonzero entanglement-breaking completely positive subchannel is itself entanglement breaking, even when that subchannel is non-Gaussian. Second, if a resource state dominates a positive multiple of a faithful separable state, no finite-copy, postselected separability-preserving protocol can prepare an entangled Gaussian state exactly with nonzero success probability. Third, a connected graph of entangled Gaussian two-mode marginals certifies genuine multipartite entanglement of every compatible global state, even if the global state is non-Gaussian; the certification is robust to sufficiently small trace-norm errors in the marginals. As a structural corollary, mixing states separable across different partitions cannot produce new Gaussian states, so full inseparability and genuine multipartite entanglement coincide for finite-mode Gaussian states and identical copies of a biseparable Gaussian state cannot activate genuine multipartite entanglement.
AI Summary
For general mixed states, entanglement across every bipartition does not imply genuine multipartite entanglement (GME). This paper addresses whether that distinction persists for finite-mode Gaussian states, proving a stronger positive-domination statement: if a Gaussian state $\rho_G$ satisfies $0\ne T\preccurlyeq\rho_G$ for an operator $T$ separable across a fixed partition, then $\rho_G$ is separable across that partition. The operator $T$ need not be Gaussian. Consequently, Gaussian full inseparability and GME coincide, and identical copies of a biseparable Gaussian state cannot activate GME when copies are grouped by party. The proof derives a partition-block-structured lower bound on the logarithmic Hessian of a separable operator’s Husimi function. Comparing this with the constant Gaussian Hessian at maxima of a regularized Husimi ratio produces a pure product Gaussian covariance $\gamma_*\preccurlyeq\gamma$. Classical random displacements then reconstruct $\rho_G$. Trace-norm approximation and compactness handle separable operators without countable product decompositions and closed convex hulls. Applications exclude nonzero entanglement-breaking CP subchannels of non-entanglement-breaking Gaussian channels, including non-Gaussian branches. They also prohibit exact entangled Gaussian preparation by finite-copy, postselected separability-preserving operations from states dominating a positive multiple of faithful separable noise. A connected graph of entangled Gaussian two-mode marginals—hence a spanning tree with $n-1$ edges—certifies GME of every compatible global state, without global Gaussianity. Marginal certification has a positive trace-norm tolerance, but no explicit bound; covariance closeness alone is insufficient. The preparation obstruction does not exclude approximation or asymptotic protocols and provides no universal approximation-error bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 30 pages