Publications

Order by: publication date number of citations

• Codebase release 2.0 for EERAD3

  Benjamin Campillo Aveleira, Aude Gehrmann-De Ridder, Thomas Gehrmann, Nigel Glover, Gudrun Heinrich, Christian T. Preuss

  SciPost Phys. Codebases 59-r2.0 (2025) · published 22 October 2025 | Toggle abstract · src

  We present a major update of the publicly available EERAD3 package to calculate perturbative corrections in the strong coupling in hadronic Higgs and $Z$-boson decays. We describe the theoretical framework underlying the numerical implementation and provide a guide to the usage of the program.

  1 citation

• EERAD3 version 2: QCD corrections in hadronic colour-singlet decays

  Benjamin Campillo Aveleira, Aude Gehrmann-De Ridder, Thomas Gehrmann, Nigel Glover, Gudrun Heinrich, Christian T. Preuss

  SciPost Phys. Codebases 59 (2025) · published 22 October 2025 | Toggle abstract · pdf

  We present a major update of the publicly available EERAD3 package to calculate perturbative corrections in the strong coupling in hadronic Higgs and $Z$-boson decays. We describe the theoretical framework underlying the numerical implementation and provide a guide to the usage of the program.

  1 citation

• Codebase release 1.0 for evortran

  Thomas Biekötter

  SciPost Phys. Codebases 64-r1.0 (2026) · published 27 January 2026 | Toggle abstract · src

  evortran is a modern Fortran library designed for high-performance genetic algorithms and evolutionary optimization. evortran can be used to tackle a wide range of problems in high-energy physics and beyond, such as derivative-free parameter optimization, complex search taks, parameter scans and fitting experimental data under the presence of instrumental noise. The library is built as an fpm package with flexibility and efficiency in mind, while also offering a simple installation process, user interface and integration into existing Fortran (or Python) programs. evortran offers a variety of selection, crossover, mutation and elitism strategies, with which users can tailor an evolutionary algorithm to their specific needs. evortran supports different abstraction levels: from operating directly on individuals and populations, to running full evolutionary cycles, and even enabling migration between independently evolving populations to enhance convergence and maintain diversity. In this paper, we present the functionality of the evortran library, demonstrate its capabilities with example benchmark applications, and compare its performance with existing genetic algorithm frameworks. As physics-motivated applications, we use evortran to confront extended Higgs sectors with LHC data and to reconstruct gravitational wave spectra and the underlying physical parameters from LISA mock data, demonstrating its effectiveness in realistic, data-driven scenarios.

  1 citation

• Codebase release r1.4 for CoVVVR

  Prasanth Shyamsundar, Jacob L. Scott, Stephen Mrenna, Konstantin T. Matchev, Kyoungchul Kong

  SciPost Phys. Codebases 28-r1.4 (2024) · published 4 March 2024 | Toggle abstract · src

  Monte Carlo (MC) integration is an important calculational technique in the physical sciences. Practical considerations require that the calculations are performed as accurately as possible for a given set of computational resources. To improve the accuracy of MC integration, a number of useful variance reduction algorithms have been developed, including importance sampling and control variates. In this work, we demonstrate how these two methods can be applied simultaneously, thus combining their benefits. We provide a python wrapper, named CoVVVR, which implements our approach in the VEGAS program. The improvements are quantified with several benchmark examples from the literature.

  1 citation

• Codebase release 1.3 for SymTensor

  Yang Gao, Phillip Helms, Garnet Kin-Lic Chan, Edgar Solomonik

  SciPost Phys. Codebases 10-r1.3 (2023) · published 24 February 2023 | Toggle abstract · src

  Tensor contractions are ubiquitous in computational chemistry and physics, where tensors generally represent states or operators and contractions express the algebra of these quantities. In this context, the states and operators often preserve physical conservation laws, which are manifested as group symmetries in the tensors. These group symmetries imply that each tensor has block sparsity and can be stored in a reduced form. For nontrivial contractions, the memory footprint and cost are lowered, respectively, by a linear and a quadratic factor in the number of symmetry sectors. State-of-the-art tensor contraction software libraries exploit this opportunity by iterating over blocks or using general block-sparse tensor representations. Both approaches entail overhead in performance and code complexity. With intuition aided by tensor diagrams, we present a technique, irreducible representation alignment, which enables efficient handling of Abelian group symmetries via only dense tensors, by using contraction-specific reduced forms. This technique yields a general algorithm for arbitrary group symmetric contractions, which we implement in Python and apply to a variety of representative contractions from quantum chemistry and tensor network methods. As a consequence of relying on only dense tensor contractions, we can easily make use of efficient batched matrix multiplication via Intel's MKL and distributed tensor contraction via the Cyclops library, achieving good efficiency and parallel scalability on up to 4096 Knights Landing cores of a supercomputer.

  1 citation

• Making digital objects FAIR in high energy physics: An implementation for Universal FeynRules Output (UFO) models

  Mark S. Neubauer, Avik Roy, Zijun Wang

  SciPost Phys. Codebases 13 (2023) · published 9 June 2023 | Toggle abstract · pdf

  Research in the data-intensive discipline of high energy physics (HEP) often relies on domain-specific digital contents. Reproducibility of research relies on proper preservation of these digital objects. This paper reflects on the interpretation of principles of Findability, Accessibility, Interoperability, and Reusability (FAIR) in such context and demonstrates its implementation by describing the development of an end-to-end support infrastructure for preserving and accessing Universal FeynRules Output (UFO) models guided by the FAIR principles. UFO models are custom-made python libraries used by the HEP community for Monte Carlo simulation of collider physics events. Our framework provides simple but robust tools to preserve and access the UFO models and corresponding metadata in accordance with the FAIR principles.

  1 citation

• Codebase release 0.24 for ITransverse.jl

  Stefano Carignano

  SciPost Phys. Codebases 63-r0.24 (2026) · published 9 January 2026 | Toggle abstract · src

  Transverse contraction methods are extremely promising tools for the efficient contraction of tensor networks associated with the time evolution of quantum many-body systems, allowing in some cases to circumvent the entanglement barrier that would normally prevent the study of quantum dynamics with classical resources. We present here the ITransverse.jl package, written in Julia and based on ITensors.jl, containing several of these high-level algorithms, including novel prescriptions for efficient truncations of temporal matrix product states.

  1 citation

• Variance reduction via simultaneous importance sampling and control variates techniques using vegas

  Prasanth Shyamsundar, Jacob L. Scott, Stephen Mrenna, Konstantin T. Matchev, Kyoungchul Kong

  SciPost Phys. Codebases 28 (2024) · published 4 March 2024 | Toggle abstract · pdf

  Monte Carlo (MC) integration is an important calculational technique in the physical sciences. Practical considerations require that the calculations are performed as accurately as possible for a given set of computational resources. To improve the accuracy of MC integration, a number of useful variance reduction algorithms have been developed, including importance sampling and control variates. In this work, we demonstrate how these two methods can be applied simultaneously, thus combining their benefits. We provide a python wrapper, named CoVVVR, which implements our approach in the VEGAS program. The improvements are quantified with several benchmark examples from the literature.

  1 citation

• Codebase release 1.0 for kdotpy

  Wouter Beugeling, Florian Bayer, Christian Berger, Jan Böttcher, Leonid Bovkun, Christopher Fuchs, Maximilian Hofer, Saquib Shamim, Moritz Siebert, Li-Xian Wang, Ewelina M. Hankiewicz, Tobias Kießling, Hartmut Buhmann, Laurens W. Molenkamp

  SciPost Phys. Codebases 47-r1.0 (2025) · published 28 January 2025 | Toggle abstract · src

  The software project kdotpy provides a Python application for simulating electronic band structures of semiconductor devices with k·p theory on a lattice. The application implements the widely used Kane model, capable of reliable predictions of transport and optical properties for a large variety of topological and non-topological materials with a zincblende crystal structure. The application automates the tedious steps of simulating band structures. The user inputs the relevant physical parameters on the command line, for example materials and dimensions of the device, magnetic field, and temperature. The program constructs the appropriate matrix Hamiltonian on a discretized lattice of spatial coordinates and diagonalizes it. The physical observables are extracted from the eigenvalues and eigenvectors and saved as output. The program is highly customizable with a large set of configuration options and material parameters.

  1 citation

• Codebase release 0.2 for Pychastic

  Radost Waszkiewicz, Maciej Bartczak, Kamil Kolasa, Maciej Lisicki

  SciPost Phys. Codebases 11-r0.2 (2023) · published 3 April 2023 | Toggle abstract · src

  In the last decade, Python-powered physics simulations ecosystem has been growing steadily, allowing greater interoperability, and becoming an important tool in numerical exploration of physical phenomena, particularly in soft matter systems. Driven by the need for fast and precise numerical integration in colloidal dynamics, here we formulate the problem of Brownian Dynamics (BD) in a mathematically consistent formalism of the Itō calculus, and develop a Python package to assist numerical computations. We show that, thanks to the automatic differentiation packages, the classical truncated Taylor-Itō integrators can be implemented without the burden of computing the derivatives of the coefficient functions beforehand. Furthermore, we show how to circumvent the difficulties of BD simulations such as calculations of the divergence of the mobility tensor in the diffusion equation and discontinuous trajectories encountered when working with dynamics on $S^2$ and $SO(3)$. The resulting Python package, Pychastic, is capable of performing BD simulations including hydrodynamic interactions at speeds comparable to dedicated implementations in lower-level programming languages, but with a much simpler end-user interface.

  1 citation