Overcoming the entanglement barrier with sampled tensor networks

• URL: http://arxiv.org/abs/2505.09714v2
• Date: Mon, 09 Jun 2025 17:44:30 GMT
• Title: Overcoming the entanglement barrier with sampled tensor networks
• Authors: Stefano Carignano, Guglielmo Lami, Jacopo De Nardis, Luca Tagliacozzo,
• Abstract summary: We develop a new hybrid-Network/Monte-Carlo (TN-MC) algorithm that samples and evaluates expectation values of generic local operators.<n>The accurate contraction of wave function amplitudes is a consequence of the favorable scaling with time.<n>Our results show that, when computing expectation values of local operators, the entanglement barrier in one-dimensional Hamiltonian evolution can be bypassed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid growth of entanglement under unitary time evolution is the primary bottleneck for modern tensor-network techniques--such as Matrix Product States (MPS)--when computing time-dependent expectation values. This {entanglement barrier} restricts classical simulations and, conversely, underpins the quantum advantage anticipated from future devices. Here we show that, for one-dimensional Hamiltonian dynamics, the spatio-temporal tensor network encoding the evolved wave function amplitudes can be contracted efficiently along the left-right (spatial) direction. Exploiting this structure, we develop a hybrid Tensor-Network/Monte-Carlo (TN-MC) algorithm that samples the wave function and evaluates expectation values of generic local operators with computational cost that scales only polynomially in time. The accurate contraction of the wave function amplitudes is a consequence of the favorable scaling with time of the generalised temporal entropies. We find that their real part either saturates or, at most, grows logarithmically with time, revealing new instances of continuous dynamical quantum phase transitions (DQPTs) which we characterize. Our results therefore show that, when computing expectation values of local operators, the entanglement barrier in one-dimensional Hamiltonian evolution can be bypassed with a TN-MC blend.

Related papers

• Langevin Flows for Modeling Neural Latent Dynamics [81.81271685018284]
  We introduce LangevinFlow, a sequential Variational Auto-Encoder where the time evolution of latent variables is governed by the underdamped Langevin equation.<n>Our approach incorporates physical priors -- such as inertia, damping, a learned potential function, and forces -- to represent both autonomous and non-autonomous processes in neural systems.<n>Our method outperforms state-of-the-art baselines on synthetic neural populations generated by a Lorenz attractor.
  arXiv  Detail & Related papers  (2025-07-15T17:57:48Z)
• Continuous-time parametrization of neural quantum states for quantum dynamics [17.826631514127012]
  Neural quantum states are a promising framework for simulating many-body quantum dynamics.<n>We demonstrate accurate time evolution using simply a restricted Boltzmann machine as the instantaneous neural network architecture.
  arXiv  Detail & Related papers  (2025-07-11T09:05:16Z)
• 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)
• Loschmidt echo, emerging dual unitarity and scaling of generalized temporal entropies after quenches to the critical point [0.0]
  We show how the Loschmidt echo of a product state after a quench can be predicted by using conformal field theories.<n>We are also able to predict and confirm an emerging dual-unitarity of the evolution at late times.
  arXiv  Detail & Related papers  (2024-05-23T15:40:37Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Open Quantum System Dynamics from Infinite Tensor Network Contraction [0.0]
  We show that for Gaussian environments highly efficient contraction to matrix product operator (MPO) form can be achieved with infinite MPO evolution methods. We show that for Gaussian environments highly efficient contraction to matrix product operator (MPO) form can be achieved with infinite MPO evolution methods.
  arXiv  Detail & Related papers  (2023-07-04T16:12:03Z)
• Regularized scheme of time evolution tensor network algorithms [0.0]
  Regularized factorization is proposed to simulate time evolution for quantum lattice systems. The resulting compact structure of the propagator indicates a high-order Baker-Campbell-Hausdorff series.
  arXiv  Detail & Related papers  (2022-08-06T03:38:37Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• 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)
• Multi-Temporal Convolutions for Human Action Recognition in Videos [83.43682368129072]
  We present a novel temporal-temporal convolution block that is capable of extracting at multiple resolutions. The proposed blocks are lightweight and can be integrated into any 3D-CNN architecture.
  arXiv  Detail & Related papers  (2020-11-08T10:40:26Z)
• Time-Reversal Symmetric ODE Network [138.02741983098454]
  Time-reversal symmetry is a fundamental property that frequently holds in classical and quantum mechanics. We propose a novel loss function that measures how well our ordinary differential equation (ODE) networks comply with this time-reversal symmetry. We show that, even for systems that do not possess the full time-reversal symmetry, TRS-ODENs can achieve better predictive performances over baselines.
  arXiv  Detail & Related papers  (2020-07-22T12:19:40Z)
• Liquid Time-constant Networks [117.57116214802504]
  We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system's dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations.
  arXiv  Detail & Related papers  (2020-06-08T09:53:35Z)

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.