Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.09546 · Physical review. B./Physical review. B

Accelerating two-dimensional tensor network optimization by preconditioning

Xing-Yu Zhang, Qi Yang, Philippe Corboz, Jutho Haegeman, Wei Tang

Published Feb 13, 2026• 3 citations
arXivHTMLPDF

Abstract

We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), 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.

DOI
10.1103/h396-yc28

Related papers

Variational optimization with infinite projected entangled-pair states

Philippe Corboz

An infinite projected entangled-pair state (iPEPS) is a powerful variational tensor network ansatz for two-dimensional ground states in the thermodynamic limit, and can be seen as a natural generalization of a matrix-product state to two dimensions. One of the main challenges in iPEPS simulations is the optimization of the tensors, i.e., finding the optimal variational parameters, in order to have the best representation of the ground state of a given Hamiltonian. The author presents a variational optimization scheme, in which the energy is minimized in an iterative way by sweeping over all the tensors in the ansatz, in a similar spirit as done in the density-matrix renormalization group method. Benchmark results for challenging problems are presented that show that the variational scheme yields considerably more accurate results than the previously best imaginary-time evolution algorithm, with a similar computational cost and with a faster convergence towards the ground state.

arXiv:1605.03006•Physical review. B./Physical review. B•Jul 14, 2016•234 citations

Implicit differentiation of tensor network algorithms

Lander Burgelman, Anna Francuz, Paul Brehmer +4 more

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.

quant-pharXiv:2607.15030•Jul 17, 2026•0 citations

Simulation of three-dimensional quantum systems with projected entangled-pair states

Patrick C. G. Vlaar, Philippe Corboz

Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because the efficient contraction of a 3D tensor network is very challenging. In this paper, we develop and benchmark two contraction approaches for infinite projected entangled-pair states (iPEPS) in 3D. The first approach is based on a contraction of a finite cluster of tensors including an effective environment to approximate the full 3D network. The second approach performs a full contraction of the network by first iteratively contracting layers of the network with a boundary iPEPS, followed by a contraction of the resulting quasi-2D network using the corner transfer matrix renormalization group. Benchmark data for the Heisenberg and Bose-Hubbard models on the cubic lattice show that the algorithms provide competitive results compared to other approaches, making iPEPS a promising tool to study challenging open problems in 3D.

arXiv:2102.06715•Physical review. B./Physical review. B•May 19, 2021•38 citations

Towards next-generation methods to optimize two-dimensional tensor networks: Algorithmic differentiation and applications to quantum magnets

Juraj Hašík

Infinite Projected entangled-pair state (iPEPS) is a two-dimensional tensor network (TN) ansatz targeting the ground states of lattice models directly in the thermodynamic limit. It is the most successful among the true two-dimensional TN methods, challenging the more common density matrix renormalization group computations conducted on a finite-width cylinders. iPEPS, being a variational method does not suffer from the infamous sign problem, and hence could be readily applied to both fermionic problems off the half-filling and frustrated spin system. Using the imaginary-time optimization, the so called Full Update, led to the celebrated results of iPEPS such as the analysis of stripes in doped t-J and Hubbard models or the insight into the magnetization plateaus in Shastry-Sutherland model. However, the physics of the continuous phase transitions from the symmetry-broken Neel phase into the valence-bond solids or spin-liquids in frustrated magnets is still eluding iPEPS. The main difficulty lies in the optimization, since Full Update is just not precise enough. In the pursuit of the best variational iPEPS states, the gradient methods were put forward in 2016 by Corboz and Vanderstraeten. However, due to their complex nature, they have not been widely adopted especially for iPEPS ansatze with larger unit cells. We will introduce an alternative approach first applied in the context of iPEPS by Liao et al., based on the well established method of Algorithmic differentiation (AD) which allows us to evaluate gradients for iPEPS in a robust and conceptually simple way. Finally, we will present the results of our investigation into the physics of frustrated magnets putting AD to work.

•Oct 25, 2019•3 citations

Infinite projected entangled pair states algorithm improved: Fast full update and gauge fixing

Ho N. Phien, Johann A. Bengua, Hoang Duong Tuan +2 more

The infinite projected entangled pair states (iPEPS) algorithm [J. Jordan et al., Phys. Rev. Lett. 101, 250602 (2008)] has become a useful tool in the calculation of ground-state properties of two-dimensional quantum lattice systems in the thermodynamic limit. Despite its many successful implementations, the method has some limitations in its present formulation which hinder its application to some highly entangled systems. The purpose of this paper is to unravel some of these issues, in turn enhancing the stability and efficiency of iPEPS methods. For this, we first introduce the fast full update scheme, where effective environment and iPEPS tensors are both simultaneously updated (or evolved) throughout time. As we shall show, this implies two crucial advantages: (i) dramatic computational savings and (ii) improved overall stability. In addition, we extend the application of the local gauge fixing, successfully implemented for finite-size PEPS [M. Lubasch et al., Phys. Rev. B 90, 064425 (2014)], to the iPEPS algorithm. We see that the gauge fixing not only further improves the stability of the method but also accelerates the convergence of the alternating least-squares sweeping in the (either ``full'' or ``fast full'') tensor update scheme. The improvement in terms of computational cost and stability of the resulting ``improved'' iPEPS algorithm is benchmarked by studying the ground-state properties of the quantum Heisenberg and transverse-field Ising models on an infinite square lattice.

arXiv:1503.05345•Physical Review B•Jul 24, 2015•226 citations

Efficient optimization of variational tensor-network approach to three-dimensional statistical systems

Xiaze Xu, Tong-Yu Lin, Guang-Ming Zhang

Variational tensor network optimization has become a powerful tool for studying classical statistical models in two dimensions. However, its application to three-dimensional systems remains limited, primarily due to the high computational cost associated with evaluating the free-energy density and its gradient. This process requires contracting a triple-layer tensor network composed of a projected entangled pair operator and projected entangled pair states. In this paper, we employ a split corner-transfer renormalization group scheme tailored for the contraction of such a triple-layer network, which reduces the computational complexity while keeping high accuracy. Through numerical benchmarks on the three-dimensional classical Ising model, we demonstrate that the proposed scheme achieves numerical results comparable to the most recent Monte Carlo simulations, providing a substantial speedup over previous variational tensor network approaches. This makes this method well-suited for efficient gradient-based optimization in three-dimensional tensor network simulations.

arXiv:2506.19339•Physical review. B./Physical review. B•Sep 18, 2025•2 citations
We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), 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.
An infinite projected entangled-pair state (iPEPS) is a powerful variational tensor network ansatz for two-dimensional ground states in the thermodynamic limit, and can be seen as a natural generalization of a matrix-product state to two dimensions. One of the main challenges in iPEPS simulations is the optimization of the tensors, i.e., finding the optimal variational parameters, in order to have the best representation of the ground state of a given Hamiltonian. The author presents a variational optimization scheme, in which the energy is minimized in an iterative way by sweeping over all the tensors in the ansatz, in a similar spirit as done in the density-matrix renormalization group method. Benchmark results for challenging problems are presented that show that the variational scheme yields considerably more accurate results than the previously best imaginary-time evolution algorithm, with a similar computational cost and with a faster convergence towards the ground state.
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.
Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because the efficient contraction of a 3D tensor network is very challenging. In this paper, we develop and benchmark two contraction approaches for infinite projected entangled-pair states (iPEPS) in 3D. The first approach is based on a contraction of a finite cluster of tensors including an effective environment to approximate the full 3D network. The second approach performs a full contraction of the network by first iteratively contracting layers of the network with a boundary iPEPS, followed by a contraction of the resulting quasi-2D network using the corner transfer matrix renormalization group. Benchmark data for the Heisenberg and Bose-Hubbard models on the cubic lattice show that the algorithms provide competitive results compared to other approaches, making iPEPS a promising tool to study challenging open problems in 3D.
Infinite Projected entangled-pair state (iPEPS) is a two-dimensional tensor network (TN) ansatz targeting the ground states of lattice models directly in the thermodynamic limit. It is the most successful among the true two-dimensional TN methods, challenging the more common density matrix renormalization group computations conducted on a finite-width cylinders. iPEPS, being a variational method does not suffer from the infamous sign problem, and hence could be readily applied to both fermionic problems off the half-filling and frustrated spin system. Using the imaginary-time optimization, the so called Full Update, led to the celebrated results of iPEPS such as the analysis of stripes in doped t-J and Hubbard models or the insight into the magnetization plateaus in Shastry-Sutherland model. However, the physics of the continuous phase transitions from the symmetry-broken Neel phase into the valence-bond solids or spin-liquids in frustrated magnets is still eluding iPEPS. The main difficulty lies in the optimization, since Full Update is just not precise enough. In the pursuit of the best variational iPEPS states, the gradient methods were put forward in 2016 by Corboz and Vanderstraeten. However, due to their complex nature, they have not been widely adopted especially for iPEPS ansatze with larger unit cells. We will introduce an alternative approach first applied in the context of iPEPS by Liao et al., based on the well established method of Algorithmic differentiation (AD) which allows us to evaluate gradients for iPEPS in a robust and conceptually simple way. Finally, we will present the results of our investigation into the physics of frustrated magnets putting AD to work.
The infinite projected entangled pair states (iPEPS) algorithm [J. Jordan et al., Phys. Rev. Lett. 101, 250602 (2008)] has become a useful tool in the calculation of ground-state properties of two-dimensional quantum lattice systems in the thermodynamic limit. Despite its many successful implementations, the method has some limitations in its present formulation which hinder its application to some highly entangled systems. The purpose of this paper is to unravel some of these issues, in turn enhancing the stability and efficiency of iPEPS methods. For this, we first introduce the fast full update scheme, where effective environment and iPEPS tensors are both simultaneously updated (or evolved) throughout time. As we shall show, this implies two crucial advantages: (i) dramatic computational savings and (ii) improved overall stability. In addition, we extend the application of the local gauge fixing, successfully implemented for finite-size PEPS [M. Lubasch et al., Phys. Rev. B 90, 064425 (2014)], to the iPEPS algorithm. We see that the gauge fixing not only further improves the stability of the method but also accelerates the convergence of the alternating least-squares sweeping in the (either ``full'' or ``fast full'') tensor update scheme. The improvement in terms of computational cost and stability of the resulting ``improved'' iPEPS algorithm is benchmarked by studying the ground-state properties of the quantum Heisenberg and transverse-field Ising models on an infinite square lattice.
Variational tensor network optimization has become a powerful tool for studying classical statistical models in two dimensions. However, its application to three-dimensional systems remains limited, primarily due to the high computational cost associated with evaluating the free-energy density and its gradient. This process requires contracting a triple-layer tensor network composed of a projected entangled pair operator and projected entangled pair states. In this paper, we employ a split corner-transfer renormalization group scheme tailored for the contraction of such a triple-layer network, which reduces the computational complexity while keeping high accuracy. Through numerical benchmarks on the three-dimensional classical Ising model, we demonstrate that the proposed scheme achieves numerical results comparable to the most recent Monte Carlo simulations, providing a substantial speedup over previous variational tensor network approaches. This makes this method well-suited for efficient gradient-based optimization in three-dimensional tensor network simulations.