Direct solution of multiple excitations in a matrix product state with
block Lanczos
- URL: http://arxiv.org/abs/2109.08181v3
- Date: Wed, 28 Jun 2023 14:32:30 GMT
- Title: Direct solution of multiple excitations in a matrix product state with
block Lanczos
- Authors: Thomas E. Baker, Alexandre Foley, and David S\'en\'echal
- Abstract summary: We introduce the multi-targeted density matrix renormalization group method that acts on a bundled matrix product state, holding many excitations.
A large number of excitations can be obtained at a small bond dimension with highly reliable local observables throughout the chain.
- Score: 62.997667081978825
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Matrix product state methods are known to be efficient for computing ground
states of local, gapped Hamiltonians, particularly in one dimension. We
introduce the multi-targeted density matrix renormalization group method that
acts on a bundled matrix product state, holding many excitations. The use of a
block or banded Lanczos algorithm allows for the simultaneous, variational
optimization of the bundle of excitations. The method is demonstrated on a
Heisenberg model and other cases of interest. A large of number of excitations
can be obtained at a small bond dimension with highly reliable local
observables throughout the chain.
Related papers
- Efficient and systematic calculation of arbitrary observables for the matrix product state excitation ansatz [0.0]
We present a method for calculating expectation values for excitations with a single-particle character in the thermodynamic limit.
We demonstrate the versatility of our method by studying the low-lying excitations in the spin-1 Heisenberg chain and the one-dimensional Hubbard model.
We hope that this technique will foster further advancements with the excitation ansatz.
arXiv Detail & Related papers (2024-08-30T08:59:29Z) - Matrix-product-state-based band-Lanczos solver for quantum cluster
approaches [0.0]
We present a matrix-product state (MPS) based band-Lanczos method as solver for quantum cluster methods.
We show that our approach makes it possible to treat cluster geometries well beyond the reach of exact diagonalization methods.
arXiv Detail & Related papers (2023-10-16T19:59:21Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - Non-Markovian Stochastic Schr\"odinger Equation: Matrix Product State
Approach to the Hierarchy of Pure States [65.25197248984445]
We derive a hierarchy of matrix product states (HOMPS) for non-Markovian dynamics in open finite temperature.
The validity and efficiency of HOMPS is demonstrated for the spin-boson model and long chains where each site is coupled to a structured, strongly non-Markovian environment.
arXiv Detail & Related papers (2021-09-14T01:47:30Z) - Generalized quantum measurements with matrix product states:
Entanglement phase transition and clusterization [58.720142291102135]
We propose a method for studying the time evolution of many-body quantum lattice systems under continuous and site-resolved measurement.
We observe a peculiar phenomenon of measurement-induced particle clusterization that takes place only for frequent moderately strong measurements, but not for strong infrequent measurements.
arXiv Detail & Related papers (2021-04-21T10:36:57Z) - Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one.
We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective.
Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
arXiv Detail & Related papers (2020-12-16T13:01:37Z) - Variational optimization of continuous matrix product states [0.0]
We show how to optimize continuous matrix product states for systems with inhomogeneous external potentials.
We show how both the energy and its backwards derivative can be calculated exactly and at a cost that scales as the cube of the bond dimension.
We illustrate this by finding ground states of interacting bosons in external potentials, and by calculating boundary or Casimir energy corrections of continuous many-body systems.
arXiv Detail & Related papers (2020-06-02T17:35:41Z) - Polynomially filtered exact diagonalization approach to many-body
localization [0.0]
Polynomially filtered exact diagonalization method (POLFED) for large sparse matrices is introduced.
The potential of POLFED is demonstrated examining many-body scaling transition in 1D interacting quantum spin-1/2 chains.
arXiv Detail & Related papers (2020-05-19T15:49:07Z) - Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
Bilinear pooling achieves great success in fine-grained visual recognition (FGVC)
Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features.
We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
arXiv Detail & Related papers (2020-03-30T08:40:35Z) - Tangent-space methods for truncating uniform MPS [0.0]
A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension.
We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states.
arXiv Detail & Related papers (2020-01-31T14:54:50Z)
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.