Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Combinatory-Algebraic Perspective on Multipartiteness, Entanglement and Quantum Localization

Ioannis Raptis, Romàn R. Zapatrin

Published Jul 1, 2005• 0 citations
Publisher
DOI
10.1007/s10773-005-7063-x

Related papers

A Combinatory-Algebraic Perspective on Multipartiteness, Entanglement and Quantum Localization

Raptis, Ioannis, Romàn R. Zapatrin

We claim that both multipartiteness and localization of subsystems of compound quantum systems are of an essentially relative nature crucially depending on the set of operationalistically available states. In a more general setting, to capture the relativity and variability of our structures with respect to the observation means, sheaves of algebras may need be introduced. We provide the general formalism based on algebras which exhibits the relativity of multipartiteness and localization.

arXiv:quant-ph/0211077•Nov 13, 2002•0 citations

Encoding matroids into quantum states

Nathan Ferreira, Alison A. Silva, Giuliano G. La Guardia +1 more

Efficient representations of multipartite quantum states play a fundamental role in quantum information theory, providing both conceptual insight and practical tools for characterizing entanglement. Motivated by the axiomatic framework for graph states [Phys. Rev. A 85, 062313 (2012)] and its subsequent extension to hypergraph states [Phys. Rev. A 87, 022311 (2013)], we introduce an axiomatic construction of \emph{matroid states}, a new family of multipartite quantum states associated with matroids. Our constructions are based on a set of axioms analogous to those that define graph and hypergraph states, yielding a consistent quantum representation of arbitrary matroids. Two ways of constructing matroid states are proposed: the first is defined in terms of circuits, and the second in terms of independent sets. In both approaches, we establish the existence of universal global operators that satisfy desirable properties such as locality, symmetry, commutativity, and are associated with the combinatorial structure of matroids. Furthermore, we establish a hierarchy connecting graph, matroid, and hypergraph states within a unified framework. Additionally, we show how to obtain an arbitrary graph state by applying suitable families of matroid states, whose corresponding operators are the generators of the stabilizer subgroup of the graph state. These results identify matroid theory as a natural combinatorial language for the efficient description of multipartite quantum states and open new perspectives for the investigation of quantum entanglement and related combinatorial structures.

quant-pharXiv:2607.02736•Jul 6, 2026•0 citations

An algebraic approach to the study of multipartite entanglement

Sara Di Martino, Benedetto Militello, ANTONINO MESSINA

arXiv:1204.2227•Journal of Russian Laser Research•Jan 1, 2013•1 citation

Unified framework for multipartite quantum nonlocality

Qiongyi He, Eric G. Cavalcanti, M. D. Reid +1 more

•Aug 30, 2010•0 citations

Algebraic Criteria for Entanglement in Multipartite Systems

J. D. M. Vianna, Marco A. S. Trindade, M.C.B. Fernandes

International Journal of Theoretical Physics•Sep 20, 2007•7 citations

A combinatorial approach for studying local operations and classical communication transformations of multipartite states

Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar +1 more

We develop graph theoretic methods for analyzing maximally entangled pure states distributed between a number of different parties. We introduce a technique called bicolored merging, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication. We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among n agents. Further, we discuss a new graph theoretic metric on a class of multipartite states, and its implications.

Journal of Mathematical Physics•Dec 1, 2005•11 citations
Efficient representations of multipartite quantum states play a fundamental role in quantum information theory, providing both conceptual insight and practical tools for characterizing entanglement. Motivated by the axiomatic framework for graph states [Phys. Rev. A 85, 062313 (2012)] and its subsequent extension to hypergraph states [Phys. Rev. A 87, 022311 (2013)], we introduce an axiomatic construction of \emph{matroid states}, a new family of multipartite quantum states associated with matroids. Our constructions are based on a set of axioms analogous to those that define graph and hypergraph states, yielding a consistent quantum representation of arbitrary matroids. Two ways of constructing matroid states are proposed: the first is defined in terms of circuits, and the second in terms of independent sets. In both approaches, we establish the existence of universal global operators that satisfy desirable properties such as locality, symmetry, commutativity, and are associated with the combinatorial structure of matroids. Furthermore, we establish a hierarchy connecting graph, matroid, and hypergraph states within a unified framework. Additionally, we show how to obtain an arbitrary graph state by applying suitable families of matroid states, whose corresponding operators are the generators of the stabilizer subgroup of the graph state. These results identify matroid theory as a natural combinatorial language for the efficient description of multipartite quantum states and open new perspectives for the investigation of quantum entanglement and related combinatorial structures.
We develop graph theoretic methods for analyzing maximally entangled pure states distributed between a number of different parties. We introduce a technique called bicolored merging, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication. We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among n agents. Further, we discuss a new graph theoretic metric on a class of multipartite states, and its implications.