pith. sign in

arxiv: 1301.6658 · v1 · pith:NITFQHSMnew · submitted 2013-01-28 · 🪐 quant-ph · cs.IT· math.IT

Minimum Relative Entropy for Quantum Estimation: Feasibility and General Solution

classification 🪐 quant-ph cs.ITmath.IT
keywords convexentropyestimationfeasibilitygeneralminimumoptimizationquantum
0
0 comments X
read the original abstract

We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data and, whenever necessary, to relax the constraints in order to allow for a physically admissible solution. Building on these results, the variational analysis can be completed ensuring existence and uniqueness of the optimum. The latter can then be computed by standard, efficient standard algorithms for convex optimization, without resorting to approximate methods or restrictive assumptions on its rank.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.