REVIEW 2 cited by
Sample efficient tomography via Pauli Measurements
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Pauli Measurements are the most important measurements in both theoretical and experimental aspects of quantum information science. In this paper, we explore the power of Pauli measurements in the state tomography related problems. Firstly, we show that the \textit{quantum state tomography} problem of $n$-qubit system can be accomplished with ${\mathcal{O}}(\frac{10^n}{\epsilon^2})$ copies of the unknown state using Pauli measurements. As a direct application, we studied the \textit{quantum overlapping tomography} problem introduced by Cotler and Wilczek in Ref. \cite{Cotler_2020}. We show that the sample complexity is $\mathcal{O}(\frac{10^k\cdot\log({{n}\choose{k}}/\delta))}{\epsilon^{2}})$ for quantum overlapping tomography of $k$-qubit reduced density matrices among $n$ is quantum system, where $1-\delta$ is the confidential level, and $\epsilon$ is the trace distance error. This can be achieved using Pauli measurements. Moreover, we prove that $\Omega(\frac{\log(n/\delta)}{\epsilon^{2}})$ copies are needed. In other words, for constant $k$, joint, highly entangled, measurements are not asymptotically more efficient than Pauli measurements.
Forward citations
Cited by 2 Pith papers
-
Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
Single-qubit measurements need Ω(10^N/(√N ε²)) copies for N-qubit tomography, matching the Pauli-measurement upper bound up to a √N factor.
-
Online Quantum State Tomography via Stochastic Gradient Descent
Mini-batch stochastic gradient descent with Pauli measurements can reconstruct low-rank quantum states online, with local linear convergence guarantees and lower time complexity than prior non-convex methods.
Discussion (0). Continue with ORCID to comment.