Estimation of low rank density matrices: bounds in Schatten norms and other distances

Abstract

Let Sm be the set of all m× m density matrices (Hermitian positively semi-definite matrices of unit trace). Consider a problem of estimation of an unknown density matrix ∈ Sm based on outcomes of n measurements of observables X1,…, Xn∈ Hm ( Hm being the space of m× m Hermitian matrices) for a quantum system identically prepared n times in state . Outcomes Y1,…, Yn of such measurements could be described by a trace regression model in which E(Yj|Xj)= tr( Xj), j=1,…, n. The design variables X1,…, Xn are often sampled at random from the uniform distribution in an orthonormal basis \E1,…, Em2\ of Hm (such as Pauli basis). The goal is to estimate the unknown density matrix based on the data (X1,Y1), …, (Xn,Yn). Let Z:=m2nΣj=1n Yj Xj and let be the projection of Z onto the convex set Sm of density matrices. It is shown that for estimator the minimax lower bounds in classes of low rank density matrices (established earlier) are attained up logarithmic factors for all Schatten p-norm distances, p∈ [1,∞] and for Bures version of quantum Hellinger distance. Moreover, for a slightly modified version of estimator the same property holds also for quantum relative entropy (Kullback-Leibler) distance between density matrices.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…