Related papers: Block Algorithms for Quark Propagator Calculation
The Kaczmarz algorithm is one of the most popular methods for solving large-scale over-determined linear systems due to its simplicity and computational efficiency. This method can be viewed as a special instance of a more general class of…
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…
We explore the possibility of computing fermionic correlators on the lattice by combining a domain decomposition with a multi-level integration scheme. The quark propagator is expanded in series of terms with a well defined hierarchical…
Global and block Krylov subspace methods are efficient iterative solvers for large sparse linear systems with multiple right-hand sides. However, global or block Lanczos-type solvers often exhibit large oscillations in the residual norms…
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed…
Randomized Kaczmarz methods form a family of linear system solvers which converge by repeatedly projecting their iterates onto randomly sampled equations. While effective in some contexts, such as highly over-determined least squares,…
In this paper, we consider the nonconvex quadratically constrained quadratic programming (QCQP) with one quadratic constraint. By employing the conjugate gradient method, an efficient algorithm is proposed to solve QCQP that exploits the…
We propose a method to improve the quenched approximation. The method, based on the worldline formalism, takes into account effects of quark loops. The idea is useful mostly for AdS/CFT (holographic) calculations. To demonstrate the method…
Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is…
The computational cost required to calculate nuclear correlation functions grows factorially in the number of quarks, making the study of large nuclei inaccessible to ab initio study using lattice QCD at the present time. However, the…
We compute the quark number susceptibilities in two flavor QCD for staggered fermions by adding the chemical potential as a Lagrange multiplier for the point-split number density term. Since lesser number of quark propagators are required…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
A class of averaging block nonlinear Kaczmarz methods is developed for the solution of the nonlinear system of equations. The convergence theory of the proposed method is established under suitable assumptions and the upper bounds of the…
In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present…
This article introduces randomized block Gram-Schmidt process (RBGS) for QR decomposition. RBGS extends the single-vector randomized Gram-Schmidt (RGS) algorithm and inherits its key characteristics such as being more efficient and having…
We report on our progress in computing the excitation spectrum in Lattice QCD. We focus on the isospin 0, 1 and 2 channels using the stochastic LapH algorithm for the quark propagators. For the isospin-0 channel, a new glueball operator…
Randomized iterative algorithms have recently been proposed to solve large-scale linear systems. In this paper, we present a simple randomized extended block Kaczmarz algorithm that exponentially converges in the mean square to the unique…
Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE…
We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based…
We propose a novel algorithm for calculating multi-baryon correlation functions on the lattice. By considering the permutation of quarks (Wick contractions) and color/spinor contractions simultaneously, we construct a unified index list for…