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

Stochastic Discrete Variable Representation: Tensor Network Eigenstates on General Potential Energy Surfaces

Hannes Hoppe

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

Abstract

Tensor network states such as tree tensor network states (TTNS) or matrix product states (MPS) allow very compact representations of high-dimensional wave functions. Using them efficiently relies on a compact representation of the Hamiltonian, and many methods are limited to the sum-of-products (SOP) form. General potential energy surfaces (PESs) do not have this form. To overcome this issue, a stochastic discrete variable representation (SDVR) is presented. The matrix elements of the potential operator in the node-local basis are estimated stochastically by importance sampling of grid configurations. The estimator of the matrix elements is unbiased, and the PES is only evaluated pointwise. The variance is reduced by representing parts of the potential with a 2-mode representation and only sampling the remainder. Sampling noise biases the eigenvalues. A noise-control scheme mitigates this bias. Final energies are obtained from an unbiased variational Monte Carlo estimator. The method is demonstrated by calculating vibrational states of CH3 (6D) and acetonitrile (12D), as well as the zero-point vibrational energy of uracil (30D). For all three systems, the energies agree with the exact references to sub-wavenumber accuracy.

DOI
10.48550/arxiv.2611.14377

Related papers

Computing vibrational eigenstates with tree tensor network states (TTNS)

Henrik R. Larsson

We present how to compute vibrational eigenstates with tree tensor network states (TTNSs), the underlying ansatz behind the multilayer multiconfiguration time-dependent Hartree (ML-MCTDH) method. The eigenstates are computed with an algorithm that is based on the density matrix renormalization group (DMRG). We apply this to compute the vibrational spectrum of acetonitrile (CH3CN) to high accuracy and compare TTNSs with matrix product states (MPSs), the ansatz behind the DMRG. The presented optimization scheme converges much faster than ML-MCTDH-based optimization. For this particular system, we found no major advantage of the more general TTNS over MPS. We highlight that for both TTNS and MPS, the usage of an adaptive bond dimension significantly reduces the amount of required parameters. We furthermore propose a procedure to find good trees.

arXiv:1909.13831•The Journal of Chemical Physics•Nov 25, 2019•85 citations

Tree Tensor Networks Methods for Efficient Calculation of Molecular Vibrational Spectra

Shuo Sun, Richard M. Milbradt, Stefan Knecht +2 more

We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm$^{-1}$ error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.

physics.chem-phCross-listedarXiv:2512.15875•The Journal of Chemical Physics•Dec 19, 2025•1 citation

Encoding a Many-Body Potential Energy Surface into a Grid-Based Matrix Product Operator

Kentaro Hino, Yuki Kurashige

An efficient algorithm for compressing a given many-body potential energy surface (PES) of molecular systems into a grid-based matrix product operator (MPO) is proposed. The PES is once represented by a full-dimensional or truncated many-body expansion form, which is obtained by ab initio calculations at each grid mesh point, and then all terms in the expansion are compressed and merged into a single MPO while maintaining the bond dimension of the MPO as small as possible. It was shown that the ab initio PES of the H 2 CO was compressed by more than 2 orders of magnitude in the size of the site operators without loss of accuracy. By the use of grid basis, the tensor rank of the site operators of the MPO is reduced from four to three due to the diagonal nature of the position-dependent operators on grid basis, which significantly reduces the computational cost of the tensor contractions required in the real and imaginary time evolution of the matrix product state (MPS) wave functions with the grid-based MPO (Grid-MPO) Hamiltonian. Similar to other grid-based methods, Grid-MPO is easily applicable to any kinds of potentials of molecular systems, such as analytical empirical model potentials expressed by position operators and ab initio potentials, if the values at the grid points are available. Using the Grid-MPO combined with the MPS, we calculated the time correlation function of the Eigen cation H 3 O + ( H 2 O ) 3 to predict the infrared spectrum and compared with the experimental and the previous theoretical studies. The actual scaling with the size of systems was examined for the multidimensional Henon–Heiles Hamiltonian. It was shown that the method is considerably accelerated by the graphic processing unit (GPU) because the sizes of site operators were kept small and all tensors were able to be stored on the VRAM of a GPU.

Journal of Chemical Theory and Computation•Apr 22, 2024•6 citations

Variational Quantum Monte Carlo Simulations with Tensor-Network States

Anders W. Sandvik, Guifré Vidal

We show that the formalism of tensor-network states, such as the matrix-product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of this approach by explicit MPS calculations for the transverse Ising chain with up to N=256 spins at criticality, using periodic boundary conditions and D x D matrices with D up to 48. The computational cost of our scheme formally scales as ND3, whereas standard MPS approaches and the related density matrix renormalization group method scale as ND5 and ND6, respectively, for periodic systems.

arXiv:0708.2232•Physical Review Letters•Nov 29, 2007•174 citations

Unbiased Monte Carlo for the age of tensor networks

Andrew J. Ferris

A new unbiased Monte Carlo technique called Tensor Network Monte Carlo (TNMC) is introduced based on sampling all possible renormalizations (or course-grainings) of tensor networks, in this case matrix-product states. Tensor networks are a natural language for expressing a wide range of discrete physical and statistical problems, such as classical and quantum systems on a lattice at thermal equilibrium. By simultaneously sampling multiple degrees of freedom associated with each bond of the tensor network (and its renormalized form), we can achieve unprecedented low levels of statistical fluctuations which simultaneously parallel the impressive accuracy scaling of tensor networks while avoiding completely the variational bias inherent to those techniques, even with small bond dimensions. The resulting technique is essentially an aggressive multi-sampling technique that can account for the great majority of the partition function in a single sample. The method is quite general and can be combined with a variety of tensor renormalization techniques appropriate to different geometries and dimensionalities.

arXiv:1507.00767•Jul 2, 2015•28 citations

Stochastically Projecting Tensor Networks

Bryan K. Clark, Hitesh J. Changlani

We apply a series of projection techniques on top of tensor networks to compute energies of ground state wave functions with higher accuracy than tensor networks alone with minimal additional cost. We consider both matrix product states as well as tree tensor networks in this work. Building on top of these approaches, we apply fixed-node quantum Monte Carlo, Lanczos steps, and exact projection. We demonstrate these improvements for the triangular lattice Heisenberg model, where we capture up to 57 percent of the remaining energy not captured by the tensor network alone. We conclude by discussing further ways to improve our approach.

arXiv:1404.2296•Apr 8, 2014•10 citations
Tensor network states such as tree tensor network states (TTNS) or matrix product states (MPS) allow very compact representations of high-dimensional wave functions. Using them efficiently relies on a compact representation of the Hamiltonian, and many methods are limited to the sum-of-products (SOP) form. General potential energy surfaces (PESs) do not have this form. To overcome this issue, a stochastic discrete variable representation (SDVR) is presented. The matrix elements of the potential operator in the node-local basis are estimated stochastically by importance sampling of grid configurations. The estimator of the matrix elements is unbiased, and the PES is only evaluated pointwise. The variance is reduced by representing parts of the potential with a 2-mode representation and only sampling the remainder. Sampling noise biases the eigenvalues. A noise-control scheme mitigates this bias. Final energies are obtained from an unbiased variational Monte Carlo estimator. The method is demonstrated by calculating vibrational states of CH3 (6D) and acetonitrile (12D), as well as the zero-point vibrational energy of uracil (30D). For all three systems, the energies agree with the exact references to sub-wavenumber accuracy.
We present how to compute vibrational eigenstates with tree tensor network states (TTNSs), the underlying ansatz behind the multilayer multiconfiguration time-dependent Hartree (ML-MCTDH) method. The eigenstates are computed with an algorithm that is based on the density matrix renormalization group (DMRG). We apply this to compute the vibrational spectrum of acetonitrile (CH3CN) to high accuracy and compare TTNSs with matrix product states (MPSs), the ansatz behind the DMRG. The presented optimization scheme converges much faster than ML-MCTDH-based optimization. For this particular system, we found no major advantage of the more general TTNS over MPS. We highlight that for both TTNS and MPS, the usage of an adaptive bond dimension significantly reduces the amount of required parameters. We furthermore propose a procedure to find good trees.
We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm−1^{-1}−1 error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.
An efficient algorithm for compressing a given many-body potential energy surface (PES) of molecular systems into a grid-based matrix product operator (MPO) is proposed. The PES is once represented by a full-dimensional or truncated many-body expansion form, which is obtained by ab initio calculations at each grid mesh point, and then all terms in the expansion are compressed and merged into a single MPO while maintaining the bond dimension of the MPO as small as possible. It was shown that the ab initio PES of the H 2 CO was compressed by more than 2 orders of magnitude in the size of the site operators without loss of accuracy. By the use of grid basis, the tensor rank of the site operators of the MPO is reduced from four to three due to the diagonal nature of the position-dependent operators on grid basis, which significantly reduces the computational cost of the tensor contractions required in the real and imaginary time evolution of the matrix product state (MPS) wave functions with the grid-based MPO (Grid-MPO) Hamiltonian. Similar to other grid-based methods, Grid-MPO is easily applicable to any kinds of potentials of molecular systems, such as analytical empirical model potentials expressed by position operators and ab initio potentials, if the values at the grid points are available. Using the Grid-MPO combined with the MPS, we calculated the time correlation function of the Eigen cation H 3 O + ( H 2 O ) 3 to predict the infrared spectrum and compared with the experimental and the previous theoretical studies. The actual scaling with the size of systems was examined for the multidimensional Henon–Heiles Hamiltonian. It was shown that the method is considerably accelerated by the graphic processing unit (GPU) because the sizes of site operators were kept small and all tensors were able to be stored on the VRAM of a GPU.
We show that the formalism of tensor-network states, such as the matrix-product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of this approach by explicit MPS calculations for the transverse Ising chain with up to N=256 spins at criticality, using periodic boundary conditions and D x D matrices with D up to 48. The computational cost of our scheme formally scales as ND3, whereas standard MPS approaches and the related density matrix renormalization group method scale as ND5 and ND6, respectively, for periodic systems.
A new unbiased Monte Carlo technique called Tensor Network Monte Carlo (TNMC) is introduced based on sampling all possible renormalizations (or course-grainings) of tensor networks, in this case matrix-product states. Tensor networks are a natural language for expressing a wide range of discrete physical and statistical problems, such as classical and quantum systems on a lattice at thermal equilibrium. By simultaneously sampling multiple degrees of freedom associated with each bond of the tensor network (and its renormalized form), we can achieve unprecedented low levels of statistical fluctuations which simultaneously parallel the impressive accuracy scaling of tensor networks while avoiding completely the variational bias inherent to those techniques, even with small bond dimensions. The resulting technique is essentially an aggressive multi-sampling technique that can account for the great majority of the partition function in a single sample. The method is quite general and can be combined with a variety of tensor renormalization techniques appropriate to different geometries and dimensionalities.
We apply a series of projection techniques on top of tensor networks to compute energies of ground state wave functions with higher accuracy than tensor networks alone with minimal additional cost. We consider both matrix product states as well as tree tensor networks in this work. Building on top of these approaches, we apply fixed-node quantum Monte Carlo, Lanczos steps, and exact projection. We demonstrate these improvements for the triangular lattice Heisenberg model, where we capture up to 57 percent of the remaining energy not captured by the tensor network alone. We conclude by discussing further ways to improve our approach.