Related papers: $\texttt{tapir}$: A tool for topologies, amplitude…
We present a collection of tools automating the efficient computation of large sets of theory predictions for high-energy physics. Calculating predictions for different processes often require dedicated programs. These programs, however,…
Linear Programming (LP) is widely applied in industry and is a key component of various other mathematical problem-solving techniques. Recent work introduced an LP compiler translating polynomial-time, polynomial-space algorithms into…
FeynMaster is a multi-tasking software for particle physics studies. By making use of already existing programs (FeynRules, QGRAF, FeynCalc), FeynMaster automatically generates Feynman rules, generates and draws Feynman diagrams, generates…
CompHEP is a package for automatic calculations of elementary particle decay and collision properties in the lowest order of perturbation theory (the tree approximation). The main idea prescribed into the CompHEP is to make available…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
The rigorous solution to the grating diffraction problem is a cornerstone step in many scientific fields and industrial applications ranging from the study of the fundamental properties of metasurfaces to the simulation of photolithography…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…
In this article, we introduce a new technique for precision tuning. This problem consists of finding the least data types for numerical values such that the result of the computation satisfies some accuracy requirement. State of the art…
Transition amplitudes and transition probabilities are relevant to many areas of physics simulation, including the calculation of response properties and correlation functions. These quantities can also be related to solving linear systems…
Accurate structural relaxation is critical for advanced materials design. Traditional approaches built on physics-derived first-principles calculations are computationally expensive, motivating the creation of machine-learning interatomic…
The Fisher information matrix is used widely in astronomy (and presumably other fields) to forecast the precision of future experiments while they are still in the design phase. Although many sources describe the mathematics of the…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…
Both nonzero temperature and chemical potentials break the Lorentz symmetry present in vacuum quantum field theory by singling out the rest frame of the heat bath. This leads to complications in the application of thermal perturbation…
As the new-generation precision experiments such as MOLLER and P2 look for physics beyond Standard Model, it is becoming increasingly important to evaluate the higher-order electroweak radiative corrections to a sub-percent level of…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
Version 2 of 'carlomat', a program for automatic computation of the lowest order cross sections of multiparticle reactions, is described. The substantial modifications with respect to version 1 of the program include: generation of a single…
In the last few years there has been a growing interest towards methods for statistical inference and learning based on computational geometry and, notably, tropical geometry, that is, the study of algebraic varieties over the min-plus…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
PINT is a pure-Python framework for high-precision pulsar timing developed on top of widely used and well-tested Python libraries, supporting both interactive and programmatic data analysis workflows. We present a new frequentist framework…