Fast Quantum State Reconstruction via Accelerated Non-Convex Programming


We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (MiFGD), extends the applicability of quantum tomography for larger systems. Despite being a non-convex method, MiFGD converges provably close to the true density matrix at an accelerated linear rate asymptotically in the absence of experimental and statistical noise, under common assumptions. With this manuscript, we present the method, prove its convergence property and provide the Frobenius norm bound guarantees with respect to the true density matrix. From a practical point of view, we benchmark the algorithm performance with respect to other existing methods, in both synthetic and real (noisy) experiments, performed on the IBM’s quantum processing unit. We find that the proposed algorithm performs orders of magnitude faster than the state-of-the-art approaches, with similar or better accuracy. In both synthetic and real experiments, we observed accurate and robust reconstruction, despite the presence of experimental and statistical noise in the tomographic data. Finally, we provide a ready-to-use code for state tomography of multi-qubit systems.

Journal article

Kim, Junhyung Lyle, Kollias, George, Kalev, Amir, et al.. "Fast Quantum State Reconstruction via Accelerated Non-Convex Programming." Photonics, 10, no. 2 (2023) MDPI:

Has part(s)
Forms part of
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (
Citable link to this page