Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer

Abstract

In materials informatics, searching for chemical materials with desired properties is challenging due to the vastness of the chemical space. Moreover, the high cost of evaluating properties necessitates a search with a few clues. In practice, there is also a demand for proposing compositions that are easily synthesizable. In the real world, such as in the exploration of chemical materials, it is common to encounter problems targeting black-box objective functions where formalizing the objective function in explicit form is challenging, and the evaluation cost is high. In recent research, a Bayesian optimization method has been proposed to formulate the quadratic unconstrained binary optimization (QUBO) problem as a surrogate model for black-box objective functions with discrete variables. Regarding this method, studies have been conducted using the D-Wave quantum annealer to optimize the acquisition function, which is based on the surrogate model and determines the next exploration point for the black-box objective function. In this paper, we address optimizing a black-box objective function containing discrete variables in the context of actual chemical material exploration. In this optimization problem, we demonstrate results obtaining parameters of the acquisition function by sampling from a probability distribution with variance can explore the solution space more extensively than in the case of no variance. As a result, we found combinations of substituents in compositions with the desired properties, which could only be discovered when we set an appropriate variance.

arXiv comment14pages, 4figures, 4tables

References in corpus (25)

• Practical Bayesian Optimization of Machine Learning Algorithms
• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• Quantum Annealing and Analog Quantum Computation
• Mathematical Foundation of Quantum Annealing
• Quantum Boltzmann Machine
• What is the Computational Value of Finite Range Tunneling?
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• Nonnegative/binary matrix factorization with a D-Wave quantum annealer
• Traffic Signal Optimization on a Square Lattice with Quantum Annealing
• Bayesian Optimization of Combinatorial Structures
• Residual Energies after Slow Quantum Annealing
• Travel time optimization on multi-AGV routing by reverse annealing
• Benchmark test of Black-box optimization using D-Wave quantum annealer
• Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
• Fair Sampling by Simulated Annealing on Quantum Annealer
• Tackling the challenge of a huge materials science search space with quantum-inspired annealing
• Comparing the effects of Boltzmann machines as associative memory in Generative Adversarial Networks between classical and quantum sampling
• Virtual Screening of Chemical Space based on Quantum Annealing
• Maximum-Likelihood Channel Decoding with Quantum Annealing Machine
• Graph minor embedding can affect sampling degenerate ground states using quantum annealing
• Kernel Learning by quantum annealer
• Quadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps

Cited by in corpus (1)

• Subgradient Method using Quantum Annealing for Inequality-Constrained Binary Optimization Problems