Lower bound on concurrence for arbitrary-dimensional tripartite quantum systems

TL;DR

This paper derives an explicit lower bound for the concurrence of arbitrary-dimensional tripartite quantum systems, improving existing bounds and aiding the study of multipartite entanglement.

Contribution

It introduces a new operational lower bound for concurrence based on sub-states, enhancing the analysis of multipartite quantum entanglement.

Findings

Lower bound can outperform existing bounds

Applicable to arbitrary-dimensional tripartite systems

Facilitates entanglement quantification in complex systems

Abstract

In this paper, we study the concurrence of arbitrary dimensional tripartite quantum systems. An explicit operational lower bound of concurrence is obtained in terms of the concurrence of sub-states. A given example show that our lower bound may improve the well known existing lower bounds of concurrence. The significance of our result is to get a lower bound when we study the concurrence of arbitrary dimensional multipartite quantum systems.