Publications

Order by: publication date number of citations

NuHepMC: A standardized event record format for neutrino event generators

Steven Gardiner, Joshua Isaacson, Luke Pickering

SciPost Phys. Codebases 57 (2025) · published 22 August 2025 | · pdf

Simulations of neutrino interactions are playing an increasingly important role in the pursuit of high-priority measurements for the field of particle physics. A significant technical barrier for efficient development of these simulations is the lack of a standard data format for representing individual neutrino scattering events. We propose and define such a universal format, named NuHepMC, as a common standard for the output of neutrino event generators. The NuHepMC format uses data structures and concepts from the HepMC3 event record library adopted by other subfields of high-energy physics. These are supplemented with an original set of conventions for generically representing neutrino interaction physics within the HepMC3 infrastructure.

2 citations
Codebase release 1.0 for NuHepMC

Steven Gardiner, Joshua Isaacson, Luke Pickering

SciPost Phys. Codebases 57-r1.0 (2025) · published 22 August 2025 | · src

Simulations of neutrino interactions are playing an increasingly important role in the pursuit of high-priority measurements for the field of particle physics. A significant technical barrier for efficient development of these simulations is the lack of a standard data format for representing individual neutrino scattering events. We propose and define such a universal format, named NuHepMC, as a common standard for the output of neutrino event generators. The NuHepMC format uses data structures and concepts from the HepMC3 event record library adopted by other subfields of high-energy physics. These are supplemented with an original set of conventions for generically representing neutrino interaction physics within the HepMC3 infrastructure.

1 citation
Python-JAX-based fast Stokesian dynamics

Kim William Torre, Raoul D. Schram, Joost de Graaf

SciPost Phys. Codebases 56 (2025) · published 30 June 2025 | · pdf

Stokesian Dynamics (SD) is a powerful computational framework for simulating the motion of particles in a viscous Newtonian fluid under Stokes-flow conditions. Traditional SD implementations can be computationally expensive as they rely on the inversion of large mobility matrices to determine hydrodynamic interactions. Recently, however, the simulation of thermalized systems with large numbers of particles has become feasible [Fiore and Swan, J. Fluid Mech. 878, 544 (2019)]. Their "fast Stokesian dynamics" (FSD) method leverages a saddle-point formulation to ensure overall scaling of the algorithm that is linear in the number of particles $\mathcal{O}(N)$; performance relies on dedicated graphics-processing-unit computing. Here, we present a different route toward implementing FSD, which instead leverages the Just-in-Time (JIT) compilation capabilities of Google JAX. We refer to this implementation as JFSD and perform benchmarks on it to verify that it has the right scaling and is sufficiently fast by the standards of modern computational physics. In addition, we provide a series of physical test cases that help ensure accuracy and robustness, as the code undergoes further development. Thus, JFSD is ready to facilitate the study of hydrodynamic effects in particle suspensions across the domains of soft, active, and granular matter.

2 citations
Codebase release 0.2 for JFSD

Kim William Torre, Raoul D. Schram, Joost de Graaf

SciPost Phys. Codebases 56-r0.2 (2025) · published 30 June 2025 | · src

Stokesian Dynamics (SD) is a powerful computational framework for simulating the motion of particles in a viscous Newtonian fluid under Stokes-flow conditions. Traditional SD implementations can be computationally expensive as they rely on the inversion of large mobility matrices to determine hydrodynamic interactions. Recently, however, the simulation of thermalized systems with large numbers of particles has become feasible [Fiore and Swan, J. Fluid Mech. 878, 544 (2019)]. Their "fast Stokesian dynamics" (FSD) method leverages a saddle-point formulation to ensure overall scaling of the algorithm that is linear in the number of particles $\mathcal{O}(N)$; performance relies on dedicated graphics-processing-unit computing. Here, we present a different route toward implementing FSD, which instead leverages the Just-in-Time (JIT) compilation capabilities of Google JAX. We refer to this implementation as JFSD and perform benchmarks on it to verify that it has the right scaling and is sufficiently fast by the standards of modern computational physics. In addition, we provide a series of physical test cases that help ensure accuracy and robustness, as the code undergoes further development. Thus, JFSD is ready to facilitate the study of hydrodynamic effects in particle suspensions across the domains of soft, active, and granular matter.

1 citation
Codebase release 1.0 for Kolya

Matteo Fael, Ilija S. Milutin, K. Keri Vos

SciPost Phys. Codebases 55-r1.0 (2025) · published 25 March 2025 | · src

We introduce the code kolya, an open-source tool for phenomenological analyses of inclusive semileptonic $B\to X_c l\bar \nu_l$ decays. It contains a library to compute predictions for the total rate and various kinematic moments within the framework of the heavy quark expansion, utilizing the so-called kinetic scheme. The library currently includes power corrections up to $1/m_b^5$. All available QCD perturbative corrections are implemented via interpolation grids for fast numerical evaluation. We also include effects from new physics parameterized as Wilson coefficients of dimension-six operators in the weak effective theory below the electroweak scale. The library is interfaced to CRunDec for easy evaluation of the quark masses and strong coupling constant at different renormalization scales. The library is developed in Python and does not require compilation. The code is flexible and can be extended to other kinds of inclusive decays such as $B$ meson lifetimes, $B \to X_u l\bar \nu_l$ and $D$ meson decays.

1 citation
Kolya: An open-source package for inclusive semileptonic B decays

Matteo Fael, Ilija S. Milutin, K. Keri Vos

SciPost Phys. Codebases 55 (2025) · published 25 March 2025 | · pdf

We introduce the code kolya, an open-source tool for phenomenological analyses of inclusive semileptonic $B\to X_c l\bar \nu_l$ decays. It contains a library to compute predictions for the total rate and various kinematic moments within the framework of the heavy quark expansion, utilizing the so-called kinetic scheme. The library currently includes power corrections up to $1/m_b^5$. All available QCD perturbative corrections are implemented via interpolation grids for fast numerical evaluation. We also include effects from new physics parameterized as Wilson coefficients of dimension-six operators in the weak effective theory below the electroweak scale. The library is interfaced to CRunDec for easy evaluation of the quark masses and strong coupling constant at different renormalization scales. The library is developed in Python and does not require compilation. The code is flexible and can be extended to other kinds of inclusive decays such as $B$ meson lifetimes, $B \to X_u l\bar \nu_l$ and $D$ meson decays.

1 citation
Quantum many-body simulations with PauliStrings.jl

Nicolas Loizeau, J. Clayton Peacock, Dries Sels

SciPost Phys. Codebases 54 (2025) · published 24 March 2025 | · pdf

We present the Julia package PauliStrings.jl for quantum many-body simulations, which performs fast operations on the Pauli group by encoding Pauli strings in binary. All of the Pauli string algebra is encoded into low-level logic operations on integers, and is made efficient by various truncation methods which allow for systematic extrapolation of the results. We illustrate the effectiveness of our package by (i) performing Heisenberg time evolution through direct numerical integration and (ii) by constructing a Liouvillian Krylov space. We benchmark the results against tensor network methods, and we find our package performs favorably. In addition, we show that this representation allows for easy encoding of any geometry. We present results for chaotic and integrable spin systems in 1D as well as some examples in 2D. Currently, the main limitations are the inefficiency of representing non-trivial pure states (or other low-rank operators), as well as the need to introduce dissipation to probe long-time dynamics.

6 citations
Codebase release 1.5 for PauliStrings.jl

Nicolas Loizeau, J. Clayton Peacock, Dries Sels

SciPost Phys. Codebases 54-r1.5 (2025) · published 24 March 2025 | · src

We present the Julia package PauliStrings.jl for quantum many-body simulations, which performs fast operations on the Pauli group by encoding Pauli strings in binary. All of the Pauli string algebra is encoded into low-level logic operations on integers, and is made efficient by various truncation methods which allow for systematic extrapolation of the results. We illustrate the effectiveness of our package by (i) performing Heisenberg time evolution through direct numerical integration and (ii) by constructing a Liouvillian Krylov space. We benchmark the results against tensor network methods, and we find our package performs favorably. In addition, we show that this representation allows for easy encoding of any geometry. We present results for chaotic and integrable spin systems in 1D as well as some examples in 2D. Currently, the main limitations are the inefficiency of representing non-trivial pure states (or other low-rank operators), as well as the need to introduce dissipation to probe long-time dynamics.

4 citations
The Cytnx library for tensor networks

Kai-Hsin Wu, Chang-Teng Lin, Ke Hsu, Hao-Ti Hung, Manuel Schneider, Chia-Min Chung, Ying-Jer Kao, Pochung Chen

SciPost Phys. Codebases 53 (2025) · published 13 March 2025 | · pdf

We introduce a tensor network library designed for classical and quantum physics simulations called Cytnx (pronounced as sci-tens). This library provides an almost identical interface and syntax for both C++ and Python, allowing users to effortlessly switch between the two languages. Aiming at a quick learning process for new users of tensor network algorithms, the interfaces resemble the popular Python scientific libraries like NumPy, Scipy, and PyTorch. Not only multiple global Abelian symmetries can be easily defined and implemented, Cytnx also provides a new tool called Network that allows users to store large tensor networks and perform tensor network contractions in an optimal order automatically. With the integration of cuQuantum, tensor calculations can also be executed efficiently on GPUs. We present benchmark results for tensor operations on both devices, CPU and GPU. We also discuss features and higher-level interfaces to be added in the future.

1 citation
Codebase release 1.0 for Cytnx

Kai-Hsin Wu, Chang-Teng Lin, Ke Hsu, Hao-Ti Hung, Manuel Schneider, Chia-Min Chung, Ying-Jer Kao, Pochung Chen

SciPost Phys. Codebases 53-r1.0 (2025) · published 13 March 2025 | · src

We introduce a tensor network library designed for classical and quantum physics simulations called Cytnx (pronounced as sci-tens). This library provides an almost identical interface and syntax for both C++ and Python, allowing users to effortlessly switch between the two languages. Aiming at a quick learning process for new users of tensor network algorithms, the interfaces resemble the popular Python scientific libraries like NumPy, Scipy, and PyTorch. Not only multiple global Abelian symmetries can be easily defined and implemented, Cytnx also provides a new tool called Network that allows users to store large tensor networks and perform tensor network contractions in an optimal order automatically. With the integration of cuQuantum, tensor calculations can also be executed efficiently on GPUs. We present benchmark results for tensor operations on both devices, CPU and GPU. We also discuss features and higher-level interfaces to be added in the future.

1 citation

Previous 1 2 3 4 5 6 7 8 9 10 ... 13 Next

Publications

2 citations

1 citation

2 citations

1 citation

1 citation

1 citation

6 citations

4 citations

1 citation

1 citation