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:1105.5720 · Physical Review Letters

Detection of Multiparticle Entanglement: Quantifying the Search for Symmetric Extensions

Fernando G. S. L. Brandão, Matthias Christandl

Published Oct 17, 2012• 27 citations
arXivHTMLPDF

Abstract

We provide quantitative bounds on the characterization of multiparticle separable states by states that have locally symmetric extensions. The bounds are derived from two-particle bounds and relate to recent studies on quantum versions of de Finetti's theorem. We discuss algorithmic applications of our results, in particular a quasipolynomial-time algorithm to decide whether a multiparticle quantum state is separable or entangled (for constant number of particles and constant error in the norm induced by one-way local operations and classical communication, or in the Frobenius norm). Our results provide a theoretical justification for the use of the search for symmetric extensions as a test for multiparticle entanglement.

DOI
10.1103/physrevlett.109.160502

Related papers

Power of symmetric extensions for entanglement detection

Miguel Navascués, Masaki Owari, Martin Bodo Plenio

In this paper, we present progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order $O(1/N)$ is sufficient and, in general, necessary to destroy the entanglement of any state admitting an $N$ Bose-symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from $N$ Bose-symmetric extensions with positive partial transpose (PPT) decreases at least as fast as $O(1/{N}^{2})$. From these results, we derive upper bounds on the time and space complexity of the weak membership problem of separability when attacked via algorithms that search for PPT-symmetric extensions. Finally, we show how to estimate the error we incur when we approximate the set of separable states by the set of (PPT) $N$-extendable quantum states in order to compute the maximum average fidelity in pure state estimation problems, the maximal output purity of quantum channels, and the geometric measure of entanglement.

arXiv:0906.2731•Physical Review A•Nov 6, 2009•80 citations

Development of new tools to detect, characterize and quantify quantum entanglement in multipartite systems

Antoine Neven

Quantum entanglement is a key property of quantum information theory, that is at the heart of numerous promising applications in fields such as quantum cryptography, quantum computing or quantum sensing. In the past decades, the advent of such innovative technologies has reinforced the need for a better understanding of entanglement. The aim of this thesis is to contribute to this effort through the development of new tools targeting the characterization of several features of entanglement. Concerning the issue of entanglement detection, we present an optimization of the approach that exploits the concept of generalized concurrences to solve the separability problem for pure states. We then reformulate the separability question of mixed states into a matrix analysis problem, from which we obtain general separability criteria for multipartite states of ranks two and three. We also briefly discuss some properties of separable states. In particular, we characterize optimal separable decompositions of symmetric (i.e. permutation invariant) states of two and three qubits with maximal rank properties. Regarding the quantification of entanglement, we propose a function to quantify the entanglement of symmetric multiqubit states within classes of entangled states gathering states that are stochastically equivalent through local operations assisted with classical communication. This function establishes a link between the amount of entanglement of a symmetric state and the distribution of its Majorana points on the Bloch sphere. We finally investigate the robustness of entanglement with respect to particle loss and provide a full description of all multiqubit states that are fragile for the loss of one of their qubits. For symmetric states, the fragility for the loss of one qubit is shown to be related to a particular symmetry of the Majorana points.

•Oct 10, 2018•0 citations

Multiparticle entanglement and its experimental detection

Wolfgang Dür, J. I. Cirac

We discuss several aspects of multiparticle mixed-state entanglement and its experimental detection. First we consider entanglement between two particles which is robust against disposals of other particles. To completely detect these kinds of entanglement, full knowledge of the multiparticle density matrix (or of all reduced density matrices) is required. Then we review the relation of the separability properties of l -partite splittings of a state ρ to its multipartite entanglement properties. We show that it suffices to determine the diagonal matrix elements of ρ in a certain basis in order to detect multiparticle entanglement properties of ρ. We apply these observations to analyse two recent experiments, where multiparticle entangled states of 3 (4) particles were produced. Finally, we focus on bound entangled states (non-separable, non-distillable states) and show that they can be activated by joint actions of the parties. We also provide several examples which show the activation of bound entanglement with bound entanglement.

arXiv:quant-ph/0011025•Journal of Physics A Mathematical and General•Aug 24, 2001•44 citations

Entanglement and the shareability of quantum states

Andrew C. Doherty

This brief review discusses the problem of determining whether a given quantum state is separable or entangled. I describe an established approach to this problem that is based on the monogamy of entanglement, which is the observation that a pair of quantum systems that are strongly entangled must be uncorrelated with the rest of the world. Unentangled states on the other hand involve correlations that can be shared with many other parties. Checking whether a given quantum state is shareable involves constructing certain symmetric quantum state extensions and I discuss how to do this using a class of optimizations known as semidefinite programs. An attractive feature of this approach is that it generates explicit entanglement witnesses that can be measured to demonstrate the entanglement experimentally. In recent years analysis of this approach has greatly increased our understanding of the complexity of determining whether a given quantum state is entangled and this review aims to give a unified discussion of these developments. Specifically, I describe how to use finite quantum de Finetti theorems to prove that highly shareable states are nearly separable and use these results to understand the computational complexity of the problem. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.

Journal of Physics A Mathematical and Theoretical•Oct 9, 2014•19 citations

Multiparticle entanglement criteria for nonsymmetric collective variances

Oliver Marty, M. Cramer, Giuseppe Vitagliano +2 more

We introduce a general scheme to detect various multiparticle entanglement structures from global non-permutationally invariant observables. In particular, we derive bounds on the variance of non-permutationally invariant and collective operators for the verification of $k$-party entanglement. For a family of observables related to the spin structure factor, we give quantitative bounds on entanglement that are independent of the total number of particles. We introduce highly non-symmetric states with genuine multipartite entanglement that is verifiable with the presented technique and discuss how they can be prepared with trapped ions exploiting the high degree of control in these systems. As a special case, our framework provides an alternative approach to obtain a tight relaxation of the entanglement criterion by Sø rensen and Mø lmer [Phys. Rev. Lett. 86, 4431 (2001)] that is free from technical assumptions and allows to calculate the bounds with an improved scaling in the detectable depth.

arXiv:1708.06986•Aug 23, 2017•2 citations

Detecting multipartite entanglement

Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri

We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state extensions with appropriate properties and may be implemented as a semidefinite program. The main result of this work is to show that there is a series of tests of this kind such that if a multiparty state is entangled this will eventually be detected by one of the tests. The procedure also provides a means of constructing entanglement witnesses that could in principle be measured in order to demonstrate that the state is entangled.

arXiv:quant-ph/0407143•Physical Review A•Mar 22, 2005•122 citations
We provide quantitative bounds on the characterization of multiparticle separable states by states that have locally symmetric extensions. The bounds are derived from two-particle bounds and relate to recent studies on quantum versions of de Finetti's theorem. We discuss algorithmic applications of our results, in particular a quasipolynomial-time algorithm to decide whether a multiparticle quantum state is separable or entangled (for constant number of particles and constant error in the norm induced by one-way local operations and classical communication, or in the Frobenius norm). Our results provide a theoretical justification for the use of the search for symmetric extensions as a test for multiparticle entanglement.
In this paper, we present progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N)O(1/N)O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state admitting an NNN Bose-symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from NNN Bose-symmetric extensions with positive partial transpose (PPT) decreases at least as fast as O(1/N2)O(1/{N}^{2})O(1/N2). From these results, we derive upper bounds on the time and space complexity of the weak membership problem of separability when attacked via algorithms that search for PPT-symmetric extensions. Finally, we show how to estimate the error we incur when we approximate the set of separable states by the set of (PPT) NNN-extendable quantum states in order to compute the maximum average fidelity in pure state estimation problems, the maximal output purity of quantum channels, and the geometric measure of entanglement.
Quantum entanglement is a key property of quantum information theory, that is at the heart of numerous promising applications in fields such as quantum cryptography, quantum computing or quantum sensing. In the past decades, the advent of such innovative technologies has reinforced the need for a better understanding of entanglement. The aim of this thesis is to contribute to this effort through the development of new tools targeting the characterization of several features of entanglement. Concerning the issue of entanglement detection, we present an optimization of the approach that exploits the concept of generalized concurrences to solve the separability problem for pure states. We then reformulate the separability question of mixed states into a matrix analysis problem, from which we obtain general separability criteria for multipartite states of ranks two and three. We also briefly discuss some properties of separable states. In particular, we characterize optimal separable decompositions of symmetric (i.e. permutation invariant) states of two and three qubits with maximal rank properties. Regarding the quantification of entanglement, we propose a function to quantify the entanglement of symmetric multiqubit states within classes of entangled states gathering states that are stochastically equivalent through local operations assisted with classical communication. This function establishes a link between the amount of entanglement of a symmetric state and the distribution of its Majorana points on the Bloch sphere. We finally investigate the robustness of entanglement with respect to particle loss and provide a full description of all multiqubit states that are fragile for the loss of one of their qubits. For symmetric states, the fragility for the loss of one qubit is shown to be related to a particular symmetry of the Majorana points.
We discuss several aspects of multiparticle mixed-state entanglement and its experimental detection. First we consider entanglement between two particles which is robust against disposals of other particles. To completely detect these kinds of entanglement, full knowledge of the multiparticle density matrix (or of all reduced density matrices) is required. Then we review the relation of the separability properties of l -partite splittings of a state ρ to its multipartite entanglement properties. We show that it suffices to determine the diagonal matrix elements of ρ in a certain basis in order to detect multiparticle entanglement properties of ρ. We apply these observations to analyse two recent experiments, where multiparticle entangled states of 3 (4) particles were produced. Finally, we focus on bound entangled states (non-separable, non-distillable states) and show that they can be activated by joint actions of the parties. We also provide several examples which show the activation of bound entanglement with bound entanglement.
This brief review discusses the problem of determining whether a given quantum state is separable or entangled. I describe an established approach to this problem that is based on the monogamy of entanglement, which is the observation that a pair of quantum systems that are strongly entangled must be uncorrelated with the rest of the world. Unentangled states on the other hand involve correlations that can be shared with many other parties. Checking whether a given quantum state is shareable involves constructing certain symmetric quantum state extensions and I discuss how to do this using a class of optimizations known as semidefinite programs. An attractive feature of this approach is that it generates explicit entanglement witnesses that can be measured to demonstrate the entanglement experimentally. In recent years analysis of this approach has greatly increased our understanding of the complexity of determining whether a given quantum state is entangled and this review aims to give a unified discussion of these developments. Specifically, I describe how to use finite quantum de Finetti theorems to prove that highly shareable states are nearly separable and use these results to understand the computational complexity of the problem. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.
We introduce a general scheme to detect various multiparticle entanglement structures from global non-permutationally invariant observables. In particular, we derive bounds on the variance of non-permutationally invariant and collective operators for the verification of kkk-party entanglement. For a family of observables related to the spin structure factor, we give quantitative bounds on entanglement that are independent of the total number of particles. We introduce highly non-symmetric states with genuine multipartite entanglement that is verifiable with the presented technique and discuss how they can be prepared with trapped ions exploiting the high degree of control in these systems. As a special case, our framework provides an alternative approach to obtain a tight relaxation of the entanglement criterion by Sø rensen and Mø lmer [Phys. Rev. Lett. 86, 4431 (2001)] that is free from technical assumptions and allows to calculate the bounds with an improved scaling in the detectable depth.
We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state extensions with appropriate properties and may be implemented as a semidefinite program. The main result of this work is to show that there is a series of tests of this kind such that if a multiparty state is entangled this will eventually be detected by one of the tests. The procedure also provides a means of constructing entanglement witnesses that could in principle be measured in order to demonstrate that the state is entangled.