Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.22069

Generalized $m$-body mean-field projections for classical simulation of $d$-dimensional Heisenberg-picture dynamics

Federico Tomás B. Pérez, Gabriela Wójtowicz, Matthias Kost, Martin B. Plenio

quant-phSubmitted Oct 15, 2026• Announced Oct 16, 2026• 0 citations
arXivHTMLPDF

Abstract

Classical simulation of quantum many-body dynamics is challenged by the rapid growth of operator complexity, particularly in higher dimensions where tensor-network methods become increasingly demanding. We develop state-adapted Pauli-weight propagation based on generalized $m$-body mean-field projections, which compress many-body observables into optimal low-body representations in a covariance geometry induced by the initial state. Combined with adaptive Krylov-like restricted Heisenberg dynamics, this provides an alternative to conventional Hilbert--Schmidt Pauli-weight truncation. We derive necessary and conditional sufficient bounds on low-body approximation accuracy using standard operator complexity measures and characterize possible dynamical failure mechanisms of the state-adapted method. Numerical benchmarks demonstrate substantial state-dependent accuracy gains, while identifying regimes of reduced accuracy or violations of Pauli spectral bounds. For a three-dimensional system of $80$ interacting spins, our method achieves strong body-order convergence, close agreement with independently converging tensor-network simulations, and substantially smaller sparse Pauli representations. These results establish state-adapted Pauli propagation as a promising approach to classical simulation of higher-dimensional coherent many-body dynamics.

AI Summary

The paper asks how to truncate Heisenberg-picture operator dynamics when the goal is an expectation value in a known initial state, rather than reconstruction of the full observable. It retains Pauli strings of weight at most $m$, but replaces Hilbert–Schmidt truncation with a projection minimizing $\mathrm{Tr}[\sigma_0(O-O_m)^2]$. For product reference states, this projection truncates the expansion in centered local operators and is explicitly computable. Projected dynamics are propagated using adaptive, finite-depth Krylov-like bases. The analysis separates instantaneous representation error from discarded-sector feedback and finite-basis errors. Projection preserves the reference-state expectation exactly, so prediction error arises through the latter dynamical contributions. Operator-space Rényi-2 entanglement supplies a necessary condition for low-body Hilbert–Schmidt approximation; sufficient covariance-error bounds require an independently assumed exponentially decaying body-order tail and controlled return coupling. Rank-deficient reference states introduce null directions whose equivalence need not survive projected evolution. Benchmarks use transverse-field Ising models with a longitudinal field. A 10-spin purity sweep finds approximately two orders of magnitude lower time-averaged error than Hilbert–Schmidt propagation near polarization $r=0.9$. An 18-spin orientation sweep also finds unfavorable states with approximate Pauli expectations reaching about $2.5$. For an 80-spin three-dimensional lattice over $tJ\leq0.6$, body orders $m=2,3$ agree at roughly the $10^{-3}$ scale and agree with independently converging tensor-network calculations. Covariance propagation uses roughly $10^4$ versus $10^5$ nonzero coefficients at $m=3$, but both require order $10^5$ seconds. No general convergence guarantee, large-system error certificate, or proportional runtime advantage is established; the adaptive threshold is not an error bound.

Little sign of AI-generated textIncrementalMissing comparisonStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Companion paper to arXiv:2609.12840; 35 pages; 6 figures; supplementary numerical results and analytical proofs included. Comments and suggestions are appreciated

Related papers

State-adapted generalized mean-field projections for Pauli propagation of Heisenberg dynamics

Federico Tomás B. Pérez, Gabriela Wójtowicz, Martin B. Plenio

The Heisenberg picture can make quantum many-body simulation efficient when evolved observables admit compact operator representation within low-dimensional structures. Conventional Pauli-string propagation and truncation techniques exploit this structure, but in coherent Hamiltonian dynamics their error control is often heuristic and their stability can be poor. We introduce a state-adapted Krylov framework based on geometric generalized mean-field projections of many-body observables onto low-body operator subspaces. The resulting dynamics approximate expectation values, do not extend spatial support beyond that prescribed by Lieb-Robinson bounds, and compress high-body correlations onto their state-relevant low-body representatives rather than simply discarding them. We derive necessary operator-entanglement obstructions to low-body representation and conditional sufficient bounds on representation and dynamical errors involving nonstabilizerness and controlled high-body tails. Numerical benchmarks show improved, stable finite-$m$ hierarchies and simulations on large three-dimensional lattices, establishing a scalable state-adapted alternative to conventional Heisenberg-picture weight-truncation of Pauli strings.

quant-pharXiv:2609.12840•Sep 14, 2026•3 citations

Classical Simulation Healed by Quantum Entanglement

Jue Xu, Chu Zhao, Xiangran Zhang +2 more

Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.

quant-pharXiv:2601.15770•Jan 23, 2026•6 citations

On the out-of-equilibrium dynamics with tensor networks

Ramos Marimón, Carlos

[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.

•Sep 10, 2025•0 citations

A Readout-Aware Theory of Approximate Heisenberg Propagation

Yubraj Bhandari, Jakob S. Kottmann, Adelina Bärligea

Classical methods for computing quantum expectation values often propagate observables in the Heisenberg picture. To remain tractable, these methods rely on approximations that discard operator components during evolution. Yet the magnitude of these components alone does not determine the resulting expectation-value error, which also depends on their subsequent evolution and the input state. We develop \emph{generalized Pauli propagation}, a common algebraic framework encompassing Pauli propagation, Lie-algebraic simulation, and Krylov subspace methods. Using weighted commutator graphs, we derive exact identities that relate approximation errors to the signed contributions of omitted and discarded operator components. Our central result establishes \emph{delayed observability}, identifying conditions under which these contributions vanish at low orders in propagation time. We use this structure to develop finite-order error estimates and state-dependent selection rules. We further prove that retaining the symmetry-preserving part of a weak perturbation eliminates first-order expectation-value errors under suitable symmetry conditions. By revealing how approximation errors affect the desired expectation value, our framework provides a basis for more informative error analysis and the development of readout-aware simulation strategies.

quant-pharXiv:2610.26222•Oct 20, 2026•0 citations

Machine learning and high-performance computing in numerical simulation of quantum many-body systems

Hongwei Chen

This thesis focuses on the development, application, and high-performance implementation of numerical methods for simulating quantum many-body systems. In the first chapter, I provide an overview of several most successful conventional approaches for simulating quantum many-body systems, along with their current limitations. Then, the basic properties of the quantum spin model, which will be the subject of study in the following chapters, and its ground state are briefly summarized. Additionally, I discuss the background and the motivations of the research projects carried out during my PhD research. Chapter 2 introduces two numerical algorithms that are extensively used in this thesis, which are exact diagonalization (ED) and variational Monte Carlo. I outline the process of constructing a Hamiltonian matrix and employing iterative methods for exact diagonalization. Subsequently, I introduce the mechanism of the four important components in the ``standard" variational Monte Carlo that are widely used in the most recent research. In Chapter 3, we propose a symmetry-projected variational ansatz in the form of linear combinations of simple restricted Boltzmann machines. This construction allows one to explore states outside of the original variational manifold and increase the representation power with moderate computational effort. Besides allowing one to restore spatial symmetries, an expansion in terms of Krylov states using a Lanczos recursion offers a solution that can further improve the quantum state accuracy. We illustrate these ideas with an application to the Heisenberg $J_1-J_2$ model on the square lattice, a paradigmatic problem under debate in condensed matter physics,and achieve state-of-the-art accuracy in the representation of the ground state. In Chapter 4, we present a variational approach based on a Chebyshev expansion of the spectral function, and each Chebyshev polynomial is represented by a neural network quantum state. The Chebyshev moments are obtained by recursively applying the Hamiltonian and projecting on the space of variational states using a modified natural gradient descent method. We compare this approach with a modified approximation of the spectral function which uses a Krylov subspace constructed from the "Chebyshev wave functions." We present results for the one-dimensional and two-dimensional Heisenberg models on the square lattice and compare them with those obtained by other methods in the literature. In Chapter 5, we describe a method to carry out thermodynamic simulations of quantum many-body models using typicality and variational representations of quantum states. Minimally entangled typical thermal states (METTS) are a construction that allows one to solve for the imaginary time evolution of quantum many-body systems. By using wave functions that are weakly entangled, one can take advantage of efficient representations in the form of matrixproduct states. We generalize these ideas to arbitrary variational wave functions and we focus, as an illustration, on the particular case of restricted Boltzmann machines. We demonstrate the application of the method to quantum spin systems in one and two spatial dimensions. In Chapter 6, we study the properties of the impurity band in heavily doped nonmagnetic semiconductors using the Jacobi-Davidson algorithm and the supervised deep learning method. The disorder averaged inverse participation ratio and Thouless number calculation show us the rich structure inside the impurity band. A convolutional neural network model, which is trained to distinguish the extended/localized phase of the Anderson model with high accuracy, shows us the results in good agreement with the conventional approach. Together, we find that there are three mobility edges in the impurity band for a specific on-site impurity potential, which means the presence of the extended states while filling the impurity band. In the final chapter, Chapter 7, we discuss the implementation of architecture-aware optimizations for spin dynamics simulations on x86 CPUs and Nvidia GPUs. The time cost of evaluating the spin-spin correlation functions in real space increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. We propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel to reduce memory latency. On Nvidia GPU, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which significantly reduces memory usage and achieves better performance than $\mathtt{cuBLAS}$.--Author's abstract

•Jan 1, 2024•0 citations

Efficient computation of real-time correlators using Pauli Propagation

Alexander F. Kemper, Raghav G. Jha, Arnab Bachhar +3 more

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.

quant-pharXiv:2607.24924•Jul 29, 2026•6 citations
Generalized mmm-body mean-field projections for classical simulation of ddd-dimensional Heisenberg-picture dynamics
Classical simulation of quantum many-body dynamics is challenged by the rapid growth of operator complexity, particularly in higher dimensions where tensor-network methods become increasingly demanding. We develop state-adapted Pauli-weight propagation based on generalized mmm-body mean-field projections, which compress many-body observables into optimal low-body representations in a covariance geometry induced by the initial state. Combined with adaptive Krylov-like restricted Heisenberg dynamics, this provides an alternative to conventional Hilbert--Schmidt Pauli-weight truncation. We derive necessary and conditional sufficient bounds on low-body approximation accuracy using standard operator complexity measures and characterize possible dynamical failure mechanisms of the state-adapted method. Numerical benchmarks demonstrate substantial state-dependent accuracy gains, while identifying regimes of reduced accuracy or violations of Pauli spectral bounds. For a three-dimensional system of 808080 interacting spins, our method achieves strong body-order convergence, close agreement with independently converging tensor-network simulations, and substantially smaller sparse Pauli representations. These results establish state-adapted Pauli propagation as a promising approach to classical simulation of higher-dimensional coherent many-body dynamics.
The paper asks how to truncate Heisenberg-picture operator dynamics when the goal is an expectation value in a known initial state, rather than reconstruction of the full observable. It retains Pauli strings of weight at most mmm, but replaces Hilbert–Schmidt truncation with a projection minimizing Tr[σ0(O−Om)2]\mathrm{Tr}[\sigma_0(O-O_m)^2]Tr[σ0​(O−Om​)2]. For product reference states, this projection truncates the expansion in centered local operators and is explicitly computable. Projected dynamics are propagated using adaptive, finite-depth Krylov-like bases.
The analysis separates instantaneous representation error from discarded-sector feedback and finite-basis errors. Projection preserves the reference-state expectation exactly, so prediction error arises through the latter dynamical contributions. Operator-space Rényi-2 entanglement supplies a necessary condition for low-body Hilbert–Schmidt approximation; sufficient covariance-error bounds require an independently assumed exponentially decaying body-order tail and controlled return coupling. Rank-deficient reference states introduce null directions whose equivalence need not survive projected evolution.
Benchmarks use transverse-field Ising models with a longitudinal field. A 10-spin purity sweep finds approximately two orders of magnitude lower time-averaged error than Hilbert–Schmidt propagation near polarization r=0.9r=0.9r=0.9. An 18-spin orientation sweep also finds unfavorable states with approximate Pauli expectations reaching about 2.52.52.5. For an 80-spin three-dimensional lattice over tJ≤0.6tJ\leq0.6tJ≤0.6, body orders m=2,3m=2,3m=2,3 agree at roughly the 10−310^{-3}10−3 scale and agree with independently converging tensor-network calculations. Covariance propagation uses roughly 10410^4104 versus 10510^5105 nonzero coefficients at m=3m=3m=3, but both require order 10510^5105 seconds. No general convergence guarantee, large-system error certificate, or proportional runtime advantage is established; the adaptive threshold is not an error bound.
The Heisenberg picture can make quantum many-body simulation efficient when evolved observables admit compact operator representation within low-dimensional structures. Conventional Pauli-string propagation and truncation techniques exploit this structure, but in coherent Hamiltonian dynamics their error control is often heuristic and their stability can be poor. We introduce a state-adapted Krylov framework based on geometric generalized mean-field projections of many-body observables onto low-body operator subspaces. The resulting dynamics approximate expectation values, do not extend spatial support beyond that prescribed by Lieb-Robinson bounds, and compress high-body correlations onto their state-relevant low-body representatives rather than simply discarding them. We derive necessary operator-entanglement obstructions to low-body representation and conditional sufficient bounds on representation and dynamical errors involving nonstabilizerness and controlled high-body tails. Numerical benchmarks show improved, stable finite-mmm hierarchies and simulations on large three-dimensional lattices, establishing a scalable state-adapted alternative to conventional Heisenberg-picture weight-truncation of Pauli strings.
Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.
[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.
Classical methods for computing quantum expectation values often propagate observables in the Heisenberg picture. To remain tractable, these methods rely on approximations that discard operator components during evolution. Yet the magnitude of these components alone does not determine the resulting expectation-value error, which also depends on their subsequent evolution and the input state. We develop \emph{generalized Pauli propagation}, a common algebraic framework encompassing Pauli propagation, Lie-algebraic simulation, and Krylov subspace methods. Using weighted commutator graphs, we derive exact identities that relate approximation errors to the signed contributions of omitted and discarded operator components. Our central result establishes \emph{delayed observability}, identifying conditions under which these contributions vanish at low orders in propagation time. We use this structure to develop finite-order error estimates and state-dependent selection rules. We further prove that retaining the symmetry-preserving part of a weak perturbation eliminates first-order expectation-value errors under suitable symmetry conditions. By revealing how approximation errors affect the desired expectation value, our framework provides a basis for more informative error analysis and the development of readout-aware simulation strategies.
This thesis focuses on the development, application, and high-performance implementation of numerical methods for simulating quantum many-body systems. In the first chapter, I provide an overview of several most successful conventional approaches for simulating quantum many-body systems, along with their current limitations. Then, the basic properties of the quantum spin model, which will be the subject of study in the following chapters, and its ground state are briefly summarized. Additionally, I discuss the background and the motivations of the research projects carried out during my PhD research. Chapter 2 introduces two numerical algorithms that are extensively used in this thesis, which are exact diagonalization (ED) and variational Monte Carlo. I outline the process of constructing a Hamiltonian matrix and employing iterative methods for exact diagonalization. Subsequently, I introduce the mechanism of the four important components in the ``standard" variational Monte Carlo that are widely used in the most recent research. In Chapter 3, we propose a symmetry-projected variational ansatz in the form of linear combinations of simple restricted Boltzmann machines. This construction allows one to explore states outside of the original variational manifold and increase the representation power with moderate computational effort. Besides allowing one to restore spatial symmetries, an expansion in terms of Krylov states using a Lanczos recursion offers a solution that can further improve the quantum state accuracy. We illustrate these ideas with an application to the Heisenberg J1−J2J_1-J_2J1​−J2​ model on the square lattice, a paradigmatic problem under debate in condensed matter physics,and achieve state-of-the-art accuracy in the representation of the ground state. In Chapter 4, we present a variational approach based on a Chebyshev expansion of the spectral function, and each Chebyshev polynomial is represented by a neural network quantum state. The Chebyshev moments are obtained by recursively applying the Hamiltonian and projecting on the space of variational states using a modified natural gradient descent method. We compare this approach with a modified approximation of the spectral function which uses a Krylov subspace constructed from the "Chebyshev wave functions." We present results for the one-dimensional and two-dimensional Heisenberg models on the square lattice and compare them with those obtained by other methods in the literature. In Chapter 5, we describe a method to carry out thermodynamic simulations of quantum many-body models using typicality and variational representations of quantum states. Minimally entangled typical thermal states (METTS) are a construction that allows one to solve for the imaginary time evolution of quantum many-body systems. By using wave functions that are weakly entangled, one can take advantage of efficient representations in the form of matrixproduct states. We generalize these ideas to arbitrary variational wave functions and we focus, as an illustration, on the particular case of restricted Boltzmann machines. We demonstrate the application of the method to quantum spin systems in one and two spatial dimensions. In Chapter 6, we study the properties of the impurity band in heavily doped nonmagnetic semiconductors using the Jacobi-Davidson algorithm and the supervised deep learning method. The disorder averaged inverse participation ratio and Thouless number calculation show us the rich structure inside the impurity band. A convolutional neural network model, which is trained to distinguish the extended/localized phase of the Anderson model with high accuracy, shows us the results in good agreement with the conventional approach. Together, we find that there are three mobility edges in the impurity band for a specific on-site impurity potential, which means the presence of the extended states while filling the impurity band. In the final chapter, Chapter 7, we discuss the implementation of architecture-aware optimizations for spin dynamics simulations on x86 CPUs and Nvidia GPUs. The time cost of evaluating the spin-spin correlation functions in real space increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. We propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel to reduce memory latency. On Nvidia GPU, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which significantly reduces memory usage and achieves better performance than cuBLAS\mathtt{cuBLAS}cuBLAS.--Author's 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.