Optimizing two-dimensional isometric tensor networks with quantum computers
Abstract
We propose a hybrid quantum-classical algorithm for approximating the ground state of two-dimensional quantum systems using an isometric tensor network ansatz, which maps naturally to quantum circuits. Inspired by the density matrix renormalization group, we optimize tensors sequentially by diagonalizing a series of effective Hamiltonians. These are constructed using a tomography-inspired method on a qubit subset whose size depends only on the bond dimension. Our approach leverages quantum computers to enable accurate solutions without relying on approximate contractions, circumventing the exponential complexity faced by classical techniques. We demonstrate our method on the two-dimensional (2D) transverse-field Ising model, achieving ground-state optimization on up to 25 qubits with modest quantum overhead -- significantly less than standard solutions based on variational quantum eigensolvers. Overall, our results offer a path towards scalable variational quantum algorithms in both noisy and fault-tolerant regimes.
Cite
@article{arxiv.2511.13827,
title = {Optimizing two-dimensional isometric tensor networks with quantum computers},
author = {Sebastian Leontica and Alberto Baiardi and Julian Schuhmacher and Francesco Tacchino and Ivano Tavernelli},
journal= {arXiv preprint arXiv:2511.13827},
year = {2025}
}