Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

New Journal of Physics

A modified least squares-based tomography with density matrix perturbation and linear entropy consideration along with performance analysis

Subhadeep Mondal, Amit Kumar Dutta

Published Aug 1, 2023• 6 citations
Publisher

Abstract

Abstract Quantum state tomography identifies target quantum states by performing repetitive measurements on identical copies. In this paper, we have two key contributions aimed at improving traditional post-processing computational complexity and sample complexity of quantum tomography protocols. In the first case, we propose a new low-cost positivity constraint method based on density matrix perturbation after the least squares (LS) estimation of the density matrix. In the second case, we propose a new cost function with the maximum linear entropy and LS method to improve the sample average trace distance with reasonably low sample complexity. We call it the LS with the maximum entropy (LSME) method. Our proposed algorithm does not follow the iterative optimization technique, which is true for existing maximum likelihood and entropy-based ones. Performance analysis is conducted for our proposed methods by studying how they compare to the existing techniques for different sample complexities and dimensionalities. Extensive numerical simulations have been conducted to demonstrate the advantages of the proposed tomography algorithms.

DOI
10.1088/1367-2630/acf187

Related papers

Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators

Steven T. Flammia, David Gross, Yi-Kai Liu +1 more

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.

arXiv:1205.2300•New Journal of Physics•Sep 27, 2012•390 citations

A Bayesian quantum state tomography along with adaptive frameworks based on linear minimum mean square error criterion

Subhadeep Mondal, Amit Kumar Dutta

Abstract Quantum state tomography (QST) is essential for characterizing unknown quantum states. Several methods of estimating quantum states already exist and can be classified mainly into three broad classes. They are based on the criteria like maximum likelihood, linear inversion, and Bayesian framework. The Bayesian framework for QST gives a better reconstruction performance. However, the existing methods of the Bayesian frameworks are computationally extensive and, most of the time require knowledge about the prior distribution of the quantum state. In this paper, we propose a Bayesian method of QST based on the linear minimum mean square error criterion, where the prior statistics are estimated and the computational complexity is comparable to that of the linear inversion based QST method. We also propose an adaptive version based on the block estimation of parameters. Extensive numerical simulations are conducted to demonstrate its efficacy over the linear inversion-based QST regarding trace distance error metric.

New Journal of Physics•Nov 20, 2023•4 citations

Reconstruction of quantum states by applying an analytical optimization model

Rohit Prasad, Pratyay Ghosh, Ronny Thomale +1 more

When working with quantum states, analysis of the final quantum state generated through probabilistic measurements is essential. This analysis is typically conducted by constructing the density matrix from either partial or full tomography measurements of the quantum state. While full tomography measurement offers the most accurate reconstruction of the density matrix, limited measurements pose challenges for reconstruction algorithms, often resulting in nonphysical density matrices with negative eigenvalues. This is often remedied using maximum likelihood estimators, which have a high computing time or by other estimation methods that decrease the reconstructed fidelity. In this paper, we show that when restricting the measurement sample size, improvement over existing algorithms can be achieved. Our findings underline the multiplicity of solutions in the reconstruction problem, depending upon the generated state and measurement model utilized, thus motivating further research towards identifying optimal algorithms tailored to specific experimental contexts.

arXiv:2501.07404•Physical Review A•Feb 3, 2025•2 citations

Structured Factorization Approaches for Quantum State Tomography

Zhen Qin, Joseph M. Lukens, Brian T. Kirby +1 more

Since the complexity of quantum state tomography (QST) scales exponentially with system size, exploiting priors such as low-rankness, tensor-network structures, and neural-network representations is essential for scalable QST in terms of sample complexity and parameter complexity. In this paper, we introduce a unified framework, termed structured factorization, that builds on BurerMonteiro-type factorization by parametrizing the density matrix as $FF^\dagger$, where the factor $F$ is constrained to belong to a structured model class. This factorization guarantees physical validity by construction while allowing a broad range of structural priors to be incorporated directly through the choice of the factor space, ranging from the generic Cholesky decomposition to low-rank matrices, matrix product operators, and neural density operators based on multilayer perceptron and transformer architectures. Building on this structured factorization framework, we formulate QST as an optimization problem over the factor space from measurement data. We first develop a unified statistical analysis of the sample complexity of least-squares estimation for a broad class of structured quantum states. We then propose a projected gradient descent method that operates directly on the factor space and accommodates a wide range of structural parametrizations and reconstruction objectives. To further exploit the geometry of the maximum-likelihood estimation formulation and the constraints on the factors, we derive a power method that yields a step-size-free algorithm with fast convergence, recovering Covers method as a special case when the factor is unconstrained.

quant-pharXiv:2607.01608•Jul 3, 2026•3 citations

Fast state tomography with optimal error bounds

Mădălin Guţǎ, Jonas Kahn, Richard Kueng +1 more

Abstract Projected least squares is an intuitive and numerically cheap technique for quantum state tomography: compute the least-squares estimator and project it onto the space of states. The main result of this paper equips this point estimator with rigorous, non-asymptotic convergence guarantees expressed in terms of the trace distance. The estimator’s sample complexity is comparable to the strongest convergence guarantees available in the literature and—in the case of the uniform POVM—saturates fundamental lower bounds. Numerical simulations support these competitive features.

arXiv:1809.11162•Journal of Physics A Mathematical and Theoretical•Mar 18, 2020•148 citations

Quantum State Tomography via Linear Regression Estimation

Bo Qi, Zhibo Hou, Li Li +3 more

A simple yet efficient state reconstruction algorithm of linear regression estimation (LRE) is presented for quantum state tomography. In this method, quantum state reconstruction is converted into a parameter estimation problem of a linear regression model and the least-squares method is employed to estimate the unknown parameters. An asymptotic mean squared error (MSE) upper bound for all possible states to be estimated is given analytically, which depends explicitly upon the involved measurement bases. This analytical MSE upper bound can guide one to choose optimal measurement sets. The computational complexity of LRE is O(d(4)) where d is the dimension of the quantum state. Numerical examples show that LRE is much faster than maximum-likelihood estimation for quantum state tomography.

arXiv:1304.6827•Scientific Reports•Dec 13, 2013•162 citations
Abstract Quantum state tomography identifies target quantum states by performing repetitive measurements on identical copies. In this paper, we have two key contributions aimed at improving traditional post-processing computational complexity and sample complexity of quantum tomography protocols. In the first case, we propose a new low-cost positivity constraint method based on density matrix perturbation after the least squares (LS) estimation of the density matrix. In the second case, we propose a new cost function with the maximum linear entropy and LS method to improve the sample average trace distance with reasonably low sample complexity. We call it the LS with the maximum entropy (LSME) method. Our proposed algorithm does not follow the iterative optimization technique, which is true for existing maximum likelihood and entropy-based ones. Performance analysis is conducted for our proposed methods by studying how they compare to the existing techniques for different sample complexities and dimensionalities. Extensive numerical simulations have been conducted to demonstrate the advantages of the proposed tomography algorithms.
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.
Abstract Quantum state tomography (QST) is essential for characterizing unknown quantum states. Several methods of estimating quantum states already exist and can be classified mainly into three broad classes. They are based on the criteria like maximum likelihood, linear inversion, and Bayesian framework. The Bayesian framework for QST gives a better reconstruction performance. However, the existing methods of the Bayesian frameworks are computationally extensive and, most of the time require knowledge about the prior distribution of the quantum state. In this paper, we propose a Bayesian method of QST based on the linear minimum mean square error criterion, where the prior statistics are estimated and the computational complexity is comparable to that of the linear inversion based QST method. We also propose an adaptive version based on the block estimation of parameters. Extensive numerical simulations are conducted to demonstrate its efficacy over the linear inversion-based QST regarding trace distance error metric.
When working with quantum states, analysis of the final quantum state generated through probabilistic measurements is essential. This analysis is typically conducted by constructing the density matrix from either partial or full tomography measurements of the quantum state. While full tomography measurement offers the most accurate reconstruction of the density matrix, limited measurements pose challenges for reconstruction algorithms, often resulting in nonphysical density matrices with negative eigenvalues. This is often remedied using maximum likelihood estimators, which have a high computing time or by other estimation methods that decrease the reconstructed fidelity. In this paper, we show that when restricting the measurement sample size, improvement over existing algorithms can be achieved. Our findings underline the multiplicity of solutions in the reconstruction problem, depending upon the generated state and measurement model utilized, thus motivating further research towards identifying optimal algorithms tailored to specific experimental contexts.
Since the complexity of quantum state tomography (QST) scales exponentially with system size, exploiting priors such as low-rankness, tensor-network structures, and neural-network representations is essential for scalable QST in terms of sample complexity and parameter complexity. In this paper, we introduce a unified framework, termed structured factorization, that builds on BurerMonteiro-type factorization by parametrizing the density matrix as FF†FF^\daggerFF†, where the factor FFF is constrained to belong to a structured model class. This factorization guarantees physical validity by construction while allowing a broad range of structural priors to be incorporated directly through the choice of the factor space, ranging from the generic Cholesky decomposition to low-rank matrices, matrix product operators, and neural density operators based on multilayer perceptron and transformer architectures. Building on this structured factorization framework, we formulate QST as an optimization problem over the factor space from measurement data. We first develop a unified statistical analysis of the sample complexity of least-squares estimation for a broad class of structured quantum states. We then propose a projected gradient descent method that operates directly on the factor space and accommodates a wide range of structural parametrizations and reconstruction objectives. To further exploit the geometry of the maximum-likelihood estimation formulation and the constraints on the factors, we derive a power method that yields a step-size-free algorithm with fast convergence, recovering Covers method as a special case when the factor is unconstrained.
Abstract Projected least squares is an intuitive and numerically cheap technique for quantum state tomography: compute the least-squares estimator and project it onto the space of states. The main result of this paper equips this point estimator with rigorous, non-asymptotic convergence guarantees expressed in terms of the trace distance. The estimator’s sample complexity is comparable to the strongest convergence guarantees available in the literature and—in the case of the uniform POVM—saturates fundamental lower bounds. Numerical simulations support these competitive features.
A simple yet efficient state reconstruction algorithm of linear regression estimation (LRE) is presented for quantum state tomography. In this method, quantum state reconstruction is converted into a parameter estimation problem of a linear regression model and the least-squares method is employed to estimate the unknown parameters. An asymptotic mean squared error (MSE) upper bound for all possible states to be estimated is given analytically, which depends explicitly upon the involved measurement bases. This analytical MSE upper bound can guide one to choose optimal measurement sets. The computational complexity of LRE is O(d(4)) where d is the dimension of the quantum state. Numerical examples show that LRE is much faster than maximum-likelihood estimation for quantum state tomography.