Publications

Order by: publication date number of citations

• Codebase release 8.3 for PYTHIA

  Christian Bierlich, Smita Chakraborty, Nishita Desai, Leif Gellersen, Ilkka Helenius, Philip Ilten, Leif Lönnblad, Stephen Mrenna, Stefan Prestel, Christian T. Preuss, Torbjörn Sjöstrand, Peter Skands, Marius Utheim, Rob Verheyen

  SciPost Phys. Codebases 8-r8.3 (2022) · published 10 November 2022 | Toggle abstract · src

  This manual describes the Pythia event generator, the most recent version of an evolving physics tool used to answer fundamental questions in particle physics. The program is most often used to generate high-energy-physics collision "events", i.e. sets of particles produced in association with the collision of two incoming high-energy particles, but has several uses beyond that. The guiding philosophy is to produce and re-produce properties of experimentally obtained collisions as accurately as possible. The program includes a wide ranges of reactions within and beyond the Standard Model, and extending to heavy ion physics. Emphasis is put on phenomena where strong interactions play a major role. The manual contains both pedagogical and practical components. All included physics models are described in enough detail to allow the user to obtain a cursory overview of used assumptions and approximations, enabling an informed evaluation of the program output. A number of the most central algorithms are described in enough detail that the main results of the program can be reproduced independently, allowing further development of existing models or the addition of new ones. Finally, a chapter dedicated fully to the user is included towards the end, providing pedagogical examples of standard use cases, and a detailed description of a number of external interfaces. The program code, the online manual, and the latest version of this print manual can be found on the Pythia web page: https://www.pythia.org/.

  1 citation

• Codebase release 1.0 for GRIFFIN

  Lisong Chen, Ayres Freitas

  SciPost Phys. Codebases 18-r1.0 (2023) · published 10 October 2023 | Toggle abstract · src

  This paper describes a modular framework for the description of electroweak scattering and decay processes, including but not limited to Z-resonance physics. The framework consistently combines a complex-pole expansion near an s-channel resonance with a regular fixed-order perturbative description away from the resonance in a manifestly gauge-invariant scheme. Leading vertex correction contributions are encapsulated in form factors that can be predicted or treated as numerical fit parameters. This framework has been implemented in the publicly available object-oriented C++ library GRIFFIN. Version 1.0 of this library provides Standard Model predictions for the IR-subtracted matrix elements for the process $f\bar{f} \to f'\bar{f}'$ with full NNLO and leading higher-order contributions on the Z-resonance, and with NLO corrections off-resonance. The library can straightforwardly be extended to include higher-order corrections, should they become available, or predictions for new physics models. It can be interfaced with Monte-Carlo programs to account for QED and QCD initial-state and final-state radiation.

  1 citation

• Codebase release 3.44 for xSPDE

  Simon Kiesewetter, Ria R. Joseph, Peter D. Drummond

  SciPost Phys. Codebases 17-r3.44 (2023) · published 2 October 2023 | Toggle abstract · src

  The xSPDE toolbox treats stochastic partial and ordinary differential equations, with applications in biology, chemistry, engineering, medicine, physics and quantum technologies. It computes statistical averages, including time-step and/or sampling error estimation. xSPDE can provide higher order convergence, Fourier spectra and probability densities. The toolbox has graphical output and $\chi^{2}$ statistics, as well as weighted, projected, or forward-backward equations. It can generate input-output quantum spectra. All equations may have independent periodic, Dirichlet, and Neumann or Robin boundary conditions in any dimension, for any vector field component, and at either end of any interval.

  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

• Codebase release 0.1 for jVMC

  Markus Schmitt, Moritz Reh

  SciPost Phys. Codebases 2-r0.1 (2022) · published 23 August 2022 | Toggle abstract · src

  The introduction of Neural Quantum States (NQS) has recently given a new twist to variational Monte Carlo (VMC). The ability to systematically reduce the bias of the wave function ansatz renders the approach widely applicable. However, performant implementations are crucial to reach the numerical state of the art. Here, we present a Python codebase that supports arbitrary NQS architectures and model Hamiltonians. Additionally leveraging automatic differentiation, just-in-time compilation to accelerators, and distributed computing, it is designed to facilitate the composition of efficient NQS algorithms.

  1 citation

• Codebase release 1.0 for Worm Algorithm for Bose-Hubbard and XXZ Models

  Nicolas Sadoune, Lode Pollet

  SciPost Phys. Codebases 9-r1.0 (2022) · published 29 November 2022 | Toggle abstract · src

  We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path-integral representation of the partition function. The code can deal with arbitrary lattice structures and assumes spin-exchange terms, or bosonic hopping amplitudes, between nearest-neighbor sites, and local or nearest-neighbor interactions of the density-density type. We explicitly demonstrate the near-linear scaling of the algorithm with respect to the system volume and the inverse temperature and analyze the autocorrelation times in the vicinity of a $U(1)$ second order phase transition. The code is written in such a way that extensions to other lattice models as well as closely-related sign-positive models can be done straightforwardly on top of the provided framework.

  1 citation