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

Constructions of multipartite entanglement resistant to particle loss

Wanchen Zhang, Zicheng Han, Fei Shi, Xiande Zhang

Published Jul 17, 2025• 2 citations
arXivHTMLPDF

Abstract

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$.

DOI
10.1103/g4bk-gfhs

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

Cut-resistant links and multipartite entanglement resistant to particle loss

Gonçalo M. Quinta, Rui André, Adam Burchardt +1 more

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.

arXiv:1908.10390•Physical Review A•Dec 23, 2019•13 citations

Genuinely multipartite entangled states and orthogonal arrays

Dardo Goyeneche, Karol Życzkowski

A pure quantum state of $N$ subsystems with $d$ levels each is called $k$-multipartite maximally entangled state, which we call a $k$-uniform state, if all its reductions to $k$ qudits are maximally mixed. These states form a natural generalization of $N$-qudit Greenberger-Horne-Zeilinger states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and $k$-uniform states and prove the existence of several classes of such states for $N$-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of $N>5$ qubits. We show that finding a different class of 2-uniform states would imply the Hadamard conjecture, so the full classification of 2-uniform states seems to be currently out of reach. Furthermore, we establish links between the existence of $k$-uniform states and classical and quantum error correction codes and provide a graph representation for such states.

arXiv:1404.3586•Physical Review A•Aug 15, 2014•166 citations

A five-qubit 1-resistant graph state and stabilizer marginal certificates

Zicheng Han, Wanchen Zhang, Xiande Zhang

We study particle-loss resistant entanglement within the framework of stabilizer and graph states. A pure state is \(m\)-resistant if it remains entangled after the loss of any \(m\) particles and becomes fully separable after the loss of any \(m+1\) particles. The smallest previously unresolved qubit case was the existence of a five-qubit \(1\)-resistant pure state, which is resolved here by the five-cycle graph state \(\ket{C_5}\). A stabilizer-subgroup method is also developed for verifying \(m\)-resistance in graph states, using local stabilizers to certify full separability and exact negative partial transpose~(NPT) witnesses to certify entanglement. Applying this to all graph states associated with non-isomorphic graphs on five, six, and seven vertices, we obtain a graph state classification up to local Clifford equivalence, which also classifies stabilizer states up to local Clifford equivalence. Thus, the five-qubit \(1\)-resistant stabilizer states are exactly the local Clifford class of \(C_5\). Six-qubit \(2\)-resistant stabilizer states exist in three distinct local Clifford classes, whereas no seven-qubit stabilizer state is \(m\)-resistant for any nonzero admissible \(m\). Finally, we prove that the cycle graph states \(\ket{C_N}\) with \(N\ge 7\) are not \(m\)-resistant for any \(0\le m\le N-2\).

quant-pharXiv:2606.08561•Jun 9, 2026•1 citation

Local unitary equivalence and entanglement of multipartite pure states

Barbara Kraus

The necessary and sufficient conditions for the equivalence of arbitrary $n$-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two $n$-qubit states (with $n>2$ arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.

arXiv:1005.5295•Physical Review A•Sep 30, 2010•89 citations

Entanglement in the Dicke subspace

Aabhas Gulati, Ion Nechita, Clément Pellegrini

We provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits, disproving a recent conjecture. We establish that PPT entanglement exists for all multipartite systems with local dimension d >= 3 and n >= 3 parties. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies all other PPT conditions. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.

quant-pharXiv:2602.15800•Quantum•Feb 18, 2026•4 citations
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)(N\ensuremath{-}k)(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.
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.
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.
A pure quantum state of NNN subsystems with ddd levels each is called kkk-multipartite maximally entangled state, which we call a kkk-uniform state, if all its reductions to kkk qudits are maximally mixed. These states form a natural generalization of NNN-qudit Greenberger-Horne-Zeilinger states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and kkk-uniform states and prove the existence of several classes of such states for NNN-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of N>5N>5N>5 qubits. We show that finding a different class of 2-uniform states would imply the Hadamard conjecture, so the full classification of 2-uniform states seems to be currently out of reach. Furthermore, we establish links between the existence of kkk-uniform states and classical and quantum error correction codes and provide a graph representation for such states.
We study particle-loss resistant entanglement within the framework of stabilizer and graph states. A pure state is mmm-resistant if it remains entangled after the loss of any mmm particles and becomes fully separable after the loss of any m+1m+1m+1 particles. The smallest previously unresolved qubit case was the existence of a five-qubit 111-resistant pure state, which is resolved here by the five-cycle graph state ∣C5⟩\ket{C_5}∣C5​⟩. A stabilizer-subgroup method is also developed for verifying mmm-resistance in graph states, using local stabilizers to certify full separability and exact negative partial transpose~(NPT) witnesses to certify entanglement. Applying this to all graph states associated with non-isomorphic graphs on five, six, and seven vertices, we obtain a graph state classification up to local Clifford equivalence, which also classifies stabilizer states up to local Clifford equivalence. Thus, the five-qubit 111-resistant stabilizer states are exactly the local Clifford class of C5C_5C5​. Six-qubit 222-resistant stabilizer states exist in three distinct local Clifford classes, whereas no seven-qubit stabilizer state is mmm-resistant for any nonzero admissible mmm. Finally, we prove that the cycle graph states ∣CN⟩\ket{C_N}∣CN​⟩ with N≥7N\ge 7N≥7 are not mmm-resistant for any 0≤m≤N−20\le m\le N-20≤m≤N−2.
The necessary and sufficient conditions for the equivalence of arbitrary nnn-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two nnn-qubit states (with n>2n>2n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.
We provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits, disproving a recent conjecture. We establish that PPT entanglement exists for all multipartite systems with local dimension d >= 3 and n >= 3 parties. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies all other PPT conditions. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.