Pure state estimation and the characterization of entanglement

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.

Closer to published version

References in corpus (3)

• A complete family of separability criteria
• Detecting multipartite entanglement
• Finding optimal strategies for minimum-error quantum-state discrimination

Cited by in corpus (14)

• The power of symmetric extensions for entanglement detection
• Optimal estimation of entanglement
• Beyond quantum Fisher information: optimal phase estimation with arbitrary a priori knowledge
• Semidefinite programming relaxations for quantum correlations
• The connection between holographic entanglement and complexity of purification
• Optimal resource states for local state discrimination
• A complete criterion for separability detection
• Phase-Covariant Quantum Benchmarks
• Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming
• Tight bounds on the distinguishability of quantum states under separable measurements
• Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture
• Locally distinguishing a maximally entangled basis using shared entanglement
• Small sets of locally indistinguishable orthogonal maximally entangled states
• Conditions for local transformations between sets of quantum states