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

Equivalence of residual entropy of hexagonal and cubic ices from tensor network methods

Xiaze Xu, Tong-Yu Lin, Guang-Ming Zhang

Published May 20, 2026• 0 citations
arXivHTMLPDF

Abstract

The long-standing question of whether the residual entropy of hexagonal ice ($S_h$) equals that of cubic ice ($S_c$) remains unresolved despite decades of research on ice-type models. While analytical studies have established the inequality $S_h \geq S_c$, numerical investigations suggest that the two values are very close. In this work, we revisit this problem using high-precision tensor-network methods. In Monte Carlo approaches the residual entropy cannot be directly obtained by sampling the ground-state degeneracy space, however, the tensor-network framework enables an explicit encoding of the "ice rule'' into local tensors, and then the residual entropy is transformed into finding the largest eigenvalue of a transfer operator in the form of a projected entangled-pair operator, which allows high-accuracy numerical evaluation. Meanwhile, we propose a new perspective based on analyzing the normality of the transfer operator, and demonstrate that if the operator is normal, the equality $S_h = S_c$ follows directly. Then the variational tensor network methods are employed to numerically verify this normality. Finally both residual entropies are directly computed by using our recently developed split corner transfer matrix renormalization group algorithm, providing a rigorous evidence supporting the equality between $S_h$ and $S_c$.

DOI
10.1103/3myh-6pdf

Related papers

Residual entropies for three-dimensional frustrated spin systems with tensor networks

Laurens Vanderstraeten, Bram Vanhecke, Frank Verstraete

We develop a technique for calculating three-dimensional classical partition functions using projected entangled-pair states (PEPS). Our method is based on variational PEPS optimization algorithms for two-dimensional quantum spin systems, and allows us to compute free energies directly in the thermodynamic limit. The main focus of this work is classical frustration in three-dimensional many-body systems leading to an extensive ground-state degeneracy. We provide high-accuracy results for the residual entropy of the dimer model on the cubic lattice, water ice ${I}_{h}$, and water ice ${I}_{c}$. In addition, we show that these systems are in a Coulomb phase by computing the dipolar form of the correlation functions. As a further benchmark of our methods, we calculate the critical temperature and exponents of the Ising model on the cubic lattice.

arXiv:1805.10598•Physical review. E•Oct 29, 2018•58 citations

Residual Entropy of the Cubic Dimer Model: The Higher Order Tensor Renormalization Group Approach

Takahiro Otsuka, Yasuhiro Akutsu

The higher order tensor renormalization group (HOTRG) is a numerical method that can efficiently deal with high-dimensional statistical systems. We applied HOTRG to the cubic dimer model which has macroscopic ground-state degeneracy, to obtain the residual entropy with high accuracy.

Journal of the Physical Society of Japan•Apr 25, 2022•0 citations

Solving frustrated Ising models using tensor networks

Bram Vanhecke, Jeanne Colbois, Laurens Vanderstraeten +2 more

Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks that can be contracted using standard algorithms for infinite systems.This is achieved by reformulating the problem as local rules for configurations on overlapping clusters chosen in such a way that they relieve the frustration, i.e., that the energy can be minimized independently on each cluster.We show that optimizing the choice of clusters, including the weight on shared bonds, is crucial for the contractibility of the tensor networks, and we derive some basic rules and a linear program to implement them.We illustrate the power of the method by computing the residual entropy of a frustrated Ising spin system on a kagome lattice with next-next-nearest-neighbor interactions, vastly outperforming Monte Carlo methods in speed and accuracy.The extension to finite temperatures is briefly discussed.

arXiv:2006.14341•Physical Review Research•Jan 13, 2021•29 citations

Tensor-network study of Ising model on infinite hyperbolic dodecahedral lattice

Matej Moško, Andrej Gendiar

We propose a tensor-network-based algorithm to study the classical Ising model on an infinitely large hyperbolic lattice with a regular 3D tesselation of identical dodecahedra. We reformulate the corner transfer matrix renormalization group (CTMRG) algorithm from 2D to 3D to reproduce the known results on the cubic lattice. We subsequently generalize the CTMRG to a hyperbolic lattice with dodecahedral cells, which is an infinite-dimensional lattice. We analyze the spontaneous magnetization, von Neumann entropy, and correlation length to find a continuous noncritical phase transition on the dodecahedral lattice. We estimate the phase-transition temperature and find the magnetic critical exponents β=0.4999 and δ=3.007, which confirm the mean-field universality class, in accord with predictions from Monte Carlo and high-temperature series expansions. The algorithm can be applied to arbitrary multistate spin models.

arXiv:2510.20939•Physical review. E•Apr 15, 2026•0 citations

Efficient optimization of variational tensor-network approach to three-dimensional statistical systems

Xiaze Xu, Tong-Yu Lin, Guang-Ming Zhang

Variational tensor network optimization has become a powerful tool for studying classical statistical models in two dimensions. However, its application to three-dimensional systems remains limited, primarily due to the high computational cost associated with evaluating the free-energy density and its gradient. This process requires contracting a triple-layer tensor network composed of a projected entangled pair operator and projected entangled pair states. In this paper, we employ a split corner-transfer renormalization group scheme tailored for the contraction of such a triple-layer network, which reduces the computational complexity while keeping high accuracy. Through numerical benchmarks on the three-dimensional classical Ising model, we demonstrate that the proposed scheme achieves numerical results comparable to the most recent Monte Carlo simulations, providing a substantial speedup over previous variational tensor network approaches. This makes this method well-suited for efficient gradient-based optimization in three-dimensional tensor network simulations.

arXiv:2506.19339•Physical review. B./Physical review. B•Sep 18, 2025•2 citations

Variational Corner Transfer Matrix Renormalization Group Method for Classical Statistical Models

X. F. Liu, Yu Fu, Weiqiang Yu +2 more

In the context of tensor network states, we for the first time reformulate the corner transfer matrix renormalization group (CTMRG) method into a variational bilevel optimization algorithm. The solution of the optimization problem corresponds to the fixed-point environment pursued in the conventional CTMRG method, from which the partition function of a classical statistical model, represented by an infinite tensor network, can be efficiently evaluated. The validity of this variational idea is demonstrated by the high-precision calculation of the residual entropy of the dimer model, and is further verified by investigating several typical phase transitions in classical spin models, where the obtained critical points and critical exponents all agree with the best known results in literature. Its extension to three-dimensional tensor networks or quantum lattice models is straightforward, as also discussed briefly.

arXiv:2203.17098•Chinese Physics Letters•Jun 1, 2022•13 citations
The long-standing question of whether the residual entropy of hexagonal ice (ShS_hSh​) equals that of cubic ice (ScS_cSc​) remains unresolved despite decades of research on ice-type models. While analytical studies have established the inequality Sh≥ScS_h \geq S_cSh​≥Sc​, numerical investigations suggest that the two values are very close. In this work, we revisit this problem using high-precision tensor-network methods. In Monte Carlo approaches the residual entropy cannot be directly obtained by sampling the ground-state degeneracy space, however, the tensor-network framework enables an explicit encoding of the "ice rule'' into local tensors, and then the residual entropy is transformed into finding the largest eigenvalue of a transfer operator in the form of a projected entangled-pair operator, which allows high-accuracy numerical evaluation. Meanwhile, we propose a new perspective based on analyzing the normality of the transfer operator, and demonstrate that if the operator is normal, the equality Sh=ScS_h = S_cSh​=Sc​ follows directly. Then the variational tensor network methods are employed to numerically verify this normality. Finally both residual entropies are directly computed by using our recently developed split corner transfer matrix renormalization group algorithm, providing a rigorous evidence supporting the equality between ShS_hSh​ and ScS_cSc​.
We develop a technique for calculating three-dimensional classical partition functions using projected entangled-pair states (PEPS). Our method is based on variational PEPS optimization algorithms for two-dimensional quantum spin systems, and allows us to compute free energies directly in the thermodynamic limit. The main focus of this work is classical frustration in three-dimensional many-body systems leading to an extensive ground-state degeneracy. We provide high-accuracy results for the residual entropy of the dimer model on the cubic lattice, water ice Ih{I}_{h}Ih​, and water ice Ic{I}_{c}Ic​. In addition, we show that these systems are in a Coulomb phase by computing the dipolar form of the correlation functions. As a further benchmark of our methods, we calculate the critical temperature and exponents of the Ising model on the cubic lattice.
Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks that can be contracted using standard algorithms for infinite systems.This is achieved by reformulating the problem as local rules for configurations on overlapping clusters chosen in such a way that they relieve the frustration, i.e., that the energy can be minimized independently on each cluster.We show that optimizing the choice of clusters, including the weight on shared bonds, is crucial for the contractibility of the tensor networks, and we derive some basic rules and a linear program to implement them.We illustrate the power of the method by computing the residual entropy of a frustrated Ising spin system on a kagome lattice with next-next-nearest-neighbor interactions, vastly outperforming Monte Carlo methods in speed and accuracy.The extension to finite temperatures is briefly discussed.
We propose a tensor-network-based algorithm to study the classical Ising model on an infinitely large hyperbolic lattice with a regular 3D tesselation of identical dodecahedra. We reformulate the corner transfer matrix renormalization group (CTMRG) algorithm from 2D to 3D to reproduce the known results on the cubic lattice. We subsequently generalize the CTMRG to a hyperbolic lattice with dodecahedral cells, which is an infinite-dimensional lattice. We analyze the spontaneous magnetization, von Neumann entropy, and correlation length to find a continuous noncritical phase transition on the dodecahedral lattice. We estimate the phase-transition temperature and find the magnetic critical exponents β=0.4999 and δ=3.007, which confirm the mean-field universality class, in accord with predictions from Monte Carlo and high-temperature series expansions. The algorithm can be applied to arbitrary multistate spin models.
Variational tensor network optimization has become a powerful tool for studying classical statistical models in two dimensions. However, its application to three-dimensional systems remains limited, primarily due to the high computational cost associated with evaluating the free-energy density and its gradient. This process requires contracting a triple-layer tensor network composed of a projected entangled pair operator and projected entangled pair states. In this paper, we employ a split corner-transfer renormalization group scheme tailored for the contraction of such a triple-layer network, which reduces the computational complexity while keeping high accuracy. Through numerical benchmarks on the three-dimensional classical Ising model, we demonstrate that the proposed scheme achieves numerical results comparable to the most recent Monte Carlo simulations, providing a substantial speedup over previous variational tensor network approaches. This makes this method well-suited for efficient gradient-based optimization in three-dimensional tensor network simulations.
In the context of tensor network states, we for the first time reformulate the corner transfer matrix renormalization group (CTMRG) method into a variational bilevel optimization algorithm. The solution of the optimization problem corresponds to the fixed-point environment pursued in the conventional CTMRG method, from which the partition function of a classical statistical model, represented by an infinite tensor network, can be efficiently evaluated. The validity of this variational idea is demonstrated by the high-precision calculation of the residual entropy of the dimer model, and is further verified by investigating several typical phase transitions in classical spin models, where the obtained critical points and critical exponents all agree with the best known results in literature. Its extension to three-dimensional tensor networks or quantum lattice models is straightforward, as also discussed briefly.