Application of the digital annealer unit in optimizing chemical reaction conditions for enhanced production yields
Abstract Finding optimal reaction conditions is crucial for chemical synthesis in the pharmaceutical and chemical industries. However, due to the vast chemical space, conducting experiments for all the possible combinations is impractical. Thus, quantitative structure–activity relationship (QSAR) mo...
Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2025-07-01
|
| Series: | Journal of Cheminformatics |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13321-025-01043-y |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract Finding optimal reaction conditions is crucial for chemical synthesis in the pharmaceutical and chemical industries. However, due to the vast chemical space, conducting experiments for all the possible combinations is impractical. Thus, quantitative structure–activity relationship (QSAR) models have been widely used to predict product yields, but evaluating all combinations is still computationally intensive. In this work, we demonstrate the use of Digital Annealer Unit (DAU) can tackle these large-scale optimization problems more efficiently. Two types of models are developed and tested on high-throughput experimentation (HTE) and Reaxys datasets. Our results suggest that the performance of models is comparable to classical machine learning (ML) methods (i.e., Random Forest and Multilayer Perceptron (MLP)), while the inference time of our models requires only seconds with a DAU. In active learning and autonomous reaction condition design, our model shows improvement for reaction yield prediction by incorporating new data, meaning that it can potentially be used in iterative processes. Our method can also accelerate the screening of billions of reaction conditions, achieving speeds millions of times faster than traditional computing units in identifying superior conditions. Graphical Abstract |
|---|---|
| ISSN: | 1758-2946 |