Pauli Propagation: Simulating Quantum Spin Dynamics via Operator Complexity

• URL: http://arxiv.org/abs/2510.22311v1
• Date: Sat, 25 Oct 2025 14:24:12 GMT
• Title: Pauli Propagation: Simulating Quantum Spin Dynamics via Operator Complexity
• Authors: Yuguo Shao, Song Cheng, Zhengwei Liu,
• Abstract summary: We introduce a scalable Pauli propagation approach that evolves local observables directly in the Heisenberg picture.<n>We prove the number of non-zero Pauli coefficients scales quadratically in Trotter steps, establishing the compressibility of Heisenberg-evolved operators.<n>Results establish an observable-centric simulator whose cost is governed by operator complexity rather than entanglement.
• Score: 1.299941371793082
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating real-time quantum dynamics in interacting spin systems is a fundamental challenge, where exact diagonalization suffers from exponential Hilbert-space growth and tensor-network methods face entanglement barriers. In this work, we introduce a scalable Pauli propagation approach that evolves local observables directly in the Heisenberg picture. Theoretically, we derive a priori error bounds governed by the Operator Stabilizer R\'enyi entropy (OSE) $\mathcal{S}^\alpha(O)$, which explicitly links the truncation accuracy to operator complexity and prescribes a suitable Top-$K$ truncation strategy. For the 1D Heisenberg model with $J_z = 0$, we prove the number of non-zero Pauli coefficients scales quadratically in Trotter steps, establishing the compressibility of Heisenberg-evolved operators. Numerically, we validate the framework on XXZ Heisenberg chain benchmarks, showing high accuracy with small $K$ in free regimes ($J_z = 0$) and competitive performance against tensor-network methods (e.g., TDVP) in interacting cases ($J_z = 0.5$). These results establish an observable-centric simulator whose cost is governed by operator complexity rather than entanglement, offering a practical alternative for studying non-equilibrium dynamics in quantum many-body systems.

Related papers

• Unsupervised Discovery of Intermediate Phase Order in the Frustrated $J_1$-$J_2$ Heisenberg Model via Prometheus Framework [0.0]
  We apply the Prometheus variational autoencoder framework to explore the $J_1$-$J$ phase diagram.<n>We identify the structure factor $S(,)$ and $S(,)$ as the dominant order parameters.<n>This work establishes a scalable pathway for applying machine learning to frustrated quantum systems.
  arXiv  Detail & Related papers  (2026-02-25T00:44:51Z)
• Stabilizing Fixed-Point Iteration for Markov Chain Poisson Equations [49.702772230127465]
  We study finite-state Markov chains with $n$ states and transition matrix $P$.<n>We show that all non-decaying modes are captured by a real peripheral invariant subspace $mathcalK(P)$, and that the induced operator on the quotient space $mathbbRn/mathcalK(P) is strictly contractive, yielding a unique quotient solution.
  arXiv  Detail & Related papers  (2026-01-31T02:57:01Z)
• Beyond Isotonization: Scalable Non-Crossing Quantile Estimation via Neural Networks for Student Growth Percentiles [0.0]
  Student Growth Percentiles (SGPs), widely adopted across U.S. state assessment systems, employ independent quantile regression followed by post-hoc correction.<n>We demonstrate this approach contains a fundamental methodological inconsistency: between independently-estimated, potentially crossed quantiles requires monotonicity.<n>We propose neural network-based multi-quantile regression (NNQR) with shared hidden layers as a practical alternative.
  arXiv  Detail & Related papers  (2025-10-25T19:39:07Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Explicit Quantum Circuits for Simulating Linear Differential Equations via Dilation [0.0]
  We present a concrete pipeline that connects the dilation formalism with explicit quantum circuit constructions.<n>On the analytical side, we introduce a discretization of the continuous dilation operator that is tailored for quantum implementation.<n>We prove that the resulting scheme achieves a global error bound of order $O(M-3/2)$, up to exponentially small boundary effects.
  arXiv  Detail & Related papers  (2025-09-20T18:54:49Z)
• Non-Hermitian Quantum Metrology Enhancement and Skin Effect Suppression in PT-Symmetric Bardeen-Cooper-Schrieffer Chains [0.0]
  We outline a theoretical framework for quantum metrology in non-Hermitian systems.<n>Through biorthogonal quantum Fisher information analysis, we identify two distinct regimes.<n>NHSE suppresses sensitivity exponentially, while $mathcalPT$-symmetry enables Heisenberg-limited enhancement.
  arXiv  Detail & Related papers  (2025-08-06T18:54:45Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization [88.0031283949404]
  Many real-world problems have complicated non functional constraints and use a large number of data points. Our proposed method outperforms an existing method with the previously best-known result.
  arXiv  Detail & Related papers  (2022-12-19T14:48:54Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Asymptotic optimality of twist-untwist protocols for Heisenberg scaling in atomic interferometry [0.0]
  We prove that twist-untwist protocols provide the lowest estimation error among quantum metrology protocols. We consider all-to-all interactions generated by one-axis twisting. We show that the error of a twist-untwist protocol can be decreased by a factor of $L$ without an increase in the noise of spin measurement.
  arXiv  Detail & Related papers  (2021-04-13T22:29:26Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

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.