Computing noise-canceling observables via Pauli propagation

• URL: http://arxiv.org/abs/2606.20441v1
• Date: Thu, 18 Jun 2026 16:22:51 GMT
• Title: Computing noise-canceling observables via Pauli propagation
• Abstract summary: pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods.<n>We show that embedding Pauli propagation within a hybrid error-mitigation framework can reduce quantum sampling overhead while achieving lower truncation errors.<n>Results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone.
• Score: 0.33055374209385807
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.

Related papers

• Quantum Enhanced Pauli Propagation [0.0]
  We propose a hybrid algorithm that uses quantum resources to improve the accuracy of approximate classical Pauli-path simulation.<n>Noisy quantum expectation values are then used to infer a global rescaling factor that corrects quantum execution of the target circuit.<n>QuEPP offers a simple, scalable, and model-free framework for enabling accurate quantum computation in the pre-fault-tolerant era.
  arXiv  Detail & Related papers  (2026-03-15T17:04:36Z)
• Quantum Framework for Wavelet Shrinkage [0.0]
  This paper develops a unified framework for quantum wavelet shrinkage, extending classical denoising ideas into the quantum domain.<n>Phase damping and ancilla-driven constructions realize this behavior coherently and show that statistical adaptivity and quantum unitarity can be combined within a single circuit model.
  arXiv  Detail & Related papers  (2025-11-25T02:35:18Z)
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits [1.9573380763700712]
  We propose an exact sampling algorithm that integrates tensor network contraction techniques with a Markov process.<n>As a demonstration, we target the challenge of generating samples from ideal and noisy QAOA circuits with up to 476 qubits.
  arXiv  Detail & Related papers  (2025-10-28T09:33:11Z)
• Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning [8.505960463791139]
  We introduce a mechanism termed the weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory.<n>Our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity.
  arXiv  Detail & Related papers  (2025-09-09T13:09:48Z)
• Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors [64.50565018996328]
  We introduce the concept of predictive surrogates, designed to emulate the mean-value behavior of a given quantum processor with provably computational efficiency.<n>We use these surrogates to emulate a quantum processor with up to 20 programmable superconducting qubits, enabling efficient pre-training of variational quantum eigensolvers.<n> Experimental results reveal that the predictive surrogates not only reduce measurement overhead by orders of magnitude, but can also surpass the performance of conventional, quantum-resource-intensive approaches.
  arXiv  Detail & Related papers  (2025-07-23T12:51:03Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Benchmarking universal quantum gates via channel spectrum [0.0]
  Noise remains the major obstacle to scalable quantum computation. We propose a method to infer the noise properties of the target gate, including process fidelity, fidelity, and some unitary parameters, from the eigenvalues of its noisy channel. Our method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems.
  arXiv  Detail & Related papers  (2023-01-05T13:18:19Z)
• Limitations of variational quantum algorithms: a quantum optimal transport approach [11.202435939275675]
  We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
  arXiv  Detail & Related papers  (2022-04-07T13:58:44Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.