pith. sign in

arxiv: 1508.01797 · v2 · pith:43XYHWZDnew · submitted 2015-08-07 · 🪐 quant-ph · cs.IT· math.IT

Sample-optimal tomography of quantum states

classification 🪐 quant-ph cs.ITmath.IT
keywords deltacopiesepsilonerrorquantumachievedistanceinfidelity
0
0 comments X
read the original abstract

It is a fundamental problem to decide how many copies of an unknown mixed quantum state are necessary and sufficient to determine the state. Previously, it was known only that estimating states to error $\epsilon$ in trace distance required $O(dr^2/\epsilon^2)$ copies for a $d$-dimensional density matrix of rank $r$. Here, we give a theoretical measurement scheme (POVM) that requires $O (dr/ \delta ) \ln (d/\delta) $ copies of $\rho$ to error $\delta$ in infidelity, and a matching lower bound up to logarithmic factors. This implies $O( (dr / \epsilon^2) \ln (d/\epsilon) )$ copies suffice to achieve error $\epsilon$ in trace distance. We also prove that for independent (product) measurements, $\Omega(dr^2/\delta^2) / \ln(1/\delta)$ copies are necessary in order to achieve error $\delta$ in infidelity. For fixed $d$, our measurement can be implemented on a quantum computer in time polynomial in $n$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An Exponential Advantage for Adaptive Tomography of Structured States under Pauli Basis Measurements

    quant-ph 2026-04 unverdicted novelty 8.0

    For an explicit prefix/tree family of quantum states, adaptive local Pauli tomography achieves polynomial copy complexity while non-adaptive strategies require exponentially many copies.

  2. Conditional Independence of 1D Gibbs States with Applications to Efficient Learning

    quant-ph 2024-02 unverdicted novelty 6.0

    1D translation-invariant Gibbs states at positive temperature exhibit superexponential decay of Belavkin-Staszewski conditional mutual information, enabling efficient learning from local measurements and tensor networ...