MOLECULAR MAGNETS FOR QUANTUM COMPUTATION

Author(s):  
Takayoshi Kuroda
2020 ◽  
Author(s):  
Marc Philipp Bahlke ◽  
Natnael Mogos ◽  
Jonny Proppe ◽  
Carmen Herrmann

Heisenberg exchange spin coupling between metal centers is essential for describing and understanding the electronic structure of many molecular catalysts, metalloenzymes, and molecular magnets for potential application in information technology. We explore the machine-learnability of exchange spin coupling, which has not been studied yet. We employ Gaussian process regression since it can potentially deal with small training sets (as likely associated with the rather complex molecular structures required for exploring spin coupling) and since it provides uncertainty estimates (“error bars”) along with predicted values. We compare a range of descriptors and kernels for 257 small dicopper complexes and find that a simple descriptor based on chemical intuition, consisting only of copper-bridge angles and copper-copper distances, clearly outperforms several more sophisticated descriptors when it comes to extrapolating towards larger experimentally relevant complexes. Exchange spin coupling is similarly easy to learn as the polarizability, while learning dipole moments is much harder. The strength of the sophisticated descriptors lies in their ability to linearize structure-property relationships, to the point that a simple linear ridge regression performs just as well as the kernel-based machine-learning model for our small dicopper data set. The superior extrapolation performance of the simple descriptor is unique to exchange spin coupling, reinforcing the crucial role of choosing a suitable descriptor, and highlighting the interesting question of the role of chemical intuition vs. systematic or automated selection of features for machine learning in chemistry and material science.


2002 ◽  
Author(s):  
T. P. Orlando ◽  
J. E. Mooij ◽  
Seth Lloyd

2014 ◽  
Author(s):  
Paul Alsing ◽  
Michael Fanto ◽  
Gordon Lott

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 49
Author(s):  
Nathan Argaman

Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell’s Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a strict arrow-of-time assumption whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell’s Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow which is yet to be identified, is called for.


Sign in / Sign up

Export Citation Format

Share Document