Аннотация
Using geometric means, we first consider a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled one, which contains no product state components. We show that this convex decomposition can be achieved in practice with the help of a linear programming algorithm that scales in the general case polynomially with the system dimension. We illustrate the algorithm implementation with an example of a composite system of dimension 12 that undergoes a loss of coherence due to classical noise and we trace the time evolution of its essentially entangled component. We suggest a ``geometric'' description of entanglement dynamics and demonstrate how it explains the well-known phenomena of sudden death and revival of multipartite entanglements. For a statistical weight loss of the essentially entangled component with time, its average entanglement content is not affected by the coherence loss.