An Improved Sample Complexity Lower Bound for (Fidelity) Quantum State Tomography
Henry Yuen

TL;DR
This paper establishes a new lower bound on the number of copies needed for quantum state tomography, showing that at least on the order of rd/epsilon copies are necessary for accurate reconstruction.
Contribution
It provides an improved sample complexity lower bound for quantum state tomography based on fidelity, refining previous bounds in the field.
Findings
Lower bound of Ω(rd/ε) copies for quantum state tomography
Improves upon previous bounds by Haah et al. and Wright
Focuses on fidelity as the measure of closeness
Abstract
We show that copies of an unknown rank-, dimension- quantum mixed state are necessary in order to learn a classical description with fidelity. This improves upon the tomography lower bounds obtained by Haah, et al. and Wright (when closeness is measured with respect to the fidelity function).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Machine Learning and Algorithms
