Related papers: Exact diagonalization: the Bose-Hubbard model as a…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
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…
These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…
In theory, the Lanczos algorithm generates an orthogonal basis of the corresponding Krylov subspace. However, in finite precision arithmetic, the orthogonality and linear independence of the computed Lanczos vectors is usually lost quickly.…
The algebraic Bethe ansatz is a powerful method to diagonalize transfer-matrices of statistical models derived from solutions of (graded) Yang Baxter equations, connected to fundamental representations of Lie (super-)algebras and their…
Jacobian and Hessian regularization aim to reduce the magnitude of the first and second-order partial derivatives with respect to neural network inputs, and they are predominantly used to ensure the adversarial robustness of image…
Ultracold atoms in optical lattices are versatile testbeds to study and manipulate equilibrium and out-of-equilibrium aspects of quantum many-body systems whose behavior can be described by Hubbard-type Hamiltonians. In this paper, we…
We propose efficient preconditioning algorithms for an eigenvalue problem arising in quantum physics, namely the computation of a few interior eigenvalues and their associated eigenvectors for the largest sparse real and symmetric…
The zero temperature phase diagram of binary boson-fermion mixtures in two-colour superlattices is investigated. The eigenvalue problem associated with the Bose-Fermi-Hubbard Hamiltonian is solved using an exact numerical diagonalization…
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…
We study Krylov complexity of a one-dimensional Bosonic system, the celebrated Bose-Hubbard Model. The Bose-Hubbard Hamiltonian consists of interacting bosons on a lattice, describing ultra-cold atoms. Apart from showing superfluid-Mott…
We present an efficient exact diagonalization scheme for the extended dynamical mean-field theory and apply it to the extended Hubbard model on the square lattice with nonlocal charge-charge interactions. Our solver reproduces the phase…
We consider a fully pseudo-bosonic Swanson model and we show how its Hamiltonian $H$ can be diagonalized. We also deduce the eigensystem of $H^\dagger$, using the general framework and results deduced in the context of pseudo-bosons. We…
Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for…
A Bose-Hubbard Hamiltonian, modeling cold bosons in an optical lattice, is used to simulate the dynamics of interacting open quantum systems as subsystems a larger closed system, avoiding complications like the introduction of baths,…
The widely used large-scale diagonalization method using harmonic oscillator basis functions (an instance of the Rayleigh-Ritz method, also called a spectral method, configuration-interaction method, or ``exact diagonalization'' method) is…
We present first-principle numerical calculations for few particle solutions of the attractive Bose-Hubbard model with periodic boundary conditions. We show that the low-energy many-body states found by numerical diagonalization can be…
Following the general results on the relationships about Backlund transformations (BTs) and exact discretisation given in a previous work [12], we consider the Ablowitz-Ladik hierarchy and a corresponding family of BTs. After discussing the…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…
Biclustering, also known as co-clustering or two-way clustering, simultaneously partitions the rows and columns of a data matrix to reveal submatrices with coherent patterns. Incorporating background knowledge into clustering to enhance…