Related papers: Forcer, a FORM program for the parametric reductio…
Transformers have demonstrated remarkable performance in natural language processing and computer vision. However, existing vision Transformers struggle to learn from limited medical data and are unable to generalize on diverse medical…
Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions which focus on policy…
We present an efficient graphical approach to construct projectors for the tensor reduction of multi-loop Feynman integrals with both Lorentz and spinor indices in $D$ dimensions. An ansatz for the projectors is constructed making use of…
Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…
We present a program for the numerical evaluation of scalar integrals and tensor form factors entering the calculation of one-loop amplitudes which supports the use of complex masses in the loop integrals. The program is built on an earlier…
The concept of molecular mechanics force field has been widely accepted nowadays for studying various processes in biomolecular systems. In this paper, we suggest a modification for the standard CHARMM force field that permits simulations…
Beam tracking software for accelerators typically falls into two categories: fast envelope simulations limited to linear beam optics, and slower multiparticle simulations that can model nonlinear effects. To find a middle ground between…
Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during training and inference phases. Given its easy implementation and flexibility, one promising…
Link prediction is a common task on graph-structured data that has seen applications in a variety of domains. Classically, hand-crafted heuristics were used for this task. Heuristic measures are chosen such that they correlate well with the…
Even though the computation of local properties, such as densities or radial distribution functions, remains one of the most standard goals of molecular simulation, it still largely relies on straighforward histogram-based strategies. Here…
To perform any meaningful optimization task, power distribution operators need to know the topology and line impedances of their electric networks. Nevertheless, distribution grids currently lack a comprehensive metering infrastructure.…
We present an efficient method to shorten the analytic integration-by-parts (IBP) reduction coefficients of multi-loop Feynman integrals. For our approach, we develop an improved version of Leinartas' multivariate partial fraction…
This work presents a method to maximize power-efficiency of fixed point multiplier units by decomposing them into sub-components. First, an encoder block converts the operands from a two's complement to a sign magnitude representation,…
Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying…
We study the scalar and tensor integrals associated with the pentabox topology: the class of two-loop box integrals with seven propagators - five in one loop and three in the other. We focus on the case where the external legs are…
Determining the structure of a protein has been a decades-long open question. A protein's three-dimensional structure often poses nontrivial computation costs, when classical simulation algorithms are utilized. Advances in the transformer…
A form compiler takes a high-level description of the weak form of partial differential equations and produces low-level code that carries out the finite element assembly. In this paper we present the Two-Stage Form Compiler (TSFC), a new…
Built around the SMARDDA modules for magnetic field-line tracing [IEEE Tr. Plasma Sc. 42 (2014) 1932], the SMITER code package (SMARDDA for ITER) is a new graphical user interface (GUI) framework for power deposition mapping on tokamak…
We present COMPOSER, a compile-once modular parametric oracle for similarity-encoded effective reduction of electronic-structure operators (e.g., Schrieffer-Wolff-type constructions). Low-rank factorizations compress Hamiltonians and…