Pure state estimation and the characterization of entanglement

TL;DR

This paper links state estimation and entanglement characterization to develop efficient algorithms and bounds for quantum states shared among distant parties, advancing quantum information processing techniques.

Contribution

It introduces a novel connection between state estimation and separability problems, leading to new algorithms and methods for bounding local fidelity in distributed quantum states.

Findings

Developed efficient numerical algorithms for state estimation.

Derived systematic methods for upper bounds on local fidelity.

Linked entanglement characterization with state estimation techniques.

Abstract

A connection between the state estimation problem and the separability problem is noticed and exploited to find efficient numerical algorithms to solve the first one. Based on these ideas, we also derive a systematic method to obtain upper bounds on the maximum local fidelity when the states are distributed among several distant parties.