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.
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.
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.
The techniques of low-rank matrix recovery were adapted for quantum state tomography (QST) previously by Gross et al. [Phys. Rev. Lett. 105, 150401 (2010)] where they consider the tomography of n spin-1/2 systems. For the density matrix of dimension d=2n and rank r with $r\ensuremath{\ll}{2}^{n}$, it was shown that randomly chosen Pauli measurements of the order O[drlog(d)2] are enough to fully reconstruct the density matrix by running a specific convex optimization algorithm. The result utilized the low operator norm of the Pauli operator basis, which makes it ``incoherent'' to low-rank matrices. For quantum systems of dimension d not a power of two, Pauli measurements are not available, and one may consider using SU(d) measurements. Here, we point out that the SU(d) operators, owing to their high operator norm, do not provide a significant savings in the number of measurement settings required for successful recovery of all rank-r states. We propose an alternative strategy in which the quantum information is swapped into the subspace of a power-two system using only poly[log(d)2] gates at most with QST being implemented, subsequently, by performing O[drlog(d)2] Pauli measurements. We show that, despite the increased dimensionality, this method is more efficient than the one using SU(d) measurements.
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.
Abstract Compressed sensing (CS) has been verified that it offers a significant performance improvement for large quantum systems comparing with the conventional quantum tomography approaches, because it reduces the number of measurements from O ( d 2 ) to O ( rd log( d )) in particular for quantum states that are fairly pure. Yet few algorithms have been proposed for quantum state tomography using CS specifically, let alone basis analysis for various measurement sets in quantum CS. To fill this gap, in this paper an efficient and robust state reconstruction algorithm based on compressive sensing is developed. By leveraging the fixed point equation approach to avoid the matrix inverse operation, we propose a fixed-point alternating direction method algorithm for compressive quantum state estimation that can handle both normal errors and large outliers in the optimization process. In addition, properties of five practical measurement bases (including the Pauli basis) are analyzed in terms of their coherences and reconstruction performances, which provides theoretical instructions for the selection of measurement settings in the quantum state estimation. The numerical experiments show that the proposed algorithm has much less calculating time, higher reconstruction accuracy and is more robust to outlier noises than many existing state reconstruction algorithms.
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 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.