This talk will introduce numerical and analytical techniques of convex optimization. While these techniques have found wide application in quantum information, we will focus on applications to data analysis in quantum state and process tomography.
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.
Quantum state tomography (QST) is a technique for characterizing, benchmarking, and verifying quantum systems and devices. In this paper, we focus on collective QST using data from collective measurements performed on multiple copies of the state. We propose a closed-form solution and provide an analytical characterization of its computational complexity and mean squared error (MSE) scaling. Additionally, we reformulate the problem as a sum of squares (SOS) optimization problem with semialgebraic constraints, enabling the application of SOS tools for its solution. The effectiveness of the proposed methods is demonstrated through numerical simulations. Furthermore, we validate the algorithms using two-copy collective experimental data, where the entangled measurement provides information about the state purity. Compared to previous methods, our algorithms achieve lower MSEs and approach the collective MSE bound by leveraging this purity information more efficiently.
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.