Publications

Order by: publication date number of citations

• Codebase release 4.0 for QSpace

  Andreas Weichselbaum

  SciPost Phys. Codebases 40-r4.0 (2024) · published 14 November 2024 | Toggle abstract · src

  This is the documentation for the tensor library QSpace (v4.0) that provides a toolbox to exploit 'quantum symmetry spaces' in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the Abelian symmetries $\mathbb{Z}_n$ and $U(1)$, as well as all non-Abelian symmetries represented by the simple classical Lie algebras: $A_n$, $B_n$, $C_n$, and $D_n$, or respectively, the special unitary group SU($n$), the odd orthogonal group SO($2n+1$), the symplectic group Sp($2n$), and the even orthogonal group SO($2n$). The code (C++ embedded via the MEX interface into Matlab) is available (https://bitbucket.org/qspace4u) under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-Abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly computing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in its operations across all symmetries. At the level of an application, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-Abelian symmetries.

  4 citations

• Codebase release 1.0 for TeNPy

  Johannes Hauschild, Jakob Unfried, Sajant Anand, Bartholomew Andrews, Marcus Bintz, Umberto Borla, Stefan Divic, Markus Drescher, Jan Geiger, Martin Hefel, Kévin Hémery, Wilhelm Kadow, Jack Kemp, Nico Kirchner, Vincent S. Liu, Gunnar Möller, Daniel Parker, Michael Rader, Anton Romen, Samuel Scalet, Leon Schoonderwoerd, Maximilian Schulz, Tomohiro Soejima, Philipp Thoma, Yantao Wu, Philip Zechmann, Ludwig Zweng, Roger S. K. Mong, Michael P. Zaletel, Frank Pollmann

  SciPost Phys. Codebases 41-r1.0 (2024) · published 26 November 2024 | Toggle abstract · src

  TeNPy (short for 'Tensor Network Python') is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package.

  4 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 | Toggle abstract · 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

• Codebase release 1.2 for YASTN

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

  SciPost Phys. Codebases 52-r1.2 (2025) · published 26 February 2025 | Toggle abstract · src

  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.

  4 citations

• Consistent, multidimensional differential histogramming and summary statistics with YODA 2

  Andy Buckley, Louie Corpe, Matthew Filipovich, Christian Gutschow, Nick Rozinsky, Simon Thor, Yoran Yeh, Jamie Yellen

  SciPost Phys. Codebases 45 (2025) · published 16 January 2025 | Toggle abstract · pdf

  Histogramming is often taken for granted, but the power and compactness of partially aggregated, multidimensional summary statistics, and their fundamental connection to differential and integral calculus make them formidable statistical objects, especially when very large data volumes are involved. But expressing these concepts robustly and efficiently in high-dimensional parameter spaces and for large data samples is a highly non-trivial challenge – doubly so if the resulting library is to remain usable by scientists as opposed to software engineers. In this paper we summarise the core principles required for consistent generalised histogramming, and use them to motivate the design principles and implementation mechanics of the re-engineered YODA histogramming library, a key component of physics data–model comparison and statistical interpretation in collider physics.

  4 citations

• SmoQyDEAC.jl: A differential evolution package for the analytic continuation of imaginary time correlation functions

  James Neuhaus, Nathan S. Nichols, Debshikha Banerjee, Benjamin Cohen-Stead, Thomas A. Maier, Adrian Del Maestro, Steven Johnston

  SciPost Phys. Codebases 39 (2024) · published 12 November 2024 | Toggle abstract · pdf

  We introduce the SmoQyDEAC.jl package, a Julia implementation of the Differential Evolution Analytic Continuation (DEAC) algorithm [N. S. Nichols et al., Phys. Rev. E 106, 025312 (2022)] for analytically continuing noisy imaginary time correlation functions to the real frequency axis. Our implementation supports fermionic and bosonic correlation functions on either the imaginary time or Matsubara frequency axes, and treatment of the covariance error in the input data. This paper presents an overview of the DEAC algorithm and the features implemented in the SmoQyDEAC.jl package. It also provides detailed benchmarks of the package's output against the popular maximum entropy and stochastic analytic continuation methods. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/SmoQyDEAC.jl or installed using the Julia package manager. The online documentation, including examples, can be accessed at https://smoqysuite.github.io/SmoQyDEAC.jl/stable/.

  4 citations

• disorder: Deep inelastic scattering at high orders

  Alexander Karlberg

  SciPost Phys. Codebases 32 (2024) · published 9 July 2024 | Toggle abstract · pdf

  We present a Fortran 77/95 code capable of computing QCD corrections in deep inelastic scattering (DIS). The code uses the Projection-to-Born method to augment an existing $\mathcal{O}(\alpha_{\mathrm{s}}^2)$ dijet DIS code, thereby obtaining predictions for photon-mediated neutral-current single-jet DIS production in the laboratory frame. The code is lightweight and fast, and yet includes the most common functionalities found in typical perturbative QCD programs, like automatic renormalisation and factorisation scale uncertainties, options to run and combine multiple seeds, and interfaces to fastjet and LHAPDF. Due to the underlying disent and HOPPET codes, the program also provides stable results in the infrared, relevant for extracting logarithmic coefficients for analytic resummations, and access to the massless DIS structure functions and (reduced) cross sections up to $\mathcal{O}(\alpha_{\mathrm{s}}^3)$.

  4 citations

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

  4 citations

• MatsubaraFunctions.jl: An equilibrium Green's function library in the Julia programming language

  Dominik Kiese, Anxiang Ge, Nepomuk Ritz, Jan von Delft, Nils Wentzell

  SciPost Phys. Codebases 24 (2024) · published 11 January 2024 | Toggle abstract · pdf

  The Matsubara Green's function formalism stands as a powerful technique for computing the thermodynamic characteristics of interacting quantum many-particle systems at finite temperatures. In this manuscript, our focus centers on introducing MatsubaraFunctions.jl, a Julia library that implements data structures for generalized n-point Green's functions on Matsubara frequency grids. The package's architecture prioritizes user-friendliness without compromising the development of efficient solvers for quantum field theories in equilibrium. Following a comprehensive introduction of the fundamental types, we delve into a thorough examination of key facets of the interface. This encompasses avenues for accessing Green's functions, techniques for extrapolation and interpolation, as well as the incorporation of symmetries and a variety of parallelization strategies. Examples of increasing complexity serve to demonstrate the practical utility of the library, supplemented by discussions on strategies for sidestepping impediments to optimal performance.

  4 citations

• Codebase release 4.0 for RIVET

  Christian Bierlich, Andy Buckley, Jonathan Butterworth, Christian Gutschow, Leif Lonnblad, Tomasz Procter, Peter Richardson, Yoran Yeh

  SciPost Phys. Codebases 36-r4.0 (2024) · published 4 November 2024 | Toggle abstract · src

  The Rivet toolkit is the primary mechanism for phenomenological preservation of collider-physics measurements, containing both a computational core and API for analysis implementation, and a large collection of more than a thousand preserved analyses. In this note we summarise the main changes in the new Rivet 4 major release series. These include a major generalisation and more semantically coherent model for histograms and related data objects, a thorough clean-up of inelegant and legacy observable-computation tools, and new systems for extended analysis-data, incorporation of preserved machine-learning models, and serialization for high-performance computing applications. Where these changes introduce backward-incompatible interface changes, existing analyses have been updated and indications are given on how to update new analysis routines and workflows.

  3 citations