Fast quantum measurement tomography with dimension-optimal error bounds
Leonardo Zambrano, Sergi Ramos-Calderer, Richard Kueng
TL;DR
The paper tackles detector ( POVM ) tomography by introducing a two-step projected least-squares protocol that decouples data fitting from constraint enforcement, achieving dimension-optimal sample complexity up to logarithmic factors. It provides non-asymptotic guarantees for two natural distance metrics, d_op and d_av, with explicit sample bounds for both global and tensor-product 2-design probe ensembles. The authors establish matching information-theoretic lower bounds for non-adaptive tomography and demonstrate practical applicability through experiments on noisy superconducting qubits, highlighting potential uses in error mitigation and detector calibration. The work advances understanding of QMT efficiency, offering analytic LS forms under 2-designs and concrete guidance for implementing reliable detector tomography in larger quantum systems.
Abstract
We present a two-step protocol for quantum measurement tomography that is light on classical co-processing cost and still achieves optimal sample complexity in the system dimension. Given measurement data from a known probe state ensemble, we first apply least-squares estimation to produce an unconstrained approximation of the POVM, and then project this estimate onto the set of valid quantum measurements. For a POVM with $L$ outcomes acting on a $d$-dimensional system, we show that the protocol requires $\mathcal{O}(d^3 L \ln(d)/ε^2)$ samples to achieve error $ε$ in worst-case distance, and $\mathcal{O}(d^2 L^2 \ln(dL)/ε^2)$ samples in average-case distance. We further establish two almost matching sample complexity lower bounds of $Ω(d^3/ε^2)$ and $Ω(d^2 L/ε^2)$ for any non-adaptive, single-copy POVM tomography protocol. Hence, our projected least squares POVM tomography is sample-optimal in dimension $d$ up to logarithmic factors. Our method admits an analytic form when using global or local 2-designs as probe ensembles and enables rigorous non-asymptotic error guarantees. Finally, we also complement our findings with empirical performance studies carried out on a noisy superconducting quantum computer with flux-tunable transmon qubits.
