Informational completeness in bounded-rank quantum-state tomography
Abstract: We consider the problem of quantum-state tomography under the assumption that the state is pure, and more generally that its rank is bounded by a given value. In this scenario, new notions of informationally complete POVMs emerge, which allow for high-fidelity state estimation with fewer measurement outcomes than are required for an arbitrary rank state. We study this in the context of matrix completion, where the POVM outcomes determine only a few of the density matrix elements. We give an analytic solution that fully characterizes informational completeness and elucidates the important role that the positive-semidefinite property of density matrices plays in tomography. We show how positivity can impose a stricter notion of information completeness and allow us to use convex optimization programs to robustly estimate bounded-rank density matrices in the presence of statistical noise.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.