Enhanced measurements on quantum computers via the simultaneous probing of non-commuting Pauli operators

• URL: http://arxiv.org/abs/2509.01482v1
• Date: Mon, 01 Sep 2025 13:56:06 GMT
• Title: Enhanced measurements on quantum computers via the simultaneous probing of non-commuting Pauli operators
• Authors: Rick P. A. Simon, Zheng Shi, Charlie Nation, Andrew Jena, Luca Dellantonio,
• Abstract summary: We propose a scheme where identical copies of a quantum state are measured jointly so that all Pauli operators can be simultaneously assessed.<n>We use Bayesian statistics to accurately estimate the average and error, and develop an adaptive shot-allocation algorithm that preferentially samples the most uncertain Pauli terms.
• Score: 1.8538269966170613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. We propose a novel scheme where identical copies of a quantum state are measured jointly so that all Pauli operators within the considered observable can be simultaneously assessed. We use Bayesian statistics to accurately estimate the average and error, and develop an adaptive shot-allocation algorithm that preferentially samples the most uncertain Pauli terms. In regimes with many non-commuting Pauli operators, our ``double'' scheme can outperform the state-of-the-art measurement protocol in minimizing total shots for a given precision.

Related papers

• Efficient certification of intractable quantum states with few Pauli measurements [0.0]
  We introduce an efficient protocol for certifying Clifford-enhanced Product States.<n>Our protocol only requires single-qubit Pauli measurements together with efficient classical post-processing.
  arXiv  Detail & Related papers  (2025-11-10T17:01:51Z)
• Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation [45.88028371034407]
  We introduce RIDA (Random Inverse Depolarizing Approximation), a simple universal method that harnesses randomly generated circuits to estimate a given circuit's global depolarization probability and corresponding error-free expectation value.<n> Numerical tests indicate RIDA outperforms key benchmarks, suggestive of significant accuracy improvements for applications of quantum computing across fields including physics and chemistry.
  arXiv  Detail & Related papers  (2025-08-24T20:30:08Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.<n>We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• Dynamic Resource Allocation with Quantum Error Detection [8.436934066461625]
  We propose a novel resource allocation framework that applies Pauli checks.<n>In this paper, we highlight their potential to infer the noise characteristics of a quantum system.<n>We show that dynamic quantum resource allocation with Pauli checks can outperform state-of-art mapping techniques.
  arXiv  Detail & Related papers  (2024-08-10T14:21:45Z)
• Reducing Depth and Measurement Weights in Pauli-based Computation [0.0]
  Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on magic-state qubits. Here, we propose several new ways of decreasing the weight of the Pauli measurements and their associated textsccnot complexity. We also demonstrate how to reduce this model's computational depth.
  arXiv  Detail & Related papers  (2024-08-07T18:00:11Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Learning unitaries with quantum statistical queries [0.0]
  We propose several algorithms for learning unitary operators from quantum statistical queries.<n>We leverage quantum statistical queries to estimate the Fourier mass of a unitary on a subset of Pauli strings.<n>Our results indicate that quantum statistical queries offer a unified framework for various unitary learning tasks.
  arXiv  Detail & Related papers  (2023-10-03T17:56:07Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers [0.0]
  We prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations. We provide a procedure for determining such a set of minimal register Pauli operations.
  arXiv  Detail & Related papers  (2022-06-27T04:22:30Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Robust decompositions of quantum states [0.0]
  We establish a classical-quantum complexity equivalence using a noisy quantum circuit model. We construct two distinct variants, both of which are compatible with machine-learning methodology. They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.
  arXiv  Detail & Related papers  (2020-03-09T14:28:04Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.