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

arXiv:1907.06914 · Quantum Information and Computation

Persistent homology analysis of multiqubit entanglement

Ricardo Mengoni, Alessandra Di Pierro, Leleh Memarzadeh, Stefano Mancini

Published May 1, 2020• 7 citations
arXivHTMLPDF

Abstract

We introduce a homology-based technique for the classification of multiqubit state vectors with genuine entanglement. In our approach, we associate state vectors to data sets by introducing a metric-like measure in terms of bipartite entanglement, and investigate the persistence of homologies at different scales. This leads to a novel classification of multiqubit entanglement. The relative occurrence frequency of various classes of entangled states is also shown.

DOI
10.26421/qic20.5-6-2

Related papers

Homological analysis of multi-qubit entanglement

Alessandra Di Pierro, Stefano Mancini, Laleh Memarzadeh +1 more

We propose the usage of persistent homologies to characterize multipartite entanglement. On a multi-qubit data set we introduce metric-like measures defined in terms of bipartite entanglement and then we derive barcodes. We show that, depending on the distance, they are able to produce different classifications. In one case, it is possible to obtain the standard separability classes. In the other case, a new classification of entangled states of three and four qubits is provided.

arXiv:1802.04572•Europhysics Letters (EPL)•Sep 4, 2018•11 citations

Genuine multipartite entanglement detection and lower bound of multipartite concurrence

Ming Li, Shao-Ming Fei, Xianqing Li‐Jost +1 more

The problems of genuine multipartite entanglement detection and classification are challenging. We show that a multipartite quantum state is genuine multipartite entangled if the multipartite concurrence is larger than certain quantities given by the number and the dimension of the subsystems. This result also provides a classification of various genuine multipartite entanglements. We present a lower bound of the multipartite concurrence in terms of bipartite concurrences. While various operational approaches are available for providing lower bounds of bipartite concurrences, our results give an effective operational way to detect and classify genuine multipartite entanglement. As applications, genuine multipartite entanglement of tripartite systems is analyzed in detail.

arXiv:1512.08845•Physical Review A•Dec 28, 2015•31 citations

Topological Quantum Metrology: Measuring Entanglement Topology via Persistent Homology with Quadratic Scaling

Udo Granops

We introduce τ_topo — a topological quantum metric derived from persistent homology of entanglement morphism graphs — that quantifies global entanglement structure invariant under local unitaries and scalable to N-qubit systems with O(N²) measurement complexity. Unlike bipartite entropy, τ_topo captures higher-order connectivity via β₁-barcode length in Rips filtrations of Pauli-weighted state distributions.

•Oct 13, 2025•0 citations

Detecting genuine multipartite entanglement of pure states with bipartite correlations

Marcin Markiewicz, Wiesław Laskowski, Tomasz Paterek +1 more

Monogamy of bipartite correlations leads, for arbitrary pure multiqubit states, to simple conditions able to indicate various types of multipartite entanglement by being capable of excluding the possibility of $k$ separability.

arXiv:1210.5530•Physical Review A•Mar 26, 2013•27 citations

Randomized graph states and their entanglement properties

Jun-Yi Wu, Matteo A. C. Rossi, Hermann Kampermann +4 more

A class of mixed multiqubit states that corresponds to a randomized version of graph states is introduced and entanglement features of these states are studied by investigating both bipartite and genuine multipartite entanglement.

arXiv:1403.3828•Physical Review A•May 30, 2014•18 citations

Entangled graphs: Bipartite entanglement in multiqubit systems

Martin Plesch, Vladimír Bužek

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits, we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex), while a bipartite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multiqubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the ${2}^{N}$-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.

arXiv:quant-ph/0211020•Physical Review A•Jan 29, 2003•55 citations
We introduce a homology-based technique for the classification of multiqubit state vectors with genuine entanglement. In our approach, we associate state vectors to data sets by introducing a metric-like measure in terms of bipartite entanglement, and investigate the persistence of homologies at different scales. This leads to a novel classification of multiqubit entanglement. The relative occurrence frequency of various classes of entangled states is also shown.
The problems of genuine multipartite entanglement detection and classification are challenging. We show that a multipartite quantum state is genuine multipartite entangled if the multipartite concurrence is larger than certain quantities given by the number and the dimension of the subsystems. This result also provides a classification of various genuine multipartite entanglements. We present a lower bound of the multipartite concurrence in terms of bipartite concurrences. While various operational approaches are available for providing lower bounds of bipartite concurrences, our results give an effective operational way to detect and classify genuine multipartite entanglement. As applications, genuine multipartite entanglement of tripartite systems is analyzed in detail.
Monogamy of bipartite correlations leads, for arbitrary pure multiqubit states, to simple conditions able to indicate various types of multipartite entanglement by being capable of excluding the possibility of kkk separability.
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits, we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex), while a bipartite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multiqubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the 2N{2}^{N}2N-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.