Efficient time-evolution of matrix product states using average Hamiltonians

• URL: http://arxiv.org/abs/2602.04955v1
• Date: Wed, 04 Feb 2026 19:00:01 GMT
• Title: Efficient time-evolution of matrix product states using average Hamiltonians
• Authors: Belal Abouraya, Jirawat Saiphet, Fedor Jelezko, Ressa S. Said,
• Abstract summary: We propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians.<n>Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.

Related papers

• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• Fast simulation of fermions with reconfigurable qubits [0.43553942673960666]
  We present a method for faster fermionic simulation with space-time overhead of O(log(N)) in the worst case.<n>This exponential reduction is achieved by using reconfigurable quantum systems with non-local connectivity.<n>We show that the algorithms themselves can be adapted to use only the O(1)-overhead structures.
  arXiv  Detail & Related papers  (2025-09-10T18:01:02Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Large-scale stochastic simulation of open quantum systems [2.2627671295262215]
  We introduce the tensor jump method (TJM), a scalable, embarrassingly parallel algorithm for simulating large-scale open quantum systems.<n>This work represents a significant step forward in the simulation of large-scale open quantum systems.
  arXiv  Detail & Related papers  (2025-01-29T19:00:00Z)
• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment.<n>We find sufficient conditions under which dynamical decoupling works for such systems.<n>Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Scalable Imaginary Time Evolution with Neural Network Quantum States [0.0]
  The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. We introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order descent with Euclidean metric. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases.
  arXiv  Detail & Related papers  (2023-07-28T12:26:43Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Benchmarking a novel efficient numerical method for localized 1D Fermi-Hubbard systems on a quantum simulator [0.0]
  We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system. We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance. We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
  arXiv  Detail & Related papers  (2021-05-13T16:03:11Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Holographic quantum algorithms for simulating correlated spin systems [0.0]
  We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit re-use. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2020-05-06T18:00:01Z)

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.