Sample-optimal tomography of quantum states

Publication Type:
Conference Proceeding
Proceedings of the Annual ACM Symposium on Theory of Computing, 2016, 19-21-June-2016 pp. 913 - 925
Issue Date:
Full metadata record
© 2016 ACM. 978-1-4503-4132-5/16/06...$15.00. It is a fundamental problem to decide how many copies of an unknown mixed quantum state are necessary and sufficient to determine the state. This is the quantum analogue of the problem of estimating a probability distribution given some number of samples. Previously, it was known only that estimating states to error e in trace distance required O(dr2/∈2) copies for a d-dimensional density matrix of rank r. Here, we give a measurement scheme (POVM) that uses O((dr/δ) ln(d/δ)) copies to estimate ρ to error δ in infidelity. This implies O((dr/∈2) · ln(d/∈)) copies suffice to achieve error e in trace distance. For fixed d, our measurement can be implemented on a quantum computer in time polynomial in n. We also use the Holevo bound from quantum information theory to prove a lower bound of Ω(dr/∈2)/log(d/r∈) copies needed to achieve error e in trace distance. This implies a lower bound Ω(dr/δ)/log(d/rδ) for the estimation error δ in infidelity. These match our upper bounds up to log factors. Our techniques can also show an Ω(r d/δ) lower bound for measurement strategies in which each copy is measured individually and then the outcomes are classically post-processed to produce an estimate. This matches the known achievability results and proves for the first time that such "product" measurements have asymptotically suboptimal scaling with d and r.
Please use this identifier to cite or link to this item: