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

Comment on: "Dynamics of disordered quantum systems with two- and three-dimensional tensor networks" arXiv:2503.05693

King, Andrew D., Alberto Nocera, Marek M. Rams, Jacek Dziarmaga, Jack Raymond, Nitin Kaushal, Anders W. Sandvik, Alvarez, Gonzalo, Juan Carrasquilla, Marcel Franz, M. H. S. Amin

Published Mar 25, 2025• 1 citation
arXivHTMLPDF

Abstract

In a recent preprint [1] (arXiv:2503.05693), Tindall et al. presented impressive classical simulations of quantum dynamics using tensor networks. Their methods represent a significant improvement in the classical state of the art, and in some cases show lower errors than recent simulations of quantum dynamics using a quantum annealer [2] (King et al., Science, eado6285, 2025). However, of the simulations in Ref. [2], Ref. [1] did not attempt the most complex lattice geometry, nor reproduce the largest simulations in 3D lattices, nor simulate the longest simulation times, nor simulate the low-precision ensembles in which correlations grow the fastest, nor produce the full-state and fourth-order observables produced by Ref. [2]. Thus this work should not be misinterpreted as having overturned the claim of Ref. [2]: the demonstration of quantum simulations beyond the reach of classical methods. Rather, these classical advances narrow the parameter space in which beyond-classical computation has been demonstrated. In the near future these classical methods can be combined with quantum simulations to help sharpen the boundary between classical and quantum simulability.

DOI
10.48550/arxiv.2504.06283

Related papers

Dynamics of disordered quantum systems with two- and three-dimensional tensor networks

Joseph Tindall, Antonio Francesco Mello, Matthew Fishman +2 more

Large-scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage2 system on a range of lattices. After extensive comparison with existing numerical methods, these experiments were claimed to be beyond the reach of classical computation. Here, we simulated these spin-glass models with lattice-specific tensor networks, using belief propagation (BP) to keep up with the entanglement generated during the time evolution and then extracting expectation values with more sophisticated variants of BP. We found that state-of-the-art accuracies could be achieved with modest computational resources. Moreover, our results are scalable in both two and three dimensions, which we leveraged to verify universal Kibble-Zurek physics on systems involving hundreds of qubits.

arXiv:2503.05693•Science•May 21, 2026•78 citations

Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics

Joseph Vovrosh, Sergi Julià-Farré, Wladislaw Krinitsin +11 more

The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.

quant-pharXiv:2511.19340•Physical Review Research•Nov 25, 2025•12 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations

Comment on "Beyond-classical computation in quantum simulation"

Wladislaw Krinitsin, Nikita Alert, Matteo Rizzi +1 more

A recent article [Science 388, 199-204 (2025)] investigates the applicability of numerical methods and a quantum processor unit in simulating a quantum annealing protocol. One of the findings indicates that Neural Quantum States - a versatile variational ansatz for the many-body wave function based on artificial neural networks - fail to reach the same accuracy as the quantum processor. In this comment we revisit these concerns, demonstrating that NQS can provide competitive results in some of the cases when accounting for the Monte-Carlo noise and large autocorrelation times between samples obtained from the final state.

quant-pharXiv:2607.08811•SciPost Physics Core•Jul 10, 2026•2 citations

Quantum Simulation of Molecular Dynamics with Tensor Networks

Jincheng Zhang

This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.

•Sep 5, 2026•0 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
In a recent preprint [1] (arXiv:2503.05693), Tindall et al. presented impressive classical simulations of quantum dynamics using tensor networks. Their methods represent a significant improvement in the classical state of the art, and in some cases show lower errors than recent simulations of quantum dynamics using a quantum annealer [2] (King et al., Science, eado6285, 2025). However, of the simulations in Ref. [2], Ref. [1] did not attempt the most complex lattice geometry, nor reproduce the largest simulations in 3D lattices, nor simulate the longest simulation times, nor simulate the low-precision ensembles in which correlations grow the fastest, nor produce the full-state and fourth-order observables produced by Ref. [2]. Thus this work should not be misinterpreted as having overturned the claim of Ref. [2]: the demonstration of quantum simulations beyond the reach of classical methods. Rather, these classical advances narrow the parameter space in which beyond-classical computation has been demonstrated. In the near future these classical methods can be combined with quantum simulations to help sharpen the boundary between classical and quantum simulability.
Large-scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage2 system on a range of lattices. After extensive comparison with existing numerical methods, these experiments were claimed to be beyond the reach of classical computation. Here, we simulated these spin-glass models with lattice-specific tensor networks, using belief propagation (BP) to keep up with the entanglement generated during the time evolution and then extracting expectation values with more sophisticated variants of BP. We found that state-of-the-art accuracies could be achieved with modest computational resources. Moreover, our results are scalable in both two and three dimensions, which we leveraged to verify universal Kibble-Zurek physics on systems involving hundreds of qubits.
The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
A recent article [Science 388, 199-204 (2025)] investigates the applicability of numerical methods and a quantum processor unit in simulating a quantum annealing protocol. One of the findings indicates that Neural Quantum States - a versatile variational ansatz for the many-body wave function based on artificial neural networks - fail to reach the same accuracy as the quantum processor. In this comment we revisit these concerns, demonstrating that NQS can provide competitive results in some of the cases when accounting for the Monte-Carlo noise and large autocorrelation times between samples obtained from the final state.
This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.
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.