We consider a quantum version of the famous low-rank approximation problem. Specifically, we consider the distance D(ρ, σ) between two normalized quantum states, ρ and σ, where the rank of σ is constrained to be at most R. For both the trace distance and Hilbert-Schmidt distance, we analytically solve for the optimal state σ that minimizes this distance. For the Hilbert-Schmidt distance, the unique optimal state is σ = τR + NR, where τR = ΠRρΠR is given by projecting ρ onto its R principal components with projector ΠR, and NR is a normalization factor given by NR = 1−Tr(τ R ) R ΠR. For the trace distance, this state is also optimal but not uniquely optimal, and we provide the full set of states that are optimal. We briefly discuss how our results have application for performing principal component analysis (PCA) via variational optimization on quantum computers.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.