Accelerating two-dimensional tensor network optimization by preconditioning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908869797609472 |
|---|---|
| author | Zhang, Xing-Yu Yang, Qi Corboz, Philippe Haegeman, Jutho Tang, Wei |
| author_facet | Zhang, Xing-Yu Yang, Qi Corboz, Philippe Haegeman, Jutho Tang, Wei |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09546 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Accelerating two-dimensional tensor network optimization by preconditioning Zhang, Xing-Yu Yang, Qi Corboz, Philippe Haegeman, Jutho Tang, Wei Strongly Correlated Electrons Statistical Mechanics Computational Physics 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. |
| title | Accelerating two-dimensional tensor network optimization by preconditioning |
| topic | Strongly Correlated Electrons Statistical Mechanics Computational Physics |
| url | https://arxiv.org/abs/2511.09546 |