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:2511.05750

From Quantum Annealing to Alloy Discovery: Towards Accelerated Design of High-Entropy Alloys

Ibarra-Hoyos, Diego, Connors, Peter, Jang, Ho, Grain, Nathan, Klich, Israel, Chern, Gia-Wei, Peter Kaehuei Liaw, Scully, John R., S. J. Poon

Published Nov 7, 2025• 0 citations
arXivHTMLPDF

Abstract

Data scarcity remains a central challenge in materials discovery, where finding meaningful descriptors and tuning models for generalization is critical but inherently a discrete optimization problem prone to multiple local minima confounding the true optimal state. Classical methods often get trapped in these minima, while quantum annealing can escape them via quantum fluctuations, including tunneling, that overcome narrow energy barriers. We present a quantum-assisted machine-learning (QaML) framework that employs quantum annealing to address these combinatorial optimization challenges through feature selection, support-vector training formulated in QUBO form for classification and regression, and a new QUBO-based neural-network pruning formulation. Recursive batching enables quantum annealing to handle large feature spaces beyond current qubit limits, while quantum-pruned networks exhibit superior generalization over classical methods, suggesting that quantum annealing preferentially samples flatter, more stable regions of the loss landscape. Applied to high-entropy alloys (HEAs), a data-limited but compositionally complex testbed, the framework integrates models for fracture-strain classification and yield-strength regression under physics-based constraints. The framework identified and experimentally validated Al8Cr38Fe50Mn2Ti2 (at.%), a single-phase BCC alloy exhibiting a 0.2 % yield strength of 568 MPa, greater than 40 % compressive strain without fracture, and a critical current density in reducing acid nearly an order of magnitude lower than 304 stainless steel. These results establish QA as a practical route to overcome classical optimization limits and accelerate materials discovery.

DOI
10.48550/arxiv.2511.05750

Related papers

Quantum-annealed machine learning discovers ductile, high strength and corrosion-resistant high-entropy alloy

Diego Ibarra Hoyos, Peter F. Connors, Ho Jang +6 more

Abstract Data scarcity remains a central challenge in materials discovery, where finding meaningful descriptors and tuning models for generalization is critical but inherently a discrete optimization problem prone to multiple local minima confounding the true optimal state. Classical methods often get trapped in these minima, while quantum annealing can escape them via quantum fluctuations, including tunneling, that overcome narrow energy barriers. We present a quantum-assisted machine-learning (QaML) framework that employs quantum annealing to address these combinatorial optimization challenges through feature selection, support-vector training formulated in QUBO form for classification and regression, and a new QUBO-based neural-network pruning formulation. Recursive batching enables quantum annealing to handle large feature spaces beyond current qubit limits, while quantum-pruned networks exhibit superior generalization over classical methods, suggesting that quantum annealing preferentially samples flatter, more stable regions of the loss landscape. Applied to high-entropy alloys (HEAs), a data-limited but compositionally complex testbed, the framework integrates models for fracture-strain classification and yield-strength regression under physics-based constraints. The framework identified and experimentally validated Al8Cr38Fe50Mn2Ti2 (at.%), a single-phase BCC alloy exhibiting a 0.2% yield strength of 568 MPa, greater than 40% compressive strain without fracture, and a critical current density in reducing acid nearly an order of magnitude lower than 304 stainless steel. These results establish QA as a practical route to overcome classical optimization limits and accelerate materials discovery.

npj Computational Materials•Mar 6, 2026•2 citations

Quantum Annealing-Driven Deep Learning Model Architecture Design

Jincheng Zhang

This paper proposes a novel approach to deep learning model architecture design by leveraging the principles of quantum annealing. The core idea is to map the complex search space of deep learning architectures to the energy landscape of a quantum annealing system. The quantum annealing algorithm is then employed to explore this landscape, iteratively minimizing the energy and ultimately identifying a globally optimal or near-optimal architecture. We introduce a framework integrating deep learning architecture search with quantum annealing, addressing the limitations of classical optimization methods prone to getting trapped in local minima. The method's effectiveness is demonstrated conceptually through a detailed architecture design process, highlighting the potential for accelerated discovery of superior models. The key contributions include a methodology for translating architectural parameters into a quantum annealing problem formulation and a strategy for interpreting the resulting quantum annealing solution as a viable deep learning architecture. Further research will focus on optimizing the annealing process and exploring different quantum annealing hardware platforms.

•Aug 29, 2026•0 citations

Quantum Annealing for Combinatorial Optimization of Neural Network Training

Jincheng Zhang

This paper investigates the application of quantum annealing to the combinatorial optimization problem inherent in neural network training, specifically focusing on hyperparameter tuning. Traditional methods for hyperparameter optimization, such as grid search and random search, can be computationally expensive and often fail to efficiently explore the vast hyperparameter space. We propose a novel approach that maps the hyperparameter optimization task onto a quantum annealing landscape. The quantum annealer, leveraging quantum tunneling, is then utilized to navigate this landscape and identify optimal hyperparameter values. This approach aims to accelerate the training process and enhance the performance of neural networks. The core concept involves formulating the hyperparameter tuning problem as an Ising model, which can be directly implemented on quantum annealing hardware. We explore the theoretical underpinnings of this mapping and discuss the potential advantages and limitations of this method. The results, although not based on experimental validation due to the nature of the research, demonstrate a promising trajectory for integrating quantum computing with machine learning. Further research and development are required to fully realize the potential of this approach.

•Sep 3, 2026•0 citations

Quantum-Inspired Optimization for Large-Scale Machine Learning

Jincheng Zhang

The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.

•Sep 6, 2026•0 citations

Quantum-Inspired Optimization of Large-Scale Machine Learning Algorithms

Jincheng Zhang

Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.

•Sep 7, 2026•0 citations

QUBO-Driven Quantum Annealing: A Unified Cloud-Scale Framework for Resource Forecasting, Classification, and Deep Learning Training

Yulian Song, Guozheng Zhao, Nan Wang +3 more

This paper proposes an integrated QUBO-based quantum-annealing optimization framework for next-generation cloud computing. First, for resource-demand forecasting, we blend Autoregressive (AR) models with Quadratic Unconstrained Binary Optimization (QUBO) and solve the resulting problem via Simulated Annealing; monthly-scale tests reveal superior trend-capture accuracy compared with classical predictors. Second, we embed quantum optimization into Support Vector Machines by casting kernel selection and penalty-parameter tuning as QUBO instances; evaluations on the Iris benchmark—and on synthetically enlarged variants—show marked gains in both classification accuracy and training speed, especially under large-data regimes. Third, we extend the same paradigm to deep learning: a QUBO-formulated quantum-annealing routine optimizes weight initialization and layer-wise learning rates in convolutional networks for image classification, yielding higher top-1 accuracy and reduced wall-clock training time. Across all tasks the hybrid quantum-classical solver consistently outperforms its classical counterparts while maintaining linear scalability in cloud environments. These results show the practical potential of quantum - enhanced algorithms for resource prediction, classification, and deep learning, and pave the way for wider use of quantum technologies in cloud - based AI services.

Applied and Computational Engineering•Aug 13, 2025•0 citations
Data scarcity remains a central challenge in materials discovery, where finding meaningful descriptors and tuning models for generalization is critical but inherently a discrete optimization problem prone to multiple local minima confounding the true optimal state. Classical methods often get trapped in these minima, while quantum annealing can escape them via quantum fluctuations, including tunneling, that overcome narrow energy barriers. We present a quantum-assisted machine-learning (QaML) framework that employs quantum annealing to address these combinatorial optimization challenges through feature selection, support-vector training formulated in QUBO form for classification and regression, and a new QUBO-based neural-network pruning formulation. Recursive batching enables quantum annealing to handle large feature spaces beyond current qubit limits, while quantum-pruned networks exhibit superior generalization over classical methods, suggesting that quantum annealing preferentially samples flatter, more stable regions of the loss landscape. Applied to high-entropy alloys (HEAs), a data-limited but compositionally complex testbed, the framework integrates models for fracture-strain classification and yield-strength regression under physics-based constraints. The framework identified and experimentally validated Al8Cr38Fe50Mn2Ti2 (at.%), a single-phase BCC alloy exhibiting a 0.2 % yield strength of 568 MPa, greater than 40 % compressive strain without fracture, and a critical current density in reducing acid nearly an order of magnitude lower than 304 stainless steel. These results establish QA as a practical route to overcome classical optimization limits and accelerate materials discovery.
Abstract Data scarcity remains a central challenge in materials discovery, where finding meaningful descriptors and tuning models for generalization is critical but inherently a discrete optimization problem prone to multiple local minima confounding the true optimal state. Classical methods often get trapped in these minima, while quantum annealing can escape them via quantum fluctuations, including tunneling, that overcome narrow energy barriers. We present a quantum-assisted machine-learning (QaML) framework that employs quantum annealing to address these combinatorial optimization challenges through feature selection, support-vector training formulated in QUBO form for classification and regression, and a new QUBO-based neural-network pruning formulation. Recursive batching enables quantum annealing to handle large feature spaces beyond current qubit limits, while quantum-pruned networks exhibit superior generalization over classical methods, suggesting that quantum annealing preferentially samples flatter, more stable regions of the loss landscape. Applied to high-entropy alloys (HEAs), a data-limited but compositionally complex testbed, the framework integrates models for fracture-strain classification and yield-strength regression under physics-based constraints. The framework identified and experimentally validated Al8Cr38Fe50Mn2Ti2 (at.%), a single-phase BCC alloy exhibiting a 0.2% yield strength of 568 MPa, greater than 40% compressive strain without fracture, and a critical current density in reducing acid nearly an order of magnitude lower than 304 stainless steel. These results establish QA as a practical route to overcome classical optimization limits and accelerate materials discovery.
This paper proposes a novel approach to deep learning model architecture design by leveraging the principles of quantum annealing. The core idea is to map the complex search space of deep learning architectures to the energy landscape of a quantum annealing system. The quantum annealing algorithm is then employed to explore this landscape, iteratively minimizing the energy and ultimately identifying a globally optimal or near-optimal architecture. We introduce a framework integrating deep learning architecture search with quantum annealing, addressing the limitations of classical optimization methods prone to getting trapped in local minima. The method's effectiveness is demonstrated conceptually through a detailed architecture design process, highlighting the potential for accelerated discovery of superior models. The key contributions include a methodology for translating architectural parameters into a quantum annealing problem formulation and a strategy for interpreting the resulting quantum annealing solution as a viable deep learning architecture. Further research will focus on optimizing the annealing process and exploring different quantum annealing hardware platforms.
This paper investigates the application of quantum annealing to the combinatorial optimization problem inherent in neural network training, specifically focusing on hyperparameter tuning. Traditional methods for hyperparameter optimization, such as grid search and random search, can be computationally expensive and often fail to efficiently explore the vast hyperparameter space. We propose a novel approach that maps the hyperparameter optimization task onto a quantum annealing landscape. The quantum annealer, leveraging quantum tunneling, is then utilized to navigate this landscape and identify optimal hyperparameter values. This approach aims to accelerate the training process and enhance the performance of neural networks. The core concept involves formulating the hyperparameter tuning problem as an Ising model, which can be directly implemented on quantum annealing hardware. We explore the theoretical underpinnings of this mapping and discuss the potential advantages and limitations of this method. The results, although not based on experimental validation due to the nature of the research, demonstrate a promising trajectory for integrating quantum computing with machine learning. Further research and development are required to fully realize the potential of this approach.
The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.
Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.
This paper proposes an integrated QUBO-based quantum-annealing optimization framework for next-generation cloud computing. First, for resource-demand forecasting, we blend Autoregressive (AR) models with Quadratic Unconstrained Binary Optimization (QUBO) and solve the resulting problem via Simulated Annealing; monthly-scale tests reveal superior trend-capture accuracy compared with classical predictors. Second, we embed quantum optimization into Support Vector Machines by casting kernel selection and penalty-parameter tuning as QUBO instances; evaluations on the Iris benchmark—and on synthetically enlarged variants—show marked gains in both classification accuracy and training speed, especially under large-data regimes. Third, we extend the same paradigm to deep learning: a QUBO-formulated quantum-annealing routine optimizes weight initialization and layer-wise learning rates in convolutional networks for image classification, yielding higher top-1 accuracy and reduced wall-clock training time. Across all tasks the hybrid quantum-classical solver consistently outperforms its classical counterparts while maintaining linear scalability in cloud environments. These results show the practical potential of quantum - enhanced algorithms for resource prediction, classification, and deep learning, and pave the way for wider use of quantum technologies in cloud - based AI services.