Variance reduction methods in the estimation of Pauli sums

• URL: http://arxiv.org/abs/2603.20029v1
• Date: Fri, 20 Mar 2026 15:16:45 GMT
• Title: Variance reduction methods in the estimation of Pauli sums
• Abstract summary: We introduce a framework that covers many existing measurement strategies and introduce applications that can be used to enhance randomized schemes.<n>We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements.<n>We demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.

Related papers

• An em algorithm for quantum Boltzmann machines [40.40469032705598]
  We develop a quantum version of the em algorithm for training quantum Boltzmann machines.<n>We implement the algorithm on a semi-quantum restricted Boltzmann machine, where quantum effects are confined to the hidden layer.
  arXiv  Detail & Related papers  (2025-07-29T07:59:22Z)
• End-to-End Probabilistic Framework for Learning with Hard Constraints [43.297232073870866]
  We present ProbHardE2E, a probabilistic forecasting framework that incorporates hard operational/physical constraints.<n>Our methodology uses a novel differentiable probabilistic projection layer (DPPL) that can be combined with a wide range of neural network architectures.
  arXiv  Detail & Related papers  (2025-06-08T05:29:50Z)
• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• A composite measurement scheme for efficient quantum observable estimation [2.4792831406904026]
  We propose a new approach, composite measurement scheme, which composes multiple measurement schemes by distributing shots to them with a trainable ratio. We numerically demonstrate C-LBCS on molecular systems up to $mathCO$ (30bits) and show that C-LBCS outperforms the previous state-of-the-art methods despite its simplicity.
  arXiv  Detail & Related papers  (2023-05-03T21:50:36Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [49.36226952764697]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields.<n>We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget.<n>We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Fast gradient estimation for variational quantum algorithms [0.6445605125467572]
  We propose a new gradient estimation method to mitigate the measurement challenge. Within a Bayesian framework, we use prior information about the circuit to find an estimation strategy. We demonstrate that this approach can significantly outperform traditional gradient estimation methods.
  arXiv  Detail & Related papers  (2022-10-12T18:00:00Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Deterministic improvements of quantum measurements with grouping of compatible operators, non-local transformations, and covariance estimates [0.0]
  We consider several partitioning schemes based on grouping of commuting multi-qubit Pauli products. We develop two new measurement schemes that achieve a severalfold reduction in the number of measurements.
  arXiv  Detail & Related papers  (2022-01-05T06:20:18Z)
• Decision Diagrams for Quantum Measurements with Shallow Circuits [5.68103962078559]
  We introduce estimators based on randomised measurements, which use decision diagrams to sample from probability distributions on measurement bases. We show numerically that the estimators introduced here can produce more precise estimates on some quantum chemistry Hamiltonians.
  arXiv  Detail & Related papers  (2021-05-14T16:23:08Z)
• Efficient qubit phase estimation using adaptive measurements [0.0]
  Estimating the quantum phase of a physical system is a central problem in quantum parameter estimation theory. Current methods to estimate quantum phases fail to reach the quantum Cram'er-Rao bound. We propose a new adaptive scheme based on covariant measurements to circumvent this problem.
  arXiv  Detail & Related papers  (2020-12-21T02:43:47Z)
• Generalized Sliced Distances for Probability Distributions [47.543990188697734]
  We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs) GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation. We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
  arXiv  Detail & Related papers  (2020-02-28T04:18:00Z)
• Direct estimation of quantum coherence by collective measurements [54.97898890263183]
  We introduce a collective measurement scheme for estimating the amount of coherence in quantum states. Our scheme outperforms other estimation methods based on tomography or adaptive measurements. We show that our method is accessible with today's technology by implementing it experimentally with photons.
  arXiv  Detail & Related papers  (2020-01-06T03:50:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.