Publications

Order by: publication date number of citations

• jVMC: Versatile and performant variational Monte Carlo leveraging automated differentiation and GPU acceleration

  Markus Schmitt, Moritz Reh

  SciPost Phys. Codebases 2 (2022) · published 23 August 2022 | Toggle abstract · pdf

  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.

  11 citations

• Many-gluon tree amplitudes on modern GPUs: A case study for novel event generators

  Enrico Bothmann, Walter Giele, Stefan Hoeche, Joshua Isaacson, Max Knobbe

  SciPost Phys. Codebases 3 (2022) · published 23 August 2022 | Toggle abstract · pdf

  The compute efficiency of Monte-Carlo event generators for the Large Hadron Collider is expected to become a major bottleneck for simulations in the high-luminosity phase. Aiming at the development of a full-fledged generator for modern GPUs, we study the performance of various recursive strategies to compute multi-gluon tree-level amplitudes. We investigate the scaling of the algorithms on both CPU and GPU hardware. Finally, we provide practical recommendations as well as baseline implementations for the development of future simulation programs. The GPU implementations can be found at: https://www.gitlab.com/ebothmann/blockgen-archive.

  11 citations

• Efficient and scalable path integral Monte Carlo simulations with worm-type updates for Bose-Hubbard and XXZ models

  Nicolas Sadoune, Lode Pollet

  SciPost Phys. Codebases 9 (2022) · published 29 November 2022 | Toggle abstract · pdf

  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.

  11 citations

• SmoQyDQMC.jl: A flexible implementation of determinant quantum Monte Carlo for Hubbard and electron-phonon interactions

  Benjamin Cohen-Stead, Sohan Malkaruge Costa, James Neuhaus, Andy Tanjaroon Ly, Yutan Zhang, Richard Scalettar, Kipton Barros, Steven Johnston

  SciPost Phys. Codebases 29 (2024) · published 28 May 2024 | Toggle abstract · pdf

  We introduce the SmoQyDQMC.jl package, a Julia implementation of the determinant quantum Monte Carlo algorithm. SmoQyDQMC.jl supports generalized tight-binding Hamiltonians with on-site Hubbard and generalized electron-phonon ($e$-ph) interactions, including non-linear $e$-ph coupling and anharmonic lattice potentials. Our implementation uses hybrid Monte Carlo methods with exact forces for sampling the phonon fields, enabling efficient simulation of low-energy phonon branches, including acoustic phonons. The SmoQyDQMC.jl package also uses a flexible scripting interface, allowing users to adapt it to different workflows and interface with other software packages in the Julia ecosystem. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/SmoQyDQMC.jl or installed using the Julia package manager. The online documentation, including examples, can be obtained from our document page at https://smoqysuite.github.io/SmoQyDQMC.jl/stable/.

  11 citations

• A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D

  Lukas Rammelmüller, David Huber, Artem G. Volosniev

  SciPost Phys. Codebases 12 (2023) · published 19 April 2023 | Toggle abstract · pdf

  We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.

  10 citations

• Introduction to the PanScales framework, version 0.1

  Melissa van Beekveld, Mrinal Dasgupta, Basem Kamal El-Menoufi, Silvia Ferrario Ravasio, Keith Hamilton, Jack Helliwell, Alexander Karlberg, Rok Medves, Pier Francesco Monni, Gavin P. Salam, Ludovic Scyboz, Alba Soto-Ontoso, Gregory Soyez, Rob Verheyen

  SciPost Phys. Codebases 31 (2024) · published 25 June 2024 | Toggle abstract · pdf

  In this article, we document version 0.1 of the PANSCALES code for parton shower simulations. With the help of a few examples, we discuss basic usage of the code, including tests of logarithmic accuracy of parton showers. We expose some of the numerical techniques underlying the logarithmic tests and include a description of how users can implement their own showers within the framework. Some of the simpler logarithmic tests can be performed in a few minutes on a modern laptop. As an early step towards phenomenology, we also outline some aspects of a preliminary interface to PYTHIA 8.3, for access to its hard matrix elements and its hadronisation modules.

  10 citations

• Pyqcm: An open-source Python library for quantum cluster methods

  Théo N. Dionne, Alexandre Foley, Moïse Rousseau, David Sénéchal

  SciPost Phys. Codebases 23 (2023) · published 20 December 2023 | Toggle abstract · pdf

  Pyqcm is a Python/C++ library that implements a few quantum cluster methods with an exact diagonalization impurity solver. Quantum cluster methods are used in the study of strongly correlated electrons to provide an approximate solution to Hubbard-like models. The methods covered by this library are Cluster Perturbation Theory (CPT), the Variational Cluster Approach (VCA) and Cellular (or Cluster) Dynamical Mean Field Theory (CDMFT). The impurity solver (the technique used to compute the cluster's interacting Green function) is exact diagonalization from sparse matrices, using the Lanczos algorithm and variants thereof. The core library is written in C++ for performance, but the interface is in Python, for ease of use and inter-operability with the numerical Python ecosystem. The library is distributed under the GPL license.

  9 citations

• YASTN: Yet another symmetric tensor networks; A Python library for Abelian symmetric tensor network calculations

  Marek M. Rams, Gabriela Wójtowicz, Aritra Sinha, Juraj Hasik

  SciPost Phys. Codebases 52 (2025) · published 26 February 2025 | Toggle abstract · pdf

  We present an open-source tensor network Python library for quantum many-body simulations. At its core is an Abelian-symmetric tensor, implemented as a sparse block structure managed by a logical layer on top of a dense multidimensional array backend. This serves as the basis for higher-level tensor network algorithms operating on matrix product states and projected entangled pair states. An appropriate backend, such as PyTorch, gives direct access to automatic differentiation (AD) for cost-function gradient calculations and execution on GPU and other supported accelerators. We show the library performance in simulations with infinite projected entangled-pair states, such as finding the ground states with AD and simulating thermal states of the Hubbard model via imaginary time evolution. For these challenging examples, we identify and quantify sources of the numerical advantage exploited by the symmetric-tensor implementation.

  8 citations

• LinReTraCe: The linear response transport centre

  Matthias Pickem, Emanuele Maggio, Jan M. Tomczak

  SciPost Phys. Codebases 16 (2023) · published 17 July 2023 | Toggle abstract · pdf

  We describe the "Linear Response Transport Centre" (LinReTraCe), a package for the simulation of transport properties of solids. LinReTraCe captures quantum (in)coherence effects beyond semi-classical Boltzmann techniques, while incurring similar numerical costs. The enabling algorithmic innovation is a semi-analytical evaluation of Kubo formulae for resistivities and the coefficients of Hall, Seebeck and Nernst. We detail the program's architecture, its interface and usage with electronic-structure packages such as WIEN2k, VASP, and Wannier90, as well as versatile tight-binding settings.

  7 citations

• pyBumpHunter: A model independent bump hunting tool in Python for high energy physics analyses

  Louis Vaslin, Samuel Calvet, Vincent Barra, Julien Donini

  SciPost Phys. Codebases 15 (2023) · published 14 July 2023 | Toggle abstract · pdf

  The BumpHunter algorithm is widely used in the search for new particles in High Energy Physics analysis. This algorithm offers the advantage of evaluating the local and global p-values of a localized deviation in the observed data without making any hypothesis on the supposed signal. The increasing popularity of the Python programming language motivated the development of a new public implementation of this algorithm in Python, called pyBumpHunter, together with several improvements and additional features. It is the first public implementation of the BumpHunter algorithm to be added to Scikit-HEP. This paper presents in detail the BumpHunter algorithm as well as all the features proposed in this implementation. All these features have been tested in order to demonstrate their behaviour and performance.

  7 citations