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:2403.01664 · Physical Review Research

Separation between entanglement criteria and entanglement detection protocols

Zhenhuan Liu, Fuchuan Wei

Published Jul 23, 2025• 6 citations
arXivHTMLPDF

Abstract

Entanglement detection is one of the most fundamental tasks in quantum information science, playing vital roles in theoretical studies and quantum system benchmarking. Researchers have proposed many powerful entanglement criteria with high detection capabilities and small observable numbers. Nonetheless, entanglement criteria only represent mathematical rules deciding the existence of entanglement. The relationship between a good entanglement criterion and an effective experimental entanglement detection protocol (EDP) is poorly understood. In this study, we introduce postulates for EDPs about their detection capabilities and robustness and use them to show the difference between entanglement criteria and EDPs. Specifically, we design an entanglement detection task for unknown pure bipartite states and demonstrate that the sample complexity of any EDP and the number of observables for a good entanglement criterion can have exponential separation. Furthermore, we discover that the optimal EDP with the lowest sample complexity does not necessarily correspond to an entanglement criterion constructed by a small number of observables. Our results can be used to prove the exponential speedups achieved through quantum memory and be generalized to multipartite entanglement detection. By highlighting the significance and independence of EDP design, our work holds practical implications for entanglement detection experiments.

DOI
10.1103/hm8j-wgqm

Related papers

Fundamental Limitation on the Detectability of Entanglement

Pengyu Liu, Zhenhuan Liu, Shu Chen +1 more

Entanglement detection is essential in quantum information science and quantum many-body physics. It has been proved that entanglement exists almost surely for a random quantum state, while the realizations of effective entanglement criteria usually consume exponentially many resources with regard to system size or qubit number, and efficient criteria often perform poorly without prior knowledge. This fact implies a fundamental limitation might exist in the detectability of entanglement. In this work, we formalize this limitation as a fundamental trade-off between the efficiency and effectiveness of entanglement criteria via a systematic method to evaluate the detection capability of entanglement criteria theoretically. For a system coupled to an environment, we prove that any entanglement criterion needs exponentially many observables to detect the entanglement effectively when restricted to single-copy operations. Otherwise, the detection capability of the criterion will decay double exponentially. Furthermore, if multicopy joint measurements are allowed, the effectiveness of entanglement detection can be exponentially improved, which implies a quantum advantage in entanglement detection problems. Our results may shed light on why quantum phenomena are difficult to observe in large noisy systems.

arXiv:2208.02518•Physical Review Letters•Nov 30, 2022•27 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

Detecting Entanglement in Quantum Many-Body Systems via Permutation Moments

Zhenhuan Liu, Yifan Tang, Hao Dai +3 more

Multipartite entanglement plays an essential role in both quantum information science and many-body physics. Because of the exponentially large dimension and complex geometric structure of the state space, the detection of entanglement in many-body systems is extremely challenging in reality. Conventional means, like entanglement witness and entropy criterion, either highly depend on the prior knowledge of the studied systems or the detection capability is relatively weak. In this Letter, we propose a framework for designing multipartite entanglement criteria based on permutation moments, which have an effective implementation with either the generalized control-swap quantum circuits or the random unitary techniques. As an example, in the bipartite scenario, we develop an entanglement criterion that can detect bound entanglement and show strong detection capability in the multiqubit Ising model with a long-range XY Hamiltonian. In the multipartite case, the permutation-moment-based criteria can detect entangled states that are not detectable by any criteria extended from the bipartite case. Our framework also shows potential in entanglement quantification and entanglement structure detection.

arXiv:2203.08391•Physical Review Letters•Dec 23, 2022•55 citations

Entanglement Detection: Complexity and Shannon Entropic Criteria

Yichen Huang

Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the separability problem. It builds relations between certain classes of criteria and bounds the power of these criteria. In particular, it shows the equivalence of many seemingly different covariance-matrix-based criteria; it offers guidance on the study of and reveals the inherent limitations of covariance-matrix-based criteria. Also, a Shannon entropic criterion is proposed for m ⊕ n-mode states. It unifies and improves many known covariance-matrix-based criteria and Shannon entropic criteria; it is necessary and sufficient for 1 ⊕ n-mode Gaussian states and m ⊕ n-mode bisymmetric Gaussian states.

IEEE Transactions on Information Theory•May 21, 2013•20 citations

Experimentally feasible set of criteria detecting genuine multipartite entanglement in n -qubit Dicke states and in higher-dimensional systems

Marcus Huber, Paul Erker, Hans Schimpf +2 more

We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in $n$-qubit Dicke states with $m$ excitations, as shown in exemplary cases. Furthermore, they can be employed to detect multipartite entanglement in different states related to quantum cloning, decoherence-free communication, and quantum secret sharing. In a detailed analysis, we show that the criteria are also more robust to noise than any other criterion known so far, especially with increasing system size. Furthermore, it is shown that the number of required local observables scales only polynomially with size, thus making the criteria experimentally feasible.

arXiv:1011.4579•Physical Review A•Apr 18, 2011•57 citations

Entanglement detection beyond the computable cross-norm or realignment criterion

Chengjie Zhang, Yong-Sheng Zhang, Shun Zhang +1 more

Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.

arXiv:0709.3766•Physical Review A•Jun 2, 2008•95 citations
Entanglement detection is one of the most fundamental tasks in quantum information science, playing vital roles in theoretical studies and quantum system benchmarking. Researchers have proposed many powerful entanglement criteria with high detection capabilities and small observable numbers. Nonetheless, entanglement criteria only represent mathematical rules deciding the existence of entanglement. The relationship between a good entanglement criterion and an effective experimental entanglement detection protocol (EDP) is poorly understood. In this study, we introduce postulates for EDPs about their detection capabilities and robustness and use them to show the difference between entanglement criteria and EDPs. Specifically, we design an entanglement detection task for unknown pure bipartite states and demonstrate that the sample complexity of any EDP and the number of observables for a good entanglement criterion can have exponential separation. Furthermore, we discover that the optimal EDP with the lowest sample complexity does not necessarily correspond to an entanglement criterion constructed by a small number of observables. Our results can be used to prove the exponential speedups achieved through quantum memory and be generalized to multipartite entanglement detection. By highlighting the significance and independence of EDP design, our work holds practical implications for entanglement detection experiments.
Entanglement detection is essential in quantum information science and quantum many-body physics. It has been proved that entanglement exists almost surely for a random quantum state, while the realizations of effective entanglement criteria usually consume exponentially many resources with regard to system size or qubit number, and efficient criteria often perform poorly without prior knowledge. This fact implies a fundamental limitation might exist in the detectability of entanglement. In this work, we formalize this limitation as a fundamental trade-off between the efficiency and effectiveness of entanglement criteria via a systematic method to evaluate the detection capability of entanglement criteria theoretically. For a system coupled to an environment, we prove that any entanglement criterion needs exponentially many observables to detect the entanglement effectively when restricted to single-copy operations. Otherwise, the detection capability of the criterion will decay double exponentially. Furthermore, if multicopy joint measurements are allowed, the effectiveness of entanglement detection can be exponentially improved, which implies a quantum advantage in entanglement detection problems. Our results may shed light on why quantum phenomena are difficult to observe in large noisy systems.
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.
Multipartite entanglement plays an essential role in both quantum information science and many-body physics. Because of the exponentially large dimension and complex geometric structure of the state space, the detection of entanglement in many-body systems is extremely challenging in reality. Conventional means, like entanglement witness and entropy criterion, either highly depend on the prior knowledge of the studied systems or the detection capability is relatively weak. In this Letter, we propose a framework for designing multipartite entanglement criteria based on permutation moments, which have an effective implementation with either the generalized control-swap quantum circuits or the random unitary techniques. As an example, in the bipartite scenario, we develop an entanglement criterion that can detect bound entanglement and show strong detection capability in the multiqubit Ising model with a long-range XY Hamiltonian. In the multipartite case, the permutation-moment-based criteria can detect entangled states that are not detectable by any criteria extended from the bipartite case. Our framework also shows potential in entanglement quantification and entanglement structure detection.
Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the separability problem. It builds relations between certain classes of criteria and bounds the power of these criteria. In particular, it shows the equivalence of many seemingly different covariance-matrix-based criteria; it offers guidance on the study of and reveals the inherent limitations of covariance-matrix-based criteria. Also, a Shannon entropic criterion is proposed for m ⊕ n-mode states. It unifies and improves many known covariance-matrix-based criteria and Shannon entropic criteria; it is necessary and sufficient for 1 ⊕ n-mode Gaussian states and m ⊕ n-mode bisymmetric Gaussian states.
We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in nnn-qubit Dicke states with mmm excitations, as shown in exemplary cases. Furthermore, they can be employed to detect multipartite entanglement in different states related to quantum cloning, decoherence-free communication, and quantum secret sharing. In a detailed analysis, we show that the criteria are also more robust to noise than any other criterion known so far, especially with increasing system size. Furthermore, it is shown that the number of required local observables scales only polynomially with size, thus making the criteria experimentally feasible.
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.