Related papers: Improving the low-lying spectrum of the overlap ke…
We investigate the Brillouin action in terms of its suitability as a kernel to the overlap procedure, with a view on both heavy and light quark physics. We use the diagonal elements of the Kenney-Laub family of iterations for the sparse…
In this work, multi-step traffic predictions are leveraged to enable multi-period planning in reconfigurable optical networks. The proposed framework aims to achieve spectrum savings by adapting the network to predicted time-varying…
We perform a comparative study of the infrared properties of overlap and staggered fermions in QCD. We observe that the infrared spectrum of the APE/HYP improved staggered Dirac operator develops a four-fold near-degeneracy and is in…
The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalisations in the subspace…
We determine the free field hypercubic Dirac operator which is optimally close to satisfying the Ginsparg-Wilson relation. Inserting this operator into the overlap formula, we show that the analytic locality bound on the resulting overlap…
I apply a recently developed algorithm for reweighting simulations of lattice QCD from one quark mass to another to simulations performed with overlap fermions in the epsilon regime. I test it by computing the condensate from distributions…
Sparse principal component analysis addresses the problem of finding a linear combination of the variables in a given data set with a sparse coefficients vector that maximizes the variability of the data. This model enhances the ability to…
Via a random construction we establish necessary conditions for $L^p(\ell^q)$ inequalities for certain families of operators arising in harmonic analysis. In particular we consider dilates of a convolution kernel with compactly supported…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
The overlap hypercube fermion is a variant of a chirally symmetric lattice fermion, which is endowed with a higher level of locality than the standard overlap fermion. We apply this formulation in quenched QCD simulations with light quarks.…
The index bundle of the Overlap lattice Dirac operator over the orbit space of lattice gauge fields is introduced and studied. Obstructions to the vanishing of gauge anomalies in the Overlap formulation of lattice chiral gauge theory have a…
We introduce a framework to accelerate the convergence of gradient-based methods with online learning. The framework learns to scale the gradient at each iteration through an online learning algorithm and provably accelerates gradient-based…
Domain specific accelerators present new challenges and opportunities for code generation onto novel instruction sets, communication fabrics, and memory architectures. In this paper we introduce an intermediate representation (IR) which…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
We study the spectral problem for the Dirac operator with degenerate boundary conditions and a complex-valued summable potential. Sufficient conditions are found under which the spectrum of the problem under consideration coincides with the…
Advantageous numerical methods for solving the Dirac equations are derived. They are based on different stochastic optimization techniques, namely the Genetic algorithms, the Particle Swarm Optimization and the Simulated Annealing method,…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
The unfolding of a gamma ray spectrum experience many difficulties due to noise in the recorded data, that is based mainly on the change of photon energy due to scattering mechanisms (either in the detector or the medium), the accumulation…
We consider the chance-constrained program (CCP) with random right-hand side under a finite discrete distribution. It is known that the standard mixed integer linear programming (MILP) reformulation of the CCP is generally difficult to…
Quantum dynamical lower bounds for continuous and discrete one-dimensional Dirac operators are established in terms of transfer matrices. Then such results are applied to various models, including the Bernoulli-Dirac one and, in contrast to…