Tensor invariants for multipartite entanglement classification

• URL: http://arxiv.org/abs/2604.02269v1
• Date: Thu, 02 Apr 2026 17:03:28 GMT
• Title: Tensor invariants for multipartite entanglement classification
• Abstract summary: We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states.<n>We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.

Related papers

• State-independent uncertainty relations on multipartite spin $1/2$-systems [0.0]
  Uncertainty relations quantify fundamental limits on simultaneous measurement of quantum observables.<n>We develop a representation-theoretic framework for multipartite SIURs in collective spin-$tfrac12$ systems.<n>These results establish the first unified, algebraic framework for multipartite variance-based SIURs in qubit ensembles.
  arXiv  Detail & Related papers  (2026-07-15T21:28:02Z)
• Multi-state imaginarity and coherence in qubit systems [3.7112567233163003]
  We provide a unitary-invariant framework to pinpoint imaginarity and coherence in sets of qubit states.<n>We also show that the set of imaginarity-free multi-states is not convex, and that third-order invariants completely characterize multi-state imaginarity of single-qubits but not of higher-dimensional systems.
  arXiv  Detail & Related papers  (2025-07-20T09:34:57Z)
• Interpreting Multipartite Entanglement through Topological Summaries [0.5097809301149342]
  The study of multipartite entanglement is much less developed than the bipartite scenario.<n>Recently, a string of results have proposed using tools from Topological Data Analysis to attach topological quantities to multipartite states.<n>We take the first steps in connecting these abstract topological quantities to operational interpretations of entanglement in two scenarios.
  arXiv  Detail & Related papers  (2025-05-01T16:31:36Z)
• Classifying Entanglement by Algebraic Geometry [0.0]
  dissertation covers characterization of multipartite entanglement using algebraic-geometric tools.<n>We establish an algorithm to classify multipartite entanglement by $k$secibilityant varieties of the variety $ell$-multilinear ranks.<n>We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm.
  arXiv  Detail & Related papers  (2024-08-22T10:03:22Z)
• Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
  We show that PCA becomes computationally hard at a critical value of the signal's magnitude. We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree. It also lets us analyze a new problem of distinguishing between different ensembles.
  arXiv  Detail & Related papers  (2024-04-29T14:33:24Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [55.2480439325792]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication.<n>We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering [56.81492360414741]
  We show how to enforce a one-step normalized cut for bipartite graphs, especially with linear-time complexity. In this paper, we first characterize a novel one-step bipartite graph cut criterion with normalized constraints, and theoretically prove its equivalence to a trace problem. We extend this cut criterion to a scalable subspace clustering approach, where adaptive anchor learning, bipartite graph learning, and one-step normalized bipartite graph partitioning are simultaneously modeled.
  arXiv  Detail & Related papers  (2023-05-12T11:27:20Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [49.1574468325115]
  We show that the complement of any bipartite pure entangled state is spanned by product states which form a nonorthogonal unextendible product basis (nUPB) of maximum cardinality.<n>We also report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing number of mixed states.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Local Transformations of Multiple Multipartite States [0.34362363862897544]
  We study the study of transformations of states via Local Operations assisted by Classical Communication (LOCC) We show that by transferring entanglement from one state to the other, one can perform state conversions not possible in the single copy case. In the bipartite case, we identify numerous non-trivial transformations and show that the source entanglement is not additive.
  arXiv  Detail & Related papers  (2020-07-13T09:18:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.