Tensor-network Monte Carlo approach based on time-evolving block decimation

• URL: http://arxiv.org/abs/2609.12466v1
• Date: Fri, 11 Sep 2026 05:56:37 GMT
• Title: Tensor-network Monte Carlo approach based on time-evolving block decimation
• Abstract summary: We propose a tensor-network Monte Carlo (TNMC) approach for unitary evolution following the compression sequence of the time-evolving block decimation algorithm.<n>In the TNMC approach, the obtained results contain evaluable statistical errors rather than truncation errors.<n>We show that the TNMC approach can estimate accurate expectation values of observables even when the TEBD method with the same bond dimension cannot.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a tensor-network Monte Carlo (TNMC) approach for unitary evolution following the compression sequence of the time-evolving block decimation (TEBD) algorithm. In the TNMC approach, the obtained results contain evaluable statistical errors rather than truncation errors, unlike ordinary singular-value-decomposition-based methods such as the TEBD algorithm. Consequently, one can estimate unbiased expectation values within statistical errors even with a finite bond dimension. Since the sampling scheme is introduced in the simulations of unitary evolution, the proposed Monte Carlo scheme may suffer from a sign problem. We observe that the sign problem can be mitigated by increasing the bond dimension. We apply the proposed TNMC approach to the Hamiltonian and the Floquet dynamics. Numerical experiments show that the TNMC approach can estimate accurate expectation values of observables even when the TEBD method with the same bond dimension cannot. The proposed approach can be a new direction for improving the classical simulatability of unitary evolution.

Related papers

• Time-dependent variational Monte Carlo without bias [0.0]
  Bornal Monte Carlo is a versatile numerical approach to tackle the quantum many-body problem.<n>VMC exhibits a subtle estimation bias leading to inaccuracies.<n>We propose an unbiased variant of time-dependent VMC using self-normalized importance sampling.<n>We also explore an alternative sampling strategy based on active learning via the cross variation (TCI)
  arXiv  Detail & Related papers  (2026-05-05T16:20:02Z)
• Multi-Dimensional Visual Data Recovery: Scale-Aware Tensor Modeling and Accelerated Randomized Computation [51.65236537605077]
  We propose a new type of network compression optimization technique, fully randomized tensor network compression (FCTN)<n>FCTN has significant advantages in correlation characterization and transpositional in algebra, and has notable achievements in multi-dimensional data processing and analysis.<n>We derive efficient algorithms with guarantees to solve the formulated models.
  arXiv  Detail & Related papers  (2026-02-13T14:56:37Z)
• Neural Network Approach to Stochastic Dynamics for Smooth Multimodal Density Estimation [0.0]
  We extent Metropolis-Adjusted Langevin Diffusion algorithm by modelling the Eigenity of precondition matrix as a random matrix.<n>The proposed method provides fully adaptation mechanisms to tune proposal densities to exploits and adapts the geometry of local structures of statistical models.
  arXiv  Detail & Related papers  (2025-03-22T16:17:12Z)
• Scaling of Stochastic Normalizing Flows in $\mathrm{SU}(3)$ lattice gauge theory [44.99833362998488]
  Non-equilibrium Markov Chain Monte Carlo simulations provide a well-understood framework based on Jarzynski's equality to sample from a target probability distribution.<n>Out-of-equilibrium evolutions share the same framework of flow-based approaches and they can be naturally combined into a novel architecture called Normalizing Flows (SNFs)<n>We present the first implementation of SNFs for $mathrmSU(3)$ lattice gauge theory in 4 dimensions, defined by introducing gauge-equivariant layers between out-of-equilibrium Monte Carlo updates.
  arXiv  Detail & Related papers  (2024-11-29T19:01:05Z)
• Leveraging Nested MLMC for Sequential Neural Posterior Estimation with Intractable Likelihoods [0.38233569758620045]
  Methods aim to learn the posterior from adaptively proposed simulations using neural network-based conditional density estimators.<n>The automatic posterior transformation (APT) method proposed by Greenberg et al. performs well and scales to high-level runtime data.<n>In this paper, we reformulate APT as a nested estimation problem.<n>We construct several multi- Monte Carlo (MLMC) estimators for the loss function and its gradients to accommodate different scenarios.
  arXiv  Detail & Related papers  (2024-01-30T06:29:41Z)
• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
  We propose a Monte Carlo PDE solver for training unsupervised neural solvers.<n>We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles.<n>Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-02-10T08:05:19Z)
• Distributed Bayesian Learning of Dynamic States [65.7870637855531]
  The proposed algorithm is a distributed Bayesian filtering task for finite-state hidden Markov models. It can be used for sequential state estimation, as well as for modeling opinion formation over social networks under dynamic environments.
  arXiv  Detail & Related papers  (2022-12-05T19:40:17Z)
• Dynamic Bayesian Network Auxiliary ABC-SMC for Hybrid Model Bayesian Inference to Accelerate Biomanufacturing Process Mechanism Learning and Robust Control [2.727760379582405]
  We present a knowledge graph hybrid model characterizing complex causal interdependencies of underlying bioprocessing mechanisms. It can faithfully capture the important properties, including nonlinear reactions, partially observed state, and nonstationary dynamics. We derive a posterior distribution model uncertainty, which can facilitate mechanism learning and support robust process control.
  arXiv  Detail & Related papers  (2022-05-05T02:54:21Z)
• Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
  Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions. We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions. We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
  arXiv  Detail & Related papers  (2021-02-04T02:21:08Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
  This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. We design a novel structured tensor low-rank norm tailored to MVSC. We show that the proposed method outperforms state-of-the-art methods to a significant extent.
  arXiv  Detail & Related papers  (2020-04-30T11:52:12Z)

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.