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

Adaptive Rank Quantum State Estimation

Aron Pasieka

Published Jun 1, 2014• 0 citations
OpenAlex

Abstract

Quantum state estimation is an important task in the realm of experimental quantum information science. While the common approaches to this task are generally adequate, the maximum-likelihood method is frequently used with parameterizations that do not strictly satisfy the statistical requirements of maximum-likelihood estimation. We show that the source of this issue is in the structure of the parameter space and we introduce a density matrix parameterization that provides direct control over this structure. The parameterization leads to a natural quantum state estimation algorithm that does satisfy the statistical requirements of maximum-likelihood estimation. Finally, we examine the algorithm through the analysis of several data sets and experimental results.

Related papers

Local solutions of maximum likelihood estimation in quantum state tomography

Douglas Soares Gonçalves, Márcia A. Gomes-Ruggiero, Carlile Lavor +2 more

Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.

arXiv:1103.3682•Quantum Information and Computation•Sep 1, 2012•14 citations

Maximum-likelihood estimation of the density matrix

Konrad Banaszek, Giacomo Mauro D’Ariano, Matteo G. A. Paris +1 more

We present a universal technique for quantum-state estimation based on the maximum-likelihood method. This approach provides a positive-definite estimate for the density matrix from a sequence of measurements performed on identically prepared copies of the system. The method is versatile and can be applied to multimode radiation fields as well as to spin systems. The incorporation of physical constraints, which is natural in the maximum-likelihood strategy, leads to a substantial reduction of statistical errors. Numerical implementation of the method is based on a particular form of the Gauss decomposition for positive-definite Hermitian matrices.

arXiv:quant-ph/9909052•Physical Review A•Dec 8, 1999•339 citations

Quantum states estimation: root approach

Yu. I. Bogdanov

Multiparametric statistical model providing stable reconstruction of parameters by observations is considered. The only general method of this kind is the root model based on the representation of the probability density as a squared absolute value of a certain function, which is referred to as a psi-function in analogy with quantum mechanics. The psi-function is represented by an expansion in terms of an orthonormal set of functions. It is shown that the introduction of the psi-function allows one to represent the Fisher information matrix as well as statistical properties of the estimator of the state vector (state estimator) in simple analytical forms. A new statistical characteristic, a confidence cone, is introduced instead of a standard confidence interval. The chi-square test is considered to test the hypotheses that the estimated vector converges to the state vector of a general population and that both samples are homogeneous. The expansion coefficients are estimated by the maximum likelihood method. The method proposed may be applied to its full extent to solve the statistical inverse problem of quantum mechanics (root estimator of quantum states). In order to provide statistical completeness of the analysis, it is necessary to perform measurements in mutually complementing experiments (according to the Bohr terminology). The maximum likelihood technique and likelihood equation are generalized in order to analyze quantum mechanical experiments. It is shown that the requirement for the expansion to be of a root kind can be considered as a quantization condition making it possible to choose systems described by quantum mechanics from all statistical models consistent, on average, with the laws of classical mechanics.

arXiv:quant-ph/0310011•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2004•4 citations

Quantum-state estimation

Z. Hradil

An algorithm for quantum-state estimation based on the maximum-likelihood estimation is proposed. Existing techniques for state reconstruction based on the inversion of measured data are shown to be overestimated since they do not guarantee the positive definiteness of the reconstructed density matrix.

arXiv:quant-ph/9609012•Physical Review A•Mar 1, 1997•560 citations

A SIMPLE MINIMAX ESTIMATOR FOR QUANTUM STATES

Hui Khoon Ng, Berthold‐Georg Englert

Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.

arXiv:1202.5136•International Journal of Quantum Information•Jun 1, 2012•15 citations

Rigorous maximum-likelihood estimation for quantum states

K. Aditi, Stephen Becker

Existing quantum state tomography methods are limited in scalability due to their high computation and memory demands, making them impractical for the recovery of large quantum states. In this work, we address these limitations by reformulating the maximum likelihood estimation problem using the Burer--Monteiro factorization, resulting in a nonconvex but low-rank parametrization of the density matrix. We derive a fully unconstrained formulation by analytically eliminating the trace-one and positive-semidefinite constraints, thereby avoiding the need for projection steps during optimization. Furthermore, we determine the Lagrange multiplier associated with the unit-trace constraint a priori, reducing computational overhead. The resulting formulation is amenable to scalable first-order optimization, and we demonstrate its tractability using the limited-memory Broyden-Fletcher-Goldfarb-Shanno method. Importantly, we also propose a low-memory version of the above algorithm to fully recover certain large quantum states with Pauli-based positive-operator-value measurements. Our low-memory algorithm avoids explicitly forming any density matrix, and does not require the density matrix to have a matrix product state or other tensor structure. For a fixed number of measurements and fixed rank, our algorithm requires just $O(d{log}_{2}d)$ complexity per iteration to recover a $d\ifmmode\times\else\texttimes\fi{}d$ density matrix. Additionally, we derive a useful error bound that can be used to give a rigorous termination criterion. We numerically demonstrate that our method is competitive with state-of-the-art algorithms for moderately sized problems, and then demonstrate that our method can solve a 20-qubit problem on a laptop in under 5 hours.

arXiv:2506.16646•Physical Review A•Nov 19, 2025•1 citation
Quantum state estimation is an important task in the realm of experimental quantum information science. While the common approaches to this task are generally adequate, the maximum-likelihood method is frequently used with parameterizations that do not strictly satisfy the statistical requirements of maximum-likelihood estimation. We show that the source of this issue is in the structure of the parameter space and we introduce a density matrix parameterization that provides direct control over this structure. The parameterization leads to a natural quantum state estimation algorithm that does satisfy the statistical requirements of maximum-likelihood estimation. Finally, we examine the algorithm through the analysis of several data sets and experimental results.
Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.
We present a universal technique for quantum-state estimation based on the maximum-likelihood method. This approach provides a positive-definite estimate for the density matrix from a sequence of measurements performed on identically prepared copies of the system. The method is versatile and can be applied to multimode radiation fields as well as to spin systems. The incorporation of physical constraints, which is natural in the maximum-likelihood strategy, leads to a substantial reduction of statistical errors. Numerical implementation of the method is based on a particular form of the Gauss decomposition for positive-definite Hermitian matrices.
Multiparametric statistical model providing stable reconstruction of parameters by observations is considered. The only general method of this kind is the root model based on the representation of the probability density as a squared absolute value of a certain function, which is referred to as a psi-function in analogy with quantum mechanics. The psi-function is represented by an expansion in terms of an orthonormal set of functions. It is shown that the introduction of the psi-function allows one to represent the Fisher information matrix as well as statistical properties of the estimator of the state vector (state estimator) in simple analytical forms. A new statistical characteristic, a confidence cone, is introduced instead of a standard confidence interval. The chi-square test is considered to test the hypotheses that the estimated vector converges to the state vector of a general population and that both samples are homogeneous. The expansion coefficients are estimated by the maximum likelihood method. The method proposed may be applied to its full extent to solve the statistical inverse problem of quantum mechanics (root estimator of quantum states). In order to provide statistical completeness of the analysis, it is necessary to perform measurements in mutually complementing experiments (according to the Bohr terminology). The maximum likelihood technique and likelihood equation are generalized in order to analyze quantum mechanical experiments. It is shown that the requirement for the expansion to be of a root kind can be considered as a quantization condition making it possible to choose systems described by quantum mechanics from all statistical models consistent, on average, with the laws of classical mechanics.
Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.
Existing quantum state tomography methods are limited in scalability due to their high computation and memory demands, making them impractical for the recovery of large quantum states. In this work, we address these limitations by reformulating the maximum likelihood estimation problem using the Burer--Monteiro factorization, resulting in a nonconvex but low-rank parametrization of the density matrix. We derive a fully unconstrained formulation by analytically eliminating the trace-one and positive-semidefinite constraints, thereby avoiding the need for projection steps during optimization. Furthermore, we determine the Lagrange multiplier associated with the unit-trace constraint a priori, reducing computational overhead. The resulting formulation is amenable to scalable first-order optimization, and we demonstrate its tractability using the limited-memory Broyden-Fletcher-Goldfarb-Shanno method. Importantly, we also propose a low-memory version of the above algorithm to fully recover certain large quantum states with Pauli-based positive-operator-value measurements. Our low-memory algorithm avoids explicitly forming any density matrix, and does not require the density matrix to have a matrix product state or other tensor structure. For a fixed number of measurements and fixed rank, our algorithm requires just O(dlog2d)O(d{log}_{2}d)O(dlog2​d) complexity per iteration to recover a $d\ifmmode\times\else\texttimes\fi{}d$ density matrix. Additionally, we derive a useful error bound that can be used to give a rigorous termination criterion. We numerically demonstrate that our method is competitive with state-of-the-art algorithms for moderately sized problems, and then demonstrate that our method can solve a 20-qubit problem on a laptop in under 5 hours.