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

Lower Bound of $l_{1}$ Norm of Coherence of Bipartite Qubit-Qudit System and its Application in the Detection of Entangled Tripartite Qudit-Qubit-Qudit System

Palash Garhwal, Pranav Chandhok, Satyabrata Adhikari

Published Mar 24, 2022• 0 citations
arXivHTMLPDF

Abstract

Quantum coherence and quantum entanglement are two strong pillars in quantum information theory. We study here for the possibility of any connection between these two important aspects of quantum mechanics while studying the entanglement detection problem for the detection of bipartite higher dimensional entangled states and multipartite entangled states. To achieve our goal, we derive the lower bound $L$ of $l_{1}$ norm of coherence of bipartite qubit-qudit system using the criterion that detect entanglement. Furthermore, we deduce the upper bound $U$ of $l_{1}$ norm of coherence of separable bipartite qubit-qudit system using the separability criterion. Thus, we find that if any $l_{1}$ norm of coherence of bipartite qubit-qudit system is greater than the upper bound $U$ then the given qubit-qudit state is entangled. Finally, we obtained the upper bound $U_{1}$ of $l_{1}$ norm of coherence of separable tripartite state lies either in $2 \otimes d \otimes d$ or $d \otimes 2 \otimes d$ or $d \otimes d \otimes 2$ dimensional Hilbert space using the upper bound $U$. We have shown that if the $l_{1}$ norm of coherence of any tripartite $qubit-qudit-qudit$ or $qudit-qubit-qudit$ or $qudit-qudit-qubit$ system is greater than the derived upper bound $U_{1}$ then the given tripartite system represent an entangled state.

DOI
10.48550/arxiv.2203.12874

Related papers

Separability and lower bounds of quantum entanglement based on realignment

Jiaxin Sun, Hongmei Yao, Shao-Ming Fei +1 more

The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices, from which a family of separability criteria are presented for both bipartite and multipartite systems. Moreover, tighter lower bounds of concurrence and convex-roof extended negativity are derived. Criteria are also given to detect the genuine tripartite entanglement. Lower bounds of the concurrence of genuine tripartite entanglement are presented. By detailed examples we show that our results are better than the corresponding ones in identifying and estimating quantum entanglement as well as genuine multipartite entanglement.

arXiv:2405.11861•Physical Review A•Jan 8, 2025•5 citations

Entanglement polygon inequality in qudit systems

Xue Yang, Yan‐Han Yang, Ming‐Xing Luo

Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first derive an entanglement polygon inequality for the $q$ concurrence, which manifests the relationship among all the ``one-to-group'' marginal entanglements in any multipartite qudit system. This implies lower and upper bounds for the marginal entanglement of any three-qudit system. We further extend our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-$(r,s)$ entropy entanglement, including Tsallis entropy, R\'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.

arXiv:2205.08801•Physical Review A•Jun 2, 2022•21 citations

Separability criteria and lower bounds of entanglement via realignment

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.

quant-pharXiv:2610.15664•Oct 13, 2026•0 citations

A lower bound of concurrence for multipartite quantum states

Ming Li, Shao-Ming Fei, Zhi‐Xi Wang

We study the concurrence of arbitrary multipartite mixed quantum states. An explicit lower bound of the concurrence is derived, which detects quantum entanglement of some states better than some separability criteria, and gives sufficient conditions for distilling GHZ states from tripartite states. An interesting relation between the lower bound of the concurrence for bipartite states and for tripartite states has been presented.

arXiv:0903.3145•Journal of Physics A Mathematical and Theoretical•Mar 17, 2009•59 citations

Towards a quantum algorithm deciding the separability problem

Paweł Horodecki, Michał Banacki, Michał Eckstein +1 more

Abstract Determining whether an unknown quantum state is entangled can be approached through quantum tomography and related algorithms. However, these methods are generally inefficient due to the NP-hardness of the problem. An alternative strategy is to treat it as a decision (or estimation) problem with a quantum data structure (Horodecki and Ekert 2002 Phys. Rev. Lett. 89 127902). Over the years, significant progress has been made: the two-qubit case is now fully understood, but for higher-dimensional systems only entanglement detection via negativity has been established. In this work, we propose schemes for measuring upper bounds on bipartite biconcurrence and concurrence, expressed as functions of a fixed (but arbitrary) unitary operation acting on a Hilbert space that is quadratically larger than the original state space. Independently, we provide a scheme for measuring a lower bound for concurrence. In the case of the states proportional to the projectors the schemes are getting significantly simpler and the upper bound on the biconcurrence, as well as the lower bound on the concurrence, become exact (up to experimental and numerical errors). This framework opens the door to tackling the separability problem using methods inspired by the variational quantum eigensolver.

Quantum Science and Technology•May 15, 2026•0 citations

On genuine entanglement for tripartite systems

Hui Zhao, Lin Liu, Zhi‐Xi Wang +2 more

In this paper, we investigate the genuine entanglement in tripartite systems based on partial transposition and the norm of correlation tensors of the density matrices. We first derive an analytical sufficient criterion to detect genuine entanglement of tripartite qubit states combining with the partial transposition of the density matrices. Then, we use the norm of correlation tensors to study genuine entanglement for tripartite qudit quantum states and obtain a genuine entanglement criterion by constructing certain matrices. With detailed examples, our results are seen to be able to detect more genuine tripartite entangled states than previous studies.

arXiv:2209.04768•International Journal of Quantum Information•Jan 21, 2022•3 citations
Lower Bound of l1l_{1}l1​ Norm of Coherence of Bipartite Qubit-Qudit System and its Application in the Detection of Entangled Tripartite Qudit-Qubit-Qudit System
Quantum coherence and quantum entanglement are two strong pillars in quantum information theory. We study here for the possibility of any connection between these two important aspects of quantum mechanics while studying the entanglement detection problem for the detection of bipartite higher dimensional entangled states and multipartite entangled states. To achieve our goal, we derive the lower bound LLL of l1l_{1}l1​ norm of coherence of bipartite qubit-qudit system using the criterion that detect entanglement. Furthermore, we deduce the upper bound UUU of l1l_{1}l1​ norm of coherence of separable bipartite qubit-qudit system using the separability criterion. Thus, we find that if any l1l_{1}l1​ norm of coherence of bipartite qubit-qudit system is greater than the upper bound UUU then the given qubit-qudit state is entangled. Finally, we obtained the upper bound U1U_{1}U1​ of l1l_{1}l1​ norm of coherence of separable tripartite state lies either in 2⊗d⊗d2 \otimes d \otimes d2⊗d⊗d or d⊗2⊗dd \otimes 2 \otimes dd⊗2⊗d or d⊗d⊗2d \otimes d \otimes 2d⊗d⊗2 dimensional Hilbert space using the upper bound UUU. We have shown that if the l1l_{1}l1​ norm of coherence of any tripartite qubit−qudit−quditqubit-qudit-quditqubit−qudit−qudit or qudit−qubit−quditqudit-qubit-quditqudit−qubit−qudit or qudit−qudit−qubitqudit-qudit-qubitqudit−qudit−qubit system is greater than the derived upper bound U1U_{1}U1​ then the given tripartite system represent an entangled state.
The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices, from which a family of separability criteria are presented for both bipartite and multipartite systems. Moreover, tighter lower bounds of concurrence and convex-roof extended negativity are derived. Criteria are also given to detect the genuine tripartite entanglement. Lower bounds of the concurrence of genuine tripartite entanglement are presented. By detailed examples we show that our results are better than the corresponding ones in identifying and estimating quantum entanglement as well as genuine multipartite entanglement.
Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first derive an entanglement polygon inequality for the qqq concurrence, which manifests the relationship among all the ``one-to-group'' marginal entanglements in any multipartite qudit system. This implies lower and upper bounds for the marginal entanglement of any three-qudit system. We further extend our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-(r,s)(r,s)(r,s) entropy entanglement, including Tsallis entropy, R\'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.
Abstract Determining whether an unknown quantum state is entangled can be approached through quantum tomography and related algorithms. However, these methods are generally inefficient due to the NP-hardness of the problem. An alternative strategy is to treat it as a decision (or estimation) problem with a quantum data structure (Horodecki and Ekert 2002 Phys. Rev. Lett. 89 127902). Over the years, significant progress has been made: the two-qubit case is now fully understood, but for higher-dimensional systems only entanglement detection via negativity has been established. In this work, we propose schemes for measuring upper bounds on bipartite biconcurrence and concurrence, expressed as functions of a fixed (but arbitrary) unitary operation acting on a Hilbert space that is quadratically larger than the original state space. Independently, we provide a scheme for measuring a lower bound for concurrence. In the case of the states proportional to the projectors the schemes are getting significantly simpler and the upper bound on the biconcurrence, as well as the lower bound on the concurrence, become exact (up to experimental and numerical errors). This framework opens the door to tackling the separability problem using methods inspired by the variational quantum eigensolver.
In this paper, we investigate the genuine entanglement in tripartite systems based on partial transposition and the norm of correlation tensors of the density matrices. We first derive an analytical sufficient criterion to detect genuine entanglement of tripartite qubit states combining with the partial transposition of the density matrices. Then, we use the norm of correlation tensors to study genuine entanglement for tripartite qudit quantum states and obtain a genuine entanglement criterion by constructing certain matrices. With detailed examples, our results are seen to be able to detect more genuine tripartite entangled states than previous studies.