Back to News
quantum-computing

Optimizing two-dimensional isometric tensor networks with quantum computers

Sebastian Leontica, Alberto Baiardi, Julian Schuhmacher, Francesco Tacchino, Ivano Tavernelli
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from IBM and ETH Zurich introduced a hybrid quantum-classical algorithm that optimizes 2D quantum systems using isometric tensor networks, reducing classical computational bottlenecks by leveraging quantum hardware. The method sequentially optimizes tensors via quantum diagonalization of effective Hamiltonians, inspired by density matrix renormalization group techniques, while avoiding exponential classical contraction costs. A tomography-based approach limits qubit requirements to bond dimension-dependent subsets, enabling ground-state calculations for 25-qubit systems with lower overhead than variational quantum eigensolvers. Demonstrated on the 2D transverse-field Ising model, the algorithm achieves accurate results in both noisy and fault-tolerant regimes, suggesting scalability for larger systems. This work bridges tensor networks and quantum computing, offering a practical path toward scalable variational algorithms for strongly correlated quantum systems.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.13827 (quant-ph) [Submitted on 17 Nov 2025] Title:Optimizing two-dimensional isometric tensor networks with quantum computers Authors:Sebastian Leontica, Alberto Baiardi, Julian Schuhmacher, Francesco Tacchino, Ivano Tavernelli View a PDF of the paper titled Optimizing two-dimensional isometric tensor networks with quantum computers, by Sebastian Leontica and 3 other authors View PDF HTML (experimental) 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. Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el) Cite as: arXiv:2511.13827 [quant-ph] (or arXiv:2511.13827v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.13827 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Sebastian Leontica [view email] [v1] Mon, 17 Nov 2025 19:00:03 UTC (1,033 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimizing two-dimensional isometric tensor networks with quantum computers, by Sebastian Leontica and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-11 Change to browse by: cond-mat cond-mat.str-el References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms
quantum-annealing
quantum-computing
quantum-hardware
quantum-machine-learning

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.