Related papers: Block Lanczos algorithm for lattice QCD spectrosco…
The Generalized Eigenvalue Problem (GEVP) has been used extensively in the past in order to reliably extract energy levels from time-dependent Euclidean correlators calculated in Lattice QCD. We propose a formulation of the GEVP in…
A novel application of lattice QCD spectral reconstruction is presented, in which euclidean correlation function data in a fixed time range are used to infer values outside the range, enabling a model-independent investigation of the…
Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix…
We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos,…
We study the universal properties of the Lanczos algorithm applied to finite-size many-body quantum systems. Focusing on autocorrelation functions of local operators and on their infinite-time behaviour at finite size, we conjecture that in…
The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve factoring algorithm and its predecessors. We present here a…
We present a GPU implementation of the finite-temperature Lanczos method (FTLM) for Heisenberg spin Hamiltonians that targets workstation hardware rather than distributed-memory clusters. The Hamiltonian action is evaluated matrix-free in a…
We reformulate the Lanczos algorithm for quantum wave function propagation in terms of variational principle. By including some basis states of previous time steps into the variational subspace, the resultant accuracy increases by several…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization. The quantum…
The numerical and computational aspects of the overlap formalism in lattice quantum chromodynamics are extremely demanding due to a matrix-vector product that involves the sign function of the hermitian Wilson matrix. In this paper we…
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.…
Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the…
We consider an autocorrelation function of a quantum mechanical system through the lens of the so-called recursive method, by iteratively evaluating Lanczos coefficients, or solving a system of coupled differential equations in the Mori…
The theory of quantum chromodynamics (QCD) encodes the strong interactions that bind quarks and gluons into nucleons and that bind nucleons into nuclei. Predictive control of QCD would allow nuclear structure and reactions as well as…
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…
Gutzwiller-projected fermionic states can be efficiently implemented within quantum Monte Carlo calculations to define extremely accurate variational wave functions for Heisenberg models on frustrated two-dimensional lattices, not only for…
We calculate the energy levels of a system of neutrinos undergoing collective oscillations as functions of an effective coupling strength and radial distance from the neutrino source using the quantum Lanczos (QLanczos) algorithm…
The present review will focus on recent development of exact-diagonali- zation (ED) methods that use Lanczos algorithm to transform large sparse matrices onto the tridiagonal form. We begin with a review of basic principles of the Lanczos…
The Lanczos method is one of the most powerful and fundamental techniques for solving an extremal symmetric eigenvalue problem. Convergence-based error estimates depend heavily on the eigenvalue gap. In practice, this gap is often…