SLOCC: Local Operations & Classical Communication

• SLOCC is a framework in quantum information that classifies multipartite entangled states via invertible local operations and classical communication.
• It enables probabilistic state transformations, establishing equivalence classes that partition the state space into distinct entanglement types.
• SLOCC underpins quantum resource convertibility with practical applications in measurement-based computation and entanglement transformations using tensor rank and invariant criteria.

Stochastic Local Operations and Classical Communication (SLOCC) is a fundamental operational framework for classifying and transforming entangled quantum states in multipartite systems. SLOCC formalizes a regime in which local agents, operating on their respective subsystems, perform arbitrary (generally non-unitary) invertible operations and coordinate outcomes using classical communication, with the stipulation that a particular transformation succeeds with nonzero probability. This structure leads to a coarse-grained equivalence relation known as SLOCC equivalence, which partitions the state space into distinct orbits of entanglement types and underpins the partial order of interconvertibility of quantum resources for information processing.

1. Definition and Operational Formalism

Let $$|\psi\rangle, |\varphi\rangle \in \mathcal{H}_{A_1} \otimes \cdots \otimes \mathcal{H}_{A_n}$$ be pure states of an $n$-partite system. A transformation $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$ is said to be achievable under SLOCC if there exist local linear operators $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$, not necessarily unitary but invertible, such that

$$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$

with a nonzero probability of success

$$p = \| (A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle \|^2 > 0.$$

If all $A_i$ are invertible, the process is reversible with nonzero probability both ways (Chen et al., 2010). This formulation implies that SLOCC equivalence corresponds to the existence of local invertible maps connecting two states. For mixed states, the criterion generalizes to

$$\rho' = (A_1 \otimes \cdots \otimes A_n)\, \rho\, (A_1 \otimes \cdots \otimes A_n)^\dagger,$$

with $\det A_i \ne 0$ for all $i$ (Zhang et al., 2016).

2. Hierarchies and Relations: LOCC, SLOCC, MCLOCC, MCSLOCC

SLOCC is intermediate in restrictiveness between deterministic local operations and classical communication (LOCC) and their multi-copy (collective operation) analogues:

• LOCC: Deterministic protocols using trace-preserving local operations and unlimited classical communication.
• SLOCC: Stochastic, may involve post-selection on successful outcomes, defined by invertible local operators.
• MCLOCC: Multi-copy LOCC; there exists $n$0 such that $n$1.
• MCSLOCC: Multi-copy SLOCC; as above but with stochastic local operations.

These relationships form a strict hierarchy,

$n$2

and this hierarchy applies also to the equivalence (reversible) sense (Chen et al., 2010).

3. SLOCC Equivalence: Orbits, Invariants, and Classification

Under SLOCC, states lie in orbits,

$n$3

partitioning the space into equivalence classes parameterized by certain local and global invariants.

The primary invariants under SLOCC are:

• Tensor rank (generalized Schmidt rank):

$n$4

• Local ranks:

$n$5

These are non-increasing under SLOCC maps, including noninvertible ones (Chen et al., 2010, Zhang et al., 2016). If two states have different invariants, they cannot be SLOCC-equivalent; genuine multipartite inequivalence results when invariants are strictly ordered.

A hierarchical structure then emerges:

1. Principal sets $n$6: States of fixed tensor rank $n$7.
2. Subsets with fixed local ranks: $n$8, where $n$9.
3. Individual SLOCC orbits within classes.

For multipartite pure states, this organization induces a partial order with maximal elements (GHZ-like orbits at each rank) and yields nested classification (Chen et al., 2010).

4. SLOCC-Equivalence Criteria and Computable Schemes

The SLOCC equivalence problem for arbitrary multipartite pure (and, in special forms, mixed) states admits necessary and sufficient matrix-based criteria:

• Coefficient matrix (bipartition) form: For a bipartition $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$0, two pure states $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$1 are SLOCC-equivalent iff there exist invertible local maps $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$2 connecting their coefficient matrices via left/right multiplication and additional realignment conditions (Zhang et al., 2016). Specifically,

$$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$3

with unitaries $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$4, $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$5 and invertible diagonals $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$6 such that the realignments of $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$7, $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$8 decompose as Kronecker products of local invertibles.

• Tensor method: For $$|\psi\rangle \xrightarrow{\rm SLOCC} |\varphi\rangle$$9-partite pure states with coefficient tensors $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$0, SLOCC-equivalence holds iff for each mode-$$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$1 unfolding,

$$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$2

for invertible $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$3, and further realignment constraints guarantee the Kronecker product structure (Chang et al., 2022).

For mixed states, a necessary (and sometimes sufficient) condition is obtained by matching the realignments of mode-$$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$4 unfoldings under local invertible actions (Zhang et al., 2016, Chang et al., 2022).

5. Canonical SLOCC Types and Multipartite Structure

5.1. Distinguishing SLOCC Classes: Examples and Prototypical Forms

• Two qubits: All entangled states are SLOCC-equivalent to a Bell pair; separable states form the only other class (Chen et al., 2010, Zhang et al., 2016).
• Three qubits: Two inequivalent genuine classes (GHZ and W), alongside biseparable and fully separable states. The GHZ and W classes are distinguished by polynomial invariants (e.g., the $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$5-tangle) and associated rank conditions (Chen et al., 2010, Zhang et al., 2016, Li, 2018).
• Four or more qubits: SLOCC classes become uncountable; partial classifications employ polynomial invariants, coefficient matrix ranks under various bipartitions, Jordan canonical forms of spin-flip matrices, and computational approaches based on tensor unfolding or elementary local operations (Ghahi et al., 2018, Li, 2017, Li et al., 2011, Li et al., 2011, Wang et al., 2012).

Notably, the GHZ state $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$6 is a universal generator for all rank-$$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$7 states under SLOCC: for any $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$8 with $$A_i : \mathcal{H}_{A_i} \rightarrow \mathcal{H}_{A_i}$$9, there exist invertible $$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$0 such that

$$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$1

and hence $$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$2 (Chen et al., 2010).

Table: SLOCC-Orbit Prototypical Representatives (Selected Examples)

System	Representative SLOCC Classes	Defining Properties
2 qubits	Bell state, separable	Schmidt rank, concurrence
3 qubits	GHZ, W, biseparable, separable	$$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$3-tangle, bipartite ranks
4 qubits	Uncountably many orbits; GHZ, cluster	Polynomial invariants, Jordan forms

For symmetric states, the Majorana representation induces entanglement families based on degeneracy partitions, with explicit polynomial invariants and hierarchy of convex sets (Bastin et al., 2010).

6. Applications: Measurement-Based Computation and Entanglement Transformations

SLOCC transformations serve as a criterion for universality and resource convertibility in quantum information protocols. In measurement-based quantum computation (MBQC), for example, cluster states transformed via local invertible filters can yield new resource states retaining or losing universality, depending on their SLOCC-class (D'Souza et al., 2011). The analysis of correlation functions, gate-teleportation probability, and percolation thresholds in deformed cluster states can be traced directly to the structure of the underlying SLOCC transformations.

In tripartite-to-bipartite entanglement conversion, the SLOCC convertibility is determined by the maximal Schmidt rank of the reduced support. In the asymptotic regime, the existence of a conversion to a maximally entangled state is equivalent to nonvanishing noncommutative rank of an associated matrix space (Li et al., 2016).

7. Computational Complexity, Invariants, and Open Challenges

The computational determination of SLOCC-equivalence relies on the identification of invariants and normal forms:

• Polynomial invariants: For qubits, all SLOCC invariants can be generated by polynomials of degree at most $$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$4 (Turner, 2017).
• Rank invariants: Partitioning into families by matrix rank is efficient and forms the basis of scalable classification schemes for moderate $$(A_1 \otimes \cdots \otimes A_n)\, |\psi\rangle = |\varphi\rangle,$$5 (Li et al., 2011, Wang et al., 2012).
• Canonical forms and matrix reductions: Gauss–Jordan elimination in the multipartite setting leads to multipartite fully reduced forms, forming a concrete computational approach (Steinhoff, 2019).

Genuine SLOCC classification for four or more parties remains a deep challenge due to the infinite nature of orbit structure, the subtlety of partial invariants, and non-uniqueness of canonical representatives. Recent work explores classification via tensor decompositions, polynomial invariants, and geometric methods (orbit closure, moment polytopes) (Chang et al., 2022, Ghahi et al., 2018). Notably, for certain highly structured states (e.g., absolutely maximally entangled (AME)), SLOCC-classes may split into infinitely many inequivalent families, governed by nontrivial polynomial-type invariants derived from combinatorial designs (Burchardt et al., 2020).

---

References:

(Chen et al., 2010, Zhang et al., 2016, Chang et al., 2022, Li et al., 2016, Zangi et al., 2017, Li, 2017, Turner, 2017, Li, 2018, Ghahi et al., 2018, Rana et al., 2011, Wang et al., 2012, Li et al., 2011, Li et al., 2011, Bastin et al., 2010, Burchardt et al., 2020, D'Souza et al., 2011, Steinhoff, 2019, Sudha et al., 2020).