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

Physica A Statistical Mechanics and its Applications

The tensor renormalization group for pure and disordered two-dimensional lattice systems

Can Güven, Michael Hinczewski

Published Feb 12, 2010• 3 citations
Publisher
DOI
10.1016/j.physa.2010.02.010

Related papers

Real-space renormalization group investigation of pure and disordered mixed spin Ising models ond-dimensional lattices

Noureddine Benayad

The European Physical Journal B•Feb 1, 1990•47 citations

Tensor renormalization group and the solution of classical lattice models

Michael Levin, Cody P. Nave

•Nov 27, 2006•0 citations

Entanglement-based tensor-network strong-disorder renormalization group

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

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.

arXiv:2107.01555•Physical review. B./Physical review. B•Oct 8, 2021•7 citations

NOVEL TENSOR NETWORK RENORMALIZATION GROUP APPROACHES FOR QUANTUM LATTICE MODELS

Gang Su

WORLD SCIENTIFIC eBooks•Aug 14, 2013•0 citations

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

Renormalization Group on the Lattice

Andreas Wipf

Lecture notes in physics•Oct 26, 2012•0 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.