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:2102.11868

Machine Learning Regression for Operator Dynamics

Justin A. Reyes, Sayandip Dhara, Eduardo R. Mucciolo

Published Feb 23, 2021• 0 citations
arXivHTMLPDF

Abstract

Determining the dynamics of the expectation values for operators acting on a quantum many-body (QMB) system is a challenging task. Matrix product states (MPS) have traditionally been the "go-to" models for these systems because calculating expectation values in this representation can be done with relative simplicity and high accuracy. However, such calculations can become computationally costly when extended to long times. Here, we present a solution for efficiently extending the computation of expectation values to long time intervals. We utilize a multi-layer perceptron (MLP) model as a tool for regression on MPS expectation values calculated within the regime of short time intervals. With this model, the computational cost of generating long-time dynamics is significantly reduced, while maintaining a high accuracy. These results are demonstrated with operators relevant to quantum spin models in one spatial dimension.

DOI
10.48550/arxiv.2102.11868

Related papers

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

Hubert Pugzlys, Shreyas Varude, Sam Dillon +5 more

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.

arXiv:2512.13103•Dec 15, 2025•0 citations

A Heuristic for Matrix Product State Simulation of Out-of-Equilibrium Dynamics of Two-Dimensional Quantum Spin Systems

Salvatore Mandrà, Brayden Ware, Nikita Astrakhantsev +4 more

Out-of-equilibrium dynamics of non-integrable Hamiltonian many-body quantum systems are characterized by highly entangled wave functions. Near-maximal entanglement arises in systems exhibiting thermalization or pre-thermalization, where the system converges to a steady state with a fixed energy density. Classical simulation of the time dependence of such wave functions requires exponential resources. However, typical computations aim to estimate expectation values of local operators and correlation functions to some expected precision. For thermalizing systems at sufficiently high energy densities, such computations can be done without storing the full wave function by instead simulating the evolution of the local operator, which requires significantly fewer resources. Nonetheless, constructing such resource-efficient classical algorithms remains a challenge for intermediate energy densities, where simulating both the wave function and operator evolution is costly. In this paper, we propose a heuristic approach to accelerate the convergence of Matrix Product State (MPS) simulations of expectation values, applicable across a broad range of energy densities. We estimate the desired observables by rescaling the MPS results at low bond dimensions with a factor that depends on the fidelity of the MPS wave function. Using this technique, we simulated the dynamics of the two-dimensional Transverse-Field Ising Model (TFIM) on a $7\times8$ grid with periodic boundary conditions, using a maximum bond dimension of $χ= 4096$ on a single A100 GPU, as well as the dynamics of the two-dimensional XY model on grids of size up to $9\times9$. We compare our TFIM results to similar simulations on a digital quantum processor [R. Haghshenas et al., Nature 653, 56 (2026)], demonstrating excellent agreement and confirming the predictive power of our method.

quant-pharXiv:2511.23438•PRX Quantum•Dec 1, 2025•0 citations

Machine learning matrix product state ansatz for strongly correlated systems

Sumanta K. Ghosh, Debashree Ghosh

Machine learning (ML) has been used to optimize the matrix product state (MPS) ansatz for the wavefunction of strongly correlated systems. The ML optimization of MPS has been tested for the Heisenberg Hamiltonian on one-dimensional and ladder lattices, which correspond to conjugated molecular systems. The input descriptors and output for the supervised ML are lattice configurations and configuration interaction coefficients, respectively. Efficient learning can be achieved from data over the full Hilbert space via exact diagonalization or full configuration interaction, as well as over a much smaller sub-space via Monte Carlo Configuration Interaction. We show that this circumvents the need to calculate energy and operator expectation values and is therefore a computationally efficient alternative to variational optimization.

The Journal of Chemical Physics•Jan 23, 2023•9 citations

Using matrix-product states for time-series machine learning

Joshua B. Moore, Hugo P. Stackhouse, Ben Fulcher +1 more

Matrix-product states (MPS) have proven to be a versatile ansatz for modeling quantum many-body physics. For many applications, and particularly in one-dimension, they capture relevant quantum correlations in many-body wave functions while remaining tractable (polynomial scaling) to store and manipulate on a classical computer. This has motivated researchers to also apply the MPS ansatz to machine learning (ML) problems where capturing complex correlations in datasets is also a key requirement. Here, for the first time, we develop an MPS-based algorithm, MPSTime, for learning a joint probability distribution underlying a time-series dataset, and show how it can be used to tackle important time-series ML problems, including classification and imputation. MPSTime can efficiently learn complicated time-series probability distributions directly from data, requires only moderate maximum MPS bond dimension χ max (with values for our applications ranging between χ max = 20 − 160 ), and can be trained for both classification and imputation tasks under a single logarithmic loss function. Using synthetic and publicly available real-world datasets—spanning applications in medicine, energy, and astronomy—we demonstrate performance competitive with state-of-the-art ML approaches, but with the key advantage of encoding the full joint probability distribution learned from the data, which is useful for analyzing and interpreting its underlying structure. This manuscript is supplemented with the release of a publicly available code package that implements our approach, and can be used to reproduce all presented results. The effectiveness of the MPS-based ansatz for capturing complex correlation structures in time-series data makes it a powerful foundation for tackling challenging time-series analysis problems across science, industry, and medicine.

arXiv:2412.15826•Physical Review Research•Sep 1, 2025•1 citation

Matrix product operators for sequence-to-sequence learning

Chu Guo, Zhanming Jie, Wei Lu +1 more

The method of choice to study one-dimensional strongly interacting many-body quantum systems is based on matrix product states and operators. Such a method allows one to explore the most relevant and numerically manageable portion of an exponentially large space. It also allows one to accurately describe correlations between distant parts of a system, an important ingredient to account for the context in machine learning tasks. Here we introduce a machine learning model in which matrix product operators are trained to implement sequence-to-sequence prediction, i.e., given a sequence at a time step, it allows one to predict the next sequence. We then apply our algorithm to cellular automata (for which we show exact analytical solutions in terms of matrix product operators) and to nonlinear coupled maps. We show advantages of the proposed algorithm when compared to conditional random fields and a bidirectional, long, short-term-memory neural network. To highlight the flexibility of the algorithm, we also show that it can readily perform classification tasks.

arXiv:1803.10908•Physical review. E•Oct 5, 2018•48 citations

Speeding up quantum dissipative dynamics of open systems with kernel methods

Arif Ullah, Pavlo O. Dral

The future forecasting ability of machine learning (ML) makes ML a promising tool for predicting long-time quantum dissipative dynamics of open systems. In this Article, we employ nonparametric machine learning algorithm (kernel ridge regression as a representative of the kernel methods) to study the quantum dissipative dynamics of the widely-used spin-boson model. Our ML model takes short-time dynamics as an input and is used for fast propagation of the long-time dynamics, greatly reducing the computational effort in comparison with the traditional approaches. Presented results show that the ML model performs well in both symmetric and asymmetric spin-boson models. Our approach is not limited to spin-boson model and can be extended to complex systems.

•Sep 27, 2021•4 citations
Determining the dynamics of the expectation values for operators acting on a quantum many-body (QMB) system is a challenging task. Matrix product states (MPS) have traditionally been the "go-to" models for these systems because calculating expectation values in this representation can be done with relative simplicity and high accuracy. However, such calculations can become computationally costly when extended to long times. Here, we present a solution for efficiently extending the computation of expectation values to long time intervals. We utilize a multi-layer perceptron (MLP) model as a tool for regression on MPS expectation values calculated within the regime of short time intervals. With this model, the computational cost of generating long-time dynamics is significantly reduced, while maintaining a high accuracy. These results are demonstrated with operators relevant to quantum spin models in one spatial dimension.
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.
Out-of-equilibrium dynamics of non-integrable Hamiltonian many-body quantum systems are characterized by highly entangled wave functions. Near-maximal entanglement arises in systems exhibiting thermalization or pre-thermalization, where the system converges to a steady state with a fixed energy density. Classical simulation of the time dependence of such wave functions requires exponential resources. However, typical computations aim to estimate expectation values of local operators and correlation functions to some expected precision. For thermalizing systems at sufficiently high energy densities, such computations can be done without storing the full wave function by instead simulating the evolution of the local operator, which requires significantly fewer resources. Nonetheless, constructing such resource-efficient classical algorithms remains a challenge for intermediate energy densities, where simulating both the wave function and operator evolution is costly. In this paper, we propose a heuristic approach to accelerate the convergence of Matrix Product State (MPS) simulations of expectation values, applicable across a broad range of energy densities. We estimate the desired observables by rescaling the MPS results at low bond dimensions with a factor that depends on the fidelity of the MPS wave function. Using this technique, we simulated the dynamics of the two-dimensional Transverse-Field Ising Model (TFIM) on a 7×87\times87×8 grid with periodic boundary conditions, using a maximum bond dimension of χ=4096χ= 4096χ=4096 on a single A100 GPU, as well as the dynamics of the two-dimensional XY model on grids of size up to 9×99\times99×9. We compare our TFIM results to similar simulations on a digital quantum processor [R. Haghshenas et al., Nature 653, 56 (2026)], demonstrating excellent agreement and confirming the predictive power of our method.
Machine learning (ML) has been used to optimize the matrix product state (MPS) ansatz for the wavefunction of strongly correlated systems. The ML optimization of MPS has been tested for the Heisenberg Hamiltonian on one-dimensional and ladder lattices, which correspond to conjugated molecular systems. The input descriptors and output for the supervised ML are lattice configurations and configuration interaction coefficients, respectively. Efficient learning can be achieved from data over the full Hilbert space via exact diagonalization or full configuration interaction, as well as over a much smaller sub-space via Monte Carlo Configuration Interaction. We show that this circumvents the need to calculate energy and operator expectation values and is therefore a computationally efficient alternative to variational optimization.
Matrix-product states (MPS) have proven to be a versatile ansatz for modeling quantum many-body physics. For many applications, and particularly in one-dimension, they capture relevant quantum correlations in many-body wave functions while remaining tractable (polynomial scaling) to store and manipulate on a classical computer. This has motivated researchers to also apply the MPS ansatz to machine learning (ML) problems where capturing complex correlations in datasets is also a key requirement. Here, for the first time, we develop an MPS-based algorithm, MPSTime, for learning a joint probability distribution underlying a time-series dataset, and show how it can be used to tackle important time-series ML problems, including classification and imputation. MPSTime can efficiently learn complicated time-series probability distributions directly from data, requires only moderate maximum MPS bond dimension χ max (with values for our applications ranging between χ max = 20 − 160 ), and can be trained for both classification and imputation tasks under a single logarithmic loss function. Using synthetic and publicly available real-world datasets—spanning applications in medicine, energy, and astronomy—we demonstrate performance competitive with state-of-the-art ML approaches, but with the key advantage of encoding the full joint probability distribution learned from the data, which is useful for analyzing and interpreting its underlying structure. This manuscript is supplemented with the release of a publicly available code package that implements our approach, and can be used to reproduce all presented results. The effectiveness of the MPS-based ansatz for capturing complex correlation structures in time-series data makes it a powerful foundation for tackling challenging time-series analysis problems across science, industry, and medicine.
The method of choice to study one-dimensional strongly interacting many-body quantum systems is based on matrix product states and operators. Such a method allows one to explore the most relevant and numerically manageable portion of an exponentially large space. It also allows one to accurately describe correlations between distant parts of a system, an important ingredient to account for the context in machine learning tasks. Here we introduce a machine learning model in which matrix product operators are trained to implement sequence-to-sequence prediction, i.e., given a sequence at a time step, it allows one to predict the next sequence. We then apply our algorithm to cellular automata (for which we show exact analytical solutions in terms of matrix product operators) and to nonlinear coupled maps. We show advantages of the proposed algorithm when compared to conditional random fields and a bidirectional, long, short-term-memory neural network. To highlight the flexibility of the algorithm, we also show that it can readily perform classification tasks.
The future forecasting ability of machine learning (ML) makes ML a promising tool for predicting long-time quantum dissipative dynamics of open systems. In this Article, we employ nonparametric machine learning algorithm (kernel ridge regression as a representative of the kernel methods) to study the quantum dissipative dynamics of the widely-used spin-boson model. Our ML model takes short-time dynamics as an input and is used for fast propagation of the long-time dynamics, greatly reducing the computational effort in comparison with the traditional approaches. Presented results show that the ML model performs well in both symmetric and asymmetric spin-boson models. Our approach is not limited to spin-boson model and can be extended to complex systems.