Related papers: Block Algorithms for Quark Propagator Calculation
Computing eigenvalues is a computationally intensive task central to numerous applications in the natural sciences. Toward this end, we investigate the quantum block Krylov subspace projector (QBKSP) algorithm - a multireference quantum…
One of the limitations of recycled GCRO methods is the large amount of computation required to orthogonalize the basis vectors of the newly generated Krylov subspace for the approximate solution when combined with those of the recycle…
The dominant cost of most lattice QCD simulations is the inversion of the Dirac operator required to calculate the force term in the RHMC update. One way to improve this situation is to use multiple pseudofermions, which reduces the size…
We propose a Jacobi-style distributed algorithm to solve convex, quadratically constrained quadratic programs (QCQPs), which arise from a broad range of applications. While small to medium-sized convex QCQPs can be solved efficiently by…
$\bf{Abstract}$: A qubit lattice algorithm (QLA), which consists of a set of interleaved unitary collision-streaming operators, is developed for electromagnetic wave propagation in tensor dielectric media. External potential operators are…
Krylov methods are a key way of solving large sparse linear systems of equations, but suffer from poor strong scalabilty on distributed memory machines. This is due to high synchronization costs from large numbers of collective…
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…
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…
Lattice QCD calculations require significant computational effort, with the dominant fraction of resources typically spent in the numerical inversion of the Dirac operator. One of the simplest methods to solve such large and sparse linear…
Numerical linked-cluster expansions allow one to calculate finite-temperature properties of quantum lattice models directly in the thermodynamic limit through exact solutions of small clusters. However, full diagonalization is often the…
Hierarchical matrices provide a highly memory-efficient way of storing dense linear operators arising, for example, from boundary element methods, particularly when stored in the H^2 format. In such data-sparse representations, iterative…
The Kaczmarz algorithm is a simple iterative scheme for solving consistent linear systems. At each step, the method projects the current iterate onto the solution space of a single constraint. Hence, it requires very low cost per iteration…
Progress in extracting excited-state baryon masses in lattice QCD using large sets of spatially-extended operators is presented. The use of stochastic estimates of all-to-all quark propagators with variance reduction techniques is…
Two field-sparsening methods, namely the sparse-grid method and the random field selection method, are used in this paper for the construction of the 2-point and 3-point correlation functions in lattice QCD. We argue that, due to the high…
The gradient-flow formalism proves to be a useful tool in lattice calculations of quantum chromodynamics. For example, it can be used as a scheme to renormalize composite operators by inverting the short-flow-time expansion of the…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
The quaternion biconjugate gradient (QBiCG) method, as a novel variant of quaternion Lanczos-type methods for solving the non-Hermitian quaternion linear systems, does not yield a minimization property. This means that the method possesses…
It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomogeneous media. A Dyson map points to a unitary field qubit…
The randomized Kaczmarz algorithm is one of the most popular approaches for solving large-scale linear systems due to its simplicity and efficiency. In this paper, we propose two classes of global randomized Kaczmarz methods for solving…
In this talk, we review a QCD factorization based approach to extract parton distribution and correlation functions from lattice QCD calculation of single hadron matrix elements of quark-gluon operators. We argue that although the lattice…