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

TL;DR
This paper establishes bounds on the $l_{1}$ norm of coherence for bipartite and tripartite qubit-qudit systems, providing a criterion to detect entanglement based on coherence measures.
Contribution
It derives new bounds on the $l_{1}$ norm of coherence that serve as entanglement detection criteria for bipartite and tripartite qubit-qudit systems.
Findings
Bound $L$ for bipartite qubit-qudit coherence
Upper bound $U$ for separable bipartite states
Upper bound $U_{1}$ for tripartite states with specific dimensions
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 of norm of coherence of bipartite qubit-qudit system using the criterion that detect entanglement. Furthermore, we deduce the upper bound of norm of coherence of separable bipartite qubit-qudit system using the separability criterion. Thus, we find that if any norm of coherence of bipartite qubit-qudit system is greater than the upper bound then the given qubit-qudit state is entangled. Finally, we obtained the upper bound of norm of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
