ﻻ يوجد ملخص باللغة العربية
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types of spin coupling. We further discuss about the implications of NP-complete Hamiltonian models in physics and the fundamental limitations of all numerical methods imposed by such models. We conclude by a brief discussion on the picture when quantum computation and quantum complexity theory are included.
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the negative sign problem when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the
We study AKLT models on locally tree-like lattices of fixed connectivity and find that they exhibit a variety of ground states depending upon the spin, coordination and global (graph) topology. We find a) quantum paramagnetic or valence bond solid gr
We discuss the connection between computational social choice (comsoc) and computational complexity. We stress the work so far on, and urge continued focus on, two less-recognized aspects of this connection. Firstly, this is very much a two-way stree
While macroscopic properties of spin glasses have been thoroughly investigated, their manifestation in the corresponding microscopic configurations is much less understood. Cases where both descriptions have been provided, such as constraint satisfac
Neutron scattering experiments on a polycrystalline sample of the frustrated pyrochlore magnet Tb2Ti2O7, which does not show any magnetic order down to 50 mK, have revealed that it shows condensation behavior below 0.4 K from a thermally fluctuating