Lower Bound of Multipartite Concurrence Based on Sub-quantum State Decomposition

TL;DR

This paper introduces a new analytical lower bound for the entanglement measure called concurrence in tripartite quantum states, which can be generalized to systems of any dimension, potentially improving existing bounds.

Contribution

It presents a novel analytical lower bound for multipartite concurrence based on sub-state decomposition, enhancing the accuracy of entanglement quantification.

Findings

Lower bound improves existing bounds

Applicable to arbitrary dimensional systems

Analytical expression derived for tripartite states

Abstract

We study the entanglement of tripartite quantum states and provide analytical lower bound of concurrence in terms of the concurrence of sub-states. The lower bound may improve all the existing lower bounds of concurrence. The approach is generalized to arbitrary dimensional multipartite systems.