Accelerating two-dimensional tensor network optimization by preconditioning
Phys. Rev. B 113, 125111 – Published 5 March, 2026
DOI: https://doi.org/10.1103/h396-yc28
Abstract
We revisit gradient-based optimization for infinite projected entangled-pair states, a tensor network ansatz for simulating many-body quantum systems. This approach is hindered by two major challenges: the high computational cost of evaluating energies and gradients, and an ill-conditioned optimization landscape that slows convergence. To reduce the number of optimization steps, we introduce an efficient preconditioner derived from the leading term of the metric tensor. We benchmark our method against standard optimization techniques on the Heisenberg and Kitaev models, demonstrating substantial improvements in overall computational efficiency. Our approach is broadly applicable across various contraction schemes, unit-cell sizes, and Hamiltonians, highlighting the potential of preconditioned optimization to advance tensor network algorithms for strongly correlated systems.
