Precise reconstruction of unknown quantum states from measurement data, a process commonly called quantum state tomography, is a crucial component in the development of quantum information processing technologies. Many different tomography methods have been proposed over the years. Maximum-likelihood estimation is a prominent example, being the most popular method for a long period of time. Recently, more advanced neural-network methods have started to emerge. Here, we go back to basics and present a method for continuous-variable state reconstruction that is both conceptually and practically simple, based on convex optimization. Convex optimization has been used for process tomography and qubit-state tomography, but seems to have been overlooked for continuous-variable quantum-state tomography. We demonstrate high-fidelity reconstruction of an underlying state from data corrupted by thermal noise and imperfect detection, for both homodyne and heterodyne measurements. A major advantage over other methods is that convex optimization algorithms are guaranteed to converge to the optimal solution.
Precise reconstruction of unknown quantum states from measurement data, a process commonly called quantum state tomography, is a crucial component in the development of quantum information processing technologies. Many different tomography methods have been proposed over the years. Maximum-likelihood estimation is a prominent example, being the most popular method for a long period of time. Recently, more advanced neural-network methods have started to emerge. Here, we go back to basics and present a method for continuous-variable state reconstruction that is both conceptually and practically simple, based on convex optimization. Convex optimization has been used for process tomography and qubit-state tomography, but seems to have been overlooked for continuous-variable quantum-state tomography. We demonstrate high-fidelity reconstruction of an underlying state from data corrupted by thermal noise and imperfect detection, for both homodyne and heterodyne measurements. A major advantage over other methods is that convex optimization algorithms are guaranteed to converge to the optimal solution.
Quantum states encoded in electromagnetic fields, also known as bosonic states, have been widely applied in quantum sensing, quantum communication, and quantum error correction. Accurate characterization is therefore essential yet difficult when states cannot be reconstructed with sparse Pauli measurements. Tomography must work with dense measurement bases, high-dimensional Hilbert spaces, and often sample-based data. However, existing convex optimization-based techniques are not efficient enough and scale poorly when extended to large and multimode systems. In this work, we explore convex optimization as an effective framework to address problems in bosonic state tomography, introducing three techniques to enhance efficiency and scalability: efficient displacement operator computation, Hilbert-space truncation, and stochastic convex optimization, which mitigate common limitations of existing approaches. Then we propose a sample-based, convex maximum-likelihood estimation method specifically designed for flying-mode tomography. Numerical simulations of flying four-mode and nine-mode problems demonstrate the accuracy and practicality of our methods. This method provides practical tools for reliable bosonic mode quantum state reconstruction in high-dimensional and multimode systems.
Conventional methods for computing maximum-likelihood estimators (MLE) often converge slowly in practical situations, leading to a search for simplifying methods that rely on additional assumptions for their validity. In this work, we provide a fast and reliable algorithm for maximum-likelihood reconstruction that avoids this slow convergence. Our method utilizes the state-of-the-art convex optimization scheme, an accelerated projected-gradient method, that allows one to accommodate the quantum nature of the problem in a different way than in the standard methods. We demonstrate the power of our approach by comparing its performance with other algorithms for n-qubit state tomography. In particular, an eight-qubit situation that purportedly took weeks of computation time in 2005 can now be completed in under a minute for a single set of data, with far higher accuracy than previously possible. This refutes the common claim that MLE reconstruction is slow and reduces the need for alternative methods that often come with difficult-to-verify assumptions. In fact, recent methods assuming Gaussian statistics or relying on compressed sensing ideas are demonstrably inapplicable for the situation under consideration here. Our algorithm can be applied to general optimization problems over the quantum state space; the philosophy of projected gradients can further be utilized for optimization contexts with general constraints.
With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optimization. The algorithm excels in the compressed-sensing-like setting, where only a few data points are measured from a low-rank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol.
Continuous-variable (CV) photonic states are of increasing interest in quantum information science, bolstered by features such as deterministic resource state generation and error correction via bosonic codes. Data-efficient characterization methods will prove critical in the fine-tuning and maturation of such CV quantum technology. Although Bayesian inference offers appealing properties-including uncertainty quantification and optimality in mean-squared error-Bayesian methods have yet to be demonstrated for the tomography of arbitrary CV states. Here we introduce a complete Bayesian quantum state tomography workflow capable of inferring generic CV states measured by homodyne or heterodyne detection, with no assumption of Gaussianity. As examples, we demonstrate our approach on experimental coherent, thermal, and cat state data, obtaining excellent agreement between our Bayesian estimates and theoretical predictions. Our approach lays the groundwork for Bayesian estimation of highly complex CV quantum states in emerging quantum photonic platforms, such as quantum communications networks and sensors.
Drawing inspiration from gradient-descent methods developed for data processing in quantum state tomography [\href{https://iopscience.iop.org/article/10.1088/2058-9565/ae0baa}{Quantum Sci.~Technol.~\textbf{10} 045055 (2025)}] and quantum process tomography [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.150402}{Phys.~Rev.~Lett.~\textbf{130}, 150402 (2023)}], we introduce stochastic gradient descent (SGD) algorithms for fast quantum measurement tomography (QMT), applicable to both discrete- and continuous-variable quantum systems -- thus completing the tomography trio. A measurement device or detector in a quantum experiment is characterized by a set of positive operator-valued measure (POVM) elements; the goal of QMT is to estimate these operators from experimental data. To ensure physically valid (positive and complete) POVM reconstructions, we propose two distinct parameterization schemes within the SGD framework: one leveraging optimization on a Stiefel manifold and one based on Hermitian operator normalization via eigenvalue scaling. Within the SGD-QMT framework, we further investigate two loss functions: mean squared error, equivalent to L2 or Euclidean norm, and average negative log-likelihood, inspired by maximum likelihood estimation. We benchmark performance against state-of-the-art constrained convex optimization methods. Numerical simulations demonstrate that, compared to standard methods, our SGD-QMT algorithms offer significantly lower computational cost, superior reconstruction fidelity, and enhanced robustness to noise. We make a Python implementation of the SGD-QMT algorithms publicly available at \href{https://github.com/agtomo/SGD-QMT}{github.com/agtomo/SGD-QMT}.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε-approximate ML estimate in O((DlogD)/ε2) iterations with O(D3) per-iteration time complexity, where D denotes the dimension of the unknown quantum state and ε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.