Photonic quantum sensing often uses low-rank entangled probes such as Greenberger-Horne-Zeilinger (GHZ), Bell, and NOON states. Although these probes are ideally rank-1, practical quantum state tomography (QST) can produce density-matrix estimates with many small finite-shot and noise-induced eigenmodes. This eigenvalue contamination can increase the estimated entropy of the reconstruction and reduce the quantum Fisher information (QFI) available for downstream sensing, while fixed rank-1 purification can discard valid signal modes when real probes acquire additional signal modes. We introduce Spectral Subspace Purification for Quantum State Tomography (SSP-QST), a rank-adaptive post-processing layer for least-squares quantum state tomography (LS-QST). SSP-QST eigendecomposes the least-squares estimate, computes a Weyl-motivated noise floor from the measured spectrum and shot count, removes eigenmodes below this floor, and renormalises the retained subspace. It requires no rank prior, no iterative optimisation, and only one eigendecomposition. In Qiskit Aer simulations, SSP-QST achieves the highest fidelity among the tested non-iterative baselines across the evaluated probe ranks, with a maximum fidelity gain of $+0.584$. It also improves shot efficiency by at least $8\times$ within the tested range. These results show that SSP-QST can make photonic QST more reliable under finite-shot noise while providing a lightweight reconstruction primitive for feedback-oriented quantum sensing pipelines.
Comments
10 pages + 1 page of references, 6 figures. Accepted at the IEEE International Conference on Quantum Computing and Engineering (QCE 2026), Quantum Photonics track. Code: https://github.com/AnuvabSen1/SSP-QST
Photonic quantum sensing often uses low-rank entangled probes such as Greenberger-Horne-Zeilinger (GHZ), Bell, and NOON states. Although these probes are ideally rank-1, practical quantum state tomography (QST) can produce density-matrix estimates with many small finite-shot and noise-induced eigenmodes. This eigenvalue contamination can increase the estimated entropy of the reconstruction and reduce the quantum Fisher information (QFI) available for downstream sensing, while fixed rank-1 purification can discard valid signal modes when real probes acquire additional signal modes. We introduce Spectral Subspace Purification for Quantum State Tomography (SSP-QST), a rank-adaptive post-processing layer for least-squares quantum state tomography (LS-QST). SSP-QST eigendecomposes the least-squares estimate, computes a Weyl-motivated noise floor from the measured spectrum and shot count, removes eigenmodes below this floor, and renormalises the retained subspace. It requires no rank prior, no iterative optimisation, and only one eigendecomposition. In Qiskit Aer simulations, SSP-QST achieves the highest fidelity among the tested non-iterative baselines across the evaluated probe ranks, with a maximum fidelity gain of +0.584. It also improves shot efficiency by at least 8× within the tested range. These results show that SSP-QST can make photonic QST more reliable under finite-shot noise while providing a lightweight reconstruction primitive for feedback-oriented quantum sensing pipelines.
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) estimates an unknown quantum state from a measurement process typically performed on identical copies of the target state and plays a core role in characterizing quantum information systems. However, because quantum measurement outcomes are probabilistic, QST methods often require many shots per basis to achieve high-fidelity estimates, which hinders scalability to many-qubit applications and slows the transmission of quantum information. A more efficient procedure is therefore required for modern-day quantum operations in quantum computing, communications, and sensing. We address this need with an adaptive QST approach that measures a single-qubit state in a wide set of bases. We include bases beyond the Pauli triad {X,Y,Z} by leveraging the infinite-dimensional Hilbert space of quantum mechanics, increasing the likelihood of producing highly polarized measurement outcomes and finding an optimally informative basis. With this basis, the state can be identified with fewer measurements by focusing on directions that most reduce uncertainty of the state. In addition to theoretical innovation in [9], we experimentally verify in a simplified photonic realization using 13 bases that having many more available measurement bases than the Pauli triad benefits QST. This engineering implementation demonstrates that adaptive QST is both efficient in performance and practical to implement.
Abstract Quantum state tomography (QST) is a widely employed technique for characterizing the state of a quantum system. However, it is plagued by two fundamental challenges: computational and experimental complexity grows exponentially with the number of qubits, rendering experimental implementation and data post-processing arduous even for moderately sized systems. Here, we introduce gradient-descent (GD) algorithms for the post-processing step of QST in discrete- and continuous-variable systems. To ensure physically valid state reconstruction at each iteration step of the algorithm, we use various density-matrix parameterizations: Cholesky decomposition, Stiefel manifold, and projective normalization. These parameterizations have the added benefit of enabling a rank-controlled ansatz, which simplifies reconstruction when there is prior information about the system. We benchmark the performance of our GD-QST techniques against state-of-the-art methods, including constrained convex optimization, conditional generative adversarial networks, and iterative maximum likelihood estimation. Our comparison focuses on time complexity, iteration counts, data requirements, state rank, and robustness against noise. We find that rank-controlled ansatzes in our stochastic mini-batch GD-QST algorithms effectively handle noisy and incomplete data sets, yielding significantly higher reconstruction fidelity than other methods. Simulations achieving full-rank seven-qubit QST in under three minutes on a standard laptop, with 18 GB of RAM and no dedicated GPU, highlight that GD-QST is computationally more efficient and outperforms other techniques in most scenarios, offering a promising avenue for characterizing noisy intermediate-scale quantum devices. Our Python code for GD-QST algorithms is publicly available at github.com/mstorresh/GD-QST .
Quantum state tomography (QST) has attracted considerable attention due to its fundamental role in quantum information processing. In this paper, we develop a unified theoretical framework for analyzing the sample complexity of structured QST under noisy observations arising from state preparation noise, measurement noise, and finite-shot statistical noise. The proposed framework applies to a broad family of structured quantum-state classes, including general mixed states, sparse states, low-rank states, matrix product states (MPSs), matrix product operators (MPOs), projected entangled-pair states (PEPSs), and projected entangled-pair operators (PEPOs), while further introducing physically consistent structured models---including low-rank and sparse states, low-rank MPOs (LR-MPOs), and low-rank PEPOs (LR-PEPOs)---that simultaneously exploit low-dimensional structures and preserve the physical constraint. Within this framework, we derive unified non-asymptotic sample complexity guarantees for two constrained least-squares estimators under noisy observations: a noise-aware estimator that incorporates the calibrated noise model and a noise-unaware estimator based on the ideal Born measurement model. For the noise-aware estimator, we derive unified trace-norm recovery guarantees that explicitly characterize the dependence of the sample complexity on three fundamental quantities: the complexity of the underlying structured state class, the complexity of the measurement ensemble, and the state preparation and measurement noise levels. For the noise-unaware estimator, we establish a unified non-asymptotic recovery guarantee consisting of a statistical error term and an additional deterministic bias term arising from the mismatch between the assumed reconstruction model and the noisy observation process.
Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In this work, we propose an efficient and robust mixed-state tomography scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. High tomography fidelity is achieved with much smaller numbers of positive-operator-valued measurement (POVM) bases than the conventional least-square (LS) method. On the superconducting quantum experimental circuit [Phys. Rev. Lett. 119, 180511 (2017)], our scheme accurately reconstructs the Greenberger-Horne-Zeilinger (GHZ) state and exhibits robustness to experimental noises. Specifically, we achieve the fidelity F≃0.92 for the 10-qubit GHZ state with just Nm=500 POVM bases, which far outperforms the fidelity F≃0.85 by the LS method using the full Nm=310=59049 bases. Our work reveals the prospects of applying tensor network state ansatz and the machine learning approaches for efficient QST of many-body states.
The estimation of high dimensional quantum states is an important statistical problem arising in current quantum technology applications. A key example is the tomography of multiple ions states, employed in the validation of state preparation in ion trap experiments (Häffner et al 2005 Nature 438 643 ). Since full tomography becomes unfeasible even for a small number of ions, there is a need to investigate lower dimensional statistical models which capture prior information about the state, and to devise estimation methods tailored to such models. In this paper we propose several new methods aimed at the efficient estimation of low rank states and analyse their performance for multiple ions tomography. All methods consist in first computing the least squares estimator, followed by its truncation to an appropriately chosen smaller rank. The latter is done by setting eigenvalues below a certain 'noise level' to zero, while keeping the rest unchanged, or normalizing them appropriately. We show that (up to logarithmic factors in the space dimension) the mean square error of the resulting estimators scales as where r is the rank, is the dimension of the Hilbert space, and N is the number of quantum samples. Furthermore we establish a lower bound for the asymptotic minimax risk which shows that the above scaling is optimal. The performance of the estimators is analysed in an extensive simulations study, with emphasis on the dependence on the state rank, and the number of measurement repetitions. We find that all estimators perform significantly better than the least squares, with the 'physical estimator' (which is a bona fide density matrix) slightly outperforming the other estimators.