Publications

Order by: publication date number of citations

• The ITensor Software Library for Tensor Network Calculations

  Matthew Fishman, Steven R. White, E. Miles Stoudenmire

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

  ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagram notation, which allows users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of tensor network algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block-sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

  221 citations

• A comprehensive guide to the physics and usage of PYTHIA 8.3

  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 (2022) · published 10 November 2022 | Toggle abstract · pdf

  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/.

  140 citations

• Codebase release 0.3 for ITensor

  Matthew Fishman, Steven R. White, E. Miles Stoudenmire

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

  ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagram notation, which allows users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of tensor network algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block-sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

  40 citations

• NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems

  Filippo Vicentini, Damian Hofmann, Attila Szabó, Dian Wu, Christopher Roth, Clemens Giuliani, Gabriel Pescia, Jannes Nys, Vladimir Vargas-Calderón, Nikita Astrakhantsev, Giuseppe Carleo

  SciPost Phys. Codebases 7 (2022) · published 24 August 2022 | Toggle abstract · pdf

  We introduce version 3 of NetKet, the machine learning toolbox for many-body quantum physics. NetKet is built around neural-network quantum states and provides efficient algorithms for their evaluation and optimization. This new version is built on top of JAX, a differentiable programming and accelerated linear algebra framework for the Python programming language. The most significant new feature is the possibility to define arbitrary neural network ansätze in pure Python code using the concise notation of machine-learning frameworks, which allows for just-in-time compilation as well as the implicit generation of gradients thanks to automatic differentiation. NetKet 3 also comes with support for GPU and TPU accelerators, advanced support for discrete symmetry groups, chunking to scale up to thousands of degrees of freedom, drivers for quantum dynamics applications, and improved modularity, allowing users to use only parts of the toolbox as a foundation for their own code.

  31 citations

• The ALF (Algorithms for Lattice Fermions) project release 2.0. Documentation for the auxiliary-field quantum Monte Carlo code

  F. F. Assaad, M. Bercx, F. Goth, A. Götz, J. S. Hofmann, E. Huffman, Z. Liu, F. Parisen Toldin, J. S. E. Portela, J. Schwab

  SciPost Phys. Codebases 1 (2022) · published 22 August 2022 · licensed under CC BY-SA (4.0) | Toggle abstract · pdf

  The Algorithms for Lattice Fermions package provides a general code for the finite-temperature and projective auxiliary-field quantum Monte Carlo algorithm. The code is engineered to be able to simulate any model that can be written in terms of sums of single-body operators, of squares of single-body operators and single-body operators coupled to a bosonic field with given dynamics. The package includes five pre-defined model classes: SU(N) Kondo, SU(N) Hubbard, SU(N) t-V and SU(N) models with long range Coulomb repulsion on honeycomb, square and N-leg lattices, as well as $Z_2$ unconstrained lattice gauge theories coupled to fermionic and $Z_2$ matter. An implementation of the stochastic Maximum Entropy method is also provided. One can download the code from our Git instance at https://git.physik.uni-wuerzburg.de/ALF/ALF/-/tree/ALF-2.0 and sign in to file issues.

  23 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.

  6 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.

  6 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.

  6 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.

  5 citations

• HarmonicBalance.jl: A Julia suite for nonlinear dynamics using harmonic balance

  Jan Košata, Javier del Pino, Toni L. Heugel, Oded Zilberberg

  SciPost Phys. Codebases 6 (2022) · published 24 August 2022 | Toggle abstract · pdf

  HarmonicBalance.jl is a publicly available Julia package designed to simplify and solve systems of periodic time-dependent nonlinear ordinary differential equations. Time dependence of the system parameters is treated with the harmonic balance method, which approximates the system's behaviour as a set of harmonic terms with slowly-varying amplitudes. Under this approximation, the set of all possible steady-state responses follows from the solution of a polynomial system. In HarmonicBalance.jl, we combine harmonic balance with contemporary implementations of symbolic algebra and the homotopy continuation method to numerically determine all steady-state solutions and their associated fluctuation dynamics. For the exploration of involved steady-state topologies, we provide a simple graphical user interface, allowing for arbitrary solution observables and phase diagrams. HarmonicBalance.jl is a free software available at https://github.com/NonlinearOscillations/HarmonicBalance.jl.

  4 citations