期刊
JOURNAL OF MATERIALS SCIENCE & TECHNOLOGY
卷 44, 期 -, 页码 116-120出版社
JOURNAL MATER SCI TECHNOL
DOI: 10.1016/j.jmst.2019.12.009
关键词
3D Ising model; Spin-glass; Computational complexity
资金
- National Natural Science Foundation of China [51590883, 51331006]
- State Key Project of Research and Development of of China [2017YFA0206302]
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(2(mn)). 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(2(mn)) by any algorithms, which is in subexponential time, superpolynomial. (C) 2020 Published by Elsevier Ltd on behalf of The editorial office of Journal of Materials Science & Technology.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据