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:1908.10390 · Physical Review A

Cut-resistant links and multipartite entanglement resistant to particle loss

Gonçalo M. Quinta, Rui André, Adam Burchardt, Karol Życzkowski

Published Dec 23, 2019• 13 citations
arXivHTMLPDF

Abstract

In this work, we explore the space of quantum states composed of $N$ particles. To investigate entanglement resistant to particle loss, we introduce the notion of $m$-resistant states. A quantum state is $m$ resistant if it remains entangled after losing an arbitrary subset of $m$ particles but becomes separable after losing any number of particles larger than $m$. We establish an analogy to the problem of designing a topological link consisting of $N$ rings such that, after cutting any $(m+1)$ of them, the remaining rings become disconnected. We present a constructive solution to this problem, which allows us to exhibit several $N$-particle states with the desired property of entanglement resistance to particle loss.

DOI
10.1103/physreva.100.062329

Related papers

Genuinely multipartite entangled qudits: one rule to link them all

Gonçalo M. Quinta, Rui André

Links of rings offer an intuitive picture of multipartite entanglement. Cutting one ring can free some of the others, just as losing a particle, i.e. tracing it out, can disentangle some of the remaining ones. This analogy classifies multipartite entanglement according to which groups of particles stay entangled when others are lost, a question at the heart of robust quantum networks. However, pure states realizing a given link class were known only in special cases. Here, we close this gap. Recasting link polynomials as hypergraphs, we give an explicit formula for pure qudit states and prove that, for every link class, their entanglement under any pattern of particle loss matches the link exactly. The same construction also controls genuine multipartite entanglement, determining exactly which of the groups that stay entangled are genuinely multipartite entangled, and all of them can be made so. As a consequence, we prove the conjecture that $m$-resistant pure qudit states, which stay entangled after the loss of any $m$ particles but become fully separable after the loss of $m+1$, exist for any number of particles and any $m$.

quant-pharXiv:2610.33160•Oct 27, 2026•0 citations

Constructions of multipartite entanglement resistant to particle loss

Wanchen Zhang, Zicheng Han, Fei Shi +1 more

An entangled state is called $m$ resistant if it remains entangled after losing an arbitrary subset of $m$ particles but becomes fully separable after losing any number of particles larger than $m$. Quinta et al. [Phys. Rev. A 100, 062329 (2019)] conjectured that for any $N$-particle systems, there always exists an $m$-resistant pure state of some local dimension $d$. In this paper, we give two general constructions of $m$-resistant pure states. One is from the mixtures of Dicke states, which provides strong $(N\ensuremath{-}k)$-resistant pure $N$-qubit states with $k=4$ or 5. The other is from classical error-correcting codes, which provides new $m$-resistant pure qudit states for certain $m<N/2$.

arXiv:2505.06567•Physical Review A•Jul 17, 2025•2 citations

Classifying quantum entanglement through topological links

Gonçalo M. Quinta, Rui André

We propose an alternative classification scheme for quantum entanglement based on topological links. This is done by identifying a nonrigid ring to a particle, attributing the act of cutting and removing a ring to the operation of tracing out the particle, and associating linked rings to entangled particles. This analogy naturally leads us to a classification of multipartite quantum entanglement based on all possible distinct links for a given number of rings. To determine all different possibilities, we develop a formalism that associates any link to a polynomial, with each polynomial thereby defining a distinct equivalence class. To demonstrate the use of this classification scheme, we choose qubit quantum states as our example of physical system. A possible procedure to obtain qubit states from the polynomials is also introduced, providing an example state for each link class. We apply the formalism for the quantum systems of three and four qubits and demonstrate the potential of these tools in a context of qubit networks.

arXiv:1803.08935•Physical Review A•Apr 5, 2018•15 citations

Symmetry and Classification of Multipartite Entangled States

Adam Burchardt

One of the key manifestations of quantum mechanics is the phenomenon of quantum entanglement. While the entanglement of bipartite systems is already well understood, our knowledge of entanglement in multipartite systems is still limited. This dissertation covers various aspects of the quantification of entanglement in multipartite states and the role of symmetry in such systems. Firstly, we establish a connection between the classification of multipartite entanglement and knot theory and investigate the family of states that are resistant to particle loss. Furthermore, we construct several examples of such states using the Majorana representation as well as some combinatorial methods. Secondly, we introduce classes of highly-symmetric but not fully-symmetric states and investigate their entanglement properties. Thirdly, we study the well-established class of Absolutely Maximally Entangled (AME) quantum states. On one hand, we provide construction of new states belonging to this family, for instance, an AME state of 4 subsystems with six levels each, on the other, we tackle the problem of equivalence of such states. Finally, we present a novel approach for the general problem of verification of the equivalence between any pair of arbitrary quantum states based on a single polynomial entanglement measure.

arXiv:2204.13441•Apr 28, 2022•7 citations

LINKS AND QUANTUM ENTANGLEMENT

A. I. Solomon, CHOON-LIN HO

We discuss the analogy between topological entanglement and quantum entanglement, particularly for tripartite quantum systems. We illustrate our approach by first discussing two clearly (topologically) inequivalent systems of three-ring links: The Borromean rings, in which the removal of any one link leaves the remaining two non-linked (or, by analogy, non-entangled); and an inequivalent system (which we call the NUS link) for which the removal of any one link leaves the remaining two linked (or, entangled in our analogy). We introduce unitary representations for the appropriate Braid Group ($B_3$) which produce the related quantum entangled systems. We finally remark that these two quantum systems, which clearly possess inequivalent entanglement properties, are locally unitarily equivalent.

arXiv:1104.5144•Conference in Honour of Murray Gell-Mann's 80th Birthday•Nov 1, 2010•4 citations

Quantum Circuit Cutting Minimising Loss of Qubit Entanglement

Michael Hart, John McAllister

Quantum circuit cutting allows an arbitrary circuit to be executed on a quantum computer with fewer qubits by fragmenting it into subcircuits, each with fewer qubits. If such a method is to be employed, it is critical that the quantum properties of the original circuit, such as entanglement, are not violated. This paper demonstrates, using circuit cutting tools, how to select circuit bipartitions while prioritising the preservation of underlying entanglement between the qubits. We present two entanglement-based criteria. The former minimises losses of reduced-state pairwise qubit entanglement, and has polynomial complexity in the number of qubits. The latter minimises loss of multipartite entanglement across qubit bipartitions, with exponential complexity. Violations of entanglement with frequencies up to 72% are observed in current circuit cutting software. This paper describes how to prevent such violations, or to minimise qubit entanglement losses, fragmenting circuits with pairwise qubit negativity losses of only 5%, and for certain circuits 0% von Neumann entropy losses across qubit bipartitions.

ACM International Conference on Computing Frontiers (CF)•May 7, 2024•1 citation
In this work, we explore the space of quantum states composed of NNN particles. To investigate entanglement resistant to particle loss, we introduce the notion of mmm-resistant states. A quantum state is mmm resistant if it remains entangled after losing an arbitrary subset of mmm particles but becomes separable after losing any number of particles larger than mmm. We establish an analogy to the problem of designing a topological link consisting of NNN rings such that, after cutting any (m+1)(m+1)(m+1) of them, the remaining rings become disconnected. We present a constructive solution to this problem, which allows us to exhibit several NNN-particle states with the desired property of entanglement resistance to particle loss.
Links of rings offer an intuitive picture of multipartite entanglement. Cutting one ring can free some of the others, just as losing a particle, i.e. tracing it out, can disentangle some of the remaining ones. This analogy classifies multipartite entanglement according to which groups of particles stay entangled when others are lost, a question at the heart of robust quantum networks. However, pure states realizing a given link class were known only in special cases. Here, we close this gap. Recasting link polynomials as hypergraphs, we give an explicit formula for pure qudit states and prove that, for every link class, their entanglement under any pattern of particle loss matches the link exactly. The same construction also controls genuine multipartite entanglement, determining exactly which of the groups that stay entangled are genuinely multipartite entangled, and all of them can be made so. As a consequence, we prove the conjecture that mmm-resistant pure qudit states, which stay entangled after the loss of any mmm particles but become fully separable after the loss of m+1m+1m+1, exist for any number of particles and any mmm.
An entangled state is called mmm resistant if it remains entangled after losing an arbitrary subset of mmm particles but becomes fully separable after losing any number of particles larger than mmm. Quinta et al. [Phys. Rev. A 100, 062329 (2019)] conjectured that for any NNN-particle systems, there always exists an mmm-resistant pure state of some local dimension ddd. In this paper, we give two general constructions of mmm-resistant pure states. One is from the mixtures of Dicke states, which provides strong $(N\ensuremath{-}k)$-resistant pure NNN-qubit states with k=4k=4k=4 or 5. The other is from classical error-correcting codes, which provides new mmm-resistant pure qudit states for certain m<N/2m<N/2m<N/2.
We propose an alternative classification scheme for quantum entanglement based on topological links. This is done by identifying a nonrigid ring to a particle, attributing the act of cutting and removing a ring to the operation of tracing out the particle, and associating linked rings to entangled particles. This analogy naturally leads us to a classification of multipartite quantum entanglement based on all possible distinct links for a given number of rings. To determine all different possibilities, we develop a formalism that associates any link to a polynomial, with each polynomial thereby defining a distinct equivalence class. To demonstrate the use of this classification scheme, we choose qubit quantum states as our example of physical system. A possible procedure to obtain qubit states from the polynomials is also introduced, providing an example state for each link class. We apply the formalism for the quantum systems of three and four qubits and demonstrate the potential of these tools in a context of qubit networks.
One of the key manifestations of quantum mechanics is the phenomenon of quantum entanglement. While the entanglement of bipartite systems is already well understood, our knowledge of entanglement in multipartite systems is still limited. This dissertation covers various aspects of the quantification of entanglement in multipartite states and the role of symmetry in such systems. Firstly, we establish a connection between the classification of multipartite entanglement and knot theory and investigate the family of states that are resistant to particle loss. Furthermore, we construct several examples of such states using the Majorana representation as well as some combinatorial methods. Secondly, we introduce classes of highly-symmetric but not fully-symmetric states and investigate their entanglement properties. Thirdly, we study the well-established class of Absolutely Maximally Entangled (AME) quantum states. On one hand, we provide construction of new states belonging to this family, for instance, an AME state of 4 subsystems with six levels each, on the other, we tackle the problem of equivalence of such states. Finally, we present a novel approach for the general problem of verification of the equivalence between any pair of arbitrary quantum states based on a single polynomial entanglement measure.
We discuss the analogy between topological entanglement and quantum entanglement, particularly for tripartite quantum systems. We illustrate our approach by first discussing two clearly (topologically) inequivalent systems of three-ring links: The Borromean rings, in which the removal of any one link leaves the remaining two non-linked (or, by analogy, non-entangled); and an inequivalent system (which we call the NUS link) for which the removal of any one link leaves the remaining two linked (or, entangled in our analogy). We introduce unitary representations for the appropriate Braid Group (B3B_3B3​) which produce the related quantum entangled systems. We finally remark that these two quantum systems, which clearly possess inequivalent entanglement properties, are locally unitarily equivalent.
Quantum circuit cutting allows an arbitrary circuit to be executed on a quantum computer with fewer qubits by fragmenting it into subcircuits, each with fewer qubits. If such a method is to be employed, it is critical that the quantum properties of the original circuit, such as entanglement, are not violated. This paper demonstrates, using circuit cutting tools, how to select circuit bipartitions while prioritising the preservation of underlying entanglement between the qubits. We present two entanglement-based criteria. The former minimises losses of reduced-state pairwise qubit entanglement, and has polynomial complexity in the number of qubits. The latter minimises loss of multipartite entanglement across qubit bipartitions, with exponential complexity. Violations of entanglement with frequencies up to 72% are observed in current circuit cutting software. This paper describes how to prevent such violations, or to minimise qubit entanglement losses, fragmenting circuits with pairwise qubit negativity losses of only 5%, and for certain circuits 0% von Neumann entropy losses across qubit bipartitions.