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:2606.16712

Complete entanglement detection using polynomial invariants

Thomas C. Fraser, Vjosa Blakaj, Roberto Rubboli, Felix Huber, Marco Fanizza

quant-phSubmitted Jun 15, 2026• Announced Jun 16, 2026• 2 citations
arXivHTMLPDF

Abstract

Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories: they are either complete but require access to an explicit density matrix followed by numerical optimization, or they can be evaluated directly by measuring the quantum system but are incomplete, in the sense that they cannot detect all forms of entanglement. In this work, we overcome both limitations in a unified framework. First, we bypass numerical optimization by deriving separability criteria in the form of universal bounds on tensor powers of separable states. We prove that these bounds are complete: every entangled state violates them for sufficiently large tensor powers. Second, we explicitly construct a corresponding complete family of nonlinear entanglement witnesses, which can detect all forms of entanglement without requiring an explicit density matrix. The witnesses we construct are moreover basis-independent, in the sense that they are invariant under conjugation by local unitaries. Altogether, our results expand the toolbox for entanglement detection in arbitrary local dimensions in a manifestly invariant way.

Comments
33 pages, 0 figures,

Related papers

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

Universal entanglement detection with geometrically optimal witnesses

Xuanran Zhu, Keyi Huang, Chao Zhang +3 more

Constructing optimal entanglement witnesses for arbitrary quantum systems remains a formidable challenge, hindered by the structural complexity of high-dimensional quantum state spaces. In this work, we overcome this barrier by introducing a unified framework for constructing geometrically optimal witnesses capable of identifying arbitrary entanglement structures. By leveraging the geometric properties of a target quantum state relative to a specific entanglement structure in Hilbert-Schmidt space, these witnesses are constructed in an efficient and effective manner. Among all nontrivial witnesses, they provide maximal distinguishability between the target state and the set of states without the desired entanglement structure. As a result, our approach enables the universal detection of bipartite, multipartite, and high-dimensional entanglement. To demonstrate its experimental feasibility, we apply the framework to a four-qubit nuclear spin quantum system. Compared to existing methods, our approach offers enhanced noise robustness, broader detection universality, and improved construction efficiency, providing a powerful and versatile tool for advancing the characterization and understanding of entanglement in quantum systems.

quant-pharXiv:2610.17592•Physical Review A•Oct 14, 2026•0 citations

Detecting entanglement with partial state information

Federico M. Spedalieri

We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the form of linear constraints on the density matrix, the sequence of tests can prove that either all states satisfying the constraints are entangled or there is at least one separable state that satisfies them. The algorithm works even if the values of the constraints are only known to fall in a certain range. If the states are entangled, an entanglement witness is constructed and lower bounds on entanglement measures and related quantities are provided; if a separable state satisfies the constraints, a separable decomposition is provided to certify this fact.

arXiv:1208.0860•Physical Review A•Dec 13, 2012•9 citations

Optimal entanglement criteria from trace invariants

Bivas Mallick, Aabhas Gulati, Ion Nechita

Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from $m$ such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for $m = 2$ and relax to a semidefinite program of size $O(m)$ for arbitrary $m$. The dual solutions are polynomial minorants of $\sqrt{x}$ on $[0,1]$, and two explicit families, binomial and $L^1$-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.

quant-pharXiv:2609.29471•Sep 25, 2026•1 citation

Accessible nonlinear entanglement witnesses

Juan Miguel Arrazola, Oleg Gittsovich, Norbert Lütkenhaus

Verification of entanglement is an important tool to characterize sources and devices for use in quantum computing and communication applications. In a vast majority of experiments entanglement witnesses (EWs) are used in order to prove the presence of entanglement in a quantum state. EWs can be constructed from available measurement results and do not require a reconstruction of the whole density matrix (full tomography), which is especially valuable for high-dimensional systems. We provide a method to construct accessible nonlinear EWs, which incorporate two important properties. First, they improve on linear EWs in the sense that each nonlinear EW detects more entangled states than its linear counterpart and therefore allows the verification of entanglement without critical dependence on having found the ``right'' linear witness. Second, they can be evaluated using exactly the same data as for the evaluation of the original linear witness. This allows a reanalysis of published experimental data to strengthen statements about entanglement verification without the requirement to perform additional measurements. These particular properties make the accessible nonlinear EWs attractive for the implementations in current experiments, for they can also enhance the statistical significance of the entanglement verification.

arXiv:1203.1239•Physical Review A•Jun 28, 2012•23 citations

Compressed entanglement testing

Federico M. Spedalieri

We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the form of linear constraints on the density matrix, the sequence of tests can prove that either all states satisfying the constraints are entangled, or that there is at least one separable state that satisfies them. The algorithm works even if the values of the constraints are only known to fall in a certain range. If the states are entangled, an entanglement witness is constructed and lower bounds on entanglement measures and related quantities are provided; if a separable state satisfies the constraints, a separable decomposition is provided to certify this fact.

•Aug 3, 2012•0 citations
Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories: they are either complete but require access to an explicit density matrix followed by numerical optimization, or they can be evaluated directly by measuring the quantum system but are incomplete, in the sense that they cannot detect all forms of entanglement. In this work, we overcome both limitations in a unified framework. First, we bypass numerical optimization by deriving separability criteria in the form of universal bounds on tensor powers of separable states. We prove that these bounds are complete: every entangled state violates them for sufficiently large tensor powers. Second, we explicitly construct a corresponding complete family of nonlinear entanglement witnesses, which can detect all forms of entanglement without requiring an explicit density matrix. The witnesses we construct are moreover basis-independent, in the sense that they are invariant under conjugation by local unitaries. Altogether, our results expand the toolbox for entanglement detection in arbitrary local dimensions in a manifestly invariant way.
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.
Constructing optimal entanglement witnesses for arbitrary quantum systems remains a formidable challenge, hindered by the structural complexity of high-dimensional quantum state spaces. In this work, we overcome this barrier by introducing a unified framework for constructing geometrically optimal witnesses capable of identifying arbitrary entanglement structures. By leveraging the geometric properties of a target quantum state relative to a specific entanglement structure in Hilbert-Schmidt space, these witnesses are constructed in an efficient and effective manner. Among all nontrivial witnesses, they provide maximal distinguishability between the target state and the set of states without the desired entanglement structure. As a result, our approach enables the universal detection of bipartite, multipartite, and high-dimensional entanglement. To demonstrate its experimental feasibility, we apply the framework to a four-qubit nuclear spin quantum system. Compared to existing methods, our approach offers enhanced noise robustness, broader detection universality, and improved construction efficiency, providing a powerful and versatile tool for advancing the characterization and understanding of entanglement in quantum systems.
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the form of linear constraints on the density matrix, the sequence of tests can prove that either all states satisfying the constraints are entangled or there is at least one separable state that satisfies them. The algorithm works even if the values of the constraints are only known to fall in a certain range. If the states are entangled, an entanglement witness is constructed and lower bounds on entanglement measures and related quantities are provided; if a separable state satisfies the constraints, a separable decomposition is provided to certify this fact.
Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from mmm such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for m=2m = 2m=2 and relax to a semidefinite program of size O(m)O(m)O(m) for arbitrary mmm. The dual solutions are polynomial minorants of x\sqrt{x}x​ on [0,1][0,1][0,1], and two explicit families, binomial and L1L^1L1-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.
Verification of entanglement is an important tool to characterize sources and devices for use in quantum computing and communication applications. In a vast majority of experiments entanglement witnesses (EWs) are used in order to prove the presence of entanglement in a quantum state. EWs can be constructed from available measurement results and do not require a reconstruction of the whole density matrix (full tomography), which is especially valuable for high-dimensional systems. We provide a method to construct accessible nonlinear EWs, which incorporate two important properties. First, they improve on linear EWs in the sense that each nonlinear EW detects more entangled states than its linear counterpart and therefore allows the verification of entanglement without critical dependence on having found the ``right'' linear witness. Second, they can be evaluated using exactly the same data as for the evaluation of the original linear witness. This allows a reanalysis of published experimental data to strengthen statements about entanglement verification without the requirement to perform additional measurements. These particular properties make the accessible nonlinear EWs attractive for the implementations in current experiments, for they can also enhance the statistical significance of the entanglement verification.
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the form of linear constraints on the density matrix, the sequence of tests can prove that either all states satisfying the constraints are entangled, or that there is at least one separable state that satisfies them. The algorithm works even if the values of the constraints are only known to fall in a certain range. If the states are entangled, an entanglement witness is constructed and lower bounds on entanglement measures and related quantities are provided; if a separable state satisfies the constraints, a separable decomposition is provided to certify this fact.