Publications

Order by: publication date number of citations

• Codebase release 1.0 for BlockGen

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

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

  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.

  1 citation

• 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

• 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

• 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

• 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

• Codebase release 2.0 for ALF (Algorithms for Lattice Fermions)

  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-r2.0 (2022) · published 22 August 2022 | Toggle abstract · src

  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.

  3 citations

• Generalized Symmetries in F-theory and the Topology of Elliptic Fibrations

  Max Hübner, David R. Morrison, Sakura Schäfer-Nameki, Yi-Nan Wang

  SciPost Phys. 13, 030 (2022) · published 19 August 2022 | Toggle abstract · pdf

  We realize higher-form symmetries in F-theory compactifications on non-compact elliptically fibered Calabi-Yau manifolds. Central to this endeavour is the topology of the boundary of the non-compact elliptic fibration, as well as the explicit construction of relative 2-cycles in terms of Lefschetz thimbles. We apply the analysis to a variety of elliptic fibrations, including geometries where the discriminant of the elliptic fibration intersects the boundary. We provide a concrete realization of the 1-form symmetry group by constructing the associated charged line operator from the elliptic fibration. As an application we compute the symmetry topological field theories in the case of elliptic three-folds, which correspond to mixed anomalies in 5d and 6d theories.

  12 citations

• Computing associators of endomorphism fusion categories

  Daniel Barter, Jacob C. Bridgeman, Ramona Wolf

  SciPost Phys. 13, 029 (2022) · published 19 August 2022 | Toggle abstract · pdf

  Many applications of fusion categories, particularly in physics, require the associators or $F$-symbols to be known explicitly. Finding these matrices typically involves solving vast systems of coupled polynomial equations in large numbers of variables. In this work, we present an algorithm that allows associator data for some category with unknown associator to be computed from a Morita equivalent category with known data. Given a module category over the latter, we utilize the representation theory of a module tube category, built from the known data, to compute this unknown associator data. When the input category is unitary, we discuss how to ensure the obtained data is also unitary. We provide several worked examples to illustrate this algorithm. In addition, we include several Mathematica files showing how the algorithm can be used to compute the data for the Haagerup category $\mathcal{H}_1$, whose data was previously unknown.

  4 citations

• Quantifying Non-Markovianity in Open Quantum Dynamics

  Chu Guo

  SciPost Phys. 13, 028 (2022) · published 19 August 2022 | Toggle abstract · pdf

  Characterization of non-Markovian open quantum dynamics is both of theoretical and practical relevance. In a seminal work [Phys. Rev. Lett. 120, 040405 (2018)], a necessary and sufficient quantum Markov condition is proposed, with a clear operational interpretation and correspondence with the classical limit. Here we propose two non-Markovianity measures for general open quantum dynamics, which are fully reconciled with the Markovian limit and can be efficiently calculated based on the multi-time quantum measurements of the system. A heuristic algorithm for reconstructing the underlying open quantum dynamics is proposed, whose complexity is directly related to the proposed non-Markovianity measures. The non-Markovianity measures and the reconstruction algorithm are demonstrated with numerical examples, together with a careful reexamination of the non-Markovianity in quantum dephasing dynamics.

  2 citations

• Reduced Dynamics of Full Counting Statistics

  Felix A. Pollock, Emanuel Gull, K. Modi, Guy Cohen

  SciPost Phys. 13, 027 (2022) · published 18 August 2022 | Toggle abstract · pdf

  We present a theory of modified reduced dynamics in the presence of counting fields. Reduced dynamics techniques are useful for describing open quantum systems at long emergent timescales when the memory timescales are short. However, they can be difficult to formulate for observables spanning the system and its environment, such as those characterizing transport properties. A large variety of mixed system--environment observables, as well as their statistical properties, can be evaluated by considering counting fields. Given a numerical method able to simulate the field-modified dynamics over the memory timescale, we show that the long-lived full counting statistics can be efficiently obtained from the reduced dynamics. We demonstrate the utility of the technique by computing the long-time current in the nonequilibrium Anderson impurity model from short-time Monte Carlo simulations.

  2 citations