2000 character limit reached
Pauli Measurements Are Near-Optimal for Pure State Tomography
Published 7 Jan 2026 in quant-ph | (2601.04444v1)
Abstract: We give an algorithm for pure state tomography with near-optimal copy complexity using single-qubit measurements. Specifically, given $\widetilde{O}(2n/ε)$ copies of an unknown pure $n$-qubit state $\lvertψ\rangle$, the algorithm performs only \textit{nonadaptive Pauli measurements}, runs in time $\mathrm{poly}(2n,1/ε)$, and outputs $\lvert \widehatψ \rangle$ that has fidelity $1-ε$ with $\lvert ψ\rangle$ with high probability. This improves upon the previous best copy complexity bound of $\widetilde{O}(3n/ε)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.