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

The difference between programming a gate-based quantum computer and a quantum annealer

Kristel F. L. Michielsen

Published Jan 1, 2018• 0 citations
OpenAlex

Related papers

EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

Ramin Ayanzadeh, Poulami Das, Swamit Tannu +1 more

Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Gate-based quantum computers and Quantum Annealers (QAs) are two commercially available hardware platforms that are accessible to users today. Although promising, existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. On the other hand, existing QAs with few thousand qubits have the potential to solve some domain-specific optimization problems. QAs are single instruction machines and to execute a program, the problem is cast to a Hamiltonian, embedded in the hardware, and a single quantum machine instruction (QMI) is run. Unfortunately, noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials.Due to the limited programmability of QAs users execute the same QMI for all trials. This subjects all trials to a similar noise profile throughout the execution, resulting in a systematic bias. We observe that systematic bias leads to sub-optimal solutions and cannot be alleviated by executing more trials or using existing error-mitigation schemes. To address this challenge, we propose EQUAL (Ensemble QUantum AnneaLing). EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI. When executed on the QA, the ensemble of QMIs steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions. Our evaluations using the 2041-qubit D-Wave QA show that EQUAL bridges the difference between the baseline and the ideal by an average of 14% (and up to 26%) without requiring any additional trials. EQUAL can be combined with existing error mitigation schemes to further bridge the difference between the baseline and ideal by an average of 55% (and up to 68%).

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•8 citations

Simulation on/of Quantum Computers and Quantum Annealers

Kristel F. L. Michielsen

•Jan 1, 2018•0 citations

Gate-based Quantum Computing und Quantum Annealing : zwei Wege zu Quantenanwendungen

Rudolf Marcel Füchslin

•Apr 4, 2023•0 citations

Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigms

Eneko Osaba, Pablo Miranda-Rodriguez, Andreas Oikonomakis +4 more

This paper presents a novel hybrid approach to solving real-world drone routing problems by leveraging the capabilities of quantum computing. The proposed method, coined Quantum for Drone Routing (Q4DR), integrates the two most prominent paradigms in the field: quantum gate-based computing, through the Eclipse Qrisp programming language; and quantum annealers, by means of D-Wave System’s devices. The algorithm is divided into two different phases: an initial clustering phase executed using a Quantum Approximate Optimization Algorithm (QAOA), and a routing phase employing quantum annealers. The efficacy of Q4DR is demonstrated through three use cases of increasing complexity, each incorporating real-world constraints such as asymmetric costs, forbidden paths, and itinerant charging points. This research contributes to the growing body of work in quantum optimization, showcasing the practical applications of quantum computing in logistics and route planning.

arXiv:2501.18432•IEEE Congress on Evolutionary Computation (CEC)•Jun 8, 2025•8 citations

Gate-based Quantum Computing: An Overview

Rafael Pereira da Silva

•Jan 1, 2023•4 citations

QABE: a Framework for Quantum Annealer Programming and Benchmarking

Gianluca Scanu, M. Vénere, Donatella Sciuto +1 more

In recent years, research has given great focus to quantum annealers, a novel architecture belonging to the quantum computing realm, which stands out for its potential to boost computation while being able to tackle more complex problems than gate-based quantum computers currently can. Yet, their programming model requires deep expertise, and estimating their performance is a non-trivial task, due to the limits of current device topologies. Therefore, this work introduces QABE, a framework for automatic programming and benchmarking of quantum annealers through a high-level interface. We describe the software architecture of our solution, that relies on the Quadratic Unconstrained Binary Optimization (QUBO) representation. Furthermore, we select four optimization problems and provide an experimental benchmarking of the D-Wave Advantage architecture, highlighting performance and resource utilization.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•Jun 3, 2025•0 citations
Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Gate-based quantum computers and Quantum Annealers (QAs) are two commercially available hardware platforms that are accessible to users today. Although promising, existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. On the other hand, existing QAs with few thousand qubits have the potential to solve some domain-specific optimization problems. QAs are single instruction machines and to execute a program, the problem is cast to a Hamiltonian, embedded in the hardware, and a single quantum machine instruction (QMI) is run. Unfortunately, noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials.Due to the limited programmability of QAs users execute the same QMI for all trials. This subjects all trials to a similar noise profile throughout the execution, resulting in a systematic bias. We observe that systematic bias leads to sub-optimal solutions and cannot be alleviated by executing more trials or using existing error-mitigation schemes. To address this challenge, we propose EQUAL (Ensemble QUantum AnneaLing). EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI. When executed on the QA, the ensemble of QMIs steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions. Our evaluations using the 2041-qubit D-Wave QA show that EQUAL bridges the difference between the baseline and the ideal by an average of 14% (and up to 26%) without requiring any additional trials. EQUAL can be combined with existing error mitigation schemes to further bridge the difference between the baseline and ideal by an average of 55% (and up to 68%).
This paper presents a novel hybrid approach to solving real-world drone routing problems by leveraging the capabilities of quantum computing. The proposed method, coined Quantum for Drone Routing (Q4DR), integrates the two most prominent paradigms in the field: quantum gate-based computing, through the Eclipse Qrisp programming language; and quantum annealers, by means of D-Wave System’s devices. The algorithm is divided into two different phases: an initial clustering phase executed using a Quantum Approximate Optimization Algorithm (QAOA), and a routing phase employing quantum annealers. The efficacy of Q4DR is demonstrated through three use cases of increasing complexity, each incorporating real-world constraints such as asymmetric costs, forbidden paths, and itinerant charging points. This research contributes to the growing body of work in quantum optimization, showcasing the practical applications of quantum computing in logistics and route planning.
In recent years, research has given great focus to quantum annealers, a novel architecture belonging to the quantum computing realm, which stands out for its potential to boost computation while being able to tackle more complex problems than gate-based quantum computers currently can. Yet, their programming model requires deep expertise, and estimating their performance is a non-trivial task, due to the limits of current device topologies. Therefore, this work introduces QABE, a framework for automatic programming and benchmarking of quantum annealers through a high-level interface. We describe the software architecture of our solution, that relies on the Quadratic Unconstrained Binary Optimization (QUBO) representation. Furthermore, we select four optimization problems and provide an experimental benchmarking of the D-Wave Advantage architecture, highlighting performance and resource utilization.