Pauli Propagation for Imaginary Time Evolution

• URL: http://arxiv.org/abs/2601.14400v1
• Date: Tue, 20 Jan 2026 19:05:04 GMT
• Title: Pauli Propagation for Imaginary Time Evolution
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We extend the Pauli Propagation framework to simulate imaginary time evolution. By deriving explicit update rules for the propagation of Pauli operators under imaginary time evolution generated by Pauli strings, we introduce an imaginary time Pauli Propagation (ITPP) algorithm for approximating imaginary time dynamics directly in the Pauli basis. This approach enables the computation of thermal and ground-state properties while retaining the key computational advantages of Pauli Propagation. Benchmarking ITPP on the one-dimensional transverse-field Ising model demonstrates that truncation provides a controlled trade-off between accuracy and computational cost, while also revealing challenges associated with operator growth under imaginary time evolution. Finally, combining imaginary time and real-time Pauli Propagation naturally suggests a pathway toward simulating open quantum system dynamics within a unified framework.

Related papers

• Efficient computation of real-time correlators using Pauli Propagation [35.33651860775101]
  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.
  arXiv  Detail & Related papers  (2026-07-27T18:00:03Z)
• Symmetric dilations of Pauli channels and semigroups [0.0]
  We explore the symmetry properties of Stinespring dilations of single-qubit Pauli channels.<n>For each scenario, we derive the representation of the Pauli group acting on the Hilbert space of the environment.<n>Our results are relevant for the quantum simulation of Pauli channels via unitary dilations and of Pauli semigroups via collision models.
  arXiv  Detail & Related papers  (2026-05-20T08:53:39Z)
• Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits [1.7188280334580195]
  We propose a novel algorithm for architecture-aware synthesis of Pauli exponentials.<n>The results show an improved CNOT count and runtime for both random Pauli exponentials and molecular anstze.
  arXiv  Detail & Related papers  (2026-05-05T09:16:29Z)
• Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization [5.084371079702479]
  We develop a finite-beta structure for diagonal Pauli-Z cost Hamiltonians.<n>The structure yields an exact finite-beta identity between the LCU success probability and the ground-subspace fidelity.
  arXiv  Detail & Related papers  (2026-04-30T06:25:35Z)
• Spatiotemporal Pauli processes: Quantum combs for modelling correlated noise in quantum error correction [0.7345631364204196]
  Corspace noise is a critical failure mode in quantum error correction (QEC)<n>We present emphSpatio Pauli Processes (SPPs)<n>We map arbitrary multi-time, non-ovian dynamics to a multi-time Pauli process.
  arXiv  Detail & Related papers  (2026-03-05T18:45:06Z)
• Parallel Complex Diffusion for Scalable Time Series Generation [50.01609741902786]
  PaCoDi is a spectral-native architecture that decouples generative modeling in the frequency domain.<n>We show that PaCoDi outperforms existing baselines in both generation quality and inference speed.
  arXiv  Detail & Related papers  (2026-02-10T14:31:53Z)
• DFPO: Scaling Value Modeling via Distributional Flow towards Robust and Generalizable LLM Post-Training [94.568675548967]
  Training reinforcement learning (RL) systems in real-world environments remains challenging due to noisy supervision and poor out-of-domain generalization.<n>Recent distributional RL methods improve robustness by modeling values with multiple quantile points, but they still learn each quantile independently as a scalar.<n>We propose DFPO, a robust distributional RL framework that models values as continuous flows across time steps.
  arXiv  Detail & Related papers  (2026-02-05T17:07:42Z)
• 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)
• Multivariate Long-term Time Series Forecasting with Fourier Neural Filter [42.60778405812048]
  We introduce FNF as the backbone and DBD as architecture to provide excellent learning capabilities and optimal learning pathways for spatial-temporal modeling.<n>We show that FNF unifies local time-domain and global frequency-domain information processing within a single backbone that extends naturally to spatial modeling.
  arXiv  Detail & Related papers  (2025-06-10T18:40:20Z)
• Pauli Propagation: A Computational Framework for Simulating Quantum Systems [0.0]
  We provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation to its high-level user applications.<n>We present Pauli propagation.jl, a Julia software package that can perform rapid Pauli propagation simulation straight out-of-the-box.
  arXiv  Detail & Related papers  (2025-05-27T17:52:57Z)
• Pauli weight requirement of the matrix elements in time-evolved local operators: dependence beyond the equilibration temperature [0.0]
  We investigate whether "light" Pauli strings can be applied to quenches starting from homogeneous product states. In some cases, the light Pauli strings suffice to describe the dynamics, enabling efficient simulation with current algorithms. We analyze this behavior using a newly introduced measure of complexity, the Operator Weight Entropy.
  arXiv  Detail & Related papers  (2024-09-20T16:02:19Z)
• Lattice real-time simulations with learned optimal kernels [49.1574468325115]
  We present a simulation strategy for the real-time dynamics of quantum fields inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information.
  arXiv  Detail & Related papers  (2023-10-12T06:01:01Z)
• 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)
• Non-unitary Trotter circuits for imaginary time evolution [0.0]
  We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution. The scheme was tested on the transverse Ising model and the fermionic Hubbard model and is demonstrated to converge to the ground state of the system.
  arXiv  Detail & Related papers  (2023-04-16T23:37:34Z)
• Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity [7.1064035036390925]
  Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. The original QITE proposal [Nat. Phys. 16, 205-210 ( 2020)], which approximates the imaginary time evolution by real time evolution, suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. We propose a time-dependent drifting scheme inspired by thePhys. Rev. Lett 123, 070503 LiH], which randomly draws a Pauli term out of the approximated unitary operation generators of
  arXiv  Detail & Related papers  (2022-03-21T16:41:27Z)
• 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)
• Analog cosmological reheating in an ultracold Bose gas [58.720142291102135]
  We quantum-simulate the reheating-like dynamics of a generic cosmological single-field model in an ultracold Bose gas. Expanding spacetime as well as the background oscillating inflaton field are mimicked in the non-relativistic limit. The proposed experiment has the potential of exploring the evolution up to late times even beyond the weak coupling regime.
  arXiv  Detail & Related papers  (2020-08-05T18:00:26Z)
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters [1.0587959762260986]
  Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters. We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
  arXiv  Detail & Related papers  (2020-03-30T16:29:40Z)

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.