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

Confident entanglement detection via the separable numerical range

Timo Simnacher, Jakub Czartowski, Konrad Szymański, Karol Życzkowski

Published Oct 25, 2021• 9 citations
arXivHTMLPDF

Abstract

We investigate the joint (separable) numerical range of multiple measurements, i.e., the regions of expectation values accessible with (separable) quantum states for given observables. This not only enables efficient entanglement detection, but also sheds light on the geometry of the set of quantum states. More precisely, in an experiment, if the confidence region for the obtained data and the separable numerical range are disjoint, entanglement is reliably detected. Generically, the success of such an experiment is more likely the smaller the separable numerical range is, compared to the standard numerical range of the observables measured. We quantify this relation using the ratio between these two volumes and show that it cannot be arbitrarily small, giving analytical bounds for any number of particles, local dimensions, as well as number of measurements. Moreover, we explicitly compute the volume of separable and standard numerical range for two locally traceless two-qubit product observables, which are of particular interest as they are easier to measure in practice. Furthermore, we consider typical volume ratios for generic observables and extreme instances.

DOI
10.1103/physreva.104.042420

Related papers

Multiple fidelities and joint numerical range

Pei Li, Bang-Hai Wang

We investigate the effectiveness of entanglement detection based on multiple fidelities via the geometry of the joint separable numerical range. When all reference states are product states, we derive a necessary and sufficient criterion for such detection: either some pair of reference states has nontrivial moduli of the local inner products on both subsystems, or the orthogonal complement of the span of the reference states is completely entangled. We further show that there exist sets of reference product states for which no proper subset is effective for entanglement detection, whereas the full set is. A typical example of this phenomenon is provided by unextendible product bases. Moreover, for a pair of reference product states on a bipartite system with arbitrary local dimensions, we characterize both the joint numerical range and the joint separable numerical range, showing that the joint separable numerical range is determined solely by their local fidelities, as illustrated by a representative two-qubit example. Our results offer a systematic approach to designing effective entanglement witnesses and lay the groundwork for extensions to higher-dimensional and multipartite scenarios.

quant-pharXiv:2605.24360•Journal of Physics A Mathematical and Theoretical•May 26, 2026•0 citations

Valid and efficient entanglement verification with finite copies of a quantum state

Paweł Cieśliński, Jan Dziewior, Lukas Knips +5 more

Abstract Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme’s validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme’s efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.

arXiv:2208.01983•npj Quantum Information•Jan 24, 2024•6 citations

Detecting quantum entanglement : entanglement witnesses and uncertainty relations

Otfried Gühne

This thesis deals with methods of the detection of entanglement.After recalling some facts and definitions concerning entanglement and separability, we investigate two methods of the detection of entanglement.In the first part of this thesis we consider so-called entanglement witnesses, mainly in view of the detection of multipartite entanglement.Entanglement witnesses are observables for which a negative expectation value indicates entanglement.We first present a simple method to construct these witnesses.Since witnesses are nonlocal observables, they are not easy to measure in a real experiment.However, as we will show, one can circumvent this problem by decomposing the witness into several local observables which can be measured separately.We calculate the local decompositions for several interesting witnesses for two, three and four qubits.Local decompositions can be optimized in the number of measurement settings which are needed for an experimental implementation.We present a method to prove that a given local decomposition is optimal and discuss with this the optimality of our decompositions.Then we present another method of designing witnesses which are by construction measurable with local measurements.Finally, we shortly report on experiments where some of the witnesses derived in this part have been used to detect three-and four-partite entanglement of polarized photons.The second part of this thesis deals with separability criteria which are written in terms of uncertainty relations.There are two different formulations of uncertainty relations since one can measure the uncertainty of an observable by its variance as well as by entropic quantities.We show that both formulations are useful tools for the derivation of separability criteria for finite-dimensional systems and investigate the resulting criteria.Our results in this part exhibit also some more fundamental properties of entanglement: We show how known separability criteria for infinitedimensional systems can be translated to finite-dimensional systems.Furthermore, we prove that any entropic uncertainty relation on one part of the system gives rise to a separability criterion on the composite system.

•Jan 1, 2004•4 citations

Detection and typicality of bound entangled states

Joonwoo Bae, Markus Tiersch, Simeon Sauer +4 more

We derive an explicit analytic estimate for the entanglement of a large class of bipartite quantum states, which extends into bound entanglement regions. This is done by using an efficiently computable concurrence lower bound, which is further employed to numerically construct a volume of $3\ifmmode\times\else\texttimes\fi{}3$ bound entangled states.

arXiv:0902.4372•Physical Review A•Aug 13, 2009•18 citations

Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities

Alexander Sauer, József Zsolt Bernád, H J Moreno +1 more

Abstract Euclidean volume ratios between quantum states with positive partial transpose and all quantum states in bipartite systems are investigated. These ratios allow a quantitative exploration of the typicality of entanglement and of its detectability by Bell inequalities. For this purpose a new numerical approach is developed. It is based on the Peres–Horodecki criterion, on a characterization of the convex set of quantum states by inequalities resulting from Newton identities and from Descartes’ rule of signs, and on a numerical approach involving the multiphase Monte Carlo method and the hit-and-run algorithm. This approach confirms not only recent analytical and numerical results on two-qubit, qubit-qutrit, and qubit-four-level qudit states but also allows for a numerically reliable numerical treatment of so far unexplored qutrit–qutrit states. Based on this numerical approach with the help of the Clauser–Horne–Shimony–Holt inequality and the Collins–Gisin inequality the degree of detectability of entanglement is investigated for two-qubit quantum states. It is investigated quantitatively to which extent a combined test of both Bell inequalities can increase the detectability of entanglement beyond what is achievable by each of these inequalities separately.

arXiv:2102.00312•Journal of Physics A Mathematical and Theoretical•Oct 28, 2021•9 citations

Minimal-error quantum state discrimination versus robustness of entanglement: More indistinguishability with less entanglement

Debarupa Saha, Kornikar Sen, Chirag Srivastava +1 more

We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the probability of discriminating the states, appearing in an arbitrary multiparty ensemble, in terms of their robustness of entanglement and the probability of discriminating states of the closest separable ensemble. These bounds hold true, irrespective of the dimension of the constituent systems the number of parties involved, the size of the ensemble, and whether the measurement strategies are local or global. Additional lower bounds on the same quantity is determined by considering two special cases of two-state multiparty ensembles, either having equal entanglement or at least one of them being separable. The case of equal entanglement reveals that it is always easier to discriminate the entangled states than the ones in the corresponding closest separable ensemble, a phenomenon which we refer as "More indistinguishability with less entanglement". Furthermore, we numerically explore how tight the bounds are by examining the global discrimination probability of states selected from Haar-uniformly generated ensembles of two two-qubit states. We find that for two-element ensembles of unequal entanglements, the minimum of the two entanglements must possess a threshold value for the ensemble to exhibit "More indistinguishability with less entanglement".

arXiv:2402.05074•Physical Review A•Nov 13, 2025•3 citations
We investigate the joint (separable) numerical range of multiple measurements, i.e., the regions of expectation values accessible with (separable) quantum states for given observables. This not only enables efficient entanglement detection, but also sheds light on the geometry of the set of quantum states. More precisely, in an experiment, if the confidence region for the obtained data and the separable numerical range are disjoint, entanglement is reliably detected. Generically, the success of such an experiment is more likely the smaller the separable numerical range is, compared to the standard numerical range of the observables measured. We quantify this relation using the ratio between these two volumes and show that it cannot be arbitrarily small, giving analytical bounds for any number of particles, local dimensions, as well as number of measurements. Moreover, we explicitly compute the volume of separable and standard numerical range for two locally traceless two-qubit product observables, which are of particular interest as they are easier to measure in practice. Furthermore, we consider typical volume ratios for generic observables and extreme instances.
We investigate the effectiveness of entanglement detection based on multiple fidelities via the geometry of the joint separable numerical range. When all reference states are product states, we derive a necessary and sufficient criterion for such detection: either some pair of reference states has nontrivial moduli of the local inner products on both subsystems, or the orthogonal complement of the span of the reference states is completely entangled. We further show that there exist sets of reference product states for which no proper subset is effective for entanglement detection, whereas the full set is. A typical example of this phenomenon is provided by unextendible product bases. Moreover, for a pair of reference product states on a bipartite system with arbitrary local dimensions, we characterize both the joint numerical range and the joint separable numerical range, showing that the joint separable numerical range is determined solely by their local fidelities, as illustrated by a representative two-qubit example. Our results offer a systematic approach to designing effective entanglement witnesses and lay the groundwork for extensions to higher-dimensional and multipartite scenarios.
Abstract Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme’s validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme’s efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.
This thesis deals with methods of the detection of entanglement.After recalling some facts and definitions concerning entanglement and separability, we investigate two methods of the detection of entanglement.In the first part of this thesis we consider so-called entanglement witnesses, mainly in view of the detection of multipartite entanglement.Entanglement witnesses are observables for which a negative expectation value indicates entanglement.We first present a simple method to construct these witnesses.Since witnesses are nonlocal observables, they are not easy to measure in a real experiment.However, as we will show, one can circumvent this problem by decomposing the witness into several local observables which can be measured separately.We calculate the local decompositions for several interesting witnesses for two, three and four qubits.Local decompositions can be optimized in the number of measurement settings which are needed for an experimental implementation.We present a method to prove that a given local decomposition is optimal and discuss with this the optimality of our decompositions.Then we present another method of designing witnesses which are by construction measurable with local measurements.Finally, we shortly report on experiments where some of the witnesses derived in this part have been used to detect three-and four-partite entanglement of polarized photons.The second part of this thesis deals with separability criteria which are written in terms of uncertainty relations.There are two different formulations of uncertainty relations since one can measure the uncertainty of an observable by its variance as well as by entropic quantities.We show that both formulations are useful tools for the derivation of separability criteria for finite-dimensional systems and investigate the resulting criteria.Our results in this part exhibit also some more fundamental properties of entanglement: We show how known separability criteria for infinitedimensional systems can be translated to finite-dimensional systems.Furthermore, we prove that any entropic uncertainty relation on one part of the system gives rise to a separability criterion on the composite system.
Abstract Euclidean volume ratios between quantum states with positive partial transpose and all quantum states in bipartite systems are investigated. These ratios allow a quantitative exploration of the typicality of entanglement and of its detectability by Bell inequalities. For this purpose a new numerical approach is developed. It is based on the Peres–Horodecki criterion, on a characterization of the convex set of quantum states by inequalities resulting from Newton identities and from Descartes’ rule of signs, and on a numerical approach involving the multiphase Monte Carlo method and the hit-and-run algorithm. This approach confirms not only recent analytical and numerical results on two-qubit, qubit-qutrit, and qubit-four-level qudit states but also allows for a numerically reliable numerical treatment of so far unexplored qutrit–qutrit states. Based on this numerical approach with the help of the Clauser–Horne–Shimony–Holt inequality and the Collins–Gisin inequality the degree of detectability of entanglement is investigated for two-qubit quantum states. It is investigated quantitatively to which extent a combined test of both Bell inequalities can increase the detectability of entanglement beyond what is achievable by each of these inequalities separately.
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the probability of discriminating the states, appearing in an arbitrary multiparty ensemble, in terms of their robustness of entanglement and the probability of discriminating states of the closest separable ensemble. These bounds hold true, irrespective of the dimension of the constituent systems the number of parties involved, the size of the ensemble, and whether the measurement strategies are local or global. Additional lower bounds on the same quantity is determined by considering two special cases of two-state multiparty ensembles, either having equal entanglement or at least one of them being separable. The case of equal entanglement reveals that it is always easier to discriminate the entangled states than the ones in the corresponding closest separable ensemble, a phenomenon which we refer as "More indistinguishability with less entanglement". Furthermore, we numerically explore how tight the bounds are by examining the global discrimination probability of states selected from Haar-uniformly generated ensembles of two two-qubit states. We find that for two-element ensembles of unequal entanglements, the minimum of the two entanglements must possess a threshold value for the ensemble to exhibit "More indistinguishability with less entanglement".