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:2011.08200 · Physical Review Letters

Efficient Tensor Network Ansatz for High-Dimensional Quantum Many-Body Problems

Timo Felser, Simone Notarnicola, Simone Montangero

Published Apr 29, 2021• 61 citations
arXivHTMLPDF

Abstract

We introduce a novel tensor network structure augmenting the well-established tree tensor network representation of a quantum many-body wave function. The new structure satisfies the area law in high dimensions remaining efficiently manipulatable and scalable. We benchmark this novel approach against paradigmatic two-dimensional spin models demonstrating unprecedented precision and system sizes. Finally, we compute the ground state phase diagram of two-dimensional lattice Rydberg atoms in optical tweezers observing nontrivial phases and quantum phase transitions, providing realistic benchmarks for current and future two-dimensional quantum simulations.

DOI
10.1103/physrevlett.126.170603

Related papers

Simulation of two-dimensional quantum systems using a tree tensor network: entropic area law at work

Luca Tagliacozzo, Glen Evenbly, Guifré Vidal

This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasi-exact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an optimization algorithm to accurately approximate ground states and apply it to the quantum Ising model on a torus of L X L sites for L= {4,6,8}. Approximate results for larger lattices are also obtained. As an application of the approach, we analyse the scaling of the ground state entropy at the quantum critical point of the model and confirm the presence of a logarithmic additive correction to the entropic area law.

•Mar 29, 2009•2 citations

From tree tensor network to multiscale entanglement renormalization ansatz

Xiangjian Qian, Mingpu Qin

Tensor network states (TNSs) offer an efficient representation for the ground state of quantum many-body systems and play an important role in the simulations of them. Numerous TNSs have been proposed in the past few decades. However, due to the high cost of TNS for two-dimensional systems, a balance between the encoded entanglement and computational complexity of TNS is yet to be reached. In this work we introduce a new tree tensor network-based (TTN-based) TNS dubbed a ``fully augmented tree tensor network (FATTN) by releasing the constraint in augmented tree tensor network (ATTN). When disentanglers are augmented in the physical layer of TTN, FATTN can provide more entanglement than TTN and ATTN. At the same time, FATTN maintains the scaling of computational cost with bond dimension in TTN and ATTN. Benchmark results on the ground-state energy for the transverse Ising model are provided to demonstrate the improvement of accuracy of FATTN over TTN and ATTN. Moreover, FATTN is quite flexible, which can be constructed as an interpolation between TTN and the multiscale entanglement renormalization ansatz to reach a balance between the encoded entanglement and the computational cost.

arXiv:2110.08794•Physical review. B./Physical review. B•May 4, 2022•11 citations

Matrix product states with backflow correlations

Guglielmo Lami, Giuseppe Carleo, Mario Collura

By taking inspiration from the backflow transformation for correlated systems, we introduce a tensor network Ansatz which extends the well-established matrix product state representation of a quantum many-body wave function. This structure provides enough resources to ensure that states in dimensions larger than or equal to one obey an area law for entanglement. It can be efficiently manipulated to address the ground-state search problem by means of an optimization scheme which mixes tensor-network and variational Monte Carlo algorithms. We benchmark the Ansatz against spin models both in one and two dimensions, demonstrating high accuracy and precision. We finally employ our approach to study the challenging $S=1/2$ two-dimensional (2D) ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model, demonstrating that it is competitive with the state-of-the-art methods in 2D.

arXiv:2201.00810•Physical review. B./Physical review. B•Aug 10, 2022•14 citations

Quantum Simulation with Hybrid Tensor Networks

Xiao Yuan, Jinzhao Sun, Junyu Liu +2 more

Tensor network theory and quantum simulation are, respectively, the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits, respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.

arXiv:2007.00958•Physical Review Letters•Jul 20, 2021•79 citations

Cost scaling of MPS and TTNS simulations for 2D and 3D systems with area-law entanglement

Thomas Barthel

Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in $D>1$ spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on $D=2$ and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the surface area of the associated subsystems.

quant-pharXiv:2601.08132•Jan 14, 2026•0 citations

Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law

Luca Tagliacozzo, Glen Evenbly, Guifré Vidal

This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasiexact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an algorithm to approximate the ground state of a local Hamiltonian on a $L\ifmmode\times\else\texttimes\fi{}L$ lattice with the topology of a torus. Accurate results are obtained for $L={4,6,8}$, whereas approximate results are obtained for larger lattices. As an application of the approach, we analyze the scaling of the ground-state entanglement entropy at the quantum critical point of the model. We confirm the presence of a positive additive constant to the area law for half a torus. We also find a logarithmic additive correction to the entropic area law for a square block. The single copy entanglement for half a torus reveals similar corrections to the area law with a further term proportional to $1/L$.

arXiv:0903.5017•Physical Review B•Dec 18, 2009•261 citations
We introduce a novel tensor network structure augmenting the well-established tree tensor network representation of a quantum many-body wave function. The new structure satisfies the area law in high dimensions remaining efficiently manipulatable and scalable. We benchmark this novel approach against paradigmatic two-dimensional spin models demonstrating unprecedented precision and system sizes. Finally, we compute the ground state phase diagram of two-dimensional lattice Rydberg atoms in optical tweezers observing nontrivial phases and quantum phase transitions, providing realistic benchmarks for current and future two-dimensional quantum simulations.
This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasi-exact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an optimization algorithm to accurately approximate ground states and apply it to the quantum Ising model on a torus of L X L sites for L= {4,6,8}. Approximate results for larger lattices are also obtained. As an application of the approach, we analyse the scaling of the ground state entropy at the quantum critical point of the model and confirm the presence of a logarithmic additive correction to the entropic area law.
Tensor network states (TNSs) offer an efficient representation for the ground state of quantum many-body systems and play an important role in the simulations of them. Numerous TNSs have been proposed in the past few decades. However, due to the high cost of TNS for two-dimensional systems, a balance between the encoded entanglement and computational complexity of TNS is yet to be reached. In this work we introduce a new tree tensor network-based (TTN-based) TNS dubbed a ``fully augmented tree tensor network (FATTN) by releasing the constraint in augmented tree tensor network (ATTN). When disentanglers are augmented in the physical layer of TTN, FATTN can provide more entanglement than TTN and ATTN. At the same time, FATTN maintains the scaling of computational cost with bond dimension in TTN and ATTN. Benchmark results on the ground-state energy for the transverse Ising model are provided to demonstrate the improvement of accuracy of FATTN over TTN and ATTN. Moreover, FATTN is quite flexible, which can be constructed as an interpolation between TTN and the multiscale entanglement renormalization ansatz to reach a balance between the encoded entanglement and the computational cost.
By taking inspiration from the backflow transformation for correlated systems, we introduce a tensor network Ansatz which extends the well-established matrix product state representation of a quantum many-body wave function. This structure provides enough resources to ensure that states in dimensions larger than or equal to one obey an area law for entanglement. It can be efficiently manipulated to address the ground-state search problem by means of an optimization scheme which mixes tensor-network and variational Monte Carlo algorithms. We benchmark the Ansatz against spin models both in one and two dimensions, demonstrating high accuracy and precision. We finally employ our approach to study the challenging S=1/2S=1/2S=1/2 two-dimensional (2D) ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model, demonstrating that it is competitive with the state-of-the-art methods in 2D.
Tensor network theory and quantum simulation are, respectively, the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits, respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.
Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in D>1D>1D>1 spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on D=2D=2D=2 and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the surface area of the associated subsystems.
This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasiexact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an algorithm to approximate the ground state of a local Hamiltonian on a $L\ifmmode\times\else\texttimes\fi{}L$ lattice with the topology of a torus. Accurate results are obtained for L=4,6,8L={4,6,8}L=4,6,8, whereas approximate results are obtained for larger lattices. As an application of the approach, we analyze the scaling of the ground-state entanglement entropy at the quantum critical point of the model. We confirm the presence of a positive additive constant to the area law for half a torus. We also find a logarithmic additive correction to the entropic area law for a square block. The single copy entanglement for half a torus reveals similar corrections to the area law with a further term proportional to 1/L1/L1/L.