Separable Density Tensors

• Separable density tensors are higher-order quantum states expressed as convex combinations of pure product states, with separability defined by a nuclear norm equal to one.
• They enable entanglement detection and quantification by leveraging norm-based criteria, linking geometric measures to computational complexity in quantum systems.
• Applications in quantum information distinguish classical correlations from entanglement and allow efficient separability tests in structured, symmetric systems.

A separable density tensor is a generalization of the concept of separability from density matrices to higher-order (d-partite) quantum states, formulated in the language of tensor analysis. In the multipartite quantum setting, density tensors encode the structure of mixed states, and their separability is a fundamental property distinguishing classical correlations from genuinely quantum entanglement. The characterization of separable (and entangled) density tensors has direct implications for quantum information theory and the computational complexity of state verification.

1. Definition and Structural Characterization

A density tensor is defined as follows: let $B$ be a Hermitian tensor acting on a multipartite Hilbert space (such as $B \in H_n \subset \mathbb{C}^{n \times n}$ for a $d$-partite system). $B$ is a density tensor if it is positive semidefinite ($B \in H_{n,+}$) and has unit trace. A pure density tensor is of the form $X \otimes \overline{X}$ where $X = \otimes_k x_k$ and each local vector $x_k$ satisfies $\|x_k\| = 1$.

A density tensor $R \in H_{n,+,1}$ is called separable if it can be written as a convex combination of pure product density tensors: $$R = \sum_i p_i (X_i \otimes \overline{X_i}), \qquad p_i \ge 0, \quad \sum_i p_i = 1~,$$ where each $X_i = \otimes_k x_{k,i}$ is a product of local states. This definition extends the usual notion of separability in density matrices to higher-order tensor states.

Key property: The paper establishes that $R$ is separable if and only if its nuclear norm equals one: $$R \text{ is separable} \iff \|R\|_{\text{nuc}} = 1~,$$ where the nuclear norm is defined as the dual of the “spectral norm” over product vectors (Friedland, 25 Sep 2025).

2. Norm-Based Mathematical Formalism

The formal quantification of entanglement and separability relies crucially on tensor norms:

• For pure $d$-partite states $T \in \mathbb{C}^{n^d}$,

$$\|T\|_\infty = \max_{X \in \Pi_n} |\langle X, T\rangle|~,$$

where $\Pi_n$ denotes the set of product states (vectors of the form $\otimes_k x_k$, each with $\|x_k\| = 1$).

• For density tensors $B$ (which are Hermitian and can be viewed as operators),

$$\|B\|_{\mathrm{spec}} = \max_{X \in \Pi_n} |\langle X \otimes \overline{X}, B\rangle|~.$$

The (projective) nuclear norm is the dual,

$$\|B\|_{\mathrm{nuc}} = \min \left\{ \sum_i |a_i| : B = \sum_i a_i (X_i \otimes \overline{X_i}),~ X_i \in \Pi_n \right\}~.$$

Separability criterion: $R$ is separable iff $\|R\|_{\mathrm{nuc}} = 1$.

For symmetric (bosonic) systems, the relevant subspace is that of bi-symmetric Hermitian tensors (corresponding to invariance under the simultaneous permutation of the “ket” and “bra” indices), and strong separability is linked to a corresponding b-nuclear norm being unity.

3. Computational Complexity

Determining the separability of an arbitrary density tensor via the norm criterion is, in general, NP-hard (Friedland, 25 Sep 2025). This complexity result holds even for the bipartite case ($d=2$). Thus, checking whether a given $R$ is separable is as hard as determining if $\|R\|_{\mathrm{nuc}} = 1$ for arbitrary Hermitian tensors.

However, in special cases—particularly for Bosonic systems (symmetric $d$-qubits, or symmetric $d$-qunits in $\mathbb{C}^n$ with $n$ fixed)—the spectral and nuclear norms can be computed efficiently in polynomial time in $d$. In such settings, the structure of the tensor (e.g., symmetry under permutations) dramatically reduces the effective search space, enabling tractable algorithms. Coding symmetric or bi-symmetric Hermitian tensors as polynomials and utilizing polynomial optimization or linear algebraic relaxations allows norm calculation to any desired precision with polynomial complexity in $d$ (the exponent depending on $n$).

4. Applications and Theoretical Implications

Separable density tensors delineate the boundary between classically correlated (unentangled) quantum states and those exhibiting entanglement. They are central in:

• Entanglement Detection: Certifying separability (or its violation) underpins physical implementations of quantum communication and quantum computation. Any density tensor with nuclear norm exceeding one is necessarily entangled.
• Entanglement Quantification: The geometric measure of entanglement for pure states is given by the minimum of the spectral norm, whereas the logarithm of the nuclear norm provides an “energy” measure for both pure and mixed states. States extremal in entanglement maximize the nuclear norm and minimize the spectral norm, and vice versa.
• Algorithmic and Complexity Considerations: The separation between generic NP-hardness and tractability for structured classes (Bosonic/symmetric) is directly relevant to the practical verification of quantum state properties in experiment and simulation.

5. Examples of Separable Density Tensors

• Product States: Any pure state of the form $X = \otimes_k x_k$ leads to $X \otimes \overline{X}$, which is always separable.
• Convex Mixtures (Werner-like States): States formed as mixtures of product tensors may or may not be separable, with the exact thresholds captured by nuclear norm bounds.
• Bosonic (Symmetric) Strongly Separable Tensors: For bi-symmetric tensors in $BH_{n(\times d)}$, strong separability (decomposition into convex combinations of $x^{\otimes d} \otimes \overline{x^{\otimes d}}$) is equivalent to the value $1$ of the b-nuclear norm. For symmetric states in $S^{2d}\mathbb{R}^n$, separability is similarly characterized by the norm.

The underlying sets of separable and strongly separable density tensors form semi-algebraic sets (i.e., can be described by polynomial equations and inequalities), allowing the application of computational algebraic geometry methods for their paper.

6. Further Directions and Semi-Algebraic Structure

A salient property established by the identification of separable sets as semi-algebraic is that their geometric and topological features (such as volume, boundaries, and typicality of entanglement) become accessible to real algebraic geometry techniques (e.g., via quantifier elimination). This provides tools for the mathematical analysis of the relationships between entanglement classes, enabling new insights into the geometry of quantum state spaces. The identification of semi-algebraicity also connects to and supports earlier results on the geometric measure of entanglement and the complexity of state discrimination.

7. Summary Table: Norm-Based Separability Criteria

Tensor Type	Norm Used	Separability Criterion	Complexity
General density	Nuclear norm	$\|R\|_{\mathrm{nuc}} = 1$ iff separable	NP-hard
Bi-symmetric	b-nuclear norm	$\|R\|_{\text{b-nuc}} = 1$ iff strong separable	Poly-time for fixed $n$
Product state	(trivial)	Always separable	trivial

For Bosonic and symmetric classes with fixed $n$, polynomial time algorithms exist for norm evaluation and thus separability checking; in the general case, the problem is NP-hard.

---

In summary, separable density tensors are characterized via nuclear norm conditions, with tractable computation only in certain structured settings. This norm-based approach provides a geometric and quantitative language for investigating entanglement, supports explicit separability tests, and quantifies the computational cost of verifying classicality versus quantum correlations in multipartite quantum systems (Friedland, 25 Sep 2025).