Efficient computation of real-time correlators using Pauli Propagation

• URL: http://arxiv.org/abs/2607.24924v1
• Date: Mon, 27 Jul 2026 18:00:03 GMT
• Title: Efficient computation of real-time correlators using Pauli Propagation
• Abstract summary: Pauli propagation has shown promise for simulating quantum dynamics by evolving observables directly in the Heisenberg picture.<n>One major limitation of Pauli propagation is the rapid growth in the number of Pauli strings beyond short times.<n>We overcome this limitation by combining accurate short-time Pauli-propagation data with time extension methods based on a positivity condition.
• Score: 35.33651860775101
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pauli propagation has shown promise for classically simulating quantum dynamics by evolving observables directly in the Heisenberg picture. In this work, we investigate its use for computing real-time two-point time-ordered correlators in one- and two-dimensional quantum systems. One major limitation of Pauli propagation is the rapid growth in the number of Pauli strings beyond short times. We overcome this limitation by combining accurate short-time Pauli-propagation data with time extension methods based on a positivity condition and the observation that the dynamics are often dominated by a small number of characteristic frequencies. This combined approach extends correlation functions far beyond the directly accessible time window while avoiding the exponential proliferation of Pauli operators. We demonstrate that the resulting correlators retain the relevant dynamical and spectral information. Our results broaden the regime in which classical methods can reliably probe the real-time dynamics of interacting quantum many-body systems.

Related papers

• Inverse Design of Quantum Control Sequences with Fourier Neural Operators [57.63590760083204]
  We introduce a Fourier Neural Operator (FNO)-based framework for learning high dimensional molecular quantum dynamics.<n>We develop the FNO pulse-measurement planner (FNO-SPMP), which constructs pulse sequences to purify an initially mixed Boltzmann distribution.<n>In a shared discrete control space, FNO-SPMP achieves nearly twice the success rate of a reinforcement-learning baseline.
  arXiv  Detail & Related papers  (2026-08-04T14:06:59Z)
• Computing noise-canceling observables via Pauli propagation [0.33055374209385807]
  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.
  arXiv  Detail & Related papers  (2026-06-18T16:22:51Z)
• Noise-induced Simulability Transition from Operator Scrambling [0.0]
  We study the finite-depth Pauli spectrum of random quantum circuits.<n>In noisy circuits, scrambling competes with an effective suppression of operator spreading.<n>We rigorously show that classical simulation remains exponentially hard.
  arXiv  Detail & Related papers  (2026-05-18T18:00:00Z)
• Learning Quantum Operator Dynamics from Short-Time Data [7.848025658827143]
  Real-time dynamics of quantum observables provide direct access to excitation spectra and correlation functions in quantum many-body systems.<n>We propose a neural ordinary differential equation (Neural ODE) framework with physics-driven designs to reconstruct long-time operator dynamics from short-time measurements.
  arXiv  Detail & Related papers  (2026-03-16T01:12:39Z)
• Spatiotemporal Pauli processes: Quantum combs for modelling correlated noise in quantum error correction [0.7345631364204196]
  Corpatio noise is a critical failure mode in quantum error correction (QEC)<n>We introduce Stemporal Pauli Processes (SPPs)<n>SPPs map arbitrary multi-time, non-Markovian dynamics to a multi-time Pauli process.
  arXiv  Detail & Related papers  (2026-03-05T18:45:06Z)
• Pauli Propagation for Imaginary Time Evolution [0.0]
  We introduce an imaginary time Pauli Propagation algorithm for approximating imaginary time dynamics directly in the Pauli basis.<n> Benchmarking ITPP on the one-dimensional transverse-field Ising model demonstrates that truncation provides a controlled trade-off between accuracy and computational cost.
  arXiv  Detail & Related papers  (2026-01-20T19:05:04Z)
• Constructive interference at the edge of quantum ergodic dynamics [116.94795372054381]
  We characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC$(2)$.<n>In contrast to dynamics without time reversal, OTOC$(2)$ are observed to remain sensitive to the underlying dynamics at long time scales.
  arXiv  Detail & Related papers  (2025-06-11T21:29:23Z)
• Out-of-time-order correlator computation based on discrete truncated Wigner approximation [4.604003661048267]
  We propose a method based on the discrete truncated Wigner approximation (DTWA) for computing out-of-time-order correlators.<n>This work provides and demonstrates a new technique to study scrambling dynamics in long-range interacting quantum spin systems.
  arXiv  Detail & Related papers  (2025-01-24T03:55:12Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.