Related papers: Krylov Spaces for Truncated Spectrum Methodologies
Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a…
To solve the Kohn-Sham equation within the framework of density functional theory, we develop a scheme to construct numerical atomic orbital (NAO) basis sets by contracting truncated spherical waves (TSWs). The contraction minimizes the…
This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the…
Hamiltonian Truncation Methods are a useful numerical tool to study strongly coupled QFTs. In this work we present a new method to compute the exact corrections, at any order, in the Hamiltonian Truncation approach presented by Rychkov et…
Quantum Krylov subspace diagonalization is a prominent candidate for early fault tolerant quantum simulation of many-body and molecular systems, but so far the focus has been mainly on computing ground-state energies. We go beyond this by…
Thermal Sunyaev-Zeldovich (tSZ) power spectrum is one of the most sensitive methods to constrain cosmological parameters, scaling as the amplitude $\sigma_8^8$. It is determined by the integral over the halo mass function multiplied by the…
Krylov subspace methods are a powerful family of iterative solvers for linear systems of equations, which are commonly used for inverse problems due to their intrinsic regularization properties. Moreover, these methods are naturally suited…
Hamiltonian Truncation (a.k.a. Truncated Spectrum Approach) is an efficient numerical technique to solve strongly coupled QFTs in d=2 spacetime dimensions. Further theoretical developments are needed to increase its accuracy and the range…
We propose an adaptive randomized truncation estimator for Krylov subspace methods that optimizes the trade-off between the solution variance and the computational cost, while remaining unbiased. The estimator solves a constrained…
Implementation of many statistical methods for large, multivariate data sets requires one to solve a linear system that, depending on the method, is of the dimension of the number of observations or each individual data vector. This is…
We show that for both single-Slater-Jastrow and Jastrow geminal power wave functions, the formal cost scaling of Hilbert space variational Monte Carlo can be reduced from fifth to fourth order in the system size, thus bringing it in line…
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…
In this work, we propose a reduced basis method for efficient solution of parametric linear systems. The coefficient matrix is assumed to be a linear matrix-valued function that is symmetric and positive definite for admissible values of…
In the present paper, we propose Krylov-based methods for solving large-scale differential Sylvester matrix equations having a low rank constant term. We present two new approaches for solving such differential matrix equations. The first…
The Truncated conformal space approach (TCSA) is a numerical technique for finding finite size spectrum of Hamiltonians in quantum field theory described as perturbations of conformal field theories. The truncation errors of the method have…
Low-precision computing is essential for efficiently utilizing memory bandwidth and computing cores. While many mixed-precision algorithms have been developed for iterative sparse linear solvers, effectively leveraging half-precision (fp16)…
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies…
We consider the linear least squares problem with linear equality constraints (LSE problem) formulated as $\min_{x\in\mathbb{R}^{n}}\|Ax-b\|_2 \ \mathrm{s.t.} \ Cx = d$. Although there are some classical methods available to solve this…
While there is no lack of efficient Krylov subspace solvers for Hermitian systems, there are few for complex symmetric, skew symmetric, or skew Hermitian systems, which are increasingly important in modern applications including quantum…
Rational Krylov subspaces have become a reference tool in dimension reduction procedures for several application problems. When data matrices are symmetric, a short-term recurrence can be used to generate an associated orthonormal basis. In…