betaFeedback

WorksPhysics and Astronomy

Implicit differentiation of tensor network algorithms

Abstract

The current leading approach to the variational optimization of projected entangled-pair states (PEPS) is based on automatic differentiation, which allows for a convenient evaluation of the energy gradient with respect to the local variational degrees of freedom. However, evaluating the energy gradient not only remains a major computational bottleneck of the optimization procedure, but also suffers from frequent numerical instabilities. In this work, we adopt recent advances in implicit differentiation techniques to address these challenges in PEPS optimization. By reformulating the core step of the gradient computation in terms of a single characteristic equation for the contraction environment, we reduce the cost of the gradient computation and improve its scaling with the problem size. By choosing a suitable parametrization of this characteristic equation based on the intrinsic symmetries of the contraction environment, we can directly remove instabilities from the global gradient computation that would otherwise arise from the derivatives of subroutines of the contraction algorithm. Finally, we demonstrate how this approach drastically simplifies the practical implementation of stable gradient-based PEPS optimization.

Introduction

In recent decades, tensor networks have emerged as powerful computational [1, 2] and analytical [3] tools in the study of quantum and classical many-body systems. Following the success of the density matrix renormalization group (DMRG) [4, 5] for one-dimensional systems, which is now understood as a variational method over the class of matrix product states (MPS) [6, 7, 8], the ansatz was later extended to two dimensions with the invention of projected entangled-pair states (PEPS) [9]. Both are now successfully used across many areas of physics, from strongly correlated systems and quantum information to high-energy physics, with applications ranging from ground states and finite-temperature simulations to excited states and real-time evolution. Despite this broad applicability, PEPS methods remain significantly less utilized than MPS, owing to their higher computational complexity and challenges in their implementation. Among the most common applications of PEPS is the ground-state optimization of infinite translationally invariant systems [10, 11], where the state of the art is gradient-based variational optimization [12, 13].

The accurate computation of the energy gradient remains the main bottleneck in variational PEPS optimization, both in terms of computational cost and conceptual complexity. The energy itself can only be evaluated approximately, using an approximate contraction environment obtained from an iterative procedure such as the Corner Transfer Matrix Renormalization Group (CTMRG) [14, 15] or boundary matrix product state (boundary MPS) methods [16, 17, 18]. Consequently, when calculating the energy gradient, one needs to differentiate the procedure used to obtain this approximate environment. While early approaches relied on approximate schemes for the exact PEPS gradient [12, 13], the adoption of automatic differentiation (AD) enabled the computation of exact gradients of approximate PEPS contraction schemes [19], which consequently led to a growing number of applications of these techniques to relevant physical systems [20, 21, 22, 23, 24, 25, 26]. However, the direct application of AD tools leads to significant technical challenges that can be grouped into three categories: (i) efficiency, (ii) stability and (iii) ease of implementation.

First, even when using a state-of-the-art fixed-point formulation [19, 27, 28] that avoids the memory overhead of backpropagating through all individual iterations of the contraction procedure, the presence of iterative subroutines gives rise to a nested iterative procedure for the gradient computation that is computationally very costly. Second, AD-based PEPS optimization routinely suffers from numerical instabilities arising from the differentiation of subroutines used in the contraction algorithm [19]. Notably, these instabilities are purely artifacts of the differentiation procedure, whereas the actual energy gradient is entirely stable with respect to variations that cause them. Despite progress in formally addressing these issues in specific cases [29], the lack of a general solution often leads to heuristic workarounds. Finally, the conventional approach to AD-based PEPS optimization requires every primitive operation used in the energy evaluation to be compatible with an AD engine. This means that custom differentiation rules must be defined for every subroutine that is not natively supported – a process that can be laborious and limiting in practice.

In this work, we adopt implicit differentiation techniques [27, 30, 31] to address these three challenges. Instead of differentiating through each subroutine of the contraction algorithm, we reformulate the contraction result in terms of a single characteristic equation and differentiate only that. This approach (i) reduces the cost and scaling of the gradient computation with problem size, in some cases even reducing it to a subleading step in the overall optimization procedure; (ii) removes numerical instabilities by exploiting the symmetries of the contraction environment to construct stable parameterizations of derivatives; and (iii) greatly simplifies the implementation by completely removing the need for differentiable subroutines, as the characteristic equation is formulated using only tensor network contractions.

In practice, this implicit differentiation approach ultimately reduces to a single core routine: solving a system of linear equations obtained from the automatic differentiation of the algebraic characteristic equations. This core procedure is largely independent of the specific contraction algorithm. Different contraction schemes can be used by simply substituting the appropriate characteristic equations and variable parameterizations. Nevertheless, deriving the specific characteristic equations that can be solved efficiently and converge reliably when using iterative sparse linear solvers is highly non-trivial. Therefore, in this manuscript, we provide explicit forms of characteristic equations for the most commonly used PEPS contraction algorithms.

The structure of this work is as follows. We start in § 2 by formulating the general problem of variational PEPS optimization using AD. After introducing some notation and reviewing the well established fixed-point differentiation approach, we illustrate the core ideas behind our implicit differentiation approach in this general context. We proceed by demonstrating this approach for the specific case of PEPS optimization using CTMRG in systems with a spatial C4vC_{4v} symmetry in Section III. Based on the insights gained from this example, we illustrate a similar procedure for the two most commonly used general contraction schemes in Sections IV and § 6. We benchmark the performance of our approach in these different settings in Section VI, before concluding in § 8.

PEPS optimization and implicit differentiation

Given a quantum system defined on a translationally invariant square lattice with a local physical Hilbert space PP at each site, we can parametrize a state of this system as a PEPS by introducing a local rank-5 tensor

p:vW  vNvS  vE(1)p : v_W \; \begin{matrix} v_N \\ v_S \end{matrix} \; v_E \tag*{(1)}

as a multilinear map between the physical space PP and four virtual spaces VN,VE,VW,VSV_N,V_E,V_W,V_S corresponding to the four cardinal directions. The dimension of the virtual spaces, called the bond dimension DD, controls the amount of variational degrees of freedom contained in pp, and by extension, dictates the expressiveness of the ansatz. By tiling this tensor on an infinite square lattice and contracting all virtual indices, we can define a uniform PEPS obtained from pp as

∣ψ(p)⟩=uniform PEPS tensor-network contraction(2)\lvert\psi(p)\rangle= \text{uniform PEPS tensor-network contraction} \tag*{(2)}

While the arrows indicating the duality of the virtual spaces are important when working with (in particular, fermionic) symmetries, we will omit them from now on to lighten our notation. Similarly, while a general uniform PEPS can be composed of a unit cell of different tensors, we will restrict our notation to the single-site case in the following. All concepts and techniques can be generalized to the case of arbitrary unit cells.

Variational PEPS optimization

Given a Hamiltonian HH, a primary application of the PEPS ansatz is to find the best approximation of its ground state by minimizing the variational energy

p=argmin⁡p E(p)=argmin⁡p ⟨ψ(p)∣H∣ψ(p)⟩⟨ψ(p)∣ψ(p)⟩.(3)p = \underset{p}{\operatorname{argmin}}\,E(p) = \underset{p}{\operatorname{argmin}}\,\frac{\langle\psi(p)|H|\psi(p)\rangle}{\langle\psi(p)|\psi(p)\rangle}. \tag*{(3)}

For a Hamiltonian HH defined as a sum of local terms hh that act on a few neighboring sites, evaluating the energy expectation value requires computing quantities of the form

⟨ψ(p)∣h∣ψ(p)⟩=local tensor-network contraction(4)\langle\psi(p)|h|\psi(p)\rangle= \text{local tensor-network contraction} \tag*{(4)}

To evaluate this expression, we need a reliable way to represent the infinite parts of the norm network ⟨ψ(p)∣ψ(p)⟩\langle\psi(p)|\psi(p)\rangle in terms of an approximate contraction environment

infinite tensor network⟶finite contraction environment(5)\text{infinite tensor network} \longrightarrow\text{finite contraction environment} \tag*{(5)}

This contraction environment, denoted as xx and represented by the purple and green tensors in Eq. (5), implicitly depends on the variational degrees of freedom, x≡x(p)x \equiv x(p). It provides an approximation of the infinite lattice, whose accuracy is controlled by the environment bond dimension χ\chi. The two most common algorithms for obtaining such an environment are the corner transfer matrix renormalization group (CTMRG) [14, 15] and the boundary matrix product state (boundary MPS) [17, 18] algorithms. Both algorithms will be considered in this work.

Armed with an approximate contraction environment xx, we can reformulate the variational problem for the total energy EE of Eq. (3) in terms of an approximate energy density ee, which takes the form

e(x,p)=tensor-network contraction(6)e(x,p) = \text{tensor-network contraction} \tag*{(6)}

To optimize this approximate energy density, we can compute its gradient with respect to the variational parameters pp and use a gradient-based optimization scheme such as the quasi-Newton L-BFGS algorithm [32]. Using the chain rule, we can write the gradient as a sum of two terms corresponding to the explicit dependence of ee on xx and pp respectively,

dedp(p)=∂xe(x,p) ∂px+∂pe(x,p).(7)\frac{\mathrm{d}e}{\mathrm{d}p}(p) = \partial_x e(x,p)\,\partial_p x + \partial_p e(x,p). \tag*{(7)}

The key step of a good PEPS algorithm is the practical evaluation of the first term on the right-hand side, which encodes the contribution to the total gradient arising from the dependence of the environment xx on the variational parameters pp. In this work, we will perform this key step using implicit differentiation.

Adopting some common notation in the context of AD, an introduction to which can be found in Section A, we can rewrite Eq. (7) in terms of the adjoint variables corresponding to the contraction environment and variational parameters, defined as x~=∂xe\tilde{x} = \partial_x e and p~=∂pe\tilde{p} = \partial_p e respectively [33], which yields

dedp=x~ ∂px+p~.(8)\frac{\mathrm{d}e}{\mathrm{d}p} = \tilde{x}\,\partial_p x + \tilde{p}. \tag*{(8)}

In this form, we see that the key operation in the gradient computation is the left action of the Jacobian ∂px\partial_p x on the adjoint x~\tilde{x}, known as a vector-Jacobian product or VJP. This VJP can be evaluated using a straightforward reverse-mode AD approach [19], backpropagating through each primitive operation in the computational graph in reverse order. This approach, however, requires a significant memory overhead and can suffer from instabilities of the primitive subroutines used in the algorithm, such as eigenvalue or singular value decompositions.

The key to reducing this memory overhead is to derive the VJP action of ∂px\partial_p x based on an implicit characterization of the contraction environment xx. We first review the simplest application of this idea, namely fixed-point differentiation [19, 28, 29], to introduce the necessary notation and highlight remaining difficulties with this approach. We then proceed to the general formulation of implicit differentiation of a contraction algorithm in terms of set of purely algebraic characteristic equations.

For clarity, we restrict our notation in the main text to the setting of real variables. However, all results extend straightforwardly to the complex case. A more rigorous treatment of real-valued cost functions of complex variables can be found in Section A.

Fixed-point differentiation

A general contraction algorithm corresponds to an iterative procedure where we successively apply an iterating function ff starting from an initial guess x0x_0 for the environment, until convergence is reached. In fixed-point differentiation [19, 28, 29], we characterize the convergence of the contraction environment in terms of the fixed-point equation

x=f(x,p),(9)x = f(x,p), \tag*{(9)}

whose solution will be denoted as x∗x^*. Applying the implicit function theorem to this equation [27] by differentiating both sides at this solution yields

∂px=∂xf ∂px+∂pf.(10)\partial_p x = \partial_x f\,\partial_p x + \partial_p f. \tag*{(10)}

This allows us to write the VJP action of ∂px\partial_p x as

x~ ∂px=x~(1−∂xf)−1∂pf.(11)\tilde{x}\,\partial_p x = \tilde{x}(1-\partial_x f)^{-1}\partial_p f. \tag*{(11)}

Importantly, the VJP actions of ∂xf\partial_x f and ∂pf\partial_p f in this expression are evaluated only at the fixed-point solution (x∗,p)(x^*,p). This means there is no need to keep track of any intermediate objects, solving the problem of the memory overhead encountered in straightforward reverse-mode AD.

To evaluate Eq. (11) in practice, we can first compute an intermediate object F~\tilde{F} as the solution to the linear problem

F~(∂xf−1)=x~.(12)\tilde{F}(\partial_x f-\mathbb{1}) = \tilde{x}. \tag*{(12)}

This system can be solved using any standard linear solver such as GMRES or BiCGSTAB. Subsequently, we can plug this into the VJP action of ∂pf\partial_p f to obtain the desired result as

x~ ∂px=−F~ ∂pf.(13)\tilde{x}\,\partial_p x = -\tilde{F}\,\partial_p f. \tag*{(13)}

It is important to note that in order to use fixed-point differentiation, it is necessary that the fixed-point equation Eq. (9) is satisfied element-wise. This means that f(x∗,p)f(x^*,p) produces tensors whose elements are all equal to those of x∗x^* within the convergence tolerance of the algorithm. However, in practical implementations, Eq. (9) is usually only satisfied up to allowed gauge transformations on the output of ff. This means that, in order to ensure element-wise convergence, any additional gauge freedom in the action of ff needs to be fixed explicitly using a suitable method [29].

While fixed-point differentiation resolves the memory overhead issue, it still requires the VJP actions of ∂xf\partial_x f and ∂pf\partial_p f. Obtaining these automatically via AD requires the function ff with all its subroutines to be fully differentiable. In addition, the aforementioned instabilities in these primitive VJP actions can lead to instabilities in the overall gradient computation. The fixed-point gradient linear problem Eq. (12) is particularly susceptible to this.

Aside from these issues, a further motivation for going beyond fixed-point differentiation lies in the internal complexity of the iterating function ff. In most two-dimensional contraction schemes, ff is itself composed of iterative subroutines, such as sparse singular value decomposition or eigensolvers. Crucially, evaluating the VJP corresponding to such an iterative subroutine requires solving a linear problem of the same nature as Eq. (12), and more importantly of a similar size. Therefore, when applied to the specific setting of contraction algorithms with iterative subroutines, the core linear problem in fixed-point differentiation becomes nested. Namely, for every function evaluation in the outer linear problem Eq. (12), we have to solve an inner linear problem of a similar size.

Extending the idea of implicit differentiation beyond the fixed-point condition of Eq. (9) enables us to solve all of the remaining issues simultaneously.

Implicit differentiation

While characterizing the converged contraction environment x∗x^* as a fixed point of the iterating function ff is a natural choice, any implicit characterization could in principle be used. In this framework, the solution to an optimization problem is implicitly defined as a root of an algebraic characteristic equation, which expresses the desired optimality conditions [31].

This more abstract viewpoint allows us to “forget” about how x∗x^* was computed, and instead just focus on the conditions that characterize it. In particular, if the optimality conditions characterizing x∗x^* are formulated as a single set of algebraic equations without iterative subroutines, the VJP action of ∂px\partial_p x can in turn be evaluated in terms of a single un-nested linear problem. In addition, the flexibility in choosing the characteristic equations allows us to exploit the symmetries of the contraction algorithm. In particular, we can choose a parametrization of the equations specifically such that any instabilities that would arise from subroutines are completely removed from the global gradient computation. Finally, to implement implicit differentiation in practice, we only need to be able to differentiate the characteristic equations themselves. This is much easier than ensuring that the contraction algorithm as a whole is differentiable in a stable way.

Concretely, we will formulate implicit differentiation of a contraction algorithm in terms of a differentiable function F(y,p)F(y,p) acting on a set of environment variables yy that implicitly depend on the variational parameters pp, y=y(p)y=y(p). The function FF is chosen such that the convergence of the environment corresponds to the solution of the characteristic equation

F(y,p)=0.(14)F(y,p)=0. \tag*{(14)}

We will refer to the solution y∗y^* of this condition as the root of the characteristic equation. Here, we denote the variables representing the environment as yy rather than xx, to emphasize that the characteristic equation can use a parametrization that is different from the one used in the iterating function. In particular, this new set of variables yy may be expanded to include intermediate variables appearing in the iterating function, not only its final output xx. In practice, in the subsequent examples we will always introduce a simple and explicit map from the custom parametrization to the original environment variables y↦xy\mapsto x from which we immediately obtain the corresponding map y˙↦x˙\dot{y}\mapsto\dot{x} for the adjoints. In particular, it will always be clear that the root y∗y^* of Eq. (14) is exactly equivalent to the fixed-point environment x∗x^*. In this formulation, the gradient computation Eq. (8) reduces to evaluating the VJP y˙ ∂py\dot{y}\,\partial_p y, since x˙∂px=y˙∂py\dot{x}\partial_p x=\dot{y}\partial_p y.

Differentiating the characteristic equation Eq. (14) at the root y∗y^* yields

∂yF ∂py=−∂pF.(15)\partial_y F\,\partial_p y=-\partial_p F. \tag*{(15)}

From this, we obtain the VJP action of ∂px\partial_p x as

y˙ ∂py=y˙ (∂yF)−1(−∂pF).(16)\dot{y}\,\partial_p y=\dot{y}\,(\partial_y F)^{-1}(-\partial_p F). \tag*{(16)}

Just as before, we can evaluate Eq. (16) by computing an intermediate object F~\tilde{F} as the solution to the linear problem

F~ ∂yF=y˙,(17)\tilde{F}\,\partial_y F=\dot{y}, \tag*{(17)}

from which we can obtain the desired VJP action as

y˙ ∂py=−F~ ∂pF.(18)\dot{y}\,\partial_p y=-\tilde{F}\,\partial_p F. \tag*{(18)}

In particular, this approach reduces to the fixed-point differentiation approach outlined before when we choose y=xy=x and F(x,p)=f(x,p)−xF(x,p)=f(x,p)-x.

Algorithmically, the implicit differentiation approach can be summarized as follows. First, the reverse-mode AD engine is called to backpropagate through the energy evaluation as described in Algorithm 1. While in the forward pass we contract the PEPS environment to obtain an energy value, in the reverse pass the contraction function is differentiated to accumulate the energy gradient. Precisely in this reverse pass, in Algorithm 2, we implement the implicit differentiation technique using Eqs. (17) and (18). We note that an explicit gauge-fixing step may need to be performed such that the optimality conditions F(y,p)F(y,p) are indeed fulfilled at the fixed point, as will be pointed out in the forthcoming examples.

Algorithm 1Energy evaluation and gradient
Require:PEPS tensor pp, Hamiltonian HH, initial environment x0x_0
1:function energy(p,x0,Hp,x_0,H)
2:p←symmetrize⁡(p)p \leftarrow\operatorname{symmetrize}(p) ▷ if C4vC_{4v}-symmetric
3:x←contract⁡(p,x0)x \leftarrow\operatorname{contract}(p,x_0) ▷ Algorithm 2
4:return e(p,x,H)e(p,x,H) ▷ Eq. (6)
5:E,dedp←backpropagate⁡(energy⁡,p,x0,H)E,\frac{\mathrm{d}e}{\mathrm{d}p} \leftarrow\operatorname{backpropagate}(\operatorname{energy},p,x_0,H)

Table 1.

References

  1. [1]R. Orús, Tensor networks for complex quantum systems, Nat. Rev. Phys. 1, 538–550 (2019).DOI
  2. [2]M. C. Baňuls, Tensor Network Algorithms: A Route Map, Annu. Rev. Condens. Matter Phys. 14, 173–191 (2023).DOI
  3. [3]J. I. Cirac, D. Pérez-García, N. Schuch, and F. Verstraete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys. 93, 045003 (2021).DOI
  4. [4]S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).pubmed.ncbi.nlm.nih.gov/10046608
  5. [5]S. R. White, Density-matrix algorithms for quantum renormalization groups, Phys. Rev. B 48, 10345 (1993).pubmed.ncbi.nlm.nih.gov/10007313
  6. [6]F. Verstraete, D. Porras, and J. I. Cirac, Density Matrix Renormalization Group and Periodic Boundary Conditions: A Quantum Information Perspective, Phys. Rev. Lett. 93, 227205 (2004).pubmed.ncbi.nlm.nih.gov/15601115
  7. [7]U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. (N.Y.) 326, 96 (2011).DOI
  8. [8]S. Östlund and S. Rommer, Thermodynamic Limit of Density Matrix Renormalization, Phys. Rev. Lett. 75, 3537 (1995).pubmed.ncbi.nlm.nih.gov/10059611
  9. [9]F. Verstraete and J. I. Cirac, Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions (2004), arXiv:cond-mat/0407066.DOI
  10. [10]J. Jordan, R. Orús, G. Vidal, F. Verstraete, and J. I. Cirac, Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions, Phys. Rev. Lett. 101, 250602 (2008).pubmed.ncbi.nlm.nih.gov/19113687
  11. [11]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).
  12. [12]P. Corboz, Variational optimization with infinite projected entangled-pair states, Phys. Rev. B 94, 035133 (2016).DOI
  13. [13]L. Vanderstraeten, J. Haegeman, P. Corboz, and F. Verstraete, Gradient methods for variational optimization of projected entangled-pair states, Phys. Rev. B 94, 155123 (2016).DOI
  14. [14]T. Nishino and K. Okunishi, Corner Transfer Matrix Renormalization Group Method, J. Phys. Soc. Jpn. 65, 891 (1996).DOI
  15. [15]R. Orús and G. Vidal, Simulation of two-dimensional quantum systems on an infinite lattice revisited: Corner transfer matrix for tensor contraction, Phys. Rev. B 80, 094403 (2009).DOI
  16. [16]J. Jordan, R. Orús, G. Vidal, F. Verstraete, and J. I. Cirac, Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions, Phys. Rev. Lett. 101, 250602 (2008).pubmed.ncbi.nlm.nih.gov/19113687
  17. [17]J. Haegeman and F. Verstraete, Diagonalizing Transfer Matrices and Matrix Product Operators: A Medley of Exact and Computational Methods, Annu. Rev. Condens. Matter Phys. 8, 355 (2017).DOI
  18. [18]V. Zauner-Stauber, L. Vanderstraeten, M. T. Fishman, F. Verstraete, and J. Haegeman, Variational optimization algorithms for uniform matrix product states, Phys. Rev. B 97, 045145 (2018).
  19. [19]H.-J. Liao, J.-G. Liu, L. Wang, and T. Xiang, Differentiable Programming Tensor Networks, Phys. Rev. X 9, 031041 (2019).DOI
  20. [20]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).DOI
  21. [21]B. Ponsioen, F. F. Assaad, and P. Corboz, Automatic differentiation applied to excitations with projected entangled pair states, SciPost Phys. 12, 006 (2022).DOI
  22. [22]S. Niu, J. Hasik, J.-Y. Chen, and D. Poilblanc, Chiral spin liquids on the kagome lattice with projected entangled simplex states, Phys. Rev. B 106, 245119 (2022).
  23. [23]X.-Y. Zhang, S. Liang, H.-J. Liao, W. Li, and L. Wang, Differentiable programming tensor networks for Kitaev magnets, Phys. Rev. B 108, 085103 (2023).DOI
  24. [24]Y. He, R. Rausch, M. Peschke, C. Karrasch, P. Corboz, N. Bultinck, and S. A. Parameswaran, Itinerant magnetism in the triangular-lattice Hubbard model at half doping: Application to twisted transition metal dichalcogenides, Phys. Rev. B 113, L041107 (2026).DOI
  25. [25]J. Hu, R. Chi, Y. Guo, B. Normand, H.-J. Liao, and T. Xiang, Dynamical Spectral Function of the Kagome Quantum Spin Liquid (2025), arXiv:2512.18831.DOI
  26. [26]H. Chen, T. Neupert, and J. Hasik, Simulating fermionic fractional Chern insulators with infinite projected entangled-pair states (2026), arXiv:2512.20697.DOI
  27. [27]B. Christianson, Reverse accumulation and attractive fixed points, Optim. Methods Softw. 3, 311 (1994).DOI
  28. [28]J. Naumann, E. L. Weerda, M. Rizzi, J. Eisert, and P. Schroll, An introduction to infinite projected entangled-pair state methods for variational ground state simulations using automatic differentiation, SciPost Phys. Lect. Notes 86 (2024).
  29. [29]A. Francuz, N. Schuch, and B. Vanhecke, Stable and efficient differentiation of tensor network algorithms, Phys. Rev. Res. 7, 013237 (2025).DOI
  30. [30]A. V. Fiacco, Sensitivity analysis for nonlinear programming using penalty methods, Math. Program. 10, 287 (1976).DOI
  31. [31]M. Blondel, Q. Berthet, M. Cuturi, R. Frostig, S. Hoyer, F. Llinares-López, F. Pedregosa, and J.-P. Vert, Efficient and Modular Implicit Differentiation (2022), arXiv:2105.15183.arxiv.org/abs/2105.15183
  32. [32]J. Nocedal and S. J. Wright, Numerical Optimization, Springer Series in Operations Research and Financial Engineering (Springer New York, 2006).
  33. [33]Here we have chosen to denote adjoints as x̃ as opposed to the more conventional bar-notation x̄, to avoid confusion with our notation for complex conjugation of tensors.
  34. [34]M. B. Giles, Collected Matrix Derivative Results for Forward and Reverse Mode Algorithmic Differentiation, in Advances in Automatic Differentiation (Springer Berlin Heidelberg, 2008) pp. 35–44.DOI
  35. [35]L. Vanderstraeten, L. Burgelman, B. Ponsioen, M. Van Damme, B. Vanhecke, P. Corboz, J. Haegeman, and F. Verstraete, Variational methods for contracting projected entangled-pair states, Phys. Rev. B 105, 195140 (2022).DOI
  36. [36]A. Nietner, B. Vanhecke, F. Verstraete, J. Eisert, and L. Vanderstraeten, Efficient variational contraction of two-dimensional tensor networks with a non-trivial unit cell, Quantum 4, 328 (2020).DOI
  37. [37]M. Hauru, M. Van Damme, and J. Haegeman, Riemannian optimization of isometric tensor networks, SciPost Phys. 10, 040 (2021).DOI
  38. [38]Y. Zhang, Q. Yang, and P. Corboz, Accelerating two-dimensional tensor network contractions using QR-decompositions (2025), arXiv:2505.00494.DOI
  39. [39]L. Hodgkiss, L. Lootens, J. Ueda, B. Vanhecke, and F. Verstraete, On the origin of finite entanglement scaling, in preparation (2026).arxiv.org/abs/2607.15124
  40. [40]B. Vanhecke, M. Van Damme, J. Haegeman, L. Vanderstraeten, and F. Verstraete, Tangent-space methods for truncating uniform MPS, SciPost Phys. Core 4 (2021).arxiv.org/abs/2001.11882
  41. [41]L. Vanderstraeten, J. Haegeman, and F. Verstraete, Tangent-space methods for uniform matrix product states, SciPost Phys. Lect. Notes 7 (2019).DOI
  42. [42]P. Corboz, J. Jordan, and G. Vidal, Simulation of fermionic lattice models in two dimensions with projected entangled-pair states: Next-nearest neighbor hamiltonians, Phys. Rev. B 82, 245119 (2010).DOI
  43. [43]P. Brehmer, L. Burgelman, Z.-Y. Yue, G. Fedorovich, J. Haegeman, and L. Devos, PEPSKit.jl: A Julia package for projected entangled-pair state simulations (2026), arXiv:2605.19960.arxiv.org/abs/2605.19960
  44. [44]L. Devos, M. Van Damme, and J. Haegeman, MPSKit.jl, Zenodo (2026).
  45. [45]L. Devos and J. Haegeman, TensorKit.jl: A Julia package for large-scale tensor computations, with a hint of category theory (2025), arXiv:2508.10076.arxiv.org/abs/2508.10076
  46. [46]L. Burgelman and P. Brehmer, ImplicitDifferentiationPEPS.jl, https://github.com/leburgel/ImplicitDifferentiationPEPS.jl (2026).
  47. [47]Some implementations evaluate the Sylvester equation in the pullback using the LAPACK-based Bartels–Stewart algorithm [54]. However, significantly improved performance can be achieved already at moderate dimensions by solving the Sylvester equation using appropriately pre-conditioned Krylov-based iterative methods [29] such as GMRES.
  48. [48]L. Vanderstraeten, J. Haegeman, and F. Verstraete, Simulating excitation spectra with projected entangled-pair states, Phys. Rev. B 99, 165121 (2019).DOI
  49. [49]B. N. C. Pfeifer, G. Evenbly, S. Singh, and G. Vidal, NCON: A tensor network contractor for MATLAB (2015), arXiv:1402.0939.arxiv.org/abs/1402.0939
  50. [50]As an alternative to the approach outlined here, one could incorporate complex numbers into AD by treating all variables and their complex conjugates as separate degrees of freedom. This approach is entirely equivalent, and can even be implemented by only tracking the adjoint variables as defined above.
  51. [51]M. T. Fishman, L. Vanderstraeten, V. Zauner-Stauber, J. Haegeman, and F. Verstraete, Faster methods for contracting infinite two-dimensional tensor networks, Phys. Rev. B 98, 235148 (2018).DOI
  52. [53]P. Corboz, S. R. White, G. Vidal, and M. Troyer, Stripes in the two-dimensional t-J model with infinite projected entangled-pair states, Phys. Rev. B 84, 041108 (2011).DOI

Paper details

vlnc:W_ykktvanc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents