© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2403.01664 · Physical Review Research

Separation between entanglement criteria and entanglement detection protocols

Zhenhuan Liu, Fuchuan Wei

Published Jul 23, 2025• 1 citation

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•23 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•41 citations

Moments based entanglement criteria and measures

Yiding Wang, Tinggui Zhang, Xiaofen Huang +1 more

Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.

arXiv:2405.04754•Journal of Physics A Mathematical and Theoretical•Apr 19, 2024•4 citations

Complete entanglement detection using polynomial invariants

Thomas C. Fraser, Vjosa Blakaj, Roberto Rubboli +2 more

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.

quant-pharXiv:2606.16712•Jun 16, 2026•0 citations

Improved bounds on some entanglement criteria in bipartite quantum systems

Liang Bao Tang, Fan Wu

Entanglement detection is one of the core tasks in quantum information processing. Based on a broad class of informationally complete symmetric measurements, a series of separability criteria are proposed for different bipartite quantum systems using Cauchy–Schwarz inequality and ρ−ρA⊗ρB, respectively. In addition, by comparing and analyzing the existing entanglement criteria and detailed examples, it is not difficult to prove that our proposed criteria are more powerful and comprehensive in entanglement detection.

Results in Physics•Jun 21, 2023•6 citations

Enhancing some separability criteria via equiangular tight frames

Liang Bao Tang, Fan Wu

Abstract Improvement of the detection ability of quantum entanglement is one of the essential tasks in quantum computing and quantum information. Finite tight frames play a fundamental role in a wide variety of areas and, generally, each application requires a specific class of frames and is closely related to quantum measurement. It is worth noting that a maximal set of complex equiangular vectors is closely related to a symmetric informationally complete measurement. Hence, our goal in this work is to propose a series of separability criteria assigned to a finite tight frame and some well-known inequalities in different quantum systems, respectively. In addition, some tighter criteria to detect entanglement for many-body quantum states are presented in arbitrary dimensions. Finally, the effectiveness of the proposed entanglement detection criteria is illustrated through some detailed examples.

Communications in Theoretical Physics•Nov 13, 2024•3 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.

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.

Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.

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.

Entanglement detection is one of the core tasks in quantum information processing. Based on a broad class of informationally complete symmetric measurements, a series of separability criteria are proposed for different bipartite quantum systems using Cauchy–Schwarz inequality and ρ−ρA⊗ρB, respectively. In addition, by comparing and analyzing the existing entanglement criteria and detailed examples, it is not difficult to prove that our proposed criteria are more powerful and comprehensive in entanglement detection.

Abstract Improvement of the detection ability of quantum entanglement is one of the essential tasks in quantum computing and quantum information. Finite tight frames play a fundamental role in a wide variety of areas and, generally, each application requires a specific class of frames and is closely related to quantum measurement. It is worth noting that a maximal set of complex equiangular vectors is closely related to a symmetric informationally complete measurement. Hence, our goal in this work is to propose a series of separability criteria assigned to a finite tight frame and some well-known inequalities in different quantum systems, respectively. In addition, some tighter criteria to detect entanglement for many-body quantum states are presented in arbitrary dimensions. Finally, the effectiveness of the proposed entanglement detection criteria is illustrated through some detailed examples.