Hubert Pugzlys | Searcharxiv

arXiv2025

Autoregressive Neural Network Extrapolation of Quantum Spin Dynamics Across Time and Space

Understanding the long-time dynamics of strongly correlated quantum matter remains a major challenge: as quantum entanglement grows during time evolution, conventional numerical methods become increasingly costly, limiting access to the long-range correlations and low-energy excitations that govern gapless systems. Here we show that these dynamical correlations can be extended beyond the accessible numerical window without explicitly evolving the underlying many-body wavefunction. We introduce an autoregressive machine-learning framework that enables the extrapolation of dynamical spin correlations in both time and space beyond the reach of conventional numerical methods. Trained on time-dependent density matrix renormalization group simulations of the gapless XXZ model, our approach is benchmarked against exact solutions available for this analytically solvable system. Combined with physics-informed spatial extension, a multi-layer perceptron model using ReLU activation functions has been shown to be superior to convolutional neural networks and linear regressions for longer time extrapolation. A study of error accumulation further demonstrates that our autoregressive neural network extrapolations are highly robust to perturbations, suggesting stable and reliable predictions. This work offers a complementary route to studying the dynamics of gapless quantum many-body systems, in which machine learning extends and complements the capabilities of state-of-the-art numerical approaches.

cond-mat.str-el↗

arXiv2024

Active Learning for Discovering Complex Phase Diagrams with Gaussian Processes

We introduce a Bayesian active learning algorithm that efficiently elucidates phase diagrams. Using a novel acquisition function that assesses both the impact and likelihood of the next observation, the algorithm iteratively determines the most informative next experiment to conduct and rapidly discerns the phase diagrams with multiple phases. Comparative studies against existing methods highlight the superior efficiency of our approach. We demonstrate the algorithm's practical application through the successful identification of the entire phase diagram of a spin Hamiltonian with antisymmetric interaction on Honeycomb lattice, using significantly fewer sample points than traditional grid search methods and a previous method based on support vector machines. Our algorithm identifies the phase diagram consisting of skyrmion, spiral and polarized phases with error less than 5% using only 8% of the total possible sample points, in both two-dimensional and three-dimensional phase spaces. Additionally, our method proves highly efficient in constructing three-dimensional phase diagrams, significantly reducing computational and experimental costs. Our methodological contributions extend to higher-dimensional phase diagrams with multiple phases, emphasizing the algorithm's effectiveness and versatility in handling complex, multi-phase systems in various dimensions.

physics.comp-ph↗