Stable and efficient differentiation of tensor network algorithms
Abstract: Gradient based optimization methods are the established state-of-the-art paradigm to study strongly entangled quantum systems in two dimensions with Projected Entangled Pair States. However, the key ingredient, the gradient itself, has proven challenging to calculate accurately and reliably in the case of a corner transfer matrix (CTM)-based approach. Automatic differentiation (AD), which is the best known tool for calculating the gradient, still suffers some crucial shortcomings. Some of these are known, like the problem of excessive memory usage and the divergences which may arise when differentiating a singular value decomposition (SVD). Importantly, we also find that there is a fundamental inaccuracy in the currently used backpropagation of SVD that had not been noted before. In this paper, we describe all these problems and provide them with compact and easy to implement solutions. We analyse the impact of these changes and find that the last problem -- the use of the correct gradient -- is by far the dominant one and thus should be considered a crucial patch to any AD application that makes use of an SVD for truncation.
- S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).
- S. R. White, Density-matrix algorithms for quantum renormalization groups, Phys. Rev. B 48, 10345 (1993).
- M. Fannes, B. Nachtergaele, and R. F. Werner, Finitely correlated states on quantum spin chains, Communications in Mathematical Physics 144, 443 (1992).
- A. Klümper, A. Schadschneider, and J. Zittartz, Matrix Product Ground States for One-Dimensional Spin-1 Quantum Antiferromagnets, Europhysics Letters (EPL) 24, 293–297 (1993).
- F. Verstraete and J. I. Cirac, Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions, (2004), arXiv:cond-mat/0407066 .
- P. Corboz, Improved energy extrapolation with infinite projected entangled-pair states applied to the two-dimensional Hubbard model, Physical Review B 93, 045116 (2016a).
- P. Corboz, T. M. Rice, and M. Troyer, Competing States in the t𝑡titalic_t-J𝐽Jitalic_J Model: Uniform d𝑑ditalic_d-Wave State versus Stripe State, Phys. Rev. Lett. 113, 046402 (2014).
- S. P. G. Crone and P. Corboz, Detecting a Z2subscript𝑍2Z_{2}italic_Z start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT topologically ordered phase from unbiased infinite projected entangled-pair state simulations, Physical Review B 101, 10.1103/physrevb.101.115143 (2020).
- R. J. Baxter, Variational approximations for square lattice models in statistical mechanics, Journal of Statistical Physics 19, 461 (1978).
- R. J. Baxter, Exactly solved models in statistical mechanics (1982).
- T. Nishino and K. Okunishi, Corner Transfer Matrix Renormalization Group Method, J. Phys. Soc. Jpn. 65, 891 (1996).
- M. Levin and C. P. Nave, Tensor Renormalization Group Approach to Two-Dimensional Classical Lattice Models, Phys. Rev. Lett. 99, 120601 (2007).
- H. C. Jiang, Z. Y. Weng, and T. Xiang, Accurate Determination of Tensor Network State of Quantum Lattice Models in Two Dimensions, Phys. Rev. Lett. 101, 090603 (2008).
- J. Dziarmaga, Time evolution of an infinite projected entangled pair state: Neighborhood tensor update, Phys. Rev. B 104, 094411 (2021).
- P. Corboz, Variational optimization with infinite projected entangled-pair states, Phys. Rev. B 94, 035133 (2016b).
- J. Hasik, D. Poilblanc, and F. Becca, Investigation of the Néel phase of the frustrated Heisenberg antiferromagnet by differentiable symmetric tensor networks, SciPost Phys. 10, 012 (2021).
- B. Christianson, Reverse accumulation and attractive fixed points, Optimization Methods and Software 3, 311 (1994), https://doi.org/10.1080/10556789408805572 .
- J.-Y. Chen and D. Poilblanc, Topological ℤ2subscriptnormal-ℤ2{\mathbb{Z}}_{2}roman_ℤ start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT resonating-valence-bond spin liquid on the square lattice, Phys. Rev. B 97, 161107 (2018).
- Z.-Q. Wan and S.-X. Zhang, Automatic Differentiation for Complex Valued SVD, (2019), arXiv:1909.02659 .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.