Zeno Schätzle, P Bernát Szabó, Alice Cuzzocrea, Matěj Mezera, Frank Noé
{"title":"Ab initio simulation of excited-state potential energy surfaces with transferable deep quantum Monte Carlo.","authors":"Zeno Schätzle, P Bernát Szabó, Alice Cuzzocrea, Matěj Mezera, Frank Noé","doi":"10.1038/s43588-026-01065-y","DOIUrl":"https://doi.org/10.1038/s43588-026-01065-y","url":null,"abstract":"<p><p>The accurate quantum chemical calculation of excited states is a challenging task, often requiring computationally demanding methods. When entire ground and excited potential energy surfaces (PESs) are desired, for instance, to predict the interaction of light excitation and structural changes, one is often forced to use cheaper computational methods at the cost of reduced accuracy. Here we introduce a method for the geometrically transferable optimization of neural network wavefunctions that leverages weight sharing and a dynamical ordering of electronic states. Our method enables the efficient prediction of ground- and excited-state PESs and their intersections at the highest accuracy, demonstrating up to two orders of magnitude cost reduction compared with single-point calculations. We validate our approach on four challenging excited-state PESs, namely, ethylene, the carbon dimer, the methylenimmonium cation and a rubredoxin active site model containing 96 electrons, illustrating the potential of transferable deep-learning quantum Monte Carlo as a practical framework for studying electronic excitations in molecules.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149372383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalable physical deep learning using optical dynamics with state-skipping training and single-map architecture.","authors":"Yongbo Zhang, Mitsumasa Nakajima, Katsuma Inoue, Toshikazu Hashimoto, Yasuo Kuniyoshi, Kohei Nakajima","doi":"10.1038/s43588-026-01075-w","DOIUrl":"10.1038/s43588-026-01075-w","url":null,"abstract":"<p><p>Escalating energy demands for high-performance machine learning have sparked growing interest in unconventional computing paradigms rooted in physical systems. Central to this direction is leveraging physical properties to design computing frameworks integrating strong learning capabilities, efficient training strategies and practical implementability. Here we present a simple, efficient and scalable framework aimed at achieving this, validated on an optoelectronic platform. This framework features our proposed training mechanism, state-skipping direct feedback alignment, together with our single-map architecture based on simple one-dimensional dynamics. The former eliminates the need to access the system's intermediate states during training, substantially simplifying error backpropagation, while the latter removes complex internal interconnections. Together, they enhance training efficiency and practical feasibility. Compared with conventional deep neural networks, our approach substantially reduces computational costs and trainable parameter count while achieving comparable performance. Integrated into modern architectures, our scheme attains improved performance with an approximately 40% reduction in computational resources. Notably, our approach challenges the scaling laws of conventional counterparts, underscoring its strong scalability and practical promise.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149345029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Machine learning dataset and benchmark for accurate T cell receptor-pHLA binding prediction.","authors":"Xinyuan Zhu, Jiadong Lu, Yeqing Lu, Yuyan Zhang, Fuli Feng","doi":"10.1038/s43588-026-01073-y","DOIUrl":"https://doi.org/10.1038/s43588-026-01073-y","url":null,"abstract":"<p><p>A central challenge in immunology and therapeutic design is accurately predicting the diverse interactions between T cell receptors and peptide-human leukocyte antigen (pHLA) complexes. Existing machine learning tools are hindered by incomplete sequence data and biased nonbinding examples. Here we present Hi-TPH, a large-scale hierarchical dataset featuring an on-the-fly selection method for generating nonbinding data. We further develop Hi-TPH-PLMs, a collection of protein language models (PLMs) with varied architectures and scales, fine-tuned on Hi-TPH. These models achieve a 19.2% performance gain over state-of-the-art tools on an external wet-lab test set. Leveraging the hierarchical structure of Hi-TPH, detailed analyses dissect the contribution of different molecular components to binding prediction and reveal their synergistic interplay; for instance, the prediction contribution of HLA relies on the presence of full T cell receptor chains. Hi-TPH and Hi-TPH-PLMs are publicly released to support the development of more reliable tools for advanced immunoinformatics research and personalized immunotherapy.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149278322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zizhuo Zhang, Yu Xia, Bo Yang, Xinping Guan, Qi Su
{"title":"Structure-coefficient theorem for evolutionary games on dynamic networks.","authors":"Zizhuo Zhang, Yu Xia, Bo Yang, Xinping Guan, Qi Su","doi":"10.1038/s43588-026-01068-9","DOIUrl":"https://doi.org/10.1038/s43588-026-01068-9","url":null,"abstract":"<p><p>Evolution unfolds in populations of reproducing individuals, with the dynamics shaped by numerous factors, including population structure, update rules, mutation rates, traits ('strategies') and the reproductive success derived from traits ('payoffs'). Developing a unifying principle to predict which traits will evolve and when, remains a major challenge. While rigorous mathematical results exist for static population structures, the general case of dynamic structures, where connections between individuals change over time, is more difficult and less understood. Here we present a structure-coefficient theorem for evolutionary games on dynamic networks with exogenous stochastic transitions. The framework enables arbitrary Markovian network dynamics independent of strategic interactions, together with arbitrary update mechanisms, mutation rates, strategy spaces and payoff matrices. We demonstrate that the combined effects of structure, update rules and mutation on evolutionary outcomes can be fully captured by three universal structure coefficients. Further analysis reveals that, although most sampled dynamic networks do not promote prosocial behavior, a class of dynamic core-periphery networks consistently promotes multiple forms of prosocial behavior, including cooperation, altruism, fairness and trust.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149247858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Making the case for a non-primary article","authors":"","doi":"10.1038/s43588-026-01078-7","DOIUrl":"10.1038/s43588-026-01078-7","url":null,"abstract":"Author-proposed non-primary articles can bring fresh and timely perspectives to the journal. Here, we discuss the factors that editors consider when assessing proposals for these contributions.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"6 10","pages":"1041-1041"},"PeriodicalIF":20.3,"publicationDate":"2026-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.nature.comhttps://www.nature.com/articles/s43588-026-01078-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149230840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid modeling for improved structure prediction of large protein complexes.","authors":"","doi":"10.1038/s43588-026-01067-w","DOIUrl":"https://doi.org/10.1038/s43588-026-01067-w","url":null,"abstract":"","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149198305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"HDOCK-Multimer: improved structure prediction of large protein complexes by integrating docking and combinatorial assembly.","authors":"Xuan Yao, Yifan Ya, Hao Li, Sheng-You Huang","doi":"10.1038/s43588-026-01062-1","DOIUrl":"10.1038/s43588-026-01062-1","url":null,"abstract":"<p><p>Accurate prediction of large protein assembly structures is crucial for understanding biological processes, yet remains a challenge for end-to-end approaches such as AlphaFold owing to their large size and intricate multi-chain interactions. Docking methods can handle large proteins, but suffer from the huge combinatorial binding space of multiple chains. Assembly methods offer an alternative way, but critically rely on the quality of predicted subcomponents. Here we present HDOCK-Multimer (HDM), a framework that integrates docking and combinatorial assembly for structure prediction of large protein complexes. HDM efficiently reduces reliance on subcomponent quality through docking, while leveraging the pairwise interactions of subcomponents through assembly. When evaluated on 3 benchmarks of 35 large heteromeric complexes, 172 large protein complexes and 7 CASP15 targets, HDM substantially outperforms state-of-the-art methods including CombFold, MoLPC, AlphaFold-Multimer and AlphaFold3. In addition, HDM also demonstrates the capacity to predict the stoichiometry and model the complex without stoichiometry input.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":20.3,"publicationDate":"2026-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149185998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}