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

QC-Adviser: Quantum Hardware Recommendations for Solving Industrial Optimization Problems

Djamel Laps-Bouraba, Markus Zajac, Uta Störl

Published Jan 1, 2025• 0 citations
arXivHTMLPDF

Abstract

The availability of quantum hardware via the cloud offers opportunities for new approaches to computing optimization problems in an industrial environment. However, selecting the right quantum hardware is difficult for non-experts due to its technical characteristics. In this paper, we present the QC-Adviser prototype, which supports users in selecting suitable quantum annealer hardware without requiring quantum computing knowledge.

DOI
10.18420/inf2025_156

Related papers

A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem

Deborah Volpe, Nils Quetschlich, Mariagrazia Graziano +2 more

Leveraging quantum computers for optimization problems holds promise across various application domains. Nevertheless, utilizing respective quantum computing solvers requires describing the optimization problem according to the Quadratic Unconstrained Binary Optimization (QUBO) formalism and selecting a proper solver for the application of interest with a reasonable setting. Both demand significant proficiency in quantum computing, QUBO formulation, and quantum solvers, a background that usually cannot be assumed by end users who are domain experts rather than quantum computing specialists. While tools aid in QUBO formulations, support for selecting the best-solving approach remains absent. This becomes even more challenging because selecting the best solver for a problem heavily depends on the problem itself. In this work, we are accepting this challenge and propose a predictive selection approach, which aids end users in this task. To this end, the solver selection task is first formulated as a classification task that is suitable to be solved by supervised machine learning. Based on that, we then propose strategies for adjusting solver parameters based on problem size and characteristics. Experimental evaluations, considering more than 500 different QUBO problems, confirm the benefits of the proposed solution. In fact, we show that in more than 70% of the cases, the best solver is selected, and in about 90% of the problems, a solver in the top two, i.e., the best or its closest suboptimum, is selected. This exploration proves the potential of machine learning in quantum solver selection and lays the foundations for its automation, broadening access to quantum optimization for a wider range of users. The pre-trained classifier is integrated into the MQT Quantum Auto Optimizer (MQT QAO) framework, publicly available on GitHub (https://github.com/cda-tum/mqt-qao) as part of the Munich Quantum Toolkit (MQT).

arXiv:2408.03613•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•5 citations

Quantum Optimization Applications With Quark and Quapps: Bridging the Gap Between Application and Hardware [Focus: Quantum Software and its Engineering]

Lukas Windgätter, Elisabeth Lobe

Solving discrete optimization problems is one of the most promising use cases on quantum computers with tremendous potential both in research and industry. We present two libraries quark and quapps which provide an easily usable, modular workflow to encode discrete optimization problems and interface them to both classical and quantum hardware. We provide a collection of already implemented optimization problems which can be easily adapted by the user and run on different solvers. From this we derive an additional instance data set that can directly be used to benchmark and test quantum hardware. In conjunction both libraries and the instance data set enable both expert and non-expert users to easily implement optimization problems, run them on classical and quantum machines and simplify benchmarking on quantum machines.

IEEE Software•May 1, 2025•1 citation

Quantum-ready vector quantization: Prototype learning as a binary optimization problem

Alexander Engelsberger, Thomas Villmann

Quantum Computing Research proposed strategies to solve binary optimization problems.Application on current and near-term generation Hardware is possible.Even if computational benefits of the strategies are yet to be shown, we want to explore connections to prototype learning schemes.We examine cost functions for vector quantization based on data point selection and how they can be transformed into a common quadratic unconstrained binary optimization formulation (QUBO).There are different approaches for solving QUBO problems using quantum computer or quantum annealer hardware.We look at their current limits and how they might change.

European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN)•Jan 1, 2023•4 citations

Solving Combinatorial Optimization Problems on a D-Wave Quantum Annealer and Development of Higher Level Hardware Abstraction Layers

Julian Hatzky

The area of quantum computing is a relatively new and promising branch of computation that hopes to provide help especially in the field of non-deterministic polynomial hard problems. Due to the fact that quantum computers are a heuristically non-binary approach to computation, based on the effects of quantum mechanics, a bunch of advantages and disadvantages come with it. The following work focuses especially on so-called quantum annealers, a special architecture of quantum computers that one can see as an application-specific unit that is using certain quantum mechanical effects to target binary quadratic optimization problems of the class of non-deterministic polynomial-time problems and tries to solve them faster than classical computers can do. Because this is a whole new area, it lacks extensive software support which is addressed in this work. Hence the majority of the thesis aims to develop and extend software that enables users to solve problem instances on a quantum annealer fast and reliable. Furthermore, the necessary steps to solve combinatorial optimization problems are explained and the necessary background of quantum physics theory is given. In conclusion, the main question of this work can be described as follows: 'Is it possible to create an automated pipeline to solve problems on a D-Wave Systems n.d. quantum annealer?'.

•May 3, 2021•1 citation

Facilitating Quantum Readiness Identifying and Implementing Relevant QC-Use Cases

Jochen Szangolies

Quantum computing potentially enables the acceleration of key problems in science, engineering, and industry. However, between domain experts capable of supplying relevant use cases and quantum computing researchers possessing the expertise to implement novel solutions, there exists a 'know how-knowledge gap'. Therefore, methodologies need to be developed to identify quantum computing relevant use cases by bridging the divide and enabling co-development for near-term quantum hardware. We present a strategy using short-term, results oriented projects to quickly gauge the potential of proposed use cases to find opportunities for robust future quantum advantage.

•Oct 29, 2024•0 citations

Using and Evaluating Quantum Computing for Information Retrieval and Recommender Systems

Maurizio Ferrari Dacrema, Andrea Pasin, Paolo Cremonesi +1 more

The field of Quantum Computing (QC) has gained significant popularity in recent years, due to its potential to provide benefits in terms of efficiency and effectiveness when employed to solve certain computationally intensive tasks. In both Information Retrieval (IR) and Recommender Systems (RS) we are required to build methods that apply complex processing on large and heterogeneous datasets, it is natural therefore to wonder whether QC could also be applied to boost their performance. The tutorial aims to provide first an introduction to QC for an audience that is not familiar with the technology, then to show how to apply the QC paradigm of Quantum Annealing (QA) to solve practical problems that are currently faced by IR and RS systems. During the tutorial, participants will be provided with the fundamentals required to understand QC and to apply it in practice by using a real D-Wave quantum annealer through APIs.

International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)•Jul 10, 2024•5 citations
The availability of quantum hardware via the cloud offers opportunities for new approaches to computing optimization problems in an industrial environment. However, selecting the right quantum hardware is difficult for non-experts due to its technical characteristics. In this paper, we present the QC-Adviser prototype, which supports users in selecting suitable quantum annealer hardware without requiring quantum computing knowledge.
Leveraging quantum computers for optimization problems holds promise across various application domains. Nevertheless, utilizing respective quantum computing solvers requires describing the optimization problem according to the Quadratic Unconstrained Binary Optimization (QUBO) formalism and selecting a proper solver for the application of interest with a reasonable setting. Both demand significant proficiency in quantum computing, QUBO formulation, and quantum solvers, a background that usually cannot be assumed by end users who are domain experts rather than quantum computing specialists. While tools aid in QUBO formulations, support for selecting the best-solving approach remains absent. This becomes even more challenging because selecting the best solver for a problem heavily depends on the problem itself. In this work, we are accepting this challenge and propose a predictive selection approach, which aids end users in this task. To this end, the solver selection task is first formulated as a classification task that is suitable to be solved by supervised machine learning. Based on that, we then propose strategies for adjusting solver parameters based on problem size and characteristics. Experimental evaluations, considering more than 500 different QUBO problems, confirm the benefits of the proposed solution. In fact, we show that in more than 70% of the cases, the best solver is selected, and in about 90% of the problems, a solver in the top two, i.e., the best or its closest suboptimum, is selected. This exploration proves the potential of machine learning in quantum solver selection and lays the foundations for its automation, broadening access to quantum optimization for a wider range of users. The pre-trained classifier is integrated into the MQT Quantum Auto Optimizer (MQT QAO) framework, publicly available on GitHub (https://github.com/cda-tum/mqt-qao) as part of the Munich Quantum Toolkit (MQT).
Solving discrete optimization problems is one of the most promising use cases on quantum computers with tremendous potential both in research and industry. We present two libraries quark and quapps which provide an easily usable, modular workflow to encode discrete optimization problems and interface them to both classical and quantum hardware. We provide a collection of already implemented optimization problems which can be easily adapted by the user and run on different solvers. From this we derive an additional instance data set that can directly be used to benchmark and test quantum hardware. In conjunction both libraries and the instance data set enable both expert and non-expert users to easily implement optimization problems, run them on classical and quantum machines and simplify benchmarking on quantum machines.
Quantum Computing Research proposed strategies to solve binary optimization problems.Application on current and near-term generation Hardware is possible.Even if computational benefits of the strategies are yet to be shown, we want to explore connections to prototype learning schemes.We examine cost functions for vector quantization based on data point selection and how they can be transformed into a common quadratic unconstrained binary optimization formulation (QUBO).There are different approaches for solving QUBO problems using quantum computer or quantum annealer hardware.We look at their current limits and how they might change.
The area of quantum computing is a relatively new and promising branch of computation that hopes to provide help especially in the field of non-deterministic polynomial hard problems. Due to the fact that quantum computers are a heuristically non-binary approach to computation, based on the effects of quantum mechanics, a bunch of advantages and disadvantages come with it. The following work focuses especially on so-called quantum annealers, a special architecture of quantum computers that one can see as an application-specific unit that is using certain quantum mechanical effects to target binary quadratic optimization problems of the class of non-deterministic polynomial-time problems and tries to solve them faster than classical computers can do. Because this is a whole new area, it lacks extensive software support which is addressed in this work. Hence the majority of the thesis aims to develop and extend software that enables users to solve problem instances on a quantum annealer fast and reliable. Furthermore, the necessary steps to solve combinatorial optimization problems are explained and the necessary background of quantum physics theory is given. In conclusion, the main question of this work can be described as follows: 'Is it possible to create an automated pipeline to solve problems on a D-Wave Systems n.d. quantum annealer?'.
Quantum computing potentially enables the acceleration of key problems in science, engineering, and industry. However, between domain experts capable of supplying relevant use cases and quantum computing researchers possessing the expertise to implement novel solutions, there exists a 'know how-knowledge gap'. Therefore, methodologies need to be developed to identify quantum computing relevant use cases by bridging the divide and enabling co-development for near-term quantum hardware. We present a strategy using short-term, results oriented projects to quickly gauge the potential of proposed use cases to find opportunities for robust future quantum advantage.
The field of Quantum Computing (QC) has gained significant popularity in recent years, due to its potential to provide benefits in terms of efficiency and effectiveness when employed to solve certain computationally intensive tasks. In both Information Retrieval (IR) and Recommender Systems (RS) we are required to build methods that apply complex processing on large and heterogeneous datasets, it is natural therefore to wonder whether QC could also be applied to boost their performance. The tutorial aims to provide first an introduction to QC for an audience that is not familiar with the technology, then to show how to apply the QC paradigm of Quantum Annealing (QA) to solve practical problems that are currently faced by IR and RS systems. During the tutorial, participants will be provided with the fundamentals required to understand QC and to apply it in practice by using a real D-Wave quantum annealer through APIs.