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

Quantifying multipartite quantum entanglement in a semi-device-independent manner

Lijinzhi Lin, Zhaohui Wei

Published Dec 20, 2021• 3 citations
arXivHTMLPDF

Abstract

We propose two semi-device-independent approaches that are able to quantify unknown multipartite quantum entanglement experimentally, where the only information that has to be known beforehand is quantum dimension, and the concept that plays a key role is nondegenerate Bell inequalities. Specifically, using the nondegeneracy of multipartite Bell inequalities, we obtain useful information on the purity of target quantum state. Combined with an estimate of the maximal overlap between the target state and pure product states, and a continuous property of the geometric measure of entanglement, we shall prove the information on purity allows us to give a lower bound for this entanglement measure. In addition, we show that a different combination of the above results also converts to a lower bound for the relative entropy of entanglement. As a demonstration, we apply our approach on 5-partite qubit systems with the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality, and show that useful lower bounds for the geometric measure of entanglement can be obtained if the Bell expression value is larger than 3.60, and those for the relative entropy of entanglement can be given if the Bell expression value is larger than 3.80, where the Tsirelson bound is 4.

DOI
10.1103/physreva.104.062433

Related papers

Analytic semi-device-independent entanglement quantification for bipartite quantum states

Zhaohui Wei, Lijinzhi Lin

We define a property called nondegeneracy for Bell inequalities, which describes the situation that in a Bell setting, if a Bell inequality and involved local measurements are fixed, any quantum state with a given dimension and its orthogonal quantum state cannot violate remarkably the inequality simultaneously. By choosing a proper nondegenerate Bell inequality, we prove that for an unknown bipartite quantum state of given dimension, based on the measurement statistics only, we can provide an analytic lower bound for the entanglement of formation or even the distillable entanglement, making the whole process semi device independent. We characterize the mathematical structure of nondegeneracy, and prove that quite a lot of well-known Bell inequalities are nondegenerate. We demonstrate our approach by quantifying entanglement for qutrit-qutrit states based on their violations of the Collins-Gisin-Linden-Masser-Popescu inequality.

arXiv:1903.05303•Physical Review A•Mar 17, 2021•4 citations

Semi-device-independent bounds on entanglement

Yeong-Cherng Liang, Tamás Vértesi, Nicolas Brunner

Detection and quantification of entanglement in quantum resources are two key steps in the implementation of various quantum-information processing tasks. Here, we show that Bell-type inequalities are not only useful in verifying the presence of entanglement but can also be used to bound the entanglement of the underlying physical system. Our main tool consists of a family of Clauser-Horne-like Bell inequalities that cannot be violated maximally by any finite-dimensional maximally entangled state. Using these inequalities, we demonstrate the explicit construction of both lower and upper bounds on the concurrence for two-qubit states. The fact that these bounds arise from Bell-type inequalities also allows them to be obtained in a semi-device-independent manner, that is, with assumption of the dimension of the Hilbert space but without resorting to any knowledge of the actual measurements being performed on the individual subsystems.

arXiv:1012.1513•Physical Review A•Feb 24, 2011•84 citations

Entropy Bounds for Multiparty Device-Independent Cryptography

Federico Grasselli, Gláucia Murta, Hermann Kampermann +1 more

Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks.The security of many multipartite device-independent (DI) protocols, such as DI conference-key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality.We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes.From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improves previous results.We obtain the entropy bounds thanks to two general results of independent interest.The first one drastically simplifies the quantum setup of an N -partite Bell scenario.The second one provides an upper bound on the violation of the MABK inequality by an arbitrary N -qubit state, as a function of the state's parameters.

arXiv:2004.14263•PRX Quantum•Jan 14, 2021•27 citations

Quantifying Multipartite Entanglement Based on unified entropy

Yan Hong, Tongtong Xu, Limin Gao

In this paper, we investigate the characterization of multipartite entanglement based on the unified $(q,s)$-entropy framework. For bipartite quantum states, we propose an entanglement measure $E_{q,s}^{A|B}(ρ)$ based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ for quantifying $k$-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters $q$ and $s$ are in certain ranges, $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ with respect to the parameters $q$ and $s$ for fixed quantum states. In addition, for fixed $q$ and $s$, we also give their order relations for any two pure states.

quant-pharXiv:2608.22684•Aug 25, 2026•0 citations

Semi-device-independent characterization of multipartite entanglement of states and measurements

Armin Tavakoli, Alastair A. Abbott, Marc-Olivier Renou +2 more

The semi-device-independent framework allows one to draw conclusions about properties of an unknown quantum system under weak assumptions. Here we present a semi-device-independent scheme for the characterization of multipartite entanglement based around a game played by several isolated parties whose devices are uncharacterized beyond an assumption about the dimension of their Hilbert spaces. Our scheme can simultaneously certify that an $n$-partite high-dimensional quantum state features genuine multipartite entanglement, and that a joint measurement on $n$ subsystems is entangled. Moreover, it provides a lower bound on the number of entangled measurement operators. These tests are strongly robust to noise, and even optimal for certain classes of states and measurements, as we demonstrate with illustrative examples. Notably, our scheme allows the certification of many entangled states admitting a local model, which therefore cannot violate any Bell inequality.

arXiv:1805.00377•Physical Review A•Nov 26, 2018•32 citations

Non-restrictive state reduction and analytical bounds in a multipartite device-independent scenario

Federico Grasselli, Gláucia Murta, Hermann Kampermann +1 more

Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks. The security of many multipartite device-independent (DI) protocols, such as DI conference key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality. We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes. From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improve previous results. We obtain the entropy bounds thanks to two general results of independent interest. The first one drastically simplifies the quantum setup of an $N$-partite Bell scenario. The second one provides an upper bound on the violation of the MABK inequality by an arbitrary $N$-qubit state, as a function of the state's parameters.

•Apr 29, 2020•0 citations
We propose two semi-device-independent approaches that are able to quantify unknown multipartite quantum entanglement experimentally, where the only information that has to be known beforehand is quantum dimension, and the concept that plays a key role is nondegenerate Bell inequalities. Specifically, using the nondegeneracy of multipartite Bell inequalities, we obtain useful information on the purity of target quantum state. Combined with an estimate of the maximal overlap between the target state and pure product states, and a continuous property of the geometric measure of entanglement, we shall prove the information on purity allows us to give a lower bound for this entanglement measure. In addition, we show that a different combination of the above results also converts to a lower bound for the relative entropy of entanglement. As a demonstration, we apply our approach on 5-partite qubit systems with the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality, and show that useful lower bounds for the geometric measure of entanglement can be obtained if the Bell expression value is larger than 3.60, and those for the relative entropy of entanglement can be given if the Bell expression value is larger than 3.80, where the Tsirelson bound is 4.
We define a property called nondegeneracy for Bell inequalities, which describes the situation that in a Bell setting, if a Bell inequality and involved local measurements are fixed, any quantum state with a given dimension and its orthogonal quantum state cannot violate remarkably the inequality simultaneously. By choosing a proper nondegenerate Bell inequality, we prove that for an unknown bipartite quantum state of given dimension, based on the measurement statistics only, we can provide an analytic lower bound for the entanglement of formation or even the distillable entanglement, making the whole process semi device independent. We characterize the mathematical structure of nondegeneracy, and prove that quite a lot of well-known Bell inequalities are nondegenerate. We demonstrate our approach by quantifying entanglement for qutrit-qutrit states based on their violations of the Collins-Gisin-Linden-Masser-Popescu inequality.
Detection and quantification of entanglement in quantum resources are two key steps in the implementation of various quantum-information processing tasks. Here, we show that Bell-type inequalities are not only useful in verifying the presence of entanglement but can also be used to bound the entanglement of the underlying physical system. Our main tool consists of a family of Clauser-Horne-like Bell inequalities that cannot be violated maximally by any finite-dimensional maximally entangled state. Using these inequalities, we demonstrate the explicit construction of both lower and upper bounds on the concurrence for two-qubit states. The fact that these bounds arise from Bell-type inequalities also allows them to be obtained in a semi-device-independent manner, that is, with assumption of the dimension of the Hilbert space but without resorting to any knowledge of the actual measurements being performed on the individual subsystems.
Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks.The security of many multipartite device-independent (DI) protocols, such as DI conference-key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality.We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes.From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improves previous results.We obtain the entropy bounds thanks to two general results of independent interest.The first one drastically simplifies the quantum setup of an N -partite Bell scenario.The second one provides an upper bound on the violation of the MABK inequality by an arbitrary N -qubit state, as a function of the state's parameters.
In this paper, we investigate the characterization of multipartite entanglement based on the unified (q,s)(q,s)(q,s)-entropy framework. For bipartite quantum states, we propose an entanglement measure Eq,sA∣B(ρ)E_{q,s}^{A|B}(ρ)Eq,sA∣B​(ρ) based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) for quantifying kkk-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters qqq and sss are in certain ranges, Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) with respect to the parameters qqq and sss for fixed quantum states. In addition, for fixed qqq and sss, we also give their order relations for any two pure states.
The semi-device-independent framework allows one to draw conclusions about properties of an unknown quantum system under weak assumptions. Here we present a semi-device-independent scheme for the characterization of multipartite entanglement based around a game played by several isolated parties whose devices are uncharacterized beyond an assumption about the dimension of their Hilbert spaces. Our scheme can simultaneously certify that an nnn-partite high-dimensional quantum state features genuine multipartite entanglement, and that a joint measurement on nnn subsystems is entangled. Moreover, it provides a lower bound on the number of entangled measurement operators. These tests are strongly robust to noise, and even optimal for certain classes of states and measurements, as we demonstrate with illustrative examples. Notably, our scheme allows the certification of many entangled states admitting a local model, which therefore cannot violate any Bell inequality.
Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks. The security of many multipartite device-independent (DI) protocols, such as DI conference key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality. We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes. From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improve previous results. We obtain the entropy bounds thanks to two general results of independent interest. The first one drastically simplifies the quantum setup of an NNN-partite Bell scenario. The second one provides an upper bound on the violation of the MABK inequality by an arbitrary NNN-qubit state, as a function of the state's parameters.