Найдено 30
Ничего не найдено
YASTN: Yet another symmetric tensor networks; A Python library for Abelian symmetric tensor network calculations
Rams M., Wojtowicz G., Sinha A., Hasik J.
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.
Codebase release 1.2 for YASTN
Rams M., Wojtowicz G., Sinha A., Hasik J.
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.
SOLAX: A Python solver for fermionic quantum systems with neural network support
Thirion L., Hansmann P., Bilous P.
Numerical modeling of fermionic many-body quantum systems presents similar challenges across various research domains, necessitating universal tools, including state-of-the-art machine learning techniques. Here, we introduce SOLAX, a Python library designed to compute and analyze fermionic quantum systems using the formalism of second quantization. SOLAX provides a modular framework for constructing and manipulating basis sets, quantum states, and operators, facilitating the simulation of electronic structures and determining many-body quantum states in finite-size Hilbert spaces. The library integrates machine learning capabilities to mitigate the exponential growth of Hilbert space dimensions in large quantum clusters. The core low-level functionalities are implemented using the recently developed Python library JAX. Demonstrated through its application to the Single Impurity Anderson Model, SOLAX offers a flexible and powerful tool for researchers addressing the challenges of many-body quantum systems across a broad spectrum of fields, including atomic physics, quantum chemistry, and condensed matter physics.
Codebase release 1.0 for SOLAX
Thirion L., Hansmann P., Bilous P.
Numerical modeling of fermionic many-body quantum systems presents similar challenges across various research domains, necessitating universal tools, including state-of-the-art machine learning techniques. Here, we introduce SOLAX, a Python library designed to compute and analyze fermionic quantum systems using the formalism of second quantization. SOLAX provides a modular framework for constructing and manipulating basis sets, quantum states, and operators, facilitating the simulation of electronic structures and determining many-body quantum states in finite-size Hilbert spaces. The library integrates machine learning capabilities to mitigate the exponential growth of Hilbert space dimensions in large quantum clusters. The core low-level functionalities are implemented using the recently developed Python library JAX. Demonstrated through its application to the Single Impurity Anderson Model, SOLAX offers a flexible and powerful tool for researchers addressing the challenges of many-body quantum systems across a broad spectrum of fields, including atomic physics, quantum chemistry, and condensed matter physics.
Pymablock: An algorithm and a package for quasi-degenerate perturbation theory
Araya Day I., Miles S., Kerstens H., Varjas D., Akhmerov A.R.
A common technique in the study of complex quantum-mechanical systems is to reduce the number of degrees of freedom in the Hamiltonian by using quasi-degenerate perturbation theory. While the Schrieffer-Wolff transformation achieves this and constructs an effective Hamiltonian, its scaling is suboptimal, it is limited to two subspaces, and implementing it efficiently is both challenging and error-prone. We introduce an algorithm for constructing an equivalent effective Hamiltonian as well as a Python package, Pymablock, that implements it. Our algorithm combines an optimal asymptotic scaling and the ability to handle any number of subspaces with a range of other improvements. The package supports numerical and analytical calculations of any order and it is designed to be interoperable with any other packages for specifying the Hamiltonian. We demonstrate how the package handles constructing a k.p model, analyses a superconducting qubit, and computes the low-energy spectrum of a large tight-binding model. We also compare its performance with reference calculations and demonstrate its efficiency.
Codebase release 2.1 for Pymablock
Araya Day I., Miles S., Kerstens H., Varjas D., Akhmerov A.R.
A common technique in the study of complex quantum-mechanical systems is to reduce the number of degrees of freedom in the Hamiltonian by using quasi-degenerate perturbation theory. While the Schrieffer-Wolff transformation achieves this and constructs an effective Hamiltonian, its scaling is suboptimal, it is limited to two subspaces, and implementing it efficiently is both challenging and error-prone. We introduce an algorithm for constructing an equivalent effective Hamiltonian as well as a Python package, Pymablock, that implements it. Our algorithm combines an optimal asymptotic scaling and the ability to handle any number of subspaces with a range of other improvements. The package supports numerical and analytical calculations of any order and it is designed to be interoperable with any other packages for specifying the Hamiltonian. We demonstrate how the package handles constructing a k.p model, analyses a superconducting qubit, and computes the low-energy spectrum of a large tight-binding model. We also compare its performance with reference calculations and demonstrate its efficiency.
Codebase release 0.2 for Carlo.jl
Weber L.
Carlo.jl is a Monte Carlo simulation framework written in Julia. It provides MPI-parallel scheduling (including parallel tempering), organized storage of input, checkpoint, and output files, as well as statistical postprocessing. With a minimalist design, it aims to aid the development of high-quality Monte Carlo codes, especially for demanding applications in condensed matter and statistical physics. This hands-on user guide shows how to implement a simple code with Carlo.jl, how to run an existing stochastic series expansion code based on Carlo.jl, and provides benchmarks to show its efficacy.
Carlo.jl: A general framework for Monte Carlo simulations in Julia
Weber L.
Carlo.jl is a Monte Carlo simulation framework written in Julia. It provides MPI-parallel scheduling (including parallel tempering), organized storage of input, checkpoint, and output files, as well as statistical postprocessing. With a minimalist design, it aims to aid the development of high-quality Monte Carlo codes, especially for demanding applications in condensed matter and statistical physics. This hands-on user guide shows how to implement a simple code with Carlo.jl, how to run an existing stochastic series expansion code based on Carlo.jl, and provides benchmarks to show its efficacy.
Codebase release 1.0 for DanceQ
Schäfer R., Luitz D.J.
The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite-size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the wave function, where one simply accepts the enormous Hilbert space dimensions and performs linear algebra operations, e.g., for finding the ground state of the Hamiltonian. If the system satisfies an underlying symmetry where an operator with a degenerate spectrum commutes with the Hamiltonian, it can be block-diagonalized, thus reducing the complexity at the expense of additional bookkeeping. At the most basic level required for Krylov space techniques (like the Lanczos algorithm), it is necessary to implement a matrix-vector product of a block of the Hamiltonian with arbitrary block-wavefunctions, potentially without holding the Hamiltonian block in memory. An efficient implementation of this operation requires the calculation of the position of an arbitrary basis vector in the canonical ordering of the basis of the block. We present here an elegant and powerful, multi-dimensional approach to this problem for the U(1)U(1) symmetry appearing in problems with particle number conservation. Our divide-and-conquer algorithm uses multiple subsystems and hence generalizes previous approaches to make them scalable. In addition to the theoretical presentation of our algorithm, we provide DanceQ, a flexible and modern – header only – C++20 implementation to manipulate, enumerate, and map to its index any basis state in a given particle number sector as open source software under https://DanceQ.gitlab.io/danceq.
DanceQ: High-performance library for number conserving bases
Schäfer R., Luitz D.J.
The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite-size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the wave function, where one simply accepts the enormous Hilbert space dimensions and performs linear algebra operations, e.g., for finding the ground state of the Hamiltonian. If the system satisfies an underlying symmetry where an operator with a degenerate spectrum commutes with the Hamiltonian, it can be block-diagonalized, thus reducing the complexity at the expense of additional bookkeeping. At the most basic level required for Krylov space techniques (like the Lanczos algorithm), it is necessary to implement a matrix-vector product of a block of the Hamiltonian with arbitrary block-wavefunctions, potentially without holding the Hamiltonian block in memory. An efficient implementation of this operation requires the calculation of the position of an arbitrary basis vector in the canonical ordering of the basis of the block. We present here an elegant and powerful, multi-dimensional approach to this problem for the U(1)U(1) symmetry appearing in problems with particle number conservation. Our divide-and-conquer algorithm uses multiple subsystems and hence generalizes previous approaches to make them scalable. In addition to the theoretical presentation of our algorithm, we provide DanceQ, a flexible and modern – header only – C++20 implementation to manipulate, enumerate, and map to its index any basis state in a given particle number sector as open source software under https://DanceQ.gitlab.io/danceq.
kdotpy: k·p theory on a lattice for simulating semiconductor band structures
Beugeling W., Bayer F., Berger C., Böttcher J., Bovkun L., Fuchs C., Hofer M., Shamim S., Siebert M., Wang L., Hankiewicz E., Kießling T., Buhmann H., Molenkamp L.
The software project kdotpy provides a Python application for simulating electronic band structures of semiconductor devices with k·p theory on a lattice. The application implements the widely used Kane model, capable of reliable predictions of transport and optical properties for a large variety of topological and non-topological materials with a zincblende crystal structure. The application automates the tedious steps of simulating band structures. The user inputs the relevant physical parameters on the command line, for example materials and dimensions of the device, magnetic field, and temperature. The program constructs the appropriate matrix Hamiltonian on a discretized lattice of spatial coordinates and diagonalizes it. The physical observables are extracted from the eigenvalues and eigenvectors and saved as output. The program is highly customizable with a large set of configuration options and material parameters.
Codebase release 1.0 for kdotpy
Beugeling W., Bayer F., Berger C., Böttcher J., Bovkun L., Fuchs C., Hofer M., Shamim S., Siebert M., Wang L., Hankiewicz E., Kießling T., Buhmann H., Molenkamp L.
The software project kdotpy provides a Python application for simulating electronic band structures of semiconductor devices with k·p theory on a lattice. The application implements the widely used Kane model, capable of reliable predictions of transport and optical properties for a large variety of topological and non-topological materials with a zincblende crystal structure. The application automates the tedious steps of simulating band structures. The user inputs the relevant physical parameters on the command line, for example materials and dimensions of the device, magnetic field, and temperature. The program constructs the appropriate matrix Hamiltonian on a discretized lattice of spatial coordinates and diagonalizes it. The physical observables are extracted from the eigenvalues and eigenvectors and saved as output. The program is highly customizable with a large set of configuration options and material parameters.
Tensor network Python (TeNPy) version 1
Hauschild J., Unfried J., Anand S., Andrews B., Bintz M., Borla U., Divic S., Drescher M., Geiger J., Hefel M., Hémery K., Kadow W., Kemp J., Kirchner N., Liu V.S., et. al.
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.
Codebase release 1.0 for TeNPy
Hauschild J., Unfried J., Anand S., Andrews B., Bintz M., Borla U., Divic S., Drescher M., Geiger J., Hefel M., Hémery K., Kadow W., Kemp J., Kirchner N., Liu V.S., et. al.
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.
Codebase release 1.3 for HYPERTILING
Schrauth M., Thurn Y., Goth F., Portela J., Herdt D., Dusel F.
HYPERTILING is a high-performance Python library for the generation and visualization of regular hyperbolic lattices embedded in the Poincaré disk model. Using highly optimized, efficient algorithms, hyperbolic tilings with millions of vertices can be created in a matter of minutes on a single workstation computer. Facilities including computation of adjacent vertices, dynamic lattice manipulation, refinements, as well as powerful plotting and animation capabilities are provided to support advanced uses of hyperbolic graphs. In this manuscript, we present a comprehensive exploration of the package, encompassing its mathematical foundations, usage examples, applications, and a detailed description of its implementation.
HYPERTILING — a high performance Python library for the generation and visualization of hyperbolic lattices
Schrauth M., Thurn Y., Goth F., Portela J., Herdt D., Dusel F.
HYPERTILING is a high-performance Python library for the generation and visualization of regular hyperbolic lattices embedded in the Poincaré disk model. Using highly optimized, efficient algorithms, hyperbolic tilings with millions of vertices can be created in a matter of minutes on a single workstation computer. Facilities including computation of adjacent vertices, dynamic lattice manipulation, refinements, as well as powerful plotting and animation capabilities are provided to support advanced uses of hyperbolic graphs. In this manuscript, we present a comprehensive exploration of the package, encompassing its mathematical foundations, usage examples, applications, and a detailed description of its implementation.
A tool to check whether a symmetry-compensated collinear magnetic material is antiferro- or altermagnetic
Smolyanyuk A., Šmejkal L., Mazin I.I.
Altermagnets (AM) is a recently discovered class of collinear magnets that share some properties (anomalous transport, etc) with ferromagnets, some (zero net magnetization) with antiferromagnets, while also exhibiting unique properties (spin-splitting of electronic bands and resulting spin-splitter current). Since the moment compensation in AM is driven by symmetry, it must be possible to identify them by analyzing the crystal structure directly, without computing the electronic structure. Given the significant potential of AM for spintronics, it is very useful to have a tool for such an analysis. This work presents an open-access code implementing such a direct check.
Codebase release r1.0 for amcheck
Smolyanyuk A., Šmejkal L., Mazin I.I.
Altermagnets (AM) is a recently discovered class of collinear magnets that share some properties (anomalous transport, etc) with ferromagnets, some (zero net magnetization) with antiferromagnets, while also exhibiting unique properties (spin-splitting of electronic bands and resulting spin-splitter current). Since the moment compensation in AM is driven by symmetry, it must be possible to identify them by analyzing the crystal structure directly, without computing the electronic structure. Given the significant potential of AM for spintronics, it is very useful to have a tool for such an analysis. This work presents an open-access code implementing such a direct check.
Codebase release 0.5 for divERGe
Profe J.B., Kennes D.M., Klebl L.
We present divERGe, an open source, high-performance C/C++/Python library for functional renormalization group (FRG) calculations on lattice fermions. The versatile model interface is tailored to real materials applications and seamlessly integrates with existing, standard tools from the ab-initio community. The code fully supports multi-site, multi-orbital, and non-SU(2) models in all of the three included FRG variants: TU^22FRG, N-patch FRG, and grid FRG. With this, the divERGe library paves the way for widespread application of FRG as a tool in the study of competing orders in quantum materials.
divERGe implements various Exact Renormalization Group examples
Profe J.B., Kennes D.M., Klebl L.
We present divERGe, an open source, high-performance C/C++/Python library for functional renormalization group (FRG) calculations on lattice fermions. The versatile model interface is tailored to real materials applications and seamlessly integrates with existing, standard tools from the ab-initio community. The code fully supports multi-site, multi-orbital, and non-SU(2) models in all of the three included FRG variants: TU^22FRG, N-patch FRG, and grid FRG. With this, the divERGe library paves the way for widespread application of FRG as a tool in the study of competing orders in quantum materials.
DFT2kp: Effective kp models from ab-initio data
V. Cassiano J.V., de Lelis Araújo A., Faria Junior P.E., J. Ferreira G.
The k\cdot pk⋅p method, combined with group theory, is an efficient approach to obtain the low energy effective Hamiltonians of crystalline materials. Although the Hamiltonian coefficients are written as matrix elements of the generalized momentum operator \pi= p+ p_{SOC}π=p+pSOC (including spin-orbit coupling corrections), their numerical values must be determined from outside sources, such as experiments or ab initio methods. Here, we develop a code to explicitly calculate the Kane (linear in crystal momentum) and Luttinger (quadratic in crystal momentum) parameters of k\cdot pk⋅p effective Hamiltonians directly from ab initio wavefunctions provided by Quantum ESPRESSO. Additionally, the code analyzes the symmetry transformations of the wavefunctions to optimize the final Hamiltonian. This is an optional step in the code, where it numerically finds the unitary transformation UU that rotates the basis towards an optimal symmetry-adapted representation informed by the user. Throughout the paper, we present the methodology in detail and illustrate the capabilities of the code applying it to a selection of relevant materials. Particularly, we show a “hands-on” example of how to run the code for graphene (with and without spin-orbit coupling). The code is open source and available at https://gitlab.com/dft2kp/dft2kp.
Codebase release 0.0 for DFT2kp
V. Cassiano J.V., de Lelis Araújo A., Faria Junior P.E., J. Ferreira G.
The k\cdot pk⋅p method, combined with group theory, is an efficient approach to obtain the low energy effective Hamiltonians of crystalline materials. Although the Hamiltonian coefficients are written as matrix elements of the generalized momentum operator \pi= p+ p_{SOC}π=p+pSOC (including spin-orbit coupling corrections), their numerical values must be determined from outside sources, such as experiments or ab initio methods. Here, we develop a code to explicitly calculate the Kane (linear in crystal momentum) and Luttinger (quadratic in crystal momentum) parameters of k\cdot pk⋅p effective Hamiltonians directly from ab initio wavefunctions provided by Quantum ESPRESSO. Additionally, the code analyzes the symmetry transformations of the wavefunctions to optimize the final Hamiltonian. This is an optional step in the code, where it numerically finds the unitary transformation UU that rotates the basis towards an optimal symmetry-adapted representation informed by the user. Throughout the paper, we present the methodology in detail and illustrate the capabilities of the code applying it to a selection of relevant materials. Particularly, we show a “hands-on” example of how to run the code for graphene (with and without spin-orbit coupling). The code is open source and available at https://gitlab.com/dft2kp/dft2kp.
Codebase release 2.2 for HEJ
Andersen J.R., Ducloué B., Elrick C., Hassan H., Maier A., Nail G., Paltrinieri J., Papaefstathiou A., Smillie J.M.
We present version 2.2 of the High Energy Jets (HEJ) Monte Carlo event generator for hadronic scattering processes at high energies. The new version adds support for two further processes of central phenomenological interest, namely the production of a W boson pair with equal charge together with two or more jets and the production of a Higgs boson with at least one jet. Furthermore, a new prediction for charged lepton pair production with high jet multiplicities is provided in the high-energy limit. The accuracy of HEJ 2.2 can be increased further through an enhanced interface to standard predictions based on conventional perturbation theory. We describe all improvements and provide extensive usage examples. HEJ 2.2 can be obtained from https://hej.hepforge.org.
HEJ 2.2: W boson pairs and Higgs boson plus jet production at high energies
Andersen J.R., Ducloué B., Elrick C., Hassan H., Maier A., Nail G., Paltrinieri J., Papaefstathiou A., Smillie J.M.
We present version 2.2 of the High Energy Jets (HEJ) Monte Carlo event generator for hadronic scattering processes at high energies. The new version adds support for two further processes of central phenomenological interest, namely the production of a W boson pair with equal charge together with two or more jets and the production of a Higgs boson with at least one jet. Furthermore, a new prediction for charged lepton pair production with high jet multiplicities is provided in the high-energy limit. The accuracy of HEJ 2.2 can be increased further through an enhanced interface to standard predictions based on conventional perturbation theory. We describe all improvements and provide extensive usage examples. HEJ 2.2 can be obtained from https://hej.hepforge.org.
Codebase release 1.0 for GRIFFIN
Chen L., Freitas A.
This paper describes a modular framework for the description of electroweak scattering and decay processes, including but not limited to Z-resonance physics. The framework consistently combines a complex-pole expansion near an s-channel resonance with a regular fixed-order perturbative description away from the resonance in a manifestly gauge-invariant scheme. Leading vertex correction contributions are encapsulated in form factors that can be predicted or treated as numerical fit parameters. This framework has been implemented in the publicly available object-oriented C++ library GRIFFIN. Version 1.0 of this library provides Standard Model predictions for the IR-subtracted matrix elements for the process f\bar{f} \to f'\bar{f}'ff‾→f′f‾′ with full NNLO and leading higher-order contributions on the Z-resonance, and with NLO corrections off-resonance. The library can straightforwardly be extended to include higher-order corrections, should they become available, or predictions for new physics models. It can be interfaced with Monte-Carlo programs to account for QED and QCD initial-state and final-state radiation.
