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:1406.2666 · Physical Review B

Unconstrained tree tensor network: An adaptive gauge picture for enhanced performance

Matthias Gerster, Pietro Silvi, Matteo Rizzi, Rosario Fazio, Tommaso Calarco, Simone Montangero

Published Sep 29, 2014• 85 citations
arXivHTMLPDF

Abstract

We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse graining. This additional numerical freedom, combined with the loop-free topology of the tree network, allows one to maximally exploit the internal gauge invariance of tensor networks, ultimately leading to a computationally flexible and efficient algorithm able to treat open and periodic boundary conditions on the same footing. We benchmark the novel approach against the 1D Ising model in transverse field with periodic boundary conditions and discuss the strategy to cope with the broken translational invariance generated by the network structure. We then perform investigations on a state-of-the-art problem, namely, the bilinear-biquadratic model in the transition between dimer and ferromagnetic phases. Our results clearly display an exponentially diverging correlation length and thus support the most recent guesses on the peculiarity of the transition.

DOI
10.1103/physrevb.90.125154

Related papers

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•14 citations

Fine Grained Tensor Network Methods

Philipp Schmoll, Saeed S. Jahromi, Max Hörmann +3 more

We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2D tensor networks-such as corner transfer matrix renormalization schemes-which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2D triangular and 3D stacked triangular lattice, as well as of the hardcore and softcore Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.

arXiv:1911.04882•Physical Review Letters•May 19, 2020•16 citations

Simulating strongly correlated quantum systems with tree tensor networks

V. Murg, Frank Verstraete, Örs Legeza +1 more

We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemistry versions of the density-matrix renormalization group (DMRG) method have long been applied to such systems, the spatial topology of DMRG-based methods allows efficient optimizations to be carried out with respect to one spatial dimension only. Extending the matrix-product-state picture, we formulate a more general approach by allowing the local sites to be coupled to more than two neighboring auxiliary subspaces. Following [Y. Shi, L. Duan, and G. Vidal, Phys. Rev. A 74, 022320 (2006)], we treat a treelike network ansatz with arbitrary coordination number $z$, where the $z=2$ case corresponds to the one-dimensional (1D) scheme. For this ansatz, the long-range correlation deviates from the mean-field value polynomially with distance, in contrast to the matrix-product ansatz, which deviates exponentially. The computational cost of the tree-tensor-network method is significantly smaller than that of previous DMRG-based attempts, which renormalize several blocks into a single block. In addition, we investigate the effect of unitary transformations on the local basis states and present a method for optimizing such transformations. For the 1D interacting spinless fermion model, the optimized transformation interpolates smoothly between real space and momentum space. Calculations carried out on small quantum chemical systems support our approach.

arXiv:1006.3095•Physical Review B•Nov 3, 2010•270 citations

Variational tensor network renormalization in imaginary time: Two-dimensional quantum compass model at finite temperature

Piotr Czarnik, Jacek Dziarmaga, Andrzej M. Oleś

Progress in describing thermodynamic phase transitions in quantum systems is obtained by noticing that the Gibbs operator ${e}^{\ensuremath{-}\ensuremath{\beta}H}$ for a two-dimensional (2D) lattice system with a Hamiltonian $H$ can be represented by a three-dimensional tensor network, the third dimension being the imaginary time (inverse temperature) $\ensuremath{\beta}$. Coarse graining the network along $\ensuremath{\beta}$ results in a 2D projected entangled-pair operator (PEPO) with a finite bond dimension $D$. The coarse graining is performed by a tree tensor network of isometries. The isometries are optimized variationally, taking into account full tensor environment, to maximize the accuracy of the PEPO. The algorithm is applied to the isotropic quantum compass model on an infinite square lattice near a symmetry-breaking phase transition at finite temperature. From the linear susceptibility in the symmetric phase and the order parameter in the symmetry-broken phase, the critical temperature is estimated at ${\mathcal{T}}_{c}=0.0606(4)J$, where $J$ is the isotropic coupling constant between $S=\frac{1}{2}$ pseudospins.

arXiv:1512.07168•Physical review. B./Physical review. B•May 11, 2016•37 citations

Tree Tensor Network Simulation of Dynamical Quantum Phase Transitions in the 2D Transverse-Field Ising Model

Xiangyue Zhang, Dizhou Xie, Yongqiang Li

The discovery of dynamical quantum phase transitions (DQPTs) has fundamentally challenged the traditional view that phase transitions only occur in thermal equilibrium. Experimental platforms and 1D numerical methods, like matrix product states (MPS), have made great progress. However, exploring true 2D DQPTs remains difficult due to finite-size limitations and the geometric biases of quasi-1D cylinder mappings. Here, we bypass these limitations by deploying a tree tensor network (TTN) approach. This allows us to directly compute the quench dynamics of the transverse-field Ising model (TFIM) on an open 2D square lattice. Because the TTN architecture naturally mirrors 2D lattice connectivity, we can extract the global Loschmidt echo. Our simulations reveal that while deep quenches yield standard DQPTs, quenching within the ferromagnetic phase produces an anomalous dynamical response. In this regime, the rate function exhibits sharp non-analytic peaks even as the macroscopic order parameter maintains its initial sign. This decoupled behavior strongly indicates that local spin excitations drive 2D DQPTs, rather than the macroscopic domain-wall motions seen in 1D chains. These results provide a quantitative numerical baseline for understanding non-equilibrium quantum matter in higher dimensions.

Entropy•Apr 26, 2026•0 citations

Tensor networks and geometry for the modelling of disordered quantum many-body systems

Andrew M. Goldsborough, Rudolf A. Römer

Tensor networks provide a powerful and elegant approach to quantum manybody simulation. The simplest example is the density matrix renormalisation group (DMRG), which is based on the variational update of a matrix product state (MPS). It has proved to be the most accurate approach for the numerical study of strongly correlated one dimensional systems. We use DMRG to study the one dimensional disordered Bose-Hubbard model at fillings N=L = 1=2, 1 and 2 and show that the whole phase diagram for each can be successfully obtained by analysing entanglement properties alone. We �nd that the average entanglement is insufficient to accurately locate all of the phases, however using the standard error on the mean we are able to construct a phase diagram that is consistent with previous studies. It has recently been shown that there is a connection between the geometry of tensor networks and the entanglement and correlation properties that it can encode, which is a generalisation of the so called area law for entanglement entropy. This suggests that whilst gapped quantum systems can be accurately modeled using an MPS, a tensor network with a holographic geometry is natural to capture the logarithmic entanglement scaling and power law decaying correlation functions of critical systems. We create an algorithm for the disordered Heisenberg Hamiltonian that self assembles a tensor network based on the disorder in the couplings. The geometry created is that of a disordered tree tensor network (TTN) that when averaged has the holographic properties characteristic of critical systems. We continue the analysis of holographic tensor network geometry by considering the average length of leaf-to-leaf paths in various tree graphs, which is related to two-point correlation functions in tensor networks. For regular, complete trees we analytically calculate the average path length and all statistical moments, and generalise it for any splitting number. We then turn to the Catalan trees, which is the set of unique binary trees with n vertices, as it has a similar geometry to the disordered TTNs. We calculate the average depth of a leaf and show that it is equal to the average path length. We compare these analytic results with the structures found in the TTN and randomly constructed trees to show that the renormalisation involved in the TTN algorithm is crucial in the selection of the tree structure.

•Sep 13, 2026•0 citations
We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse graining. This additional numerical freedom, combined with the loop-free topology of the tree network, allows one to maximally exploit the internal gauge invariance of tensor networks, ultimately leading to a computationally flexible and efficient algorithm able to treat open and periodic boundary conditions on the same footing. We benchmark the novel approach against the 1D Ising model in transverse field with periodic boundary conditions and discuss the strategy to cope with the broken translational invariance generated by the network structure. We then perform investigations on a state-of-the-art problem, namely, the bilinear-biquadratic model in the transition between dimer and ferromagnetic phases. Our results clearly display an exponentially diverging correlation length and thus support the most recent guesses on the peculiarity of the transition.
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.
We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2D tensor networks-such as corner transfer matrix renormalization schemes-which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2D triangular and 3D stacked triangular lattice, as well as of the hardcore and softcore Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.
We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemistry versions of the density-matrix renormalization group (DMRG) method have long been applied to such systems, the spatial topology of DMRG-based methods allows efficient optimizations to be carried out with respect to one spatial dimension only. Extending the matrix-product-state picture, we formulate a more general approach by allowing the local sites to be coupled to more than two neighboring auxiliary subspaces. Following [Y. Shi, L. Duan, and G. Vidal, Phys. Rev. A 74, 022320 (2006)], we treat a treelike network ansatz with arbitrary coordination number zzz, where the z=2z=2z=2 case corresponds to the one-dimensional (1D) scheme. For this ansatz, the long-range correlation deviates from the mean-field value polynomially with distance, in contrast to the matrix-product ansatz, which deviates exponentially. The computational cost of the tree-tensor-network method is significantly smaller than that of previous DMRG-based attempts, which renormalize several blocks into a single block. In addition, we investigate the effect of unitary transformations on the local basis states and present a method for optimizing such transformations. For the 1D interacting spinless fermion model, the optimized transformation interpolates smoothly between real space and momentum space. Calculations carried out on small quantum chemical systems support our approach.
Progress in describing thermodynamic phase transitions in quantum systems is obtained by noticing that the Gibbs operator ${e}^{\ensuremath{-}\ensuremath{\beta}H}$ for a two-dimensional (2D) lattice system with a Hamiltonian HHH can be represented by a three-dimensional tensor network, the third dimension being the imaginary time (inverse temperature) $\ensuremath{\beta}$. Coarse graining the network along $\ensuremath{\beta}$ results in a 2D projected entangled-pair operator (PEPO) with a finite bond dimension DDD. The coarse graining is performed by a tree tensor network of isometries. The isometries are optimized variationally, taking into account full tensor environment, to maximize the accuracy of the PEPO. The algorithm is applied to the isotropic quantum compass model on an infinite square lattice near a symmetry-breaking phase transition at finite temperature. From the linear susceptibility in the symmetric phase and the order parameter in the symmetry-broken phase, the critical temperature is estimated at Tc=0.0606(4)J{\mathcal{T}}_{c}=0.0606(4)JTc​=0.0606(4)J, where JJJ is the isotropic coupling constant between S=12S=\frac{1}{2}S=21​ pseudospins.
The discovery of dynamical quantum phase transitions (DQPTs) has fundamentally challenged the traditional view that phase transitions only occur in thermal equilibrium. Experimental platforms and 1D numerical methods, like matrix product states (MPS), have made great progress. However, exploring true 2D DQPTs remains difficult due to finite-size limitations and the geometric biases of quasi-1D cylinder mappings. Here, we bypass these limitations by deploying a tree tensor network (TTN) approach. This allows us to directly compute the quench dynamics of the transverse-field Ising model (TFIM) on an open 2D square lattice. Because the TTN architecture naturally mirrors 2D lattice connectivity, we can extract the global Loschmidt echo. Our simulations reveal that while deep quenches yield standard DQPTs, quenching within the ferromagnetic phase produces an anomalous dynamical response. In this regime, the rate function exhibits sharp non-analytic peaks even as the macroscopic order parameter maintains its initial sign. This decoupled behavior strongly indicates that local spin excitations drive 2D DQPTs, rather than the macroscopic domain-wall motions seen in 1D chains. These results provide a quantitative numerical baseline for understanding non-equilibrium quantum matter in higher dimensions.
Tensor networks provide a powerful and elegant approach to quantum manybody simulation. The simplest example is the density matrix renormalisation group (DMRG), which is based on the variational update of a matrix product state (MPS). It has proved to be the most accurate approach for the numerical study of strongly correlated one dimensional systems. We use DMRG to study the one dimensional disordered Bose-Hubbard model at fillings N=L = 1=2, 1 and 2 and show that the whole phase diagram for each can be successfully obtained by analysing entanglement properties alone. We �nd that the average entanglement is insufficient to accurately locate all of the phases, however using the standard error on the mean we are able to construct a phase diagram that is consistent with previous studies. It has recently been shown that there is a connection between the geometry of tensor networks and the entanglement and correlation properties that it can encode, which is a generalisation of the so called area law for entanglement entropy. This suggests that whilst gapped quantum systems can be accurately modeled using an MPS, a tensor network with a holographic geometry is natural to capture the logarithmic entanglement scaling and power law decaying correlation functions of critical systems. We create an algorithm for the disordered Heisenberg Hamiltonian that self assembles a tensor network based on the disorder in the couplings. The geometry created is that of a disordered tree tensor network (TTN) that when averaged has the holographic properties characteristic of critical systems. We continue the analysis of holographic tensor network geometry by considering the average length of leaf-to-leaf paths in various tree graphs, which is related to two-point correlation functions in tensor networks. For regular, complete trees we analytically calculate the average path length and all statistical moments, and generalise it for any splitting number. We then turn to the Catalan trees, which is the set of unique binary trees with n vertices, as it has a similar geometry to the disordered TTNs. We calculate the average depth of a leaf and show that it is equal to the average path length. We compare these analytic results with the structures found in the TTN and randomly constructed trees to show that the renormalisation involved in the TTN algorithm is crucial in the selection of the tree structure.