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:2107.01555 · Physical review. B./Physical review. B

Entanglement-based tensor-network strong-disorder renormalization group

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

Published Oct 8, 2021• 7 citations
arXivHTMLPDF

Abstract

We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.

DOI
10.1103/physrevb.104.134405

Related papers

Tensor-network strong-disorder renormalization groups for random quantum spin systems in two dimensions

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches is the tensor-network strong-disorder renormalization group (tSDRG), which was basically established for one-dimensional (1D) systems. In this paper, we propose a possible improvement of its algorithm toward 2D random spin systems, focusing on a generating process of the tree network structure of tensors, and precisely examine their performances for the random antiferromagnetic Heisenberg model not only on the 1D chain but also on the square- and triangular-lattices. On the basis of comparison with the exact numerical results up to 36 site systems, we demonstrate that accuracy of the optimal tSDRG algorithm is significantly improved for the 1D and 2D systems in the strong-randomness regime.

arXiv:2006.12857•Physical review. B./Physical review. B•Oct 26, 2020•10 citations

Entanglement renormalization for disordered systems

Andrew M. Goldsborough, Glen Evenbly

Tensor network states have proven to be powerful tools for investigating quantum many-body systems. Here, the authors propose a tensor network method, based on an adaptation of entanglement renormalization, for investigating strongly disordered systems. The method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. This approach leads to a new class of efficiently contractible tensor network ansatz for 1D systems, which may be understood as a generalization of the multiscale entanglement renormalization ansatz for disordered systems.

arXiv:1708.07652•Physical review. B./Physical review. B•Oct 24, 2017•20 citations

Machine Learning the Strong Disorder Renormalization Group Method for Disordered Quantum Spin Chains

A. Ustyuzhanin, J. Vahedi, S. Kettemann

We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of $S=1/2$-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent $α$ at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy $S(\ell)$ in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.

cond-mat.dis-nnCross-listedarXiv:2603.05164•Machine Learning Science and Technology•Mar 6, 2026•0 citations

Self-assembling tensor networks and holography in disordered spin chains

Andrew M. Goldsborough, Rudolf A. Römer

We show that the numerical strong disorder renormalization group algorithm of Hikihara et al. [Phys. Rev. B 60, 12116 (1999)] for the one-dimensional disordered Heisenberg model naturally describes a tree tensor network (TTN) with an irregular structure defined by the strength of the couplings. Employing the holographic interpretation of the TTN in Hilbert space, we compute expectation values, correlation functions, and the entanglement entropy using the geometrical properties of the TTN. We find that the disorder-averaged spin-spin correlation scales with the average path length through the tensor network while the entanglement entropy scales with the minimal surface connecting two regions. Furthermore, the entanglement entropy increases with both disorder and system size, resulting in an area-law violation. Our results demonstrate the usefulness of a self-assembling TTN approach to disordered systems and quantitatively validate the connection between holography and quantum many-body systems.

arXiv:1401.4874•Physical Review B•Jun 27, 2014•31 citations

Automatic structural search of tensor network states including entanglement renormalization

Ryo Watanabe, Hiroshi Ueda

Tensor network (TN) states, including entanglement renormalization (ER), can encompass a wider variety of entangled states. When the entanglement structure of the quantum state of interest is nonuniform in real space, accurately representing the state with a limited number of degrees of freedom hinges on appropriately configuring the TN to align with the entanglement pattern. However, a proposal has yet to show a structural search of ER due to its high computational cost and the lack of flexibility in its algorithm. In this study, we conducted an optimal structural search of TN, including ER, based on the reconstruction of their local structures with respect to variational energy. First, we demonstrated that our algorithm for the spin- 1 / 2 tetramer singlets model could calculate exact ground energy using the multiscale entanglement renormalization ansatz (MERA) structure as an initial TN structure. Subsequently, we applied our algorithm to the random XY models with the two initial structures: MERA and the suitable structure underlying the strong disordered renormalization group. We found that, in both cases, our algorithm achieves improvements in variational energy, fidelity, and entanglement entropy. The degree of improvement in these quantities is superior in the latter case compared to the former, suggesting that utilizing an existing TN design method as a preprocessing step is important for maximizing our algorithm's performance. Published by the American Physical Society 2024

arXiv:2405.06534•Physical Review Research•Sep 6, 2024•3 citations

Linearized Tensor Renormalization Group Algorithm for the Calculation of Thermodynamic Properties of Quantum Lattice Models

Wei Li, Shi-Ju Ran, Shou-Shu Gong +4 more

A linearized tensor renormalization group algorithm is developed to calculate the thermodynamic properties of low-dimensional quantum lattice models. This new approach employs the infinite time-evolving block decimation technique, and allows for treating directly the transfer-matrix tensor network that makes it more scalable. To illustrate the performance, the thermodynamic quantities of the quantum XY spin chain as well as the Heisenberg antiferromagnet on a honeycomb lattice are calculated by the linearized tensor renormalization group method, showing the pronounced precision and high efficiency.

arXiv:1011.0155•Physical Review Letters•Mar 22, 2011•95 citations
We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.
Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches is the tensor-network strong-disorder renormalization group (tSDRG), which was basically established for one-dimensional (1D) systems. In this paper, we propose a possible improvement of its algorithm toward 2D random spin systems, focusing on a generating process of the tree network structure of tensors, and precisely examine their performances for the random antiferromagnetic Heisenberg model not only on the 1D chain but also on the square- and triangular-lattices. On the basis of comparison with the exact numerical results up to 36 site systems, we demonstrate that accuracy of the optimal tSDRG algorithm is significantly improved for the 1D and 2D systems in the strong-randomness regime.
Tensor network states have proven to be powerful tools for investigating quantum many-body systems. Here, the authors propose a tensor network method, based on an adaptation of entanglement renormalization, for investigating strongly disordered systems. The method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. This approach leads to a new class of efficiently contractible tensor network ansatz for 1D systems, which may be understood as a generalization of the multiscale entanglement renormalization ansatz for disordered systems.
We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of S=1/2S=1/2S=1/2-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent ααα at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy S(ℓ)S(\ell)S(ℓ) in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.
We show that the numerical strong disorder renormalization group algorithm of Hikihara et al. [Phys. Rev. B 60, 12116 (1999)] for the one-dimensional disordered Heisenberg model naturally describes a tree tensor network (TTN) with an irregular structure defined by the strength of the couplings. Employing the holographic interpretation of the TTN in Hilbert space, we compute expectation values, correlation functions, and the entanglement entropy using the geometrical properties of the TTN. We find that the disorder-averaged spin-spin correlation scales with the average path length through the tensor network while the entanglement entropy scales with the minimal surface connecting two regions. Furthermore, the entanglement entropy increases with both disorder and system size, resulting in an area-law violation. Our results demonstrate the usefulness of a self-assembling TTN approach to disordered systems and quantitatively validate the connection between holography and quantum many-body systems.
Tensor network (TN) states, including entanglement renormalization (ER), can encompass a wider variety of entangled states. When the entanglement structure of the quantum state of interest is nonuniform in real space, accurately representing the state with a limited number of degrees of freedom hinges on appropriately configuring the TN to align with the entanglement pattern. However, a proposal has yet to show a structural search of ER due to its high computational cost and the lack of flexibility in its algorithm. In this study, we conducted an optimal structural search of TN, including ER, based on the reconstruction of their local structures with respect to variational energy. First, we demonstrated that our algorithm for the spin- 1 / 2 tetramer singlets model could calculate exact ground energy using the multiscale entanglement renormalization ansatz (MERA) structure as an initial TN structure. Subsequently, we applied our algorithm to the random XY models with the two initial structures: MERA and the suitable structure underlying the strong disordered renormalization group. We found that, in both cases, our algorithm achieves improvements in variational energy, fidelity, and entanglement entropy. The degree of improvement in these quantities is superior in the latter case compared to the former, suggesting that utilizing an existing TN design method as a preprocessing step is important for maximizing our algorithm's performance. Published by the American Physical Society 2024
A linearized tensor renormalization group algorithm is developed to calculate the thermodynamic properties of low-dimensional quantum lattice models. This new approach employs the infinite time-evolving block decimation technique, and allows for treating directly the transfer-matrix tensor network that makes it more scalable. To illustrate the performance, the thermodynamic quantities of the quantum XY spin chain as well as the Heisenberg antiferromagnet on a honeycomb lattice are calculated by the linearized tensor renormalization group method, showing the pronounced precision and high efficiency.