相关论文: Direct solution of multiple excitations in a matri…
We improve the convergence of the Lanczos algorithm using the matrix product state representation. As an alternative to the density matrix renormalization group (DMRG), the Lanczos algorithm avoids local minima and can directly find…
The density-matrix renormalization group (DMRG) algorithm can be adapted to the calculation of dynamical correlation functions in various ways which all represent compromises between computational efficiency and physical accuracy. In this…
The method of quantum Lanczos recursion is extended to solve for multiple excitations on the quantum computer. While quantum Lanczos recursion is in principle capable of obtaining excitations, the extension to a block Lanczos routine can…
We present matrix-product state (MPS) based band Lanczos method as solver for quantum cluster methods such as the variational cluster approximation. While a na\"ive implementation of MPS as cluster solver would barely improve its range of…
We review a recent approach for the simulation of many-body interacting systems based on an efficient generalization of the Lanczos method for Quantum Monte Carlo simulations. This technique allows to perform systematic corrections to a…
We propose a generalized Lanczos method to generate the many-body basis states of quantum lattice models using tensor-network states (TNS). The ground-state wave function is represented as a linear superposition composed from a set of TNS…
The theory of a novel bond-order potential, which is based on the block Lanczos algorithm, is presented within an orthogonal tight-binding representation. The block scheme handles automatically the very different character of sigma and pi…
We show that, in certain circumstances, exact excitation energies appear as locally site-independent (or flat) modes if one records the excitation spectrum of the effective Hamiltonian while sweeping through the lattice in the variational…
Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious…
The eigenstates of many-body localized (MBL) Hamiltonians exhibit low entanglement. We adapt the highly successful density-matrix renormalization group method, which is usually used to find modestly entangled ground states of local…
Recent work found that an analysis formalism based on the Lanczos algorithm allows energy levels to be extracted from Euclidean correlation functions with faster ground-state convergence than effective masses, convergent estimators for…
Numerical methods based on matrix product states (MPSs) are currently the de facto standard for calculating the ground-state properties of (quasi-)one-dimensional quantum many-body systems. While the properties of the low-lying excitations…
We show that from the point of view of the generalized pairing Hamiltonian, the atomic nucleus is a system with small entanglement and can thus be described efficiently using a 1D tensor network (matrix-product state) despite the presence…
A key property of many-body localization, the localization of quantum particles in systems with both quenched disorder and interactions, is the area law entanglement of even highly excited eigenstates of many-body localized Hamiltonians.…
We present a new subspace iteration method for computing low-lying eigenpairs (excited states) of high-dimensional quantum many-body Hamiltonians with nearest neighbor interactions on two-dimensional lattices. The method is based on a new…
A useful concept for finding numerically the dominant correlations of a given ground state in an interacting quantum lattice system in an unbiased way is the correlation density matrix. For two disjoint, separated clusters, it is defined to…
This work introduces a method for determining the energy spectrum of lattice quantum chromodynamics (LQCD) by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to…
The density matrix renormalization group is one of the most powerful numerical methods for computing ground-state properties of two-dimensional (2D) quantum lattice systems. Here we show its finite-temperature extensions are also viable for…
The Lanczos algorithm has proven itself to be a valuable matrix eigensolver for problems with large dimensions, up to hundreds of millions or even tens of billions. The computational cost of using any Lanczos algorithm is dominated by the…
We propose a thick-restart block Lanczos method, which is an extension of the thick-restart Lanczos method with the block algorithm, as an eigensolver of the large-scale shell-model calculations. This method has two advantages over the…