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

Robustness of many-qubit entanglement under general decoherence

Somshubhro Bandyopadhyay, Daniel A. Lidar

Published Aug 29, 2004• 1 citation
OpenAlex

Abstract

We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of N-party entanglement is studied in the large N limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes macroscopic (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain threshold conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions.

Related papers

Robustness of multiqubit entanglement in the independent decoherence model

Somshubhro Bandyopadhyay, Daniel A. Lidar

We study the robustness of the Greenberger-Horne-Zeilinger (``cat'') class of multipartite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of $N$-party entanglement is studied in the large $N$ limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes large and (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions.

arXiv:quant-ph/0408174•Physical Review A•Oct 31, 2005•38 citations

Robustness of multiparty entanglement

Christoph Simon, Julia Kempe

We study the robustness of multiparty entanglement under local decoherence, modeled by partially depolarizing channels acting independently on each subsystem. Surprisingly, we find that the robustness of (GHZ) entanglement increases with the number of qubits. An n-qubit Greenberger-Horne-Zeilinger (GHZ) state can stand more than 55% local depolarization in the limit $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\infty}.$ GHZ states are more robust than other generic states of three and four qubits. We also study spin-squeezed states in the limit $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\infty}$ and find that they too can stand considerable local depolarization.

arXiv:quant-ph/0109102•Physical Review A•May 9, 2002•168 citations

Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity

Fernando Lledó, Carlos Palazuelos, Julio I. de Vicente

Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been recently shown that when the links are noisy two drastically different behaviors can occur regarding the global entanglement properties of the network. While in certain configurations the network displays genuine multipartite entanglement (GME) for any system size provided the noise level is below a certain threshold, in others GME is washed out if the system size is big enough for any fixed non-zero level of noise. However, this difference has only been established considering the two extreme cases of maximally and minimally connected networks (i.e. complete graphs versus trees, respectively). In this article we investigate this question much more in depth and relate this behavior to the growth of several graph theoretic parameters that measure the connectivity of the graph sequence that codifies the structure of the network as the number of parties increases. The strongest conditions are obtained when considering the degree growth. Our main results are that a sufficiently fast degree growth (i.e. Ω ( N ) , where N is the size of the network) is sufficient for asymptotic robustness of GME, while if it is sufficiently slow (i.e. o ( log ⁡ N ) ) then the network becomes asymptotically biseparable. We also present several explicit constructions related to the optimality of these results.

arXiv:2411.12548•Quantum•Dec 31, 2025•0 citations

Robustness of entanglement

Guifré Vidal, R. Tarrach

In the quest to completely describe entanglement in the general case of a finite number of parties sharing a physical system of finite-dimensional Hilbert space an entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurance of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of two-party systems, and analytical bounds for mixed states of two-party systems. Specific results are obtained mainly for the qubit-qubit system (qubit denotes quantum bit). As by-products local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced, and arguments for considering convexity a necessary condition of any entanglement measure are put forward.

arXiv:quant-ph/9806094•Physical Review A•Jan 1, 1999•600 citations

Necessary and sufficient criterion for k-separability of N-qubit noisy GHZ states

Xiaoyu Chen, Li-zhen Jiang, Zhu‐An Xu

A Multipartite entangled state has many different kinds of entanglements specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger–Horne–Zeilinger (GHZ) state in white noise. We explicitly construct the entanglement witnesses for these states with stabilizer generators of the GHZ states. For an [Formula: see text] qubit GHZ state in white noise, we demonstrate the necessary and sufficient criterion of separability when it is divided into [Formula: see text] parties with [Formula: see text] for arbitrary [Formula: see text] and [Formula: see text]. The criterion covers more than a half of all kinds of partial entanglements for [Formula: see text]-qubit GHZ states in white noise. For the rest of multipartite entanglement problems, we present a method to obtain the sufficient conditions of separability. As an application, we consider [Formula: see text] qubit GHZ state as a codeword of the degenerate quantum code passing through depolarizing channel. We find that the output state is neither genuinely entangled nor fully separable when the quantum channel capacity reduces from positive to zero.

arXiv:1605.08496•International Journal of Quantum Information•Jun 1, 2018•10 citations

Size-Independent Robustness in Multipartite Bell Self-Testing

Shen Cao, Xingjian Zhang, Fei Shi +1 more

Practical robust self-testing of multipartite entanglement has so far been restricted to small-scale systems due to error bounds that degrade severely with system size. In this work, we establish multipartite self-testing with robustness independent of the size of the quantum network. We derive a fully analytic, device-independent self-testing bound for $n$-qubit Greenberger-Horne-Zeilinger (GHZ) states. The bound scales linearly with the observed violation error and lies universally within a constant factor of two from a theoretical upper bound. Furthermore, the operator-inequality framework reduces the verification of the conjectured optimal bound to a highly efficient numerical check, which we perform up to $n=100$. Consequently, GHZ entanglement can be certified under a fixed noise level in arbitrarily large systems, enabling scalable device-independent verification.

quant-pharXiv:2608.30851•Sep 1, 2026•0 citations
We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of N-party entanglement is studied in the large N limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes macroscopic (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain threshold conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions.
We study the robustness of the Greenberger-Horne-Zeilinger (``cat'') class of multipartite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of NNN-party entanglement is studied in the large NNN limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes large and (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions.
We study the robustness of multiparty entanglement under local decoherence, modeled by partially depolarizing channels acting independently on each subsystem. Surprisingly, we find that the robustness of (GHZ) entanglement increases with the number of qubits. An n-qubit Greenberger-Horne-Zeilinger (GHZ) state can stand more than 55% local depolarization in the limit $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\infty}.$ GHZ states are more robust than other generic states of three and four qubits. We also study spin-squeezed states in the limit $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\infty}$ and find that they too can stand considerable local depolarization.
Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been recently shown that when the links are noisy two drastically different behaviors can occur regarding the global entanglement properties of the network. While in certain configurations the network displays genuine multipartite entanglement (GME) for any system size provided the noise level is below a certain threshold, in others GME is washed out if the system size is big enough for any fixed non-zero level of noise. However, this difference has only been established considering the two extreme cases of maximally and minimally connected networks (i.e. complete graphs versus trees, respectively). In this article we investigate this question much more in depth and relate this behavior to the growth of several graph theoretic parameters that measure the connectivity of the graph sequence that codifies the structure of the network as the number of parties increases. The strongest conditions are obtained when considering the degree growth. Our main results are that a sufficiently fast degree growth (i.e. Ω ( N ) , where N is the size of the network) is sufficient for asymptotic robustness of GME, while if it is sufficiently slow (i.e. o ( log ⁡ N ) ) then the network becomes asymptotically biseparable. We also present several explicit constructions related to the optimality of these results.
In the quest to completely describe entanglement in the general case of a finite number of parties sharing a physical system of finite-dimensional Hilbert space an entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurance of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of two-party systems, and analytical bounds for mixed states of two-party systems. Specific results are obtained mainly for the qubit-qubit system (qubit denotes quantum bit). As by-products local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced, and arguments for considering convexity a necessary condition of any entanglement measure are put forward.
A Multipartite entangled state has many different kinds of entanglements specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger–Horne–Zeilinger (GHZ) state in white noise. We explicitly construct the entanglement witnesses for these states with stabilizer generators of the GHZ states. For an [Formula: see text] qubit GHZ state in white noise, we demonstrate the necessary and sufficient criterion of separability when it is divided into [Formula: see text] parties with [Formula: see text] for arbitrary [Formula: see text] and [Formula: see text]. The criterion covers more than a half of all kinds of partial entanglements for [Formula: see text]-qubit GHZ states in white noise. For the rest of multipartite entanglement problems, we present a method to obtain the sufficient conditions of separability. As an application, we consider [Formula: see text] qubit GHZ state as a codeword of the degenerate quantum code passing through depolarizing channel. We find that the output state is neither genuinely entangled nor fully separable when the quantum channel capacity reduces from positive to zero.
Practical robust self-testing of multipartite entanglement has so far been restricted to small-scale systems due to error bounds that degrade severely with system size. In this work, we establish multipartite self-testing with robustness independent of the size of the quantum network. We derive a fully analytic, device-independent self-testing bound for nnn-qubit Greenberger-Horne-Zeilinger (GHZ) states. The bound scales linearly with the observed violation error and lies universally within a constant factor of two from a theoretical upper bound. Furthermore, the operator-inequality framework reduces the verification of the conjectured optimal bound to a highly efficient numerical check, which we perform up to n=100n=100n=100. Consequently, GHZ entanglement can be certified under a fixed noise level in arbitrarily large systems, enabling scalable device-independent verification.