SciPost Submission Page
Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
by Johannes Hauschild, Frank Pollmann
This is not the latest submitted version.
This Submission thread is now published as
Submission summary
Authors (as registered SciPost users):  Johannes Hauschild · Frank Pollmann 
Submission information  

Preprint Link:  http://arxiv.org/abs/1805.00055v1 (pdf) 
Date submitted:  20180508 02:00 
Submitted by:  Hauschild, Johannes 
Submitted to:  SciPost Physics Lecture Notes 
Ontological classification  

Academic field:  Physics 
Specialties: 

Approach:  Computational 
Abstract
Tensor product state (TPS) based methods are powerful tools to efficiently simulate quantum manybody systems in and out of equilibrium. In particular, the onedimensional matrixproduct (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 timeevolving 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.
Current status:
Submission & Refereeing History
You are currently on this page
Reports on this Submission
Anonymous Report 2 on 201874 (Invited Report)
 Cite as: Anonymous, Report on arXiv:1805.00055v1, delivered 20180704, doi: 10.21468/SciPost.Report.526
Strengths
1) Wellwritten introduction, very pedagogical
2) Examples of codes for python TN libraries
3) Discussion about abelian symmetries in the TN libraries
Weaknesses
1) Only focused on Matrix Product States
2) No numerical benchmarks of the libraries
3) No discussion of nonabelian symmetries
Report
In this paper the authors offer a pedagogical introduction to some basic aspects of tensor network states and manybody entanglement theory, focusing their explanations on Matrix Product States (MPS) and their associated methods. The authors also explain the implementation of abelian symmetries in MPS, and provide a practical guide for their tensor network library in Python (TeNPy) with practical codes.
This is definitely a very useful paper, which is also nicely written It definitely deserves publication in SciPost. I have some observations though, that the authors should consider before publication:
1) Could the authors comment also (at least briefly) on the implementation of nonabelian symmetries?
2) The authors say in the title that they discuss “tensor networks”. However, in practice they only discuss MPS. I would therefore either discuss briefly other tensor networks in their paper (PEPS, MERA…), or modify the title and say “Matrix Product States” instead of Tensor Networks.
3) The paper is fully analytical, and no numerical calculation is shown. Since this is a paper about some programming libraries, it would be very helpful to the reader if the authors showed some examples of numerical benchmarks with TeNPy.
Requested changes
1) Comment on nonabelian symmetries
2) Modify title or discuss TN beyond 1d
3) Add numerical benchmarks
Report 1 by Claudius Hubig on 2018521 (Invited Report)
 Cite as: Claudius Hubig, Report on arXiv:1805.00055v1, delivered 20180521, doi: 10.21468/SciPost.Report.459
Strengths
1. excellent introduction into matrixproduct states and their underlying physical motivation
2. good description of the TeNPy library with example codes provided both here and in the documentation accompanying TeNPy.
3. complete description for the implementation of Abelian symmetries
4. discussion of basic TEBD and DMRG methods as provided by TeNPy
Weaknesses
1. reliance on the ΓΛnotation which is not necessary in the presented applications and numerically unstable
2. the discussion of DMRG is relatively short and not describing the current state of the art
Report
The lecture notes both provide an excellent motivation for and description of matrixproduct states as well as an introduction into the presented TeNPy Python package. The Python package itself is excellently documented (outside these lecture notes), provides the examples described in the lecture notes and appears to provide reasonable performance given the design goals which focus on usability, ease of extensibility and understandability.
Modulo some minor typos and small extensions (see below), my main concerns with the lecture notes submitted are then twofold. As soon as these are addressed in some way, I wholeheartedly suggest publication of these very readable, pedagogical and thorough lecture notes.
First, the algorithms are presented using the ΓΛnotation/gauge for matrix product states. While reasonably straightforward, restoring this gauge after tensor updates involves the numerically unstable multiplication by the inverse singular value tensor. However, neither for the presented TEBD algorithm nor for DMRG updates is it necessary to keep the state within the ΓΛ notation and indeed, in the section on DMRG, a different gauge is used: the much more stable alternative, the mixed canonical form with leftorhogonalised tensors (A), an orthogonality centre (either a singlesite tensor M or a bond tensor C) and rightorthogonalised tensors (B).
The ΓΛ notation is primarily useful when a) updating site tensors in parallel in TEBD (cf. Urbanek and Soldan, 2016) or b) evaluating many local expectation values. While a) is a potentially useful application, Urbanek and Soldan used an interesting trick to avoid the multiplication by the inverse singular value tensor. b) is potentially applicable, but evaluating expectation values is typically much cheaper than optimising or timeevolving tensors, so it appears unreasonable to enforce the ΓΛ gauge also during the intermediate operations (instead of restoring it at the end). If the ΓΛ notation provides other benefits, it would be useful to present those benefits in section 3.1 or instead only use the AMB form throughout the entire lecture notes.
Second, the section on DMRG should be extended to capture more of the current state of the art. In particular, the singlesite update is missing completely. The primary aim of the density matrix perturbation or the subspace expansion is not so much to improve the convergence of the 2site DMRG (2DMRG), but also to allow for a reliable singlesite DMRG (1DMRG) update with its associated computational speedup. The relative advantages of 2DMRG (slightly better convergence of other observables, less potential to get stuck) and 1DMRG (much faster, larger bond dimensions, often better energies) should be discussed in a pedagogical introduction to variational groundstate searches with MPS. A ‘staging scheme’ to incrementally increase the bond dimension and accuracy of the calculation during the sweeps is also present in the example code (I think, the example is not entirely clear) but not explained in detail. Further methods to avoid convergence problems (multigrid DMRG, perturbation Hamiltonians, initialisation of the starting state etc.) could also be mentioned. Finally, extrapolations to the limit $\chi \to \infty$ are an essential part of largescale DMRG calculations and should not be excluded from a pedagogical introduction.
Requested changes
1. Reconsidering the use of ΓΛ gauge at least in the pedagogical introduction. If keeping it, explaining the trick used by Urbanek and Soldan (Computer Physics Communications, 2016) to avoid multiplication by the inverse singular value tensor would be useful.
2. Extending the section on DMRG to present more of the details of the algorithm and how to implement/use those within TeNPy would be worthwhile.
Additionally, I’d like to suggest the following minor corrections:
3. "the Hadane phase in quantum spin…" should read "the Haldane phase…".
4. "For each algorithm, we give a short example code show how to call" should read either "showing how to" or "to show how to call".
5. Below equation (1), $\{  \alpha \rangle_{L(R)} \}$ are called an "orthonormal basis" of $\mathcal{H}_L$. A basis is a complete set of vectors spanning the entire vector space, which cannot be since $\mathcal{H} = \mathcal{H}_L \otimes \mathcal{H}_R$ does not ensure that the left and right spaces have the same dimension. Instead, the $\{  \alpha \rangle_{L(R)} \}$ are the left and right Schmidt bases and form an orthonormal basis of a *subspace* of $\mathcal{H}_L$ and $\mathcal{H}_R$ respectively.
6. In section 3.1, it may be useful to also introduce the adjective "auxiliary" to describe the bond/virtual indices, as it is commonly encountered in the literature.
7. I’m not sure it is a good idea to describe an MPS on a finite system as "uniform" (above equation (9)). While strictly speaking true, it may be more appropriate to reserve the adjective "uniform" to infinitesystem MPS.
8. In section 3.3, imaginary time evolution is described as "being used to find ground states of the Hamiltonian" (eq. (22) and the sentence above it). However, imaginary TEBD is not the method of choice for this task (as also explained later on) and it may confuse a novice reader. A more appropriate example application of imaginary time evolution may be the evaluation of Green’s functions.
9. At the bottom of page 14, it is said that the TEBD method can only be applied to nearestneighbour Hamiltonians. The introduction of swap gates (Stoudenmire and White, 2010), however, avoids this problem entirely at only slightly larger computational effort.
10. The example code for TEBD with TeNPy is split over a linebreak, which makes copypasting it a bit hard. In general, a more traditional formatting with a monospaced typeface may be worth considering (also depending on the editor’s preferences).
11. On page 16, Ref. 61 is mentioned to describe finite state machines for MPO construction. A very readable other paper on that topic is Paeckel et al 2017 (SciPost Phys. 3, 035), which is certainly worth mentioning here.
12. I’m not sure what is meant by "even if they might not be the true Schmidt basis" in footnote 3 on page 17. The DMRG procedure always keeps a Schmidt decomposition between the current left and right environment and hence always keeps a left and right Schmidt basis.
13. Fig. 8b) is slightly misleading (as then also mentioned in the text). While the effective Hamiltonian does take this form, it is very suboptimal to compute it. Instead, the authors might consider showing $\psi_{\mathrm{eff}}$ (i.e. the twosite tensor) and the product $\hat H_{\mathrm{eff}} \cdot \psi_{\mathrm{eff}}$, which would avoid the impression that one has to explicitly evaluate $\hat H_{\mathrm{eff}}$. As an aside, in the case of quantum numbers which split the local statespace into onedimensional blocks (i.e. a single state per quantum number), the ordering L·W·M·R instead of L·M·W·R allows precomputation of L·W prior to all Lanczos iterations and is typically somewhat faster than the asymptoticallyoptimal ordering, at least in 1DMRG calculations.
14. On page 19, it is mentioned that the left and right bases have to be orthonormal to ensure optimal truncation. However, these bases have to be orthonormal for the much more fundamental reason that one wishes to update the tensor using a standard instead of a generalised eigenvalue problem (as eg. explained in Schollwöck 2011, around Eq. 208). This fact should not be omitted!
15. On page 21, it may be worthwhile to mention the recent VUMPS algorithm/method as an alternative to the previous iMPS methods.
16. Section header "4.1 Infinte Time Evolving…" should read "4.1 Infinite Time Evolving…".
17. In footnote 5, the authors say that they restrict themselves to "local, abelian symmetries". In fact, the symmetries considered are *global* symmetries (i.e., not local/gauge symmetries). The restriction on locality is that the symmetry has to *act* locally; e.g. momentum conservation on a ring in real space cannot be implemented in the setting described here, one has to go to momentum space to do so.
18. I am not sure I understand the role of the total charge Q per tensor completely, in particular during tensortensor contractions. Do I understand correctly that Q acts as an additional onedimensional dummy index carrying a total charge out of/into the tensor, with those legs combined into a new "pipe" leg during tensortensor contractions? If so, it may be worthwhile to offer this alternative explanation as well.
19. In the installation instructions (doc/INSTALL.rst) of the TeNPy package on Github, the probably aliased command "git co <tag>" is used. The authors may wish to replace that by "git checkout <tag>".
20. Finally, I would suggest to link to the excellent documentation of the TeNPy package at https://tenpy.github.io/ directly from the paper. It is absolutely worth reading and hence also pointing out to readers.
Author: Johannes Hauschild on 20180830 [id 312]
(in reply to Report 1 by Claudius Hubig on 20180521)
We thank you very much for the positive and detailed report and are grateful for the effort that went into it.
On the first point: We believe that the $\Gamma$$\Lambda$ notation is very useful from a pedagogical point of view to understand the canonical form. In particular it provides a simple understanding of the relations between the left, right, and mixed canonical form  as it allows to read off the Schmidt decomposition of $\psi\rangle$ at each bond at the same time. We are aware that using the $\Gamma$ matrices in the code leads to numerical instabilities. However, we consider these instabilities as a minor detail of the implementation, less important than understanding the overall concepts of TEBD and DMRG. To the best of our knowlege, the trick for the TEBD used by Urbanek and Soldan was originially introduced by Hastings in 2009 (our Ref. 59), which we referenced in the paragraph before the TEBD example code (Of course, the trick is used in the TeNPy implementation)
On the second point: The goal of the lecture notes is to provide an accessible introduction for the newcommers to the field. We feel that explaining too many details about the different parameters in these notes will lead to unnecessary confusions, and instead refer to the documentation for that, which will be kept up to date with the implementation. We extended the discussion of 2DMRG vs 1DMRG sligthly (now before the example code to have it closer to the algorithm) and added a sentence about the extrapolation $\chi \rightarrow \infty$ in the conclusion.
On the requested changes:
1.,2.: See above

Corrected.

Corrected.

We see the point but do not fully agree with this comment: we can always complete the used left and right SchmidtBases to a full basis of $\mathcal{H}_{L(R)}$. Therefore, we changed the text to "orthonormal basis of (the relevant subspaces of) $\mathcal{H}_L$ ($\mathcal{H}_R$)".

Added.

Agree, corrected.

Added the Green's functions as example and a footnote that DMRG is better.

Added a footnote mentioning the swap gates.

Changed/Improved.

Added.

Say we optimize on sites (n, n+1) and find a new optimal state, then e.g. the $a_{n+2}\rangle_R$ (in the sense of Fig. 4c) are still orthonormal, but not the correct Schmidt basis with respect to the new state. Yet, we agree that the formulation was misleading and changed it.

Like for the $\Gamma$$\Lambda$ notation, we think that it is helpful from a pedagogical point of view to show the network of $H_{eff}$, even if it gets never fully contracted in an efficient DMRG implementation.

Included this fact.

We added an paragraph to mention VUMPS at the end of the chapter on iDMRG.

Changed.

Corrected.

Yes, one could basically think of it like a dummy index with an extra charge. For contractions, we do not necessarily need to combine legs into pipes, but yes, for and SVD you can think of it like that. The total charge is introduced to be able to write e.g. S+ and S as matrices with just two indices, and all legs sharing the same charge vector q (defined only once for a "physical" leg).

Thank you for this hint, corrected.

Agree, added.
Author: Johannes Hauschild on 20180830 [id 313]
(in reply to Report 2 on 20180704)We thank the referee for the positive report and would like to address his points below:
Actually, we did shortly comment on nonabelian symmetries in the footnote on page 25. To make it more prominent, we moved it into the main text right before section 5.1 in the revised script.
These lecture notes introduce the TeNPy library, which is what the title is focused on. We called the library TeNPy, because it will most likely contain codes on 2D tensor networks in future versions. While we only discuss the 1D MPS methods as examples of general tensor networks, the chapter 5 on abelian symmetries applies to tensor networks in 2D as well. The abstract clearly says what we discuss, so we feel that the title is justified.
We have include a paragraph on the performance of the TeNPy library at the end of the conclusions. High performance is only a secondary goal of the library, and in comparison to other C++ libraries like ITensor only reached for simluations involing large bond dimensions. Yet, we hope and believe that the TenPy library proves useful to the community due to its accessibility and flexibility  in particular also for the audience targeted by these lecture notes. Moreover, we hope that we can still optimize a few parts of the library in future versions to increase its performance, which would render a detailed benchmark in these lecture notes out of date.