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

Robustness of entanglement as a resource

Rafael Chaves, L. Davidovich

Published Nov 11, 2010• 39 citations
arXivHTMLPDF

Abstract

The robustness of multipartite entanglement of systems undergoing decoherence is of central importance to the area of quantum information. Its characterization depends, however, on the measure used to quantify entanglement and on how one partitions the system. Here we show that the unambiguous assessment of the robustness of multipartite entanglement is obtained by considering the loss of functionality in terms of two communication tasks, namely the splitting of information between many parties and the teleportation of states.

DOI
10.1103/physreva.82.052308

Related papers

Genuine multipartite entanglement measures based on multi-party teleportation capability

Minjin Choi, Eunok Bae, Soojoon Lee

Quantifying entanglement is vital to understand entanglement as a resource in quantum information processing, and many entanglement measures have been suggested for this purpose. When mathematically defining an entanglement measure, we should consider the distinguishability between entangled and separable states, the invariance under local transformation, the monotonicity under local operations and classical communication, and the convexity. These are reasonable requirements but may be insufficient, in particular when taking into account the usefulness of quantum states in multi-party quantum information processing. Therefore, if we want to investigate multipartite entanglement as a resource, then it can be necessary to consider the usefulness of quantum states in multi-party quantum information processing when we define a multipartite entanglement measure. In this paper, we define new multipartite entanglement measures for three-qubit systems based on the three-party teleportation capability, and show that these entanglement measures satisfy the requirements for being genuine multipartite entanglement measures. We also generalize our entanglement measures for N-qubit systems, where [Formula: see text], and discuss that these quantities may be good candidates to measure genuine multipartite entanglement.

arXiv:2211.15986•Scientific Reports•Sep 11, 2023•14 citations

Determining the Dynamics of Entanglement

O. Jiménez Farías, Camille Lombard Latune, Stephen Patrick Walborn +2 more

The estimation of the entanglement of multipartite systems undergoing decoherence is important for assessing the robustness of quantum information processes. It usually requires access to the final state and its full reconstruction through quantum tomography. General dynamical laws may simplify this task. We found that when one of the parties of an initially entangled two-qubit system is subject to a noisy channel, a single universal curve describes the dynamics of entanglement for both pure and mixed states, including those for which entanglement suddenly disappears. Our result, which is experimentally demonstrated using a linear optics setup, leads to a direct and efficient determination of entanglement through the knowledge of the initial state and single-party process tomography alone, foregoing the need to reconstruct the final state.

Science•May 15, 2009•71 citations

Entanglement in Two and Three Quantum Mechanical Systems

L. M. Arvalo Aguilar, M. M. Mndez Otero, P. Mastranzo

Entanglement is one of most peculiar characteristic of Quantum Mechanics (probably the other most mentioned is the particle tunneling through a barrier) because it entails correlations that supersedes classical correlations. It is conceived as the genuine quantum characteristic by many researchers and quite recently it has emerged as a physical resource to produce non-classical task, like quantum teleportation, quantum cryptography and quantum information. Entanglement could be distributed (efficient quantum communication is equivalent to efficient entanglement distribution (Plenio & Virmani, 2007)), concentrated (given an amount of entanglement, equal to the full content of entanglement in n pairs of identical entangled pure state systems, it is possible, using local operations on each system, to concentrate the total amount of entanglement into a smaller number m, m < n, of maximally pure entangled state system (Bennett, et al.; 1996)) and used to perform many quantum information tasks useful to overcome technical restrictions present on classical communication. In this chapter, we review the entanglement of quantum mechanical systems. First, in Section 2, we give a characterization of entanglement in terms of its special features as resource and its mathematical structure. Then, in section 3, we review some of the Bell inequalities. In Sections 4 and 5, we review some of the most important entanglement measures published for two and three entangled systems. After that, in Section 6, we give a characterization of quantum gates and operators by its entanglement power, i. e. the amount of entanglement that they can produce when acting on an arbitrary state. Finally, in Section 7, we briefly review the experimental detection of entanglement.

InTech eBooks•Feb 22, 2012•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•608 citations

On measures of quantum entanglement — A brief review

Debasis Sarkar

Entanglement is one of the most useful resources in quantum information processing. It is effectively the quantum correlation between different subsystems of a composite system. Mathematically, one of the most hard tasks in quantum mechanics is to quantify entanglement. However, progress in this field is remarkable but not complete yet. There are many things to do with quantification of entanglement. In this review, we will discuss some of the important measures of bipartite entanglement.

International Journal of Quantum Information•Aug 18, 2016•1 citation

Practical limitations on robustness and scalability of quantum Internet

Abhishek Sadhu, Meghana Ayyala Somayajula, Karol Horodecki +1 more

Abstract The realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, and fragility of quantum states under measurement. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of the quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. In particular, we show that the device-independent quantum key distribution (DI-QKD) network of isotropic states with parameter p has a finite diameter depending on p . Motivated by the power of abstraction in graph theory (in association with quantum information theory), that allows us to consider the topology of a network of users spatially separated over long distances around the globe or separated as nodes within the small space over a processor or circuit within a same framework, we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation, that are desirable for all scale of quantum networks, be it quantum processors or quantum Internet.

arXiv:2308.12739•Quantum Information Processing•Oct 28, 2026•19 citations
The robustness of multipartite entanglement of systems undergoing decoherence is of central importance to the area of quantum information. Its characterization depends, however, on the measure used to quantify entanglement and on how one partitions the system. Here we show that the unambiguous assessment of the robustness of multipartite entanglement is obtained by considering the loss of functionality in terms of two communication tasks, namely the splitting of information between many parties and the teleportation of states.
Quantifying entanglement is vital to understand entanglement as a resource in quantum information processing, and many entanglement measures have been suggested for this purpose. When mathematically defining an entanglement measure, we should consider the distinguishability between entangled and separable states, the invariance under local transformation, the monotonicity under local operations and classical communication, and the convexity. These are reasonable requirements but may be insufficient, in particular when taking into account the usefulness of quantum states in multi-party quantum information processing. Therefore, if we want to investigate multipartite entanglement as a resource, then it can be necessary to consider the usefulness of quantum states in multi-party quantum information processing when we define a multipartite entanglement measure. In this paper, we define new multipartite entanglement measures for three-qubit systems based on the three-party teleportation capability, and show that these entanglement measures satisfy the requirements for being genuine multipartite entanglement measures. We also generalize our entanglement measures for N-qubit systems, where [Formula: see text], and discuss that these quantities may be good candidates to measure genuine multipartite entanglement.
The estimation of the entanglement of multipartite systems undergoing decoherence is important for assessing the robustness of quantum information processes. It usually requires access to the final state and its full reconstruction through quantum tomography. General dynamical laws may simplify this task. We found that when one of the parties of an initially entangled two-qubit system is subject to a noisy channel, a single universal curve describes the dynamics of entanglement for both pure and mixed states, including those for which entanglement suddenly disappears. Our result, which is experimentally demonstrated using a linear optics setup, leads to a direct and efficient determination of entanglement through the knowledge of the initial state and single-party process tomography alone, foregoing the need to reconstruct the final state.
Entanglement is one of most peculiar characteristic of Quantum Mechanics (probably the other most mentioned is the particle tunneling through a barrier) because it entails correlations that supersedes classical correlations. It is conceived as the genuine quantum characteristic by many researchers and quite recently it has emerged as a physical resource to produce non-classical task, like quantum teleportation, quantum cryptography and quantum information. Entanglement could be distributed (efficient quantum communication is equivalent to efficient entanglement distribution (Plenio & Virmani, 2007)), concentrated (given an amount of entanglement, equal to the full content of entanglement in n pairs of identical entangled pure state systems, it is possible, using local operations on each system, to concentrate the total amount of entanglement into a smaller number m, m < n, of maximally pure entangled state system (Bennett, et al.; 1996)) and used to perform many quantum information tasks useful to overcome technical restrictions present on classical communication. In this chapter, we review the entanglement of quantum mechanical systems. First, in Section 2, we give a characterization of entanglement in terms of its special features as resource and its mathematical structure. Then, in section 3, we review some of the Bell inequalities. In Sections 4 and 5, we review some of the most important entanglement measures published for two and three entangled systems. After that, in Section 6, we give a characterization of quantum gates and operators by its entanglement power, i. e. the amount of entanglement that they can produce when acting on an arbitrary state. Finally, in Section 7, we briefly review the experimental detection of entanglement.
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.
Abstract The realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, and fragility of quantum states under measurement. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of the quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. In particular, we show that the device-independent quantum key distribution (DI-QKD) network of isotropic states with parameter p has a finite diameter depending on p . Motivated by the power of abstraction in graph theory (in association with quantum information theory), that allows us to consider the topology of a network of users spatially separated over long distances around the globe or separated as nodes within the small space over a processor or circuit within a same framework, we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation, that are desirable for all scale of quantum networks, be it quantum processors or quantum Internet.