Related papers: An investigation into a wavelet accelerated gauge …
We study a systematic improvement of perturbation theory for gauge fields on the lattice; the improvement entails resumming, to all orders in the coupling constant, a dominant subclass of tadpole diagrams. This method, originally proposed…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
Automatic cubatures approximate multidimensional integrals to user-specified error tolerances. For high dimensional problems, it makes sense to fix the sampling density but determine the sample size, $n$, automatically. Bayesian cubature…
Wavelet (Besov) priors are a promising way of reconstructing indirectly measured fields in a regularized manner. We demonstrate how wavelets can be used as a localized basis for reconstructing permeability fields with sharp interfaces from…
We propose a randomized multiplicative weight update (MWU) algorithm for $\ell_{\infty}$ regression that runs in $\widetilde{O}\left(n^{2+1/22.5} \text{poly}(1/\epsilon)\right)$ time when $\omega = 2+o(1)$, improving upon the previous best…
We prove that the generic quantum speedups for brute-force search and counting only hold when the process we apply them to can be efficiently inverted. The algorithms speeding up these problems, amplitude amplification and amplitude…
This work explores the application of the fast assembly and formation strategy from [8, 17] to trimmed bi-variate parameter spaces. Two concepts for the treatment of basis functions cut by the trimming curve are investigated: one employs a…
This work proposes a novel adaptive linearized alternating direction multiplier method (LADMM) to convex optimization, which improves the convergence rate of the LADMM-based algorithm by adjusting step-size iteratively.The innovation of…
Gauge-fixing as a sampling procedure of gauge copies provides a possibility to construct well-defined gauges also beyond perturbation theory. The implementation of such sampling strategies in lattice gauge theory is briefly outlined, and…
After an introduction in which we review the fundamental difficulty in constructing lattice chiral gauge theories, we discuss the analytic and numerical evidence that abelian lattice chiral gauge theories can be non-perturbatively…
In this paper, we present a generic framework that allows accelerating almost arbitrary non-accelerated deterministic and randomized algorithms for smooth convex optimization problems. The main approach of our envelope is the same as in…
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
Achieving faster execution with shorter compilation time can foster further diversity and innovation in neural networks. However, the current paradigm of executing neural networks either relies on hand-optimized libraries, traditional…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
We derive formulas for the Coulomb matrix within the full-potential linearized augmented-plane-wave (FLAPW) method. The Coulomb matrix is a central ingredient in implementations of many-body perturbation theory, such as the Hartree-Fock and…
This paper is concerned with the construction of a fast algorithm for computing the maximum speed of propagation in the Riemann solution for the Euler system of gas dynamics with the co-volume equation of state. The novelty in the algorithm…
In order to increase the measured phase of an atom interferometer and improve its sensitivity, researchers attempt to increase the enclosed space-time area using two methods: creating larger separations between the interferometer arms and…
We present a framework for accelerating a spectrum of machine learning algorithms that require computation of bilinear inverse forms $u^\top A^{-1}u$, where $A$ is a positive definite matrix and $u$ a given vector. Our framework is built on…
The continuous wavelet transform (CWT) is very useful for processing signals with intricate and irregular structures in astrophysics and cosmology. It is crucial to propose precise and fast algorithms for the CWT. In this work, we review…
A new algorithm for fixing the gauge to (direct) maximal center gauge in SU(N) lattice gauge theory is presented. We check how this method works on SU(3) configurations which are vortex-like, and show how these configurations look like when…