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

Progress on Data-Driven, Multi-Objective Quantum Optimization

Plehn, Thomas, Barragan-Yani, Daniel, Breitbarth, Eric, Requena, Guillermo, Melching, David

Published Dec 12, 2025• 0 citations
arXivHTMLPDF

Abstract

Here, we present two complementary approaches that advance quadratic unconstrained binary optimization (QUBO) toward practical use in data-driven materials design and other real-valued black-box optimization tasks. First, we introduce a simple yet powerful preprocessing scheme that, when applied to a machine-learned QUBO model, entirely removes system-level equality constraints by construction. This makes cumbersome soft-penalty terms obsolete, simplifies QUBO formulation, and substantially accelerates solution search. Second, we develop a multi-objective optimization strategy inspired by Tchebycheff scalarization that is compatible with non-convex objective landscapes and outperforms existing QUBO-based Pareto front methods. We demonstrate the effectiveness of both approaches using a simplified model of a multi-phase aluminum alloy design problem, highlighting significant gains in efficiency and solution quality. Together, these methods broaden the applicability of QUBO-based optimization and provide practical tools for data-driven materials discovery and beyond.

DOI
10.48550/arxiv.2512.11479

Related papers

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•0 citations

Binary Optimization with Complex Constraints via Quantum Approximate Multi-Objective Optimization

Andres Ruiz, Soumyadip Ghosh, Stefan Woerner

We show that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems. When the objective and constraints depend on a small number of quadratic features and are monotone with respect to their preferred directions, at least one globally optimal solution lies in the Pareto set of the associated MO-QUBO. This enables the constraints to be evaluated classically on Pareto-optimal candidates rather than encoded as penalties. We demonstrate the approach for binary portfolio optimization under a Conditional Value-at-Risk constraint. Using Quantum Approximate Multi-Objective Optimization on an illustrative 100-asset instance, we approximate the mean-variance Pareto front using an IBM Quantum computer and derive mean-CVaR fronts through classical post-processing. The hardware results recover the overall structure of the classical front and yield near-optimal feasible portfolios for different risk bounds.

quant-pharXiv:2609.13790•Sep 15, 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

Multi-objective QUBO solver

Mayowa Ayodele, Richard Allmendinger, Manuel López‐Ibáñez +1 more

Quantum and quantum-inspired optimisation algorithms are designed to solve problems represented in binary, quadratic and unconstrained form. Combinatorial optimisation problems are therefore often formulated as Quadratic Unconstrained Binary Optimisation Problems (QUBO) to solve them with these algorithms. Moreover, these QUBO solvers are often implemented using specialised hardware to achieve enormous speedups, e.g. Fujitsu's Digital Annealer (DA) and D-Wave's Quantum Annealer. However, these are single-objective solvers, while many real-world problems feature multiple conflicting objectives. Thus, a common practice when using these QUBO solvers is to scalarise such multi-objective problems into a sequence of single-objective problems. Due to design trade-offs of these solvers, formulating each scalarisation may require more time than finding a local optimum. We present the first attempt to extend the algorithm supporting a commercial QUBO solver as a multi-objective solver that is not based on scalarisation. The proposed multi-objective DA algorithm is validated on the bi-objective Quadratic Assignment Problem. We observe that algorithm performance significantly depends on the archiving strategy adopted, and that combining DA with non-scalarisation methods to optimise multiple objectives outperforms the current scalarised version of the DA in terms of final solution quality.

arXiv:2205.13399•Genetic and Evolutionary Computation Conference (GECCO)•Jul 8, 2022•13 citations

Harnessing quantum power: Revolutionizing materials design through advanced quantum computation

Zikang Guo, Rui Li, Xianfeng He +2 more

Abstract The design of advanced materials for applications in areas of photovoltaics, energy storage, and structural engineering has made significant strides. However, the rapid proliferation of candidate materials—characterized by structural complexity that complicates the relationships between features—presents substantial challenges in manufacturing, fabrication, and characterization. This review introduces a comprehensive methodology for materials design using cutting‐edge quantum computing, with a particular focus on quadratic unconstrained binary optimization (QUBO) and quantum machine learning (QML). We introduce the loop framework for QUBO‐empowered materials design, including constructing high‐quality datasets that capture critical material properties, employing tailored computational methods for precise material modeling, developing advanced figures of merit to evaluate performance metrics, and utilizing quantum optimization algorithms to discover optimal materials. In addition, we delve into the core principles of QML and illustrate its transformative potential in accelerating material discovery through a range of quantum simulations and innovative adaptations. The review also highlights advanced active learning strategies that integrate quantum artificial intelligence, offering a more efficient pathway to explore the vast, complex material design space. Finally, we discuss the key challenges and future opportunities for QML in material design, emphasizing their potential to revolutionize the field and facilitate groundbreaking innovations.

Materials Genome Engineering Advances•Dec 1, 2024•11 citations

Quantum Optimization in Loc(Q)ation Science: QUBO Formulations, Benchmark Problems, and a Computational Study

Felix P. Broesamle, Stefan Nickel

Recent advances in quantum computing and the increasing availability of quantum hardware have substantially enhanced the practical relevance of quantum approaches to discrete optimization. Among these, the Quadratic Unconstrained Binary Optimization (QUBO) formulation provides a unifying modeling framework for a broad class of $\mathbf{NP}$-hard problems and is naturally suited to quantum computing and quantum-inspired algorithms. Location science, network design, and logistics represent core application domains of discrete optimization, combining high practical impact with substantial computational challenges. In this work, we develop QUBO formulations for several fundamental problems in these domains, including a nonlinear integer formulation of the Discrete Ordered Median Problem (DOMP). Beyond their modeling relevance, these QUBO formulations serve as representative benchmark problems for assessing quantum algorithms and quantum hardware. We further derive a tight bound for the penalty parameter ensuring equivalence between the QUBO formulation and its underlying integer program. Finally, we conduct a comprehensive computational study using QAOA, WS-QAOA, and classical heuristics for QUBO instances of the $p$-Median Problem and the Fixed-Charge Facility Location Problem (FCFLP), and introduce two effective warm-start strategies for WS-QAOA based on its linear programming relaxation.

quant-pharXiv:2602.10951•Feb 12, 2026•0 citations
Here, we present two complementary approaches that advance quadratic unconstrained binary optimization (QUBO) toward practical use in data-driven materials design and other real-valued black-box optimization tasks. First, we introduce a simple yet powerful preprocessing scheme that, when applied to a machine-learned QUBO model, entirely removes system-level equality constraints by construction. This makes cumbersome soft-penalty terms obsolete, simplifies QUBO formulation, and substantially accelerates solution search. Second, we develop a multi-objective optimization strategy inspired by Tchebycheff scalarization that is compatible with non-convex objective landscapes and outperforms existing QUBO-based Pareto front methods. We demonstrate the effectiveness of both approaches using a simplified model of a multi-phase aluminum alloy design problem, highlighting significant gains in efficiency and solution quality. Together, these methods broaden the applicability of QUBO-based optimization and provide practical tools for data-driven materials discovery and beyond.
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.
We show that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems. When the objective and constraints depend on a small number of quadratic features and are monotone with respect to their preferred directions, at least one globally optimal solution lies in the Pareto set of the associated MO-QUBO. This enables the constraints to be evaluated classically on Pareto-optimal candidates rather than encoded as penalties. We demonstrate the approach for binary portfolio optimization under a Conditional Value-at-Risk constraint. Using Quantum Approximate Multi-Objective Optimization on an illustrative 100-asset instance, we approximate the mean-variance Pareto front using an IBM Quantum computer and derive mean-CVaR fronts through classical post-processing. The hardware results recover the overall structure of the classical front and yield near-optimal feasible portfolios for different risk bounds.
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.
Quantum and quantum-inspired optimisation algorithms are designed to solve problems represented in binary, quadratic and unconstrained form. Combinatorial optimisation problems are therefore often formulated as Quadratic Unconstrained Binary Optimisation Problems (QUBO) to solve them with these algorithms. Moreover, these QUBO solvers are often implemented using specialised hardware to achieve enormous speedups, e.g. Fujitsu's Digital Annealer (DA) and D-Wave's Quantum Annealer. However, these are single-objective solvers, while many real-world problems feature multiple conflicting objectives. Thus, a common practice when using these QUBO solvers is to scalarise such multi-objective problems into a sequence of single-objective problems. Due to design trade-offs of these solvers, formulating each scalarisation may require more time than finding a local optimum. We present the first attempt to extend the algorithm supporting a commercial QUBO solver as a multi-objective solver that is not based on scalarisation. The proposed multi-objective DA algorithm is validated on the bi-objective Quadratic Assignment Problem. We observe that algorithm performance significantly depends on the archiving strategy adopted, and that combining DA with non-scalarisation methods to optimise multiple objectives outperforms the current scalarised version of the DA in terms of final solution quality.
Abstract The design of advanced materials for applications in areas of photovoltaics, energy storage, and structural engineering has made significant strides. However, the rapid proliferation of candidate materials—characterized by structural complexity that complicates the relationships between features—presents substantial challenges in manufacturing, fabrication, and characterization. This review introduces a comprehensive methodology for materials design using cutting‐edge quantum computing, with a particular focus on quadratic unconstrained binary optimization (QUBO) and quantum machine learning (QML). We introduce the loop framework for QUBO‐empowered materials design, including constructing high‐quality datasets that capture critical material properties, employing tailored computational methods for precise material modeling, developing advanced figures of merit to evaluate performance metrics, and utilizing quantum optimization algorithms to discover optimal materials. In addition, we delve into the core principles of QML and illustrate its transformative potential in accelerating material discovery through a range of quantum simulations and innovative adaptations. The review also highlights advanced active learning strategies that integrate quantum artificial intelligence, offering a more efficient pathway to explore the vast, complex material design space. Finally, we discuss the key challenges and future opportunities for QML in material design, emphasizing their potential to revolutionize the field and facilitate groundbreaking innovations.
Recent advances in quantum computing and the increasing availability of quantum hardware have substantially enhanced the practical relevance of quantum approaches to discrete optimization. Among these, the Quadratic Unconstrained Binary Optimization (QUBO) formulation provides a unifying modeling framework for a broad class of NP\mathbf{NP}NP-hard problems and is naturally suited to quantum computing and quantum-inspired algorithms. Location science, network design, and logistics represent core application domains of discrete optimization, combining high practical impact with substantial computational challenges. In this work, we develop QUBO formulations for several fundamental problems in these domains, including a nonlinear integer formulation of the Discrete Ordered Median Problem (DOMP). Beyond their modeling relevance, these QUBO formulations serve as representative benchmark problems for assessing quantum algorithms and quantum hardware. We further derive a tight bound for the penalty parameter ensuring equivalence between the QUBO formulation and its underlying integer program. Finally, we conduct a comprehensive computational study using QAOA, WS-QAOA, and classical heuristics for QUBO instances of the ppp-Median Problem and the Fixed-Charge Facility Location Problem (FCFLP), and introduce two effective warm-start strategies for WS-QAOA based on its linear programming relaxation.