mlsanityData to 7 Oct 2026

Quantum state certification

arXiv 1708.06002 ↗First posted 20 Aug 2017quant-ph cs.DScited by 13

Not on the map. Why?

Abstract (arXiv)

We consider the problem of quantum state certification, where one is given n copies of an unknown d-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 Omega(d2) needed for full tomography on ρ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using n = O(d/ε) copies, and one with respect to trace distance using n = O(d/ε2) copies. The latter algorithm also applies when σ is unknown as well. These copy complexities are optimal up to constant factors.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Aug 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 4; 2025: 4; 2026: 1.

13 papers.

Sort: