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

IEEE Mediterranean and Middle-East Geoscience and Remote Sensing Symposium (M2GARSS)

Quantum Annealing for Semantic Segmentation in Remote Sensing: Potential and Limitations

Amer Delilbasic, Bertrand Le Saux, Morris Riedel, Kristel F. L. Michielsen, Gabriele Cavallaro

Published Apr 15, 2024• 2 citations
Publisher

Abstract

Quantum Annealing (QA) is a powerful method for combinatorial optimization derived from adiabatic quantum computation. The development of computing devices implementing QA accelerated its adoption in practical use cases. In this paper, we summarize the main features and limitations of QA and its application to remote sensing, specifically to semantic segmentation. We provide indications for successfully applying it to real problems, and techniques for improving its performance. This overview can support practitioners in the adoption of this innovative computing technology.

DOI
10.1109/m2garss57310.2024.10537465

Related papers

Quantum annealing for industry applications: introduction and review

Sheir Yarkoni, Elena Raponi, Thomas Bäck +1 more

Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.

arXiv:2112.07491•Reports on Progress in Physics•Aug 24, 2022•429 citations

Quantum Annealing for Combinatorial Optimization: Foundations, Architectures, Benchmarks, and Emerging Directions

Rudraksh Sharma, Ravi Katukam, Arjun Nagulapally

Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.

quant-pharXiv:2602.03101•International Journal for Research in Applied Science and Engineering Technology•Feb 4, 2026•3 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

Synthetic aperture radar image segmentation with quantum annealing

Timothé Presles, Cyrille Enderli, Gilles Burel +1 more

Abstract In image processing, image segmentation is the process of partitioning a digital image into multiple image segments. Among state‐of‐the‐art methods, Markov random fields can be used to model dependencies between pixels and achieve a segmentation by minimising an associated cost function. Currently, finding the optimal set of segments for a given image modelled as a Markov random fields appears to be NP‐hard. The authors aim to take advantage of the exponential scalability of quantum computing to speed up the segmentation of synthetic aperture radar images. For that purpose, the authors propose a hybrid quantum annealing classical optimisation expectation maximisation algorithm to obtain optimal sets of segments. After proposing suitable formulations, the authors discuss the performances and the scalability of authors’ approach on the D‐Wave quantum computer. The authors also propose a short study of optimal computation parameters to enlighten the limits and potential of the adiabatic quantum computation to solve large instances of combinatorial optimisation problems.

arXiv:2305.17954•IET Radar Sonar & Navigation•Jan 2, 2024•8 citations

Quantum Annealing based SVM Outperforms Classical SVM in Cloud Feature Remote Sensing Image Classification

Indranil Misra, S. Manthira Moorthi, Debajyoti Dhar

The increasing complexity and volume of remote sensing data necessitate advanced computational techniques for efficient and accurate image classification. This study explores the efficacy of Quantum Annealing based Support Vector Machines (QASVM) in comparison to classical Support Vector Machines (SVM) for classifying cloud features in remote sensing images. Quantum annealing, leveraging principles of quantum mechanics, promises to solve optimization problems more efficiently and accurately than classical methods, particularly in high-dimensional data spaces typical of remote sensing applications. Our experimental framework involved the classification of cloud features using a comprehensive dataset of Indian Nano Satellite (INS-2B) Nano-MX satellite imagery. The QA-SVM is implemented on a D-Wave quantum annealer based on the Adiabatic Quantum Computation (AQC) model, while the classical SVM utilizes a traditional computing setup. Performance metrics, including overall accuracy and F1 score, are evaluated. The results demonstrated that QA-SVM achieved higher overall accuracy and F1 score compared to its classical counterpart on the Nano-MX test image. It is found that the overall accuracy of QA-SVM is increased by 6.7% while the F1 score is increased by 4.5% with respect to classical SVM. This performance gain is attributed to the quantum annealer’s ability to explore a vast solution space more effectively, avoiding local minima that often hinder classical SVMs.

IEEE India Geoscience and Remote Sensing Symposium (InGARSS)•Dec 2, 2024•2 citations

Optimization In Quantum Annealing: Methods And Challenges

Debasis Dhal, Shovan Roy

This study presents a comprehensive analysis of optimization methodologies in quantum annealing (QA), investigating both theoretical frameworks and practical implementations. We examine various techniques for enhancing quantum annealing performance, including embedding strategies, parameter optimization, and hybrid quantum-classical approaches. Our research identifies critical challenges: qubit connectivity constraints, noise susceptibility, and problem representation difficulties. Through quantitative comparisons of optimization strategies across various problem classes, we establish a systematic framework for evaluating quantum annealing solutions. Results indicate that while significant challenges persist, strategic optimization approaches can substantially improve quantum annealing performance for specific problem domains, suggesting potential quantum advantage for certain complex optimization tasks.

International Journal of Environmental Sciences•Aug 20, 2025•0 citations
Quantum Annealing (QA) is a powerful method for combinatorial optimization derived from adiabatic quantum computation. The development of computing devices implementing QA accelerated its adoption in practical use cases. In this paper, we summarize the main features and limitations of QA and its application to remote sensing, specifically to semantic segmentation. We provide indications for successfully applying it to real problems, and techniques for improving its performance. This overview can support practitioners in the adoption of this innovative computing technology.
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.
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 In image processing, image segmentation is the process of partitioning a digital image into multiple image segments. Among state‐of‐the‐art methods, Markov random fields can be used to model dependencies between pixels and achieve a segmentation by minimising an associated cost function. Currently, finding the optimal set of segments for a given image modelled as a Markov random fields appears to be NP‐hard. The authors aim to take advantage of the exponential scalability of quantum computing to speed up the segmentation of synthetic aperture radar images. For that purpose, the authors propose a hybrid quantum annealing classical optimisation expectation maximisation algorithm to obtain optimal sets of segments. After proposing suitable formulations, the authors discuss the performances and the scalability of authors’ approach on the D‐Wave quantum computer. The authors also propose a short study of optimal computation parameters to enlighten the limits and potential of the adiabatic quantum computation to solve large instances of combinatorial optimisation problems.
The increasing complexity and volume of remote sensing data necessitate advanced computational techniques for efficient and accurate image classification. This study explores the efficacy of Quantum Annealing based Support Vector Machines (QASVM) in comparison to classical Support Vector Machines (SVM) for classifying cloud features in remote sensing images. Quantum annealing, leveraging principles of quantum mechanics, promises to solve optimization problems more efficiently and accurately than classical methods, particularly in high-dimensional data spaces typical of remote sensing applications. Our experimental framework involved the classification of cloud features using a comprehensive dataset of Indian Nano Satellite (INS-2B) Nano-MX satellite imagery. The QA-SVM is implemented on a D-Wave quantum annealer based on the Adiabatic Quantum Computation (AQC) model, while the classical SVM utilizes a traditional computing setup. Performance metrics, including overall accuracy and F1 score, are evaluated. The results demonstrated that QA-SVM achieved higher overall accuracy and F1 score compared to its classical counterpart on the Nano-MX test image. It is found that the overall accuracy of QA-SVM is increased by 6.7% while the F1 score is increased by 4.5% with respect to classical SVM. This performance gain is attributed to the quantum annealer’s ability to explore a vast solution space more effectively, avoiding local minima that often hinder classical SVMs.
This study presents a comprehensive analysis of optimization methodologies in quantum annealing (QA), investigating both theoretical frameworks and practical implementations. We examine various techniques for enhancing quantum annealing performance, including embedding strategies, parameter optimization, and hybrid quantum-classical approaches. Our research identifies critical challenges: qubit connectivity constraints, noise susceptibility, and problem representation difficulties. Through quantitative comparisons of optimization strategies across various problem classes, we establish a systematic framework for evaluating quantum annealing solutions. Results indicate that while significant challenges persist, strategic optimization approaches can substantially improve quantum annealing performance for specific problem domains, suggesting potential quantum advantage for certain complex optimization tasks.