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

arXiv:2212.10655

Bayesian Quantum State Tomography with Python's PyMC

Daniel J. Lum, Yaakov S. Weinstein

Published Dec 20, 2022• 2 citations
arXivHTMLPDF

Abstract

Quantum state tomography (QST) is typically performed from a frequentist viewpoint using maximum likelihood estimation (MLE) which seeks to find the best plausible state consistent with the data by maximizing a likelihood function / distribution. The likelihood function holds an implicit assumption that there is suitable data to infer frequency. In data-starved experiments, this may or may not be a feasible assumption. Moreover, MLE returns no error estimates on the final solution and users are forced to rely on alternative approaches involving either additional measurements or simulated data. Alternatively, Bayesian methods can return a solution with error estimates consistent with the data's uncertainty, but at the expense of a difficult integration over the likelihood distribution. The integration usually requires computational methods with appropriately chosen step sizes in a somewhat complicated problem formulation. This additional complexity serves as a strong deterrent from using Bayesian methods despite the advantages. Probabilistic programming is becoming a common alternative with growing computational power and the development of robust automated integration techniques such as Markov-Chain Monte Carlo (MCMC). Here, we show how to use Python-3's open source PyMC probabilistic programming package to transform an otherwise complicated QST optimization problem into a simple form that can be quickly optimized with efficient under-the-hood MCMC samplers.

DOI
10.48550/arxiv.2212.10655

Related papers

Probabilistic Programming for Quantum State Tomography

Jincheng Zhang

Quantum state tomography (QST) is a crucial technique for characterizing quantum states, vital for verifying quantum device performance and implementing quantum information processing. However, traditional QST methods are notoriously computationally demanding, requiring extensive experimental data acquisition and subsequent processing, often leading to high resource consumption. This work presents a novel framework for QST utilizing probabilistic programming. The core idea is to model the quantum state as a probability distribution and employ Bayesian inference, coupled with variational methods, to efficiently infer the density matrix from limited measurement data. We demonstrate the efficacy of this approach, showcasing its potential to significantly reduce experimental costs and improve the accuracy of QST. The framework's automation and optimization capabilities represent a substantial advancement in the field, paving the way for more accessible and efficient quantum state characterization.

•Sep 5, 2026•0 citations

Maximum-Likelihood Quantum State Tomography by Soft-Bayes

Lin, Chien-Ming, Yu-Ming Hsu, Yen-Huan Li

Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an $\varepsilon$-approximate ML estimate in $O( ( D \log D ) / \varepsilon ^ 2 )$ iterations with $O( D^3 )$ per-iteration time complexity, where $D$ denotes the dimension of the unknown quantum state and $\varepsilon$ denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.

arXiv:2012.15498•Dec 31, 2020•8 citations

Optimal, reliable estimation of quantum states

Robin Blume-Kohout

Accurately inferring the state of a quantum device from the results of measurements is a crucial task in building quantum information processing hardware. The predominant state estimation procedure, maximum likelihood estimation (MLE), generally reports an estimate with zero eigenvalues. These cannot be justified. Furthermore, the MLE estimate is incompatible with error bars, so conclusions drawn from it are suspect. I propose an alternative procedure, Bayesian mean estimation (BME). BME never yields zero eigenvalues, its eigenvalues provide a bound on their own uncertainties, and under certain circumstances it is provably the most accurate procedure possible. I show how to implement BME numerically, and how to obtain natural error bars that are compatible with the estimate. Finally, I briefly discuss the differences between Bayesian and frequentist estimation techniques.

arXiv:quant-ph/0611080•New Journal of Physics•Apr 20, 2010•428 citations

Markov chain Monte Carlo estimation of quantum states

James DiGuglielmo, Christopher Messenger, Jaromír Fiurášek +4 more

We apply a Bayesian data analysis scheme known as the Markov chain Monte Carlo to the tomographic reconstruction of quantum states. This method yields a vector, known as the Markov chain, which contains the full statistical information concerning all reconstruction parameters including their statistical correlations with no a priori assumptions as to the form of the distribution from which it has been obtained. From this vector we can derive, e.g., the marginal distributions and uncertainties of all model parameters, and also of other quantities such as the purity of the reconstructed state. We demonstrate the utility of this scheme by reconstructing the Wigner function of phase-diffused squeezed states. These states possess non-Gaussian statistics and therefore represent a nontrivial case of tomographic reconstruction. We compare our results to those obtained through pure maximum-likelihood and Fisher information approaches.

arXiv:0902.4603•Physical Review A•Mar 31, 2009•8 citations

Bayesian inference for quantum state tomography

Douglas Soares Gonçalves, Caio Azevedo, Carlile Lavor +1 more

We present a Bayesian approach to the problem of estimating density matrices in quantum state tomography. A general framework is presented based on a suitable mathematical formulation, where a study of the convergence of the Monte Carlo Markov Chain algorithm is given, including a comparison with other estimation methods, such as maximum likelihood estimation and linear inversion. This analysis indicates that our approach not only recovers the underlying parameters quite properly, but also produces physically acceptable punctual and interval estimates. A prior sensitive study was conducted indicating that when useful prior information is available and incorporated, more accurate results are obtained. This general framework, which is based on a reparameterization of the model, allows an easier choice of the prior and proposal distributions for the Metropolis–Hastings algorithm.

Journal of Applied Statistics•Nov 15, 2017•8 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
Quantum state tomography (QST) is typically performed from a frequentist viewpoint using maximum likelihood estimation (MLE) which seeks to find the best plausible state consistent with the data by maximizing a likelihood function / distribution. The likelihood function holds an implicit assumption that there is suitable data to infer frequency. In data-starved experiments, this may or may not be a feasible assumption. Moreover, MLE returns no error estimates on the final solution and users are forced to rely on alternative approaches involving either additional measurements or simulated data. Alternatively, Bayesian methods can return a solution with error estimates consistent with the data's uncertainty, but at the expense of a difficult integration over the likelihood distribution. The integration usually requires computational methods with appropriately chosen step sizes in a somewhat complicated problem formulation. This additional complexity serves as a strong deterrent from using Bayesian methods despite the advantages. Probabilistic programming is becoming a common alternative with growing computational power and the development of robust automated integration techniques such as Markov-Chain Monte Carlo (MCMC). Here, we show how to use Python-3's open source PyMC probabilistic programming package to transform an otherwise complicated QST optimization problem into a simple form that can be quickly optimized with efficient under-the-hood MCMC samplers.
Quantum state tomography (QST) is a crucial technique for characterizing quantum states, vital for verifying quantum device performance and implementing quantum information processing. However, traditional QST methods are notoriously computationally demanding, requiring extensive experimental data acquisition and subsequent processing, often leading to high resource consumption. This work presents a novel framework for QST utilizing probabilistic programming. The core idea is to model the quantum state as a probability distribution and employ Bayesian inference, coupled with variational methods, to efficiently infer the density matrix from limited measurement data. We demonstrate the efficacy of this approach, showcasing its potential to significantly reduce experimental costs and improve the accuracy of QST. The framework's automation and optimization capabilities represent a substantial advancement in the field, paving the way for more accessible and efficient quantum state characterization.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε\varepsilonε-approximate ML estimate in O((Dlog⁡D)/ε2)O( ( D \log D ) / \varepsilon ^ 2 )O((DlogD)/ε2) iterations with O(D3)O( D^3 )O(D3) per-iteration time complexity, where DDD denotes the dimension of the unknown quantum state and ε\varepsilonε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.
Accurately inferring the state of a quantum device from the results of measurements is a crucial task in building quantum information processing hardware. The predominant state estimation procedure, maximum likelihood estimation (MLE), generally reports an estimate with zero eigenvalues. These cannot be justified. Furthermore, the MLE estimate is incompatible with error bars, so conclusions drawn from it are suspect. I propose an alternative procedure, Bayesian mean estimation (BME). BME never yields zero eigenvalues, its eigenvalues provide a bound on their own uncertainties, and under certain circumstances it is provably the most accurate procedure possible. I show how to implement BME numerically, and how to obtain natural error bars that are compatible with the estimate. Finally, I briefly discuss the differences between Bayesian and frequentist estimation techniques.
We apply a Bayesian data analysis scheme known as the Markov chain Monte Carlo to the tomographic reconstruction of quantum states. This method yields a vector, known as the Markov chain, which contains the full statistical information concerning all reconstruction parameters including their statistical correlations with no a priori assumptions as to the form of the distribution from which it has been obtained. From this vector we can derive, e.g., the marginal distributions and uncertainties of all model parameters, and also of other quantities such as the purity of the reconstructed state. We demonstrate the utility of this scheme by reconstructing the Wigner function of phase-diffused squeezed states. These states possess non-Gaussian statistics and therefore represent a nontrivial case of tomographic reconstruction. We compare our results to those obtained through pure maximum-likelihood and Fisher information approaches.
We present a Bayesian approach to the problem of estimating density matrices in quantum state tomography. A general framework is presented based on a suitable mathematical formulation, where a study of the convergence of the Monte Carlo Markov Chain algorithm is given, including a comparison with other estimation methods, such as maximum likelihood estimation and linear inversion. This analysis indicates that our approach not only recovers the underlying parameters quite properly, but also produces physically acceptable punctual and interval estimates. A prior sensitive study was conducted indicating that when useful prior information is available and incorporated, more accurate results are obtained. This general framework, which is based on a reparameterization of the model, allows an easier choice of the prior and proposal distributions for the Metropolis–Hastings algorithm.
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.