Optimal Estimation of Low Rank Density Matrices
Abstract
The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density matrices in trace regression models used in quantum state tomography (in particular, in the case of Pauli measurements) with explicit dependence of the bounds on the rank and other complexity parameters. Such bounds are established for several statistically relevant distances, including quantum versions of Kullback-Leibler divergence (relative entropy distance) and of Hellinger distance (so called Bures distance), and Schatten $p$-norm distances. Sharp upper bounds and oracle inequalities for least squares estimator with von Neumann entropy penalization are obtained showing that minimax lower bounds are attained (up to logarithmic factors) for these distances.
Cite
Text
Koltchinskii and Xia. "Optimal Estimation of Low Rank Density Matrices." Journal of Machine Learning Research, 2015.Markdown
[Koltchinskii and Xia. "Optimal Estimation of Low Rank Density Matrices." Journal of Machine Learning Research, 2015.](https://mlanthology.org/jmlr/2015/koltchinskii2015jmlr-optimal/)BibTeX
@article{koltchinskii2015jmlr-optimal,
title = {{Optimal Estimation of Low Rank Density Matrices}},
author = {Koltchinskii, Vladimir and Xia, Dong},
journal = {Journal of Machine Learning Research},
year = {2015},
pages = {1757-1792},
volume = {16},
url = {https://mlanthology.org/jmlr/2015/koltchinskii2015jmlr-optimal/}
}