Contributor info: Prof. Frank Pollmann

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

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.

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.

Julius Lehmann, Pablo Sala de Torres-Solanot, Frank Pollmann, Tibor Rakovszky

SciPost Phys. 14, 140 (2023) · published 1 June 2023 | Toggle abstract · pdf

We study higher dimensional models with symmetric correlated hoppings, which generalize a one-dimensional model introduced in the context of dipole-conserving dynamics. We prove rigorously that whenever the local configuration space takes its smallest non-trivial value, these models exhibit localized behavior due to fragmentation, in any dimension. For the same class of models, we then construct a hierarchy of conserved quantities that are power-law localized at the boundary of the system with increasing powers. Combining these with Mazur's bound, we prove that boundary correlations are infinitely long lived, even when the bulk is not localized. We use our results to construct quantum Hamiltonians that exhibit the analogues of strong zero modes in two and higher dimensions.

Johannes Hauschild, Frank Pollmann

SciPost Phys. Lect. Notes 5 (2018) · published 8 October 2018 | Toggle abstract · pdf

Tensor product state (TPS) based methods are powerful tools to efficiently simulate quantum many-body systems in and out of equilibrium. In particular, the one-dimensional matrix-product (MPS) formalism is by now an established tool in condensed matter theory and quantum chemistry. In these lecture notes, we combine a compact review of basic TPS concepts with the introduction of a versatile tensor library for Python (TeNPy) [https://github.com/tenpy/tenpy]. As concrete examples, we consider the MPS based time-evolving block decimation and the density matrix renormalization group algorithm. Moreover, we provide a practical guide on how to implement abelian symmetries (e.g., a particle number conservation) to accelerate tensor operations.