On spurious fixed points in iterative maximum likelihood reconstruction for quantum tomography

Abstract

Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density matrix in practice. Contradicting these practical observations, we will show that convergence to a true solution is not guaranteed in general by constructing examples for spurious fixed points. To deal with this newly found problem, we then provide a criterion based on first order optimality conditions to check if the result of the algorithm is indeed the desired solution. Furthermore, we generalize the algorithm and show that it is equivalent to factorized gradient descent.