Computational complexity of spin-glass three-dimensional(3D)Ising model  

作　　者：Zhidong Zhang 

机构地区：[1]Shenyang National Laboratory for Materials Science,Institute of Metal Research,Chinese Academy of Sciences,72 Wenhua Road,Shenyang,110016,China

出　　处：《Journal of Materials Science & Technology》2020年第9期116-120,共5页材料科学技术（英文版）

基　　金：This work has been supported by the National Natural Science Foundation of China under grant numbers 51590883 and 51331006;by the State Key Project of Research and Development of China(No.2017YFA0206302).

摘　　要：In this work,the computational complexity of a spin-glass three-dimensional(3D)Ising model(for the lattice sizeN=lmn,wherel,m,n are thenumbersof 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(2mn).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(2mn)by any algorithms,which is in subexponential time,superpolynomial.

关 键 词：3D Ising model SPIN-GLASS Computational complexity 

分 类 号：TQ171.1[化学工程—玻璃工业]