Quantum state tomography (QST) is an executable procedure, allowing complete reconstruction of a quantum state. As a basic tool, QST is widely employed in quantum information research. However, many projective measurements on identical copies of the quantum state under test are required in standard QST, which is heavily time-consumed. Here, we perform reconstruction of density matrix with dimensionality of $15\times 15$ by utilizing compressed sensing method at a sampling ratio of 0.35. According to the experimental results, the fidelity could be as high as 93.0%~99.4% and 73.8% for coherent laser beams and heralded single photon sources, respectively.
Quantum state tomography (QST) is an executable procedure, allowing complete reconstruction of a quantum state. As a basic tool, QST is widely employed in quantum information research. However, many projective measurements on identical copies of the quantum state under test are required in standard QST, which is heavily time-consumed. Here, we perform reconstruction of density matrix with dimensionality of 15×15 by utilizing compressed sensing method at a sampling ratio of 0.35. According to the experimental results, the fidelity could be as high as 93.0%~99.4% and 73.8% for coherent laser beams and heralded single photon sources, respectively.
Quantum state tomography (QST) is a crucial technique for characterizing the state of quantum systems. However, traditional QST requires a large number of measurements, leading to significant experimental overhead in terms of time, resources, and data acquisition. This work proposes a novel approach to QST by leveraging compressed sensing (CS) techniques. CS allows for accurate reconstruction of the quantum state from a significantly reduced set of measurements, thereby mitigating the experimental burden. We employ sparsity regularization, a key component of CS, to minimize the number of measurements needed. The theoretical framework and the underlying principles are presented, focusing on the mathematical formulation of the problem and the optimization strategies involved. This method offers a pathway to more efficient and cost-effective QST, particularly for complex quantum states or when limited experimental resources are available. We demonstrate the potential of this approach through a detailed mathematical analysis.
Quantum state tomography (QST) is a crucial technique for characterizing quantum states, forming the bedrock of quantum information processing and quantum metrology. However, traditional QST relies on a large number of measurements, making it computationally expensive and experimentally demanding. This work addresses this challenge by proposing a novel algorithm that integrates compressed sensing (CS) and Bayesian inference to achieve accurate quantum state reconstruction from limited measurement data. The core idea is to exploit the inherent sparsity of quantum states and leverage CS principles to significantly reduce the required measurement count. The algorithm utilizes a sparse dictionary learned from prior knowledge of the quantum state and employs Bayesian inference to estimate the state parameters, providing a robust and efficient reconstruction process. The results demonstrate the feasibility and effectiveness of this approach, offering a pathway towards more practical and accessible QST methods. Key mathematical formulations are presented, including the Bayesian inference framework and the CS reconstruction process.
Quantum state tomography (QST) is a fundamental task in quantum information science that aims to reconstruct unknown quantum states from measurement data. However, the exponential growth of Hilbert-space dimension with system size makes full tomography of general quantum states statistically and computationally prohibitive. This challenge has motivated extensive research on structured quantum state tomography, where prior structure, such as low-rankness, tensor-network representations, shallow quantum circuits, and neural quantum states, can substantially reduce the effective degrees of freedom and enable scalable recovery. In this review, we provide a unified perspective on QST for structured quantum states through three closely related themes: compact state representations, measurement design, and computational algorithms. After reviewing common models for structured quantum states, we survey existing work on geometric preservation properties of measurement frameworks, ranging from informationally complete POVMs to randomized measurements, and their implications for sample complexity. On the algorithmic side, we review optimization methods for reconstructing structured quantum states from empirical measurements. By connecting QST with broader principles from compressive sensing, matrix sensing, and structured inverse problems, this survey highlights common theoretical foundations underlying sample complexity, measurement efficiency, and scalable recovery.
Quantum state tomography (QST) is an essential technique for reconstructing the density matrix of an unknown quantum state from measurement data, crucial for quantum information processing. However, conventional QST requires an exponentially growing number of measurements as the system dimension increases, posing a significant challenge for high-dimensional systems. To mitigate this issue, compressed sensing quantum state tomography (CS-QST) has been proposed, significantly reducing the required number of measurements. In this study, we investigate the impact of basis selection in CS-QST for qudit systems, which are fundamental to high-dimensional quantum information processing. Specifically, we compare the efficiency of the generalized Gell-Mann (GGM) and Heisenberg-Weyl observable (HWO) bases by numerically reconstructing density matrices and evaluating reconstruction accuracy using fidelity and trace distance metrics. Our results demonstrate that, while both bases allow for successful density matrix reconstruction, the HWO basis becomes more efficient as the qudit dimension increases. Furthermore, we find the best fitting curves that estimate the number of measurement operators required to achieve a fidelity of at least 95%. These findings highlight the significance of basis selection in CS-QST and provide valuable insights for optimizing measurement strategies in high-dimensional quantum state tomography.
Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. Firstly, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e. the sample complexity of tomography decreases with the rank. Secondly, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. In this paper, we present a new theoretical analysis of compressed tomography, based on the restricted isometry property for low-rank matrices. Using these tools, we obtain near-optimal error bounds for the realistic situation where the data contain noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators—the matrix Dantzig selector and the matrix Lasso—with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low-rank estimate using direct fidelity estimation, and describe a method for compressed quantum process tomography that works for processes with small Kraus rank and requires only Pauli eigenstate preparations and Pauli measurements.
A fundamental difficulty in demonstrating quantum state tomography is that the required resources grow exponentially with the system size. For pure states and nearly pure states, the task of tomography can be more efficient. We proposed two methods for state reconstruction, by (1) minimizing entropy and (2) maximizing likelihood. The algorithm of compressed sampling is employed to solve the optimization problem. Experiments are demonstrated considering 4-qubit photonic states. The results show that (1) much fewer measurements than the standard tomography are sufficient to obtain high fidelity, and (2) the method of maximizing likelihood is more accurate and noise robust than the original reconstruction method of compressed sampling. Furthermore, the physical meaning of the methods of minimizing entropy and maximizing likelihood is clear.