Publications

Order by: publication date number of citations

• Universal Properties of Anisotropic Dipolar Bosons in Two Dimensions

  J. Sánchez-Baena, L. A. Peña Ardila, G. Astrakharchik, F. Mazzanti

  SciPost Phys. 13, 031 (2022) · published 25 August 2022 | Toggle abstract · pdf

  The energy of ultra-dilute quantum many-body systems is known to exhibit a universal dependence on the gas parameter $x=n a_0^d$, with $n$ the density, $d$ the dimensionality of the space ($d=1,2,3$) and $a_0$ the $s$-wave scattering length. The universal regime typically extends up to $x\approx 0.001$, while at larger values specific details of the interaction start to be relevant and different model potentials lead to different results. Dipolar systems are peculiar in this regard since the anisotropy of the interaction makes $a_0$ depend on the polarization angle $\alpha$, so different combinations of $n$ and $\alpha$ can lead to the same value of the gas parameter $x$. In this work we analyze the scaling properties of dipolar bosons in two dimensions as a function of the density and polarization dependent scattering length up to very large values of the gas parameter $x$. Using Quantum Monte Carlo (QMC) methods we study the energy and the main structural and coherence properties of the ground state of a gas of dipolar bosons by varying the density and scattering length for fixed gas parameter. We find that the dipolar interaction shows relevant scaling laws up to unusually large values of $x$ that hold almost to the boundaries in the phase diagram where a transition to a stripe phase takes place.

  1 citation

• Codebase release 3.4 for NetKet

  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-r3.4 (2022) · published 24 August 2022 | Toggle abstract · src

  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.

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

  49 citations

• Codebase release 0.5 for HarmonicBalance.jl

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

  SciPost Phys. Codebases 6-r0.5 (2022) · published 24 August 2022 | Toggle abstract · src

  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.

  1 citation

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

  8 citations

• Codebase release 1.0 for SpinParser

  Finn Lasse Buessen

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

  We present the SpinParser open-source software [ https://github.com/fbuessen/SpinParser ]. The software is designed to perform pseudofermion functional renormalization group (pf-FRG) calculations for frustrated quantum magnets in two and three spatial dimensions. It aims to make such calculations readily accessible without the need to write specialized program code; instead, custom lattice graphs and microscopic spin models can be defined as plain-text input files. Underlying symmetries of the model are automatically analyzed and exploited by the numerical core written in C++ in order to optimize the performance across large-scale shared memory and/or distributed memory computing platforms.

  2 citations

• The SpinParser software for pseudofermion functional renormalization group calculations on quantum magnets

  Finn Lasse Buessen

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

  We present the SpinParser open-source software [ https://github.com/fbuessen/SpinParser ]. The software is designed to perform pseudofermion functional renormalization group (pf-FRG) calculations for frustrated quantum magnets in two and three spatial dimensions. It aims to make such calculations readily accessible without the need to write specialized program code; instead, custom lattice graphs and microscopic spin models can be defined as plain-text input files. Underlying symmetries of the model are automatically analyzed and exploited by the numerical core written in C++ in order to optimize the performance across large-scale shared memory and/or distributed memory computing platforms.

  5 citations

• Phonon dressing of a facilitated one-dimensional Rydberg lattice gas

  Matteo Magoni, Paolo P. Mazza, Igor Lesanovsky

  SciPost Phys. Core 5, 041 (2022) · published 23 August 2022 | Toggle abstract · pdf

  We study the dynamics of a one-dimensional Rydberg lattice gas under facilitation (anti-blockade) conditions which implements a so-called kinetically constrained spin system. Here an atom can only be excited to a Rydberg state when one of its neighbors is already excited. Once two or more atoms are simultaneously excited mechanical forces emerge, which couple the internal electronic dynamics of this many-body system to external vibrational degrees of freedom in the lattice. This electron-phonon coupling results in a so-called phonon dressing of many-body states which in turn impacts on the facilitation dynamics. In our theoretical study we focus on a scenario in which all energy scales are sufficiently separated such that a perturbative treatment of the coupling between electronic and vibrational states is possible. This allows to analytically derive an effective Hamiltonian for the evolution of consecutive clusters of Rydberg excitations in the presence of phonon dressing. We analyze the spectrum of this Hamiltonian and show -- by employing Fano resonance theory -- that the interaction between Rydberg excitations and lattice vibrations leads to the emergence of slowly decaying bound states that inhibit fast relaxation of certain initial states.

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

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

  73 citations