The search for new superhydrides, promising materials for both hydrogen storage and high temperature superconductivity, made great progress, thanks to atomistic simulations and Crystal Structure Prediction (CSP) algorithms. When they are combined with Density Functional Theory (DFT), these methods are highly reliable and often match a great part of the experimental results. However, systems of increasing complexity (number of atoms and chemical species) become rapidly challenging as the number of minima to explore grows exponentially with the number of degrees of freedom in the simulation cell. An efficient sampling strategy preserving a sustainable computational cost then remains to be found. We propose such a strategy based on an active-learning process where machine learning potentials and DFT simulations are jointly used, opening the way to the discovery of complex structures. As a proof of concept, this method is applied to the exploration of tin crystal structures under various pressures. We showed that the α phase, not included in the learning process, is correctly retrieved, despite its singular nature of bonding. Moreover, all the expected phases are correctly predicted under pressure (20 and 100GPa), suggesting the high transferability of our approach. The method has then been applied to the search of yttrium superhydrides (YHx) crystal structures under pressure. The YH6 structure of space group Im-3m is successfully retrieved. However, the exploration of more complex systems leads to the appearance of a large number of structures. The selection of the relevant ones to be included in the active learning process is performed through the analysis of atomic environments and the clustering algorithm. Finally, a metric involving a distance based on x-ray spectra is introduced, which guides the structural search toward experimentally relevant structures. The global process (active-learning and new selection methods) is finally considered to explore more complex and unknown YHx phases, unreachable by former CSP algorithms. New complex phases are found, demonstrating the ability of our approach to push back the exponential wall of complexity related to CSP.

Full Text

Published Version
Open DOI Link

Get access to 250M+ research papers

Discover from 40M+ Open access, 3M+ Pre-prints, 9.5M Topics and 32K+ Journals.

Sign Up Now! It's FREE

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call