Maximum-Likelihood Quantum State Tomography by Cover's Method with Non-Asymptotic Analysis

Abstract

We propose an iterative algorithm that computes the maximum-likelihood estimate in quantum state tomography. The optimization error of the algorithm converges to zero at an $O((1/k)\log D)$ rate, where $k$ denotes the number of iterations and $D$ denotes the dimension of the quantum state. The per-iteration computational complexity of the algorithm is $O(D^3+N{D}^2)$, where $N$ denotes the number of measurement outcomes. The algorithm can be considered as a parameter-free correction of the $R\rho R$ method [A. I. Lvovsky. Iterative maximum-likelihood reconstruction in quantum homodyne tomography. \textit{J. Opt. B: Quantum Semiclass. Opt.} 2004] [G. Molina-Terriza et al. Triggered qutrits for quantum communication protocols. \textit{Phys. Rev. Lett.} 2004.].

arXiv comment8 pages

References in corpus (9)

• Quantum state tomography via compressed sensing
• Optimal, reliable estimation of quantum states
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Iterative maximum-likelihood reconstruction in quantum homodyne tomography
• Triggered qutrits for Quantum Communication protocols
• Diluted maximum-likelihood algorithm for quantum tomography
• Hedged maximum likelihood estimation
• Least-squares inversion for density-matrix reconstruction
• Quantum State Tomography with Conditional Generative Adversarial Networks