Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2305.19625 · Physical Review Research

Accelerating optimal elemental configuration search in crystal using Ising machine

Kazuhide Ichikawa, Satoru Ohuchi, Koki Ueno, Tomoyasu Yokoyama

Published Sep 20, 2024• 7 citations
arXivHTMLPDF

Abstract

This research demonstrates that Ising machines can effectively solve optimal elemental configuration searches in crystals, with Au-Cu alloys serving as an example. The energy function is derived using the cluster expansion method in the form of a QUBO function, enabling efficient problem-solving via Ising machines. Using the third-generation Fujitsu's Digital Annealer, we have successfully obtained reasonable solutions for crystal structures consisting of over 10 000 atoms. Notably, we have also obtained plausible solutions for optimization problems with constrained solutions, such as situations where the composition ratio of atomic species is predetermined. These findings suggest that Ising machines can be valuable tools for addressing materials science challenges. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.033321

Related papers

Optimal elemental configuration search in crystal using quantum approximate optimization algorithm

Kazuhide Ichikawa, Genta Hayashi, Satoru Ohuchi +3 more

Optimal elemental configuration search in crystal is a crucial task to discovering industrially important materials such as lithium-ion battery cathodes. In this paper we present application of quantum approximate optimization algorithm, the representative near-term quantum algorithm for combinatorial optimization, to finding the most stable elemental configuration in a crystal, using Au-Cu alloys as an example. After expressing the energy of the crystal in the form of the Ising model through the cluster expansion method combined with first-principles calculations, we numerically perform QAOA with three types of parameter optimization. As a result, we have demonstrated that the optimal solution can be sampled with a high probability for crystals containing up to 32 atoms. Our results could pave the way for optimal elemental configuration search in a crystal using a near-term quantum computer.

arXiv:2503.09356•Mar 12, 2025•7 citations

Annealing for prediction of grand canonical crystal structures: Implementation of n -body atomic interactions

Yannick Couzinié, Yusuke Nishiya, Hirofumi Nishi +3 more

We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n -body atomic interactions and in particular three-body interactions which are necessary to simulate covalent bonds. The crystal structure is represented by discretizing a unit cell and placing binary variables which express the existence or nonexistence of an atom on every grid point. The resulting quadratic unconstrained binary optimization (QUBO) or higher-order unconstrained binary optimization (HUBO) problems implement the CSP problem and is solved using simulated and quantum annealing. Using the example of Lennard-Jones clusters we show that it is not necessary to include the target atom number in the formulation allowing for simultaneous optimization of both the particle density and the configuration and argue that this is advantageous for use on annealing machines as it reduces the total amount of interactions. We further provide a scheme that allows for reduction of higher-order interaction terms that is inspired by the underlying physics. We show for a covalently bonded monolayer MoS2 crystal that we can simultaneously optimize for the particle density as well as the crystal structure using simulated annealing. We also show that we reproduce ground states of the interatomic potential with high probability that are not represented on the initial discretization of the unit cell. Published by the American Physical Society 2024

arXiv:2307.03123•Physical Review A•Mar 15, 2024•10 citations

Accelerating optimization of composite material formulations having best property through AI models and quasi-quantum computing methods

Kohsuke Kakuda, Suguru Sakaguchi, Yoshishige Okuno

Abstract Integrating AI into materials science accelerates material discovery. This study develops an Ising model for composite material optimization using machine learning and solves it efficiently with an annealing computer. Unlike traditional methods limited to directly representable problems, our approach converts machine learning into Ising models. It includes a transformation unit to binarize variables, a training unit to learn an Ising model, and an output unit to optimize using the trained model. With an annealing computer, we achieve speeds tens of thousands of times faster than exhaustive methods. Compositional constraints are incorporated as penalty functions to ensure valid combinations. This novel method transforms machine learning predictions into Ising models, enabling rapid optimization and advancing AI applications in materials science. Graphical abstract

MRS Advances•Jun 9, 2025•4 citations

Investigating the Characteristics of Ising Machines

Kazuhiko Komatsu, Makoto Onoda, Masahito Kumagai +1 more

Recently, Ising machines have garnered attention as accelerators for resolving combinatorial optimization problems by converting them into Quadratic Unconstrained Binary Optimization (QUBO) problems. Ising machines have been rapidly developed with various implementations. For instance, there are different Ising machines like quantum annealing machines that use analog quantum circuits, simulated annealing machines that use digital processors like CPU, GPU, and VE, and digital annealing machines that use digital circuits such as CMOS and FPGA. However, the characteristics of Ising machines have not been fully comprehended, because a standardized evaluation method and a commonly used benchmark program for Ising machines have not been established yet. This research focuses on combinatorial clustering as a benchmark program for the evaluation of Ising machines, aiming to investigate the characteristics of Ising machines.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•3 citations

Finding optimal pathways in chemical reaction networks using Ising machines

Yuta Mizuno, Tamiki Komatsuzaki

Finding optimal pathways in chemical reaction networks is essential for elucidating and designing chemical processes, with significant applications such as synthesis planning and metabolic pathway analysis. Such a chemical pathway-finding problem can be formulated as a constrained combinatorial optimization problem, aiming to find an optimal combination of chemical reactions connecting starting materials to target materials in a given network. Due to combinatorial explosion, the computation time required to find an optimal pathway increases exponentially with the network size. Ising machines, including quantum and simulated annealing devices, are promising novel computers dedicated to such hard combinatorial optimization. However, to the best of our knowledge, there has yet to be an attempt to apply Ising machines to chemical pathway-finding problems. In this article, we present the Ising/quantum computing application for chemical pathway-finding problems. The Ising model, translated from a chemical pathway-finding problem, involves several types of penalty terms for violating constraints. It is not obvious how to set appropriate penalty strengths of different types. To address this challenge, we employ Bayesian optimization for parameter tuning. Furthermore, we introduce a technique that enhances tuning performance by grouping penalty terms according to the underlying problem structure. The performance evaluation and analysis of the proposed algorithm were conducted using a D-Wave Advantage system and simulated annealing. The benchmark results reveal challenges in finding exact optimal pathways. Concurrently, the results indicate the feasibility of finding approximate optimal pathways, provided that a certain degree of relative error in cost value is acceptable. Published by the American Physical Society 2024

arXiv:2308.04544•Physical Review Research•Jan 29, 2024•12 citations

Self-Adaptive Ising Machines for Constrained Optimization

Corentin Delacour

Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization problems such as finding maximum cuts in graphs. However, despite their importance in practical applications, constrained problems remain challenging to solve for IMs that require large quadratic energy penalties to ensure the correspondence between energy ground states and constrained optimal solutions. To relax this requirement, we propose a self-adaptive IM that iteratively shapes its energy landscape using a Lagrange relaxation of constraints and avoids prior tuning of penalties. Using a probabilistic-bit (p-bit) IM emulated in software, we benchmark our algorithm with multidimensional knapsack problems (MKP) and quadratic knapsack problems (QKP), the latter being an Ising problem with linear constraints. For QKP with 300 variables, the proposed algorithm finds better solutions than state-of-the-art IMs such as Fujitsu's Digital Annealer and requires 7,500x fewer samples. Our results show that adapting the energy landscape during the search can speed up IMs for constrained optimization.

arXiv:2501.04971•Design, Automation, and Test in Europe•Mar 31, 2025•3 citations
This research demonstrates that Ising machines can effectively solve optimal elemental configuration searches in crystals, with Au-Cu alloys serving as an example. The energy function is derived using the cluster expansion method in the form of a QUBO function, enabling efficient problem-solving via Ising machines. Using the third-generation Fujitsu's Digital Annealer, we have successfully obtained reasonable solutions for crystal structures consisting of over 10 000 atoms. Notably, we have also obtained plausible solutions for optimization problems with constrained solutions, such as situations where the composition ratio of atomic species is predetermined. These findings suggest that Ising machines can be valuable tools for addressing materials science challenges. Published by the American Physical Society 2024
Optimal elemental configuration search in crystal is a crucial task to discovering industrially important materials such as lithium-ion battery cathodes. In this paper we present application of quantum approximate optimization algorithm, the representative near-term quantum algorithm for combinatorial optimization, to finding the most stable elemental configuration in a crystal, using Au-Cu alloys as an example. After expressing the energy of the crystal in the form of the Ising model through the cluster expansion method combined with first-principles calculations, we numerically perform QAOA with three types of parameter optimization. As a result, we have demonstrated that the optimal solution can be sampled with a high probability for crystals containing up to 32 atoms. Our results could pave the way for optimal elemental configuration search in a crystal using a near-term quantum computer.
We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n -body atomic interactions and in particular three-body interactions which are necessary to simulate covalent bonds. The crystal structure is represented by discretizing a unit cell and placing binary variables which express the existence or nonexistence of an atom on every grid point. The resulting quadratic unconstrained binary optimization (QUBO) or higher-order unconstrained binary optimization (HUBO) problems implement the CSP problem and is solved using simulated and quantum annealing. Using the example of Lennard-Jones clusters we show that it is not necessary to include the target atom number in the formulation allowing for simultaneous optimization of both the particle density and the configuration and argue that this is advantageous for use on annealing machines as it reduces the total amount of interactions. We further provide a scheme that allows for reduction of higher-order interaction terms that is inspired by the underlying physics. We show for a covalently bonded monolayer MoS2 crystal that we can simultaneously optimize for the particle density as well as the crystal structure using simulated annealing. We also show that we reproduce ground states of the interatomic potential with high probability that are not represented on the initial discretization of the unit cell. Published by the American Physical Society 2024
Abstract Integrating AI into materials science accelerates material discovery. This study develops an Ising model for composite material optimization using machine learning and solves it efficiently with an annealing computer. Unlike traditional methods limited to directly representable problems, our approach converts machine learning into Ising models. It includes a transformation unit to binarize variables, a training unit to learn an Ising model, and an output unit to optimize using the trained model. With an annealing computer, we achieve speeds tens of thousands of times faster than exhaustive methods. Compositional constraints are incorporated as penalty functions to ensure valid combinations. This novel method transforms machine learning predictions into Ising models, enabling rapid optimization and advancing AI applications in materials science. Graphical abstract
Recently, Ising machines have garnered attention as accelerators for resolving combinatorial optimization problems by converting them into Quadratic Unconstrained Binary Optimization (QUBO) problems. Ising machines have been rapidly developed with various implementations. For instance, there are different Ising machines like quantum annealing machines that use analog quantum circuits, simulated annealing machines that use digital processors like CPU, GPU, and VE, and digital annealing machines that use digital circuits such as CMOS and FPGA. However, the characteristics of Ising machines have not been fully comprehended, because a standardized evaluation method and a commonly used benchmark program for Ising machines have not been established yet. This research focuses on combinatorial clustering as a benchmark program for the evaluation of Ising machines, aiming to investigate the characteristics of Ising machines.
Finding optimal pathways in chemical reaction networks is essential for elucidating and designing chemical processes, with significant applications such as synthesis planning and metabolic pathway analysis. Such a chemical pathway-finding problem can be formulated as a constrained combinatorial optimization problem, aiming to find an optimal combination of chemical reactions connecting starting materials to target materials in a given network. Due to combinatorial explosion, the computation time required to find an optimal pathway increases exponentially with the network size. Ising machines, including quantum and simulated annealing devices, are promising novel computers dedicated to such hard combinatorial optimization. However, to the best of our knowledge, there has yet to be an attempt to apply Ising machines to chemical pathway-finding problems. In this article, we present the Ising/quantum computing application for chemical pathway-finding problems. The Ising model, translated from a chemical pathway-finding problem, involves several types of penalty terms for violating constraints. It is not obvious how to set appropriate penalty strengths of different types. To address this challenge, we employ Bayesian optimization for parameter tuning. Furthermore, we introduce a technique that enhances tuning performance by grouping penalty terms according to the underlying problem structure. The performance evaluation and analysis of the proposed algorithm were conducted using a D-Wave Advantage system and simulated annealing. The benchmark results reveal challenges in finding exact optimal pathways. Concurrently, the results indicate the feasibility of finding approximate optimal pathways, provided that a certain degree of relative error in cost value is acceptable. Published by the American Physical Society 2024
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization problems such as finding maximum cuts in graphs. However, despite their importance in practical applications, constrained problems remain challenging to solve for IMs that require large quadratic energy penalties to ensure the correspondence between energy ground states and constrained optimal solutions. To relax this requirement, we propose a self-adaptive IM that iteratively shapes its energy landscape using a Lagrange relaxation of constraints and avoids prior tuning of penalties. Using a probabilistic-bit (p-bit) IM emulated in software, we benchmark our algorithm with multidimensional knapsack problems (MKP) and quadratic knapsack problems (QKP), the latter being an Ising problem with linear constraints. For QKP with 300 variables, the proposed algorithm finds better solutions than state-of-the-art IMs such as Fujitsu's Digital Annealer and requires 7,500x fewer samples. Our results show that adapting the energy landscape during the search can speed up IMs for constrained optimization.