Related papers: A fast minimal residual solver for overlap fermion…
The paper proposes a new aggregation method, based on the Arnoldi iteration, for computing approximate transient distributions of Markov chains. This aggregation is not partition-based, which means that an aggregate state may represent any…
We report on simulation results with overlap hypercube fermions (overlap HF) - a type of exactly chiral lattice fermions - and their link to chiral perturbation theory. We first sketch the construction of the overlap HF and discuss its high…
We describe an adaptive multigrid algorithm for solving inverses of the domain-wall fermion operator. Our multigrid algorithm uses an adaptive projection of near-null vectors of the domain-wall operator onto coarser four-dimensional…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
We describe an HMC algorithm for dynamical overlap fermions which makes use of their good chiral properties. We test the algorithm in the Schwinger model. Topological sectors are readily changed even in the massless case.
In this paper, we consider a class of nonconvex problems with linear constraints appearing frequently in the area of image processing. We solve this problem by the penalty method and propose the iteratively reweighted alternating…
The action of the overlap-Dirac operator on a vector is typically implemented indirectly through a multi-shift conjugate gradient solver. The compute-time required depends upon the condition number, $\kappa$, of the matrix that is used as…
We consider the sequence acceleration problem for the alternating direction method-of-multipliers (ADMM) applied to a class of equality-constrained problems with strongly convex quadratic objectives, which frequently arise as the Newton…
We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally)…
We test exact and approximate Ginsparg-Wilson fermions with respect to their chiral and scaling behavior in the 2-flavor Schwinger model. We first consider explicit approximate GW fermions in a short range, then we proceed to their chiral…
We establish the weak convergence of inertial Krasnoselskii-Mann iterations towards a common fixed point of a family of quasi-nonexpansive operators, along with estimates for the non-asymptotic rate at which the residuals vanish. Strong and…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
We present simulation results for the 2-flavour Schwinger model with dynamical overlap fermions. In particular we apply the overlap hypercube operator at seven light fermion masses. In each case we collect sizable statistics in the…
Minimally doubled fermions have been proposed as a cost-effective realization of chiral symmetry at non-zero lattice spacing. Using lattice perturbation theory at one loop, we study their renormalization properties. Specifically, we…
Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time…
Matrices whose adjoint is a low rank perturbation of a rational function of the matrix naturally arise when trying to extend the well known Faber-Manteuffel theorem, which provides necessary and sufficient conditions for the existence of a…
This work develops robust diffusion recursive least squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially…
Arnoldi method and conjugate gradient method are important classical iteration methods in solving linear systems and estimating eigenvalues. Their efficiency often affected by the high dimension of the space, where quantum computer can play…
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…
Using the overlap-Dirac operator proposed by Neuberger, we have computed in lattice QCD the one-loop renormalization factors of ten operators which measure the lowest two moments of unpolarized and polarized non-singlet quark distributions.…