Computational complexity of spin-glass three-dimensional（3D） Ising model
来源期刊：JOURNAL OF MATERIALS SCIENCE TECHNOLOG2020年第9期
论文作者：Zhidong Zhang
文章页码：116 - 120
摘 要：In this work, the computational complexity of a spin-glass three-dimensional（3 D） 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 2 D Ising model interacting with its nearest neighboring plane, has its computational complexity O（2 mn）. Any algorithms to make the model smaller（or simpler） than the AMC model will cut the basic element of the spin-glass3 D Ising model and lost many important information of the original model. Therefore, the computational complexity of the spin-glass 3 D Ising model cannot be reduced to be less than O（2 mn） by any algorithms,which is in subexponential time, superpolynomial.
Zhidong Zhang
Shenyang National Laboratory for Materials Science, Institute of Metal Research, Chinese Academy of Sciences
摘 要：In this work, the computational complexity of a spin-glass three-dimensional（3 D） 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 2 D Ising model interacting with its nearest neighboring plane, has its computational complexity O（2 mn）. Any algorithms to make the model smaller（or simpler） than the AMC model will cut the basic element of the spin-glass3 D Ising model and lost many important information of the original model. Therefore, the computational complexity of the spin-glass 3 D Ising model cannot be reduced to be less than O（2 mn） by any algorithms,which is in subexponential time, superpolynomial.
关键词：
