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

Bayesian error regions in quantum estimation II: region accuracy and adaptive methods

Changhun Oh, Yong Siah Teo, Hyunseok Jeong

Published Aug 16, 2018• 7 citations
arXivHTMLPDF

Abstract

Bayesian error analysis paves the way to the construction of credible and plausible error regions for a point estimator obtained from a given dataset. We introduce the concept of region accuracy for error regions (a generalization of the point-estimator mean squared error) to quantify the average statistical accuracy of all region points with respect to the unknown true parameter. We show that the increase in region accuracy is closely related to the Bayesian region dual operations in Shang et al (2013 New J. Phys. 15 123026). Next with only the given dataset as viable evidence, we establish various adaptive methods to maximize the region accuracy relative to the true parameter subject to the type of reported Bayesian region for a given point estimator. We highlight the performance of these adaptive methods by comparing them with non-adaptive procedures in three quantum-parameter estimation examples. The results of and mechanisms behind the adaptive schemes can be understood as the region analog of adaptive approaches to achieving the quantum Cramér–Rao bound for point estimators.

DOI
10.1088/1367-2630/aadac9

Related papers

Bayesian error regions in quantum estimation I: analytical reasonings

Yong Siah Teo, Changhun Oh, Hyunseok Jeong

Results concerning the construction of quantum Bayesian error regions as a means to certify the quality of parameter point estimators have been reported in recent years. This task remains numerically formidable in practice for large dimensions and so far, no analytical expressions of the region size and credibility (probability of any given true parameter residing in the region) are known, which form the two principal region properties to be reported alongside a point estimator obtained from collected data. We first establish analytical formulas for the size and credibility that are valid for a uniform prior distribution over parameters, sufficiently large data samples and general constrained convex parameter estimation settings. These formulas provide a means to an efficient asymptotic error certification for parameters of arbitrary dimensions. Next, we demonstrate the accuracies of these analytical formulas as compared to numerically computed region quantities with simulated examples in qubit and qutrit quantum-state tomography where computations of the latter are feasible.

arXiv:1804.10364•New Journal of Physics•Aug 16, 2018•9 citations

Probing Bayesian Credible Regions Intrinsically: A Feasible Error Certification for Physical Systems

Changhun Oh, Yong Siah Teo, Hyunseok Jeong

Standard computation of size and credibility of a Bayesian credible region for certifying any point estimator of an unknown parameter (such as a quantum state, channel, phase, etc.) requires selecting points that are in the region from a finite parameter-space sample, which is infeasible for a large dataset or dimension as the region would then be extremely small. We solve this problem by introducing the in-region sampling theory to compute both region qualities just by sampling appropriate functions over the region itself using any Monte Carlo sampling method. We take in-region sampling to the next level by understanding the credible-region capacity (an alternative description for the region content to size) as the average l_{p}-norm distance (p>0) between a random region point and the estimator, and present analytical formulas for p=2 to estimate both the capacity and credibility for any dimension and a sufficiently large dataset without Monte Carlo sampling, thereby providing a quick alternative to Bayesian certification. All results are discussed in the context of quantum-state tomography.

arXiv:1902.02599•Physical Review Letters•Jul 26, 2019•7 citations

Efficient Bayesian credible-region certification for quantum-state tomography

Changhun Oh, Yong Siah Teo, Hyunseok Jeong

Standard Bayesian credible-region theory for constructing an error region on the unique estimator of an unknown state in general quantum-state tomography to calculate its size and credibility relies on heavy Monte Carlo sampling of the state space followed by filtering to obtain the correct region sample. This conventional methodology typically gives negligible yield for very small error regions originating from large data sets. In this article, we discuss at length the in-region sampling theory for computing both size and credibility from region-average quantities that avoids this general problem altogether. Among the many possible numerical choices, we study the performance and properties of accelerated hit-and-run Monte Carlo algorithm for in-region sampling and provide its complexity estimates for quantum states. Finally with our in-region concept, by alternatively quantifying the region capacity with the region-average distance between two states in the region (measured for instance with either the Hilbert-Schmidt, trace-class, or Bures distance), we derive approximation formulas to analytically estimate both region capacity and credibility without Monte Carlo computation.

arXiv:1902.02602•Physical Review A•Jul 26, 2019•11 citations

Optimal error intervals for properties of the quantum state

Xikun Li, Jiangwei Shang, Hui Khoon Ng +1 more

Quantum state estimation aims at determining the quantum state from observed data. Estimating the full state can require considerable efforts, but one is often only interested in a few properties of the state, such as the fidelity with a target state, or the degree of correlation for a specified bipartite structure. Rather than first estimating the state, one can, and should, estimate those quantities of interest directly from the data. We propose the use of optimal error intervals as a meaningful way of stating the accuracy of the estimated property values. Optimal error intervals are analogs of the optimal error regions for state estimation [New J. Phys. 15, 123026 (2013)]. They are optimal in two ways: They have the largest likelihood for the observed data and the prechosen size, and they are the smallest for the prechosen probability of containing the true value. As in the state situation, such optimal error intervals admit a simple description in terms of the marginal likelihood for the data for the properties of interest. Here, we present the concept and construction of optimal error intervals, report on an iterative algorithm for reliable computation of the marginal likelihood (a quantity difficult to calculate reliably), explain how plausible intervals---a notion of evidence provided by the data---are related to our optimal error intervals, and illustrate our methods with single-qubit and two-qubit examples.

arXiv:1602.05780•Physical Review A•Dec 13, 2016•24 citations

Frequentist and Bayesian Quantum Phase Estimation

Yan Li, Luca Pezzè, Manuel Gessner +3 more

Frequentist and Bayesian phase estimation strategies lead to conceptually different results on the state of knowledge about the true value of an unknown parameter. We compare the two frameworks and their sensitivity bounds to the estimation of an interferometric phase shift limited by quantum noise, considering both the cases of a fixed and a fluctuating parameter. We point out that frequentist precision bounds, such as the Cramér-Rao bound, for instance, do not apply to Bayesian strategies and vice versa. In particular, we show that the Bayesian variance can overcome the frequentist Cramér-Rao bound, which appears to be a paradoxical result if the conceptual difference between the two approaches are overlooked. Similarly, bounds for fluctuating parameters make no statement about the estimation of a fixed parameter.

arXiv:1804.10048•Entropy•Aug 23, 2018•70 citations

Title: Adaptive Quantum Sampling for Bayesian Inference

Jincheng Zhang

This paper introduces an adaptive quantum sampling method designed to enhance the efficiency of Bayesian inference in complex, high-dimensional spaces. Traditional Bayesian inference methods often struggle with the computational complexity of exploring the vast parameter space, leading to slow convergence and limited accuracy. We propose a novel quantum sampling algorithm that dynamically adjusts the sampling process based on uncertainty estimates generated by quantum computations. This adaptive approach mitigates the inherent challenges of sampling in high-dimensional spaces, resulting in significantly faster convergence and improved inference accuracy. The core mechanism leverages quantum algorithms to identify promising regions of the parameter space, thereby reducing the computational burden and enhancing the effectiveness of Bayesian modeling. The paper details the theoretical framework underpinning the algorithm, outlines the implementation of the quantum sampling process, and provides a comprehensive analysis of its performance compared to traditional sampling techniques. Finally, we present preliminary experimental results demonstrating the effectiveness of the proposed method across a range of complex scenarios.

•Aug 29, 2026•0 citations
Bayesian error analysis paves the way to the construction of credible and plausible error regions for a point estimator obtained from a given dataset. We introduce the concept of region accuracy for error regions (a generalization of the point-estimator mean squared error) to quantify the average statistical accuracy of all region points with respect to the unknown true parameter. We show that the increase in region accuracy is closely related to the Bayesian region dual operations in Shang et al (2013 New J. Phys. 15 123026). Next with only the given dataset as viable evidence, we establish various adaptive methods to maximize the region accuracy relative to the true parameter subject to the type of reported Bayesian region for a given point estimator. We highlight the performance of these adaptive methods by comparing them with non-adaptive procedures in three quantum-parameter estimation examples. The results of and mechanisms behind the adaptive schemes can be understood as the region analog of adaptive approaches to achieving the quantum Cramér–Rao bound for point estimators.
Results concerning the construction of quantum Bayesian error regions as a means to certify the quality of parameter point estimators have been reported in recent years. This task remains numerically formidable in practice for large dimensions and so far, no analytical expressions of the region size and credibility (probability of any given true parameter residing in the region) are known, which form the two principal region properties to be reported alongside a point estimator obtained from collected data. We first establish analytical formulas for the size and credibility that are valid for a uniform prior distribution over parameters, sufficiently large data samples and general constrained convex parameter estimation settings. These formulas provide a means to an efficient asymptotic error certification for parameters of arbitrary dimensions. Next, we demonstrate the accuracies of these analytical formulas as compared to numerically computed region quantities with simulated examples in qubit and qutrit quantum-state tomography where computations of the latter are feasible.
Standard computation of size and credibility of a Bayesian credible region for certifying any point estimator of an unknown parameter (such as a quantum state, channel, phase, etc.) requires selecting points that are in the region from a finite parameter-space sample, which is infeasible for a large dataset or dimension as the region would then be extremely small. We solve this problem by introducing the in-region sampling theory to compute both region qualities just by sampling appropriate functions over the region itself using any Monte Carlo sampling method. We take in-region sampling to the next level by understanding the credible-region capacity (an alternative description for the region content to size) as the average l_{p}-norm distance (p>0) between a random region point and the estimator, and present analytical formulas for p=2 to estimate both the capacity and credibility for any dimension and a sufficiently large dataset without Monte Carlo sampling, thereby providing a quick alternative to Bayesian certification. All results are discussed in the context of quantum-state tomography.
Standard Bayesian credible-region theory for constructing an error region on the unique estimator of an unknown state in general quantum-state tomography to calculate its size and credibility relies on heavy Monte Carlo sampling of the state space followed by filtering to obtain the correct region sample. This conventional methodology typically gives negligible yield for very small error regions originating from large data sets. In this article, we discuss at length the in-region sampling theory for computing both size and credibility from region-average quantities that avoids this general problem altogether. Among the many possible numerical choices, we study the performance and properties of accelerated hit-and-run Monte Carlo algorithm for in-region sampling and provide its complexity estimates for quantum states. Finally with our in-region concept, by alternatively quantifying the region capacity with the region-average distance between two states in the region (measured for instance with either the Hilbert-Schmidt, trace-class, or Bures distance), we derive approximation formulas to analytically estimate both region capacity and credibility without Monte Carlo computation.
Quantum state estimation aims at determining the quantum state from observed data. Estimating the full state can require considerable efforts, but one is often only interested in a few properties of the state, such as the fidelity with a target state, or the degree of correlation for a specified bipartite structure. Rather than first estimating the state, one can, and should, estimate those quantities of interest directly from the data. We propose the use of optimal error intervals as a meaningful way of stating the accuracy of the estimated property values. Optimal error intervals are analogs of the optimal error regions for state estimation [New J. Phys. 15, 123026 (2013)]. They are optimal in two ways: They have the largest likelihood for the observed data and the prechosen size, and they are the smallest for the prechosen probability of containing the true value. As in the state situation, such optimal error intervals admit a simple description in terms of the marginal likelihood for the data for the properties of interest. Here, we present the concept and construction of optimal error intervals, report on an iterative algorithm for reliable computation of the marginal likelihood (a quantity difficult to calculate reliably), explain how plausible intervals---a notion of evidence provided by the data---are related to our optimal error intervals, and illustrate our methods with single-qubit and two-qubit examples.
Frequentist and Bayesian phase estimation strategies lead to conceptually different results on the state of knowledge about the true value of an unknown parameter. We compare the two frameworks and their sensitivity bounds to the estimation of an interferometric phase shift limited by quantum noise, considering both the cases of a fixed and a fluctuating parameter. We point out that frequentist precision bounds, such as the Cramér-Rao bound, for instance, do not apply to Bayesian strategies and vice versa. In particular, we show that the Bayesian variance can overcome the frequentist Cramér-Rao bound, which appears to be a paradoxical result if the conceptual difference between the two approaches are overlooked. Similarly, bounds for fluctuating parameters make no statement about the estimation of a fixed parameter.
This paper introduces an adaptive quantum sampling method designed to enhance the efficiency of Bayesian inference in complex, high-dimensional spaces. Traditional Bayesian inference methods often struggle with the computational complexity of exploring the vast parameter space, leading to slow convergence and limited accuracy. We propose a novel quantum sampling algorithm that dynamically adjusts the sampling process based on uncertainty estimates generated by quantum computations. This adaptive approach mitigates the inherent challenges of sampling in high-dimensional spaces, resulting in significantly faster convergence and improved inference accuracy. The core mechanism leverages quantum algorithms to identify promising regions of the parameter space, thereby reducing the computational burden and enhancing the effectiveness of Bayesian modeling. The paper details the theoretical framework underpinning the algorithm, outlines the implementation of the quantum sampling process, and provides a comprehensive analysis of its performance compared to traditional sampling techniques. Finally, we present preliminary experimental results demonstrating the effectiveness of the proposed method across a range of complex scenarios.