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:1803.11057 · Quantum Information Processing

Improved separability criteria via some classes of measurements

Shu-Qian Shen, Ming Li, Xianqing Li-Jost, Shao-Ming Fei

Published Mar 27, 2018• 22 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1876-z

Related papers

Separability criteria via some classes of measurements

Lu Liu, Ting Gao, FengLi Yan

arXiv:1704.08486•Science China Physics Mechanics and Astronomy•Aug 17, 2017•16 citations

New Separability Criteria Based on Two Classes of Measurements

Yuan-Yuan Lu, Shu‐Qian Shen, Ti-Run Xu +1 more

International Journal of Theoretical Physics•Sep 30, 2017•4 citations

A family of separability criteria and lower bounds of concurrence

Xian Shi, Yashuai Sun

arXiv:2211.04868•Quantum Information Processing•Feb 27, 2023•12 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•4 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

On independent permutation separability criteria

Lieven Clarisse, Paweł Wocjan

Recently, P.\ Wocjan and M.\ Horodecki [Open Syst.\ Inf.\ Dyn.\ 12, 331 (2005)] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent criteria meaning that no criterion is strictly stronger that any other. In this paper we observe that some of these criteria are still dependent and analyze why these dependencies occur. To remove them we introduce an improved necessary condition and give a complete classification of the remaining permutations. We conjecture that the remaining class of criteria only contains truly independent permutation separability criteria. Our conjecture is based on the proof that for two, three and four parties all these criteria are truly independent and on numerical verification of their independence for up to 8 parties. It was commonly believed that for three parties there were 9 independent criteria, here we prove that there are exactly 6 independent criteria for three parties and 22 for four parties.

arXiv:quant-ph/0504160•Quantum Information and Computation•May 1, 2006•24 citations
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.
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.
Recently, P.\ Wocjan and M.\ Horodecki [Open Syst.\ Inf.\ Dyn.\ 12, 331 (2005)] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent criteria meaning that no criterion is strictly stronger that any other. In this paper we observe that some of these criteria are still dependent and analyze why these dependencies occur. To remove them we introduce an improved necessary condition and give a complete classification of the remaining permutations. We conjecture that the remaining class of criteria only contains truly independent permutation separability criteria. Our conjecture is based on the proof that for two, three and four parties all these criteria are truly independent and on numerical verification of their independence for up to 8 parties. It was commonly believed that for three parties there were 9 independent criteria, here we prove that there are exactly 6 independent criteria for three parties and 22 for four parties.