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:2002.10354 · New Journal of Physics

A practical and efficient approach for Bayesian quantum state estimation

Joseph M. Lukens, Kody J. H. Law, Ajay Jasra, Pavel Lougovski

Published Apr 30, 2020• 121 citations
arXivHTMLPDF

Abstract

Abstract Bayesian inference is a powerful paradigm for quantum state tomography, treating uncertainty in meaningful and informative ways. Yet the numerical challenges associated with sampling from complex probability distributions hampers Bayesian tomography in practical settings. In this article, we introduce an improved, self-contained approach for Bayesian quantum state estimation. Leveraging advances in machine learning and statistics, our formulation relies on highly efficient preconditioned Crank–Nicolson sampling and a pseudo-likelihood. We theoretically analyze the computational cost, and provide explicit examples of inference for both actual and simulated datasets, illustrating improved performance with respect to existing approaches.

DOI
10.1088/1367-2630/ab8efa

Related papers

Efficient adaptive MCMC implementation for Pseudo-Bayesian quantum tomography

Tien Mai

We revisit the Pseudo-Bayesian approach to the problem of estimating density matrix in quantum state tomography in this paper. Pseudo-Bayesian inference has been shown to offer a powerful paradign for quantum tomography with attractive theoretical and empirical results. However, the computation of (Pseudo-)Bayesian estimators, due to sampling from complex and high-dimensional distribution, pose significant challenges that hampers their usages in practical settings. To overcome this problem, we present an efficient adaptive MCMC sampling method for the Pseudo-Bayesian estimator. We show in simulations that our approach is substantially faster than the previous implementation by at least two orders of magnitude which is significant for practical quantum tomography.

•Jun 1, 2021•0 citations

Computationally efficient Bayesian quantum state tomography

Joseph M. Lukens, Kody J. H. Law, Ajay Jasra +1 more

We describe a method for Bayesian quantum state estimation combining efficient parameterization, a pseudo-likelihood, and advanced numerical sampling techniques. Examples reveal significant computational speedup, indicating the approach's promise in practical quantum state tomography.

IEEE Photonics Conference•Sep 1, 2020•0 citations

An efficient adaptive MCMC algorithm for Pseudo-Bayesian quantum tomography

Tien Mai

Abstract We revisit the Pseudo-Bayesian approach to the problem of estimating density matrix in quantum state tomography in this paper. Pseudo-Bayesian inference has been shown to offer a powerful paradigm for quantum tomography with attractive theoretical and empirical results. However, the computation of (Pseudo-)Bayesian estimators, due to sampling from complex and high-dimensional distribution, pose significant challenges that hamper their usages in practical settings. To overcome this problem, we present an efficient adaptive MCMC sampling method for the Pseudo-Bayesian estimator by exploring an adaptive proposal scheme together with subsampling method. We show in simulations that our approach is substantially computationally faster than the previous implementation by at least two orders of magnitude which is significant for practical quantum tomography.

arXiv:2106.00577•Computational Statistics•Jul 23, 2022•3 citations

Quantum-Enhanced Bayesian Inference for Uncertainty Quantification

Jincheng Zhang

Quantum-enhanced Bayesian inference offers a promising approach to address the computational challenges associated with uncertainty quantification, particularly in situations demanding high accuracy and speed. This paper explores the design and implementation of a quantum algorithm, quantum state tomography, to enhance Bayesian inference, aiming to mitigate the inherent cost of traditional methods. We detail the theoretical framework underpinning this approach, highlighting its potential to significantly improve reliability and speed. The core claim centers on leveraging quantum state tomography to achieve a more precise estimate of the system state, thereby bolstering the accuracy of Bayesian inference. This work represents a novel investigation into the application of quantum mechanics to Bayesian inference, with the potential to deliver substantial improvements in computational efficiency and robustness.

•Sep 1, 2026•0 citations

Demonstration of machine-learning-enhanced Bayesian quantum state estimation

Sanjaya Lohani, Joseph M. Lukens, Atiyya A. Davis +6 more

Abstract Machine learning (ML) has found broad applicability in quantum information science in topics as diverse as experimental design, state classification, and even studies on quantum foundations. Here, we experimentally realize an approach for defining custom prior distributions that are automatically tuned using ML for Bayesian quantum state estimation methods that generally better conform to the physical properties of the underlying system than standard fixed prior distributions. Previously, researchers have looked to Bayesian quantum state tomography for advantages like uncertainty quantification, the return of reliable estimates under any measurement condition, and minimal mean-squared error. However, practical challenges related to long computation times and conceptual issues concerning how to incorporate prior knowledge most suitably can overshadow these benefits. Using both simulated and experimental measurement results, we demonstrate that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution. These results constitute a promising path toward practical implementations of Bayesian quantum state tomography.

arXiv:2212.08032•New Journal of Physics•Jul 12, 2023•8 citations

Unorthodox parallelization for Bayesian quantum state estimation

Hanson H Nguyen, Kody J. H. Law, Joseph M. Lukens

Abstract Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis–Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems.

arXiv:2501.17334•New Journal of Physics•May 1, 2025•1 citation
Abstract Bayesian inference is a powerful paradigm for quantum state tomography, treating uncertainty in meaningful and informative ways. Yet the numerical challenges associated with sampling from complex probability distributions hampers Bayesian tomography in practical settings. In this article, we introduce an improved, self-contained approach for Bayesian quantum state estimation. Leveraging advances in machine learning and statistics, our formulation relies on highly efficient preconditioned Crank–Nicolson sampling and a pseudo-likelihood. We theoretically analyze the computational cost, and provide explicit examples of inference for both actual and simulated datasets, illustrating improved performance with respect to existing approaches.
We revisit the Pseudo-Bayesian approach to the problem of estimating density matrix in quantum state tomography in this paper. Pseudo-Bayesian inference has been shown to offer a powerful paradign for quantum tomography with attractive theoretical and empirical results. However, the computation of (Pseudo-)Bayesian estimators, due to sampling from complex and high-dimensional distribution, pose significant challenges that hampers their usages in practical settings. To overcome this problem, we present an efficient adaptive MCMC sampling method for the Pseudo-Bayesian estimator. We show in simulations that our approach is substantially faster than the previous implementation by at least two orders of magnitude which is significant for practical quantum tomography.
Abstract We revisit the Pseudo-Bayesian approach to the problem of estimating density matrix in quantum state tomography in this paper. Pseudo-Bayesian inference has been shown to offer a powerful paradigm for quantum tomography with attractive theoretical and empirical results. However, the computation of (Pseudo-)Bayesian estimators, due to sampling from complex and high-dimensional distribution, pose significant challenges that hamper their usages in practical settings. To overcome this problem, we present an efficient adaptive MCMC sampling method for the Pseudo-Bayesian estimator by exploring an adaptive proposal scheme together with subsampling method. We show in simulations that our approach is substantially computationally faster than the previous implementation by at least two orders of magnitude which is significant for practical quantum tomography.
Quantum-enhanced Bayesian inference offers a promising approach to address the computational challenges associated with uncertainty quantification, particularly in situations demanding high accuracy and speed. This paper explores the design and implementation of a quantum algorithm, quantum state tomography, to enhance Bayesian inference, aiming to mitigate the inherent cost of traditional methods. We detail the theoretical framework underpinning this approach, highlighting its potential to significantly improve reliability and speed. The core claim centers on leveraging quantum state tomography to achieve a more precise estimate of the system state, thereby bolstering the accuracy of Bayesian inference. This work represents a novel investigation into the application of quantum mechanics to Bayesian inference, with the potential to deliver substantial improvements in computational efficiency and robustness.
Abstract Machine learning (ML) has found broad applicability in quantum information science in topics as diverse as experimental design, state classification, and even studies on quantum foundations. Here, we experimentally realize an approach for defining custom prior distributions that are automatically tuned using ML for Bayesian quantum state estimation methods that generally better conform to the physical properties of the underlying system than standard fixed prior distributions. Previously, researchers have looked to Bayesian quantum state tomography for advantages like uncertainty quantification, the return of reliable estimates under any measurement condition, and minimal mean-squared error. However, practical challenges related to long computation times and conceptual issues concerning how to incorporate prior knowledge most suitably can overshadow these benefits. Using both simulated and experimental measurement results, we demonstrate that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution. These results constitute a promising path toward practical implementations of Bayesian quantum state tomography.
Abstract Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis–Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems.