Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation

• URL: http://arxiv.org/abs/2606.31195v1
• Date: Tue, 30 Jun 2026 06:24:45 GMT
• Title: Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
• Abstract summary: We introduce quantum error mitigation with prior knowledge of Pauli weights (Pauli weight quantum error mitigation (Pi-QEM))<n>By leveraging the relationship between variance and locality in parameterized quantum circuits, Pi-QEM trains on a small subset of dominant, low-weight Pauli strings.<n>In numerical simulations of molecular systems on a noisy IBM quantum backend, Pi-QEM reduces ground-state energy estimation error by up to 34.01% using just a single dominant local observable.
• Score: 0.03608221777510314
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Machine learning provides a scalable solution for quantum error mitigation. However, the selection of appropriate Pauli strings for inclusion in training data remains a challenge. Current methods rely on heuristic or uniform random sampling, requiring data for every Pauli string in the Hamiltonian, a process that scales linearly with measurements and grows with system size. To address this, we introduce quantum error mitigation with prior knowledge of Pauli weights (Pauli weight quantum error mitigation (Pi-QEM)), a systematic framework that selects training observables based on Pauli weight. By leveraging the relationship between variance and locality in parameterized quantum circuits, Pi-QEM trains on a small subset of dominant, low-weight Pauli strings. In numerical simulations of molecular systems on a noisy IBM quantum backend, Pi-QEM reduces ground-state energy estimation error by up to 34.01% using just a single dominant local observable, offering an efficient, scalable pathway for high-precision error mitigation on NISQ devices.

Related papers

• Machine Learning Framework for Efficient Prediction of Quantum Wasserstein Distance [4.181752542660445]
  We present a machine learning framework that efficiently predicts the quantum W-distance.<n>Our approach employs both classical neural networks and traditional machine learning models.<n>The results establish machine learning as a viable and scalable alternative to traditional numerical methods for W-distance computation.
  arXiv  Detail & Related papers  (2025-11-16T04:07:13Z)
• Efficient Measurement Error Mitigation with Subsystem-Balanced Pauli Twirling [3.0919095220959996]
  Model-free measurement error mitigation (MEM) is essential for realizing reliable quantum computation.<n>We introduce subsystem-balanced Pauli twirling (SB-PT) that enforces Pauli operator balance on measuring subsystems to selectively suppress measurement noise.<n>This work provides a resource-frugal and experimentally viable path toward high-fidelity measurement in near-term quantum devices.
  arXiv  Detail & Related papers  (2025-09-22T00:39:32Z)
• 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)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• 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)
• Noise-Mitigated Variational Quantum Eigensolver with Pre-training and Zero-Noise Extrapolation [3.205475178870021]
  We develop an efficient noise-mitigating variational quantum eigensolver for accurate computation of molecular ground state energies in noisy environments.<n>We employ zero-noise extrapolation to mitigate quantum noise and combine it with neural networks to improve the accuracy of the noise-fitting function.<n>Results show that our algorithm can constrain noise errors within the range of $mathcalO(10-2) sim mathcalO(10-1)$, outperforming mainstream variational quantum eigensolvers.
  arXiv  Detail & Related papers  (2025-01-03T05:34:36Z)
• 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)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.366942647553326]
  We propose a robust protocol for characterizing quantum states on current quantum computing platforms.<n>Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity.<n>This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
  arXiv  Detail & Related papers  (2024-02-27T21:53:32Z)
• Experimental validation of the Kibble-Zurek Mechanism on a Digital Quantum Computer [62.997667081978825]
  The Kibble-Zurek mechanism captures the essential physics of nonequilibrium quantum phase transitions with symmetry breaking. We experimentally tested the KZM for the simplest quantum case, a single qubit under the Landau-Zener evolution. We report on extensive IBM-Q experiments on individual qubits embedded in different circuit environments and topologies.
  arXiv  Detail & Related papers  (2022-08-01T18:00:02Z)
• Quantum error mitigation via matrix product operators [27.426057220671336]
  Quantum error mitigation (QEM) can suppress errors in measurement results via repeated experiments and post decomposition of data. MPO representation increases the accuracy of modeling noise without consuming more experimental resources. Our method is hopeful of being applied to circuits in higher dimensions with more qubits and deeper depth.
  arXiv  Detail & Related papers  (2022-01-03T16:57:43Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

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.