Journal of Materials Science & Technology ( IF 11.2 ) Pub Date : 2020-01-08 , DOI: 10.1016/j.jmst.2019.12.009 Zhidong Zhang
In this work, the computational complexity of a spin-glass three-dimensional (3D) Ising model (for the lattice size N = lmn, where l, m, n are the numbers of lattice points along three crystallographic directions) is studied. We prove that an absolute minimum core (AMC) model consisting of a spin-glass 2D Ising model interacting with its nearest neighboring plane, has its computational complexity O(). Any algorithms to make the model smaller (or simpler) than the AMC model will cut the basic element of the spin-glass 3D Ising model and lost many important information of the original model. Therefore, the computational complexity of the spin-glass 3D Ising model cannot be reduced to be less than O() by any algorithms, which is in subexponential time, superpolynomial.
中文翻译:
自旋玻璃三维(3D)Ising模型的计算复杂性
在这项工作中,研究了自旋玻璃三维(3D)Ising模型的计算复杂性(对于晶格大小N = lmn,其中l,m,n是沿着三个晶体学方向的晶格点数)。我们证明由旋转玻璃2D Ising模型与其最近的相邻平面相互作用组成的绝对最小核(AMC)模型具有计算复杂度O()。任何使模型比AMC模型更小(或更简单)的算法都会削减自旋玻璃3D Ising模型的基本元素,并丢失许多原始模型的重要信息。因此,无法将旋转玻璃3D Ising模型的计算复杂度降低到小于O(),可以使用任何指数算法(在指数以下的时间)进行。