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

A Quantum Annealing-Based System and Method for Formulation Optimization of Implantable Brain-Computer Interface Electrode Materials

tong dai

Published Jan 1, 2026• 0 citations
Publisher

Abstract

This study aims to develop a Quantum Annealing (QA)-based system for the combinatorial optimization and screening of component ratios, formulations, and process parameters of electrode materials for implantable brain-computer interfaces (BCI). BCI electrode materials — including bulk materials such as platinum-iridium alloy and surface coatings such as iridium oxide, titanium nitride, and conductive polymers — must simultaneously satisfy conflicting requirements of low interfacial impedance, high charge injection capacity, excellent mechanical stability, and favorable biocompatibility. The formulation space of these materials is enormous, and traditional trial-and-error approaches are inefficient and often fail to locate globally optimal combinations. We propose leveraging Quantum Annealing, specifically on D-Wave Advantage systems, to map the electrode material formulation optimization problem to a Quadratic Unconstrained Binary Optimization (QUBO) model, where component ratios, coating types, and fabrication process parameters are encoded as binary variables, and multi-objective performance functions are embedded as the QUBO objective. Expected outcomes include: a dedicated formulation-QUBO encoding scheme for BCI electrode materials; a multi-objective performance prediction model integrating electrochemical, mechanical, and biocompatibility indicators; and a Factorization Machine-Quantum Annealing (FMQA) iterative optimization framework that systematically screens thousands to tens of thousands of candidate formulations to identify globally optimal electrode material compositions.

DOI
10.17605/osf.io/4szqu

Related papers

Quantum optimization algorithm for solving elliptic boundary value problems on D-Wave quantum annealing device

Rebecca Conley, Deokkyu Choi, Gregory Medwig +4 more

The quantum annealing devices, which encode the solution to a computational problem in the ground state of a quantum Hamiltonian, are implemented in D-Wave systems with more than 2,000 qubits. However, quantum annealing can solve only a classical combinatorial optimization problem such as an Ising model, or equivalently, a quadratic unconstrained binary optimization (QUBO) problem. In this paper, we formulate the QUBO model to solve elliptic problems with Dirichlet and Neumann boundary conditions using the finite element method. In this formulation, we develop the objective function of quadratic binary variables represented by qubits and the system finds the binary string combination minimizing the objective function globally. Based on the QUBO formulation, we introduce an iterative algorithm to solve the elliptic problems. We discuss the validation of the modeling on the D-Wave quantum annealing system.

Quantum Computing, Communication, and Simulation•Mar 8, 2023•8 citations

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

•Sep 3, 2026•0 citations

Quantum-Enhanced Multi-Objective Optimization Framework for Accelerated Drug Discovery

Mostafijur Rahman Mamun

Abstract : We propose a hybrid quantum–classical framework that integrates variational quantum machine learning (QML) for molecular binding affinity prediction with quantum annealing for Pareto-optimal drug formulation design. Leveraging a four-qubit variational circuit, our QML model achieves superior predictive performance compared to state-of-the-art classical baselines, effectively capturing complex molecular interactions. In parallel, we formulate drug formulation optimization as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solve it using D-Wave’s quantum annealer, enabling efficient identification of Pareto-optimal solutions that balance bioavailability, toxicity, and stability. By unifying predictive modeling and combinatorial optimization within a single pipeline, our framework demonstrates the potential of near-term quantum devices to accelerate and enhance critical stages of drug discovery. These findings underscore the transformative role of NISQ-era algorithms in bridging molecular informatics and formulation design, paving the way for scalable, data-driven pharmaceutical innovation.

•Dec 29, 2025•0 citations

Hybrid artificial intelligence and quantum annealing as an optimization layer in drug discovery

Chia‐Ho Ou, Jun-cheng Liao, Chung‐Yao Huang +1 more

Artificial intelligence (AI) has greatly expanded the generative capacity of drug discovery, yet the ability to translate large candidate pools into structured, resource-aware decisions remains limited. This review addresses this emerging optimization bottleneck by examining quantum annealing as a potential decision-optimization layer within hybrid computational workflows. We focus on discrete, constraint-dominated tasks-such as compound subset selection, combinatorial design, and multi-objective prioritization-that can be formulated as quadratic unconstrained binary optimization (QUBO) problems. Rather than positioning quantum annealing as a predictive tool, we analyze its role as a complementary optimization interface integrated with AI-generated scores. We further discuss practical implementation considerations, including embedding overhead, noise, scalability, and benchmarking challenges. By emphasizing workflow-level design and rigorous evaluation, this review provides a pragmatic framework for assessing annealing-based optimization in drug discovery and related data-intensive scientific domains.

Patterns•Aug 1, 2026•0 citations

HYBRID QUANTUM ANNEALING–CLASSICAL OPTIMIZATION OF PERSONALIZED MULTI-DRUG CANCER THERAPY USING QUBO-BASED DIGITAL TWIN MODELING

Achile Solomon Egbunu, Peter Adetokunbo, Okedoye Akindele Michael

The optimization of multidrug cancer treatment schedules is a high-dimensional combinatorial optimization problem involving nonlinear tumor dynamics, pharmacokinetic interactions, and stringent toxicity constraints. When exploring large therapeutic search spaces, conventional optimization algorithms often exhibit limited scalability and become trapped in local optima. This simulation study proposes a hybrid quantum-classical optimization framework that employs QA to generate adaptive treatment schedules for precision oncology. The treatment scheduling problem is formulated as a quadratic unconstrained binary optimization (QUBO) model, which encodes drug combinations, dosing intervals, toxicity constraints, and synergistic interactions within an Ising Hamiltonian compatible with D-Wave quantum annealing hardware. Global combinatorial optimization is performed using a D-Wave Advantage quantum annealer, while sequential least squares programming refines continuous dosage parameters under pharmacokinetic and toxicity constraints. Tumor progression is represented using a modified Gompertz growth model coupled with first-order pharmacokinetic dynamics. The proposed framework was evaluated using synthetic Digital Twin datasets generated from clinically realistic pharmacokinetic and tumor growth parameters. Simulation results demonstrated a maximum tumor regression ratio of 0.98 ± 0.02, compared with 0.82 ± 0.05 for standard-of-care protocols, while maintaining a lower cumulative toxicity index (40 ± 5 versus 75 ± 8) and reducing optimization time to less than 2 s for 120-variable scheduling problems. The hybrid framework exhibited near-linear computational scalability and maintained robustness under stochastic dosage perturbations (TRR > 0.95 at σ = 0.25). However, predictive classification performance remained limited (AUC = 0.49), highlighting the need for validation using longitudinal clinical datasets and multimodal patient-specific data. These findings demonstrate the potential of hybrid quantum-classical optimization as a scalable computational framework for adaptive treatment scheduling and personalized precision oncology.

•Oct 22, 2026•0 citations

Data-driven multi-objective optimization for alloy recycling using factorization machines and quantum annealing

Thomas Plehn, Katrin Bugelnig, Silvana Tumminello +2 more

Quantum annealing has the potential to provide practical quantum advantage for complex optimization tasks. Here, we present a systematic assessment of an integrated factorization-machine and quantum-annealing workflow (FM+QA) for a technologically relevant application: multi-objective Pareto optimization in metal up-cycling through alloy design. To address the non-convex nature of the Pareto front, we employ the recently proposed data-driven Tchebycheff scalarization (DDTS) scheme. Our results show that FM+QA extends the applicability of QUBO-based optimization to data-driven materials discovery problems with multiple competing objectives. In particular, we analyze the scaling behavior of the approach and compare quantum annealing with classical simulated annealing using both regular binary encoding and one-hot encoding. Finally, we provide a critical perspective on the problem sizes and encoding strategies for which quantum-annealing-based optimization may become practically beneficial in the near future.

cond-mat.mtrl-sciCross-listedarXiv:2607.03208•Jul 6, 2026•1 citation
This study aims to develop a Quantum Annealing (QA)-based system for the combinatorial optimization and screening of component ratios, formulations, and process parameters of electrode materials for implantable brain-computer interfaces (BCI). BCI electrode materials — including bulk materials such as platinum-iridium alloy and surface coatings such as iridium oxide, titanium nitride, and conductive polymers — must simultaneously satisfy conflicting requirements of low interfacial impedance, high charge injection capacity, excellent mechanical stability, and favorable biocompatibility. The formulation space of these materials is enormous, and traditional trial-and-error approaches are inefficient and often fail to locate globally optimal combinations. We propose leveraging Quantum Annealing, specifically on D-Wave Advantage systems, to map the electrode material formulation optimization problem to a Quadratic Unconstrained Binary Optimization (QUBO) model, where component ratios, coating types, and fabrication process parameters are encoded as binary variables, and multi-objective performance functions are embedded as the QUBO objective. Expected outcomes include: a dedicated formulation-QUBO encoding scheme for BCI electrode materials; a multi-objective performance prediction model integrating electrochemical, mechanical, and biocompatibility indicators; and a Factorization Machine-Quantum Annealing (FMQA) iterative optimization framework that systematically screens thousands to tens of thousands of candidate formulations to identify globally optimal electrode material compositions.
The quantum annealing devices, which encode the solution to a computational problem in the ground state of a quantum Hamiltonian, are implemented in D-Wave systems with more than 2,000 qubits. However, quantum annealing can solve only a classical combinatorial optimization problem such as an Ising model, or equivalently, a quadratic unconstrained binary optimization (QUBO) problem. In this paper, we formulate the QUBO model to solve elliptic problems with Dirichlet and Neumann boundary conditions using the finite element method. In this formulation, we develop the objective function of quadratic binary variables represented by qubits and the system finds the binary string combination minimizing the objective function globally. Based on the QUBO formulation, we introduce an iterative algorithm to solve the elliptic problems. We discuss the validation of the modeling on the D-Wave quantum annealing system.
This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.
Abstract : We propose a hybrid quantum–classical framework that integrates variational quantum machine learning (QML) for molecular binding affinity prediction with quantum annealing for Pareto-optimal drug formulation design. Leveraging a four-qubit variational circuit, our QML model achieves superior predictive performance compared to state-of-the-art classical baselines, effectively capturing complex molecular interactions. In parallel, we formulate drug formulation optimization as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solve it using D-Wave’s quantum annealer, enabling efficient identification of Pareto-optimal solutions that balance bioavailability, toxicity, and stability. By unifying predictive modeling and combinatorial optimization within a single pipeline, our framework demonstrates the potential of near-term quantum devices to accelerate and enhance critical stages of drug discovery. These findings underscore the transformative role of NISQ-era algorithms in bridging molecular informatics and formulation design, paving the way for scalable, data-driven pharmaceutical innovation.
Artificial intelligence (AI) has greatly expanded the generative capacity of drug discovery, yet the ability to translate large candidate pools into structured, resource-aware decisions remains limited. This review addresses this emerging optimization bottleneck by examining quantum annealing as a potential decision-optimization layer within hybrid computational workflows. We focus on discrete, constraint-dominated tasks-such as compound subset selection, combinatorial design, and multi-objective prioritization-that can be formulated as quadratic unconstrained binary optimization (QUBO) problems. Rather than positioning quantum annealing as a predictive tool, we analyze its role as a complementary optimization interface integrated with AI-generated scores. We further discuss practical implementation considerations, including embedding overhead, noise, scalability, and benchmarking challenges. By emphasizing workflow-level design and rigorous evaluation, this review provides a pragmatic framework for assessing annealing-based optimization in drug discovery and related data-intensive scientific domains.
The optimization of multidrug cancer treatment schedules is a high-dimensional combinatorial optimization problem involving nonlinear tumor dynamics, pharmacokinetic interactions, and stringent toxicity constraints. When exploring large therapeutic search spaces, conventional optimization algorithms often exhibit limited scalability and become trapped in local optima. This simulation study proposes a hybrid quantum-classical optimization framework that employs QA to generate adaptive treatment schedules for precision oncology. The treatment scheduling problem is formulated as a quadratic unconstrained binary optimization (QUBO) model, which encodes drug combinations, dosing intervals, toxicity constraints, and synergistic interactions within an Ising Hamiltonian compatible with D-Wave quantum annealing hardware. Global combinatorial optimization is performed using a D-Wave Advantage quantum annealer, while sequential least squares programming refines continuous dosage parameters under pharmacokinetic and toxicity constraints. Tumor progression is represented using a modified Gompertz growth model coupled with first-order pharmacokinetic dynamics. The proposed framework was evaluated using synthetic Digital Twin datasets generated from clinically realistic pharmacokinetic and tumor growth parameters. Simulation results demonstrated a maximum tumor regression ratio of 0.98 ± 0.02, compared with 0.82 ± 0.05 for standard-of-care protocols, while maintaining a lower cumulative toxicity index (40 ± 5 versus 75 ± 8) and reducing optimization time to less than 2 s for 120-variable scheduling problems. The hybrid framework exhibited near-linear computational scalability and maintained robustness under stochastic dosage perturbations (TRR > 0.95 at σ = 0.25). However, predictive classification performance remained limited (AUC = 0.49), highlighting the need for validation using longitudinal clinical datasets and multimodal patient-specific data. These findings demonstrate the potential of hybrid quantum-classical optimization as a scalable computational framework for adaptive treatment scheduling and personalized precision oncology.
Quantum annealing has the potential to provide practical quantum advantage for complex optimization tasks. Here, we present a systematic assessment of an integrated factorization-machine and quantum-annealing workflow (FM+QA) for a technologically relevant application: multi-objective Pareto optimization in metal up-cycling through alloy design. To address the non-convex nature of the Pareto front, we employ the recently proposed data-driven Tchebycheff scalarization (DDTS) scheme. Our results show that FM+QA extends the applicability of QUBO-based optimization to data-driven materials discovery problems with multiple competing objectives. In particular, we analyze the scaling behavior of the approach and compare quantum annealing with classical simulated annealing using both regular binary encoding and one-hot encoding. Finally, we provide a critical perspective on the problem sizes and encoding strategies for which quantum-annealing-based optimization may become practically beneficial in the near future.