Quantum state certification
Costin B\u{a}descu, Ryan O'Donnell, John Wright

TL;DR
This paper introduces efficient algorithms for quantum state certification that significantly reduce the number of copies needed compared to full tomography, with optimal copy complexities for testing state fidelity and trace distance.
Contribution
The paper presents two robust quantum state certification algorithms with optimal copy complexities, improving efficiency over previous methods.
Findings
Fidelity-based certification uses O(d/ε) copies.
Trace distance certification uses O(d/ε^2) copies.
Algorithms are optimal up to constant factors.
Abstract
We consider the problem of quantum state certification, where one is given copies of an unknown -dimensional quantum mixed state , and one wants to test whether is equal to some known mixed state or else is -far from . The goal is to use notably fewer copies than the needed for full tomography on (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using copies, and one with respect to trace distance using copies. The latter algorithm also applies when is unknown as well. These copy complexities are optimal up to constant factors.
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.
