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 Journal of Selected Topics in Applied Earth Observations and Remote Sensing

Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks

Edoardo Pasetto, Morris Riedel, Kristel F. L. Michielsen, Gabriele Cavallaro

Published Jan 1, 2024• 5 citations
Publisher

Abstract

The increased development of quantum computing hardware in recent years has led to increased interest in its application to various areas. Finding effective ways to apply this technology to real-world use-cases is a current area of research in the (RS) community. This paper proposes an (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to (SVR) and (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentration in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained by a classical implementation of kernel-based algorithms and a (RKS) implementation. On average, the parallel (AQKS) achieved comparable results to the benchmark methods, indicating its potential for future applications.

DOI
10.1109/jstars.2024.3350385

Related papers

Adiabatic Quantum Kitchen Sinks with Parallel Annealing for Remote Sensing Regression Problems

Edoardo Pasetto, Morris Riedel, Kristel F. L. Michielsen +1 more

Kernel methods are class of Machine Learning (ML) models that have been widely employed in the literature for Earth Observation (EO) applications. The increasing development of quantum computing hardware motivates further research to improve the capabilities and the performances of data analysis algorithms. In this manuscript an implementation of Adiabatic Quantum Kitchen Sinks (AQKS) kernel estimation algorithm integrated with parallel quantum annealing is presented. Such combination with the concept of parallel quantum annealing allows for the solving of multiple problem instances in the same annealing cycle, thus reducing the number of rquired calls to the quantum annealing solver. The proposed workflow is then implemented using a D-Wave Advantage system and tested on a regression problem on a real Remote Sensing (RS) dataset. The obtained results are then analyzed and compared with those obtained by a classical kernel approximation algorithm based on Random Fourier Features.

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)•Jul 16, 2023•1 citation

Quantum SVR for Chlorophyll Concentration Estimation in Water With Remote Sensing

Edoardo Pasetto, Morris Riedel, Farid Melgani +2 more

The increasing availability of quantum computers motivates researching their potential capabilities in enhancing the performance of data analysis algorithms. Similarly, as in other research communities, also in Remote Sensing (RS) it is not yet defined how its applications can benefit from the usage of quantum computing. This paper proposes a formulation of the Support Vector Regression (SVR) algorithm that can be executed by D-Wave quantum computers. Specifically, the SVR is mapped to a Quadratic Unconstrained Binary Optimization (QUBO) problem that is solved with Quantum Annealing (QA). The algorithm is tested on two different types of computing environments offered by D-Wave: The Advantage system, which directly embeds the problem into the Quantum Processing Unit (QPU), and a Hybrid solver that employs both classical and quantum computing resources. For the evaluation, we considered a biophysical variable estimation problem with RS data. The experimental results show that the proposed quantum SVR implementation can achieve comparable or in some cases better results than the classical implementation. This work is one of the first attempts to provide insight into how QA could be exploited and integrated in future RS workflows based on Machine Learning (ML) algorithms.

IEEE Geoscience and Remote Sensing Letters•Jan 1, 2022•18 citations

Quantum Support Vector Regression for Biophysical Variable Estimation in Remote Sensing

Edoardo Pasetto, Amer Delilbasic, Gabriele Cavallaro +4 more

Regression analysis has a crucial role in many Earth Ob-servation (EO) applications. The increasing availability and recent development of new computing technologies moti-vate further research to expand the capabilities and enhance the performance of data analysis algorithms. In this paper, the biophysical variable estimation problem is addressed. A novel approach is proposed, which consists in a reformulated Support Vector Regression (SVR) and leverages Quantum Annealing (QA). In particular, the SVR optimization prob-lem is reframed to a Quadratic Unconstrained Binary Opti-mization (QUBO) problem. The algorithm is then tested on the D-Wave Advantage quantum annealer. The experiments presented in this paper show good results, despite current hardware limitations, suggesting that this approach is viable and has great potential.

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)•Jul 17, 2022•8 citations

A Single-Step Multiclass SVM Based on Quantum Annealing for Remote Sensing Data Classification

Amer Delilbasic, Bertrand Le Saux, Morris Riedel +2 more

In recent years, the development of quantum annealers has enabled experimental demonstrations and has increased research interest in applications of quantum annealing, such as in quantum machine learning and in particular for the popular quantum Support Vector Machine (SVM). Several versions of the quantum SVM have been proposed, and quantum annealing has been shown to be effective in them. Extensions to multiclass problems have also been made, which consist of an ensemble of multiple binary classifiers. This work proposes a novel quantum SVM formulation for direct multiclass classification based on quantum annealing, called Quantum Multiclass SVM (QMSVM). The multiclass classification problem is formulated as a single quadratic unconstrained binary optimization problem solved with quantum annealing. The main objective of this work is to evaluate the feasibility, accuracy, and time performance of this approach. Experiments have been performed on the D-Wave Advantage quantum annealer for a classification problem on remote sensing data. Results indicate that, despite the memory demands of the quantum annealer, QMSVM can achieve an accuracy that is comparable to standard SVM methods, such as the one-versus-one (OVO), depending on the dataset (compared to OVO: 0.8663 vs 0.8598 on Toulouse, 0.8123 vs 0.8521 on Potsdam). More importantly, it scales much more efficiently with the number of training examples, resulting in nearly constant time (compared to OVO: 85.72s vs 248.02s on Toulouse, 58.89s vs 580.17s on Potsdam). This work shows an approach for bringing together classical and quantum computation, solving practical problems in remote sensing with current hardware.

arXiv:2303.11705•IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing•Nov 28, 2023•49 citations

Adaptive Learning for Quantum Linear Regression

Costantino Carugno, Maurizio Ferrari Dacrema, Paolo Cremonesi

The recent availability of quantum annealers as cloud-based services has enabled new ways to handle machine learning problems, and several relevant algorithms have been adapted to run on these devices. In a recent work, linear regression was formulated as a quadratic binary optimization problem that can be solved via quantum annealing. Although this approach promises a computational time advantage for large datasets, the quality of the solution is limited by the necessary use of a precision vector, used to approximate the real-numbered regression coefficients in the quantum formulation. In this work, we focus on the practical challenge of improving the precision vector encoding: instead of setting an array of generic values equal for all coefficients, we allow each one to be expressed by its specific precision, which is tuned with a simple adaptive algorithm. This approach is evaluated on synthetic datasets of increasing size, and linear regression is solved using the D-Wave Advantage quantum annealer, as well as classical solvers. To the best of our knowledge, this is the largest dataset ever evaluated for linear regression on a quantum annealer. The results show that our formulation is able to deliver improved solution quality in all instances, and could better exploit the potential of current quantum devices.

arXiv:2408.02833•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•4 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 increased development of quantum computing hardware in recent years has led to increased interest in its application to various areas. Finding effective ways to apply this technology to real-world use-cases is a current area of research in the (RS) community. This paper proposes an (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to (SVR) and (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentration in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained by a classical implementation of kernel-based algorithms and a (RKS) implementation. On average, the parallel (AQKS) achieved comparable results to the benchmark methods, indicating its potential for future applications.
Kernel methods are class of Machine Learning (ML) models that have been widely employed in the literature for Earth Observation (EO) applications. The increasing development of quantum computing hardware motivates further research to improve the capabilities and the performances of data analysis algorithms. In this manuscript an implementation of Adiabatic Quantum Kitchen Sinks (AQKS) kernel estimation algorithm integrated with parallel quantum annealing is presented. Such combination with the concept of parallel quantum annealing allows for the solving of multiple problem instances in the same annealing cycle, thus reducing the number of rquired calls to the quantum annealing solver. The proposed workflow is then implemented using a D-Wave Advantage system and tested on a regression problem on a real Remote Sensing (RS) dataset. The obtained results are then analyzed and compared with those obtained by a classical kernel approximation algorithm based on Random Fourier Features.
The increasing availability of quantum computers motivates researching their potential capabilities in enhancing the performance of data analysis algorithms. Similarly, as in other research communities, also in Remote Sensing (RS) it is not yet defined how its applications can benefit from the usage of quantum computing. This paper proposes a formulation of the Support Vector Regression (SVR) algorithm that can be executed by D-Wave quantum computers. Specifically, the SVR is mapped to a Quadratic Unconstrained Binary Optimization (QUBO) problem that is solved with Quantum Annealing (QA). The algorithm is tested on two different types of computing environments offered by D-Wave: The Advantage system, which directly embeds the problem into the Quantum Processing Unit (QPU), and a Hybrid solver that employs both classical and quantum computing resources. For the evaluation, we considered a biophysical variable estimation problem with RS data. The experimental results show that the proposed quantum SVR implementation can achieve comparable or in some cases better results than the classical implementation. This work is one of the first attempts to provide insight into how QA could be exploited and integrated in future RS workflows based on Machine Learning (ML) algorithms.
Regression analysis has a crucial role in many Earth Ob-servation (EO) applications. The increasing availability and recent development of new computing technologies moti-vate further research to expand the capabilities and enhance the performance of data analysis algorithms. In this paper, the biophysical variable estimation problem is addressed. A novel approach is proposed, which consists in a reformulated Support Vector Regression (SVR) and leverages Quantum Annealing (QA). In particular, the SVR optimization prob-lem is reframed to a Quadratic Unconstrained Binary Opti-mization (QUBO) problem. The algorithm is then tested on the D-Wave Advantage quantum annealer. The experiments presented in this paper show good results, despite current hardware limitations, suggesting that this approach is viable and has great potential.
In recent years, the development of quantum annealers has enabled experimental demonstrations and has increased research interest in applications of quantum annealing, such as in quantum machine learning and in particular for the popular quantum Support Vector Machine (SVM). Several versions of the quantum SVM have been proposed, and quantum annealing has been shown to be effective in them. Extensions to multiclass problems have also been made, which consist of an ensemble of multiple binary classifiers. This work proposes a novel quantum SVM formulation for direct multiclass classification based on quantum annealing, called Quantum Multiclass SVM (QMSVM). The multiclass classification problem is formulated as a single quadratic unconstrained binary optimization problem solved with quantum annealing. The main objective of this work is to evaluate the feasibility, accuracy, and time performance of this approach. Experiments have been performed on the D-Wave Advantage quantum annealer for a classification problem on remote sensing data. Results indicate that, despite the memory demands of the quantum annealer, QMSVM can achieve an accuracy that is comparable to standard SVM methods, such as the one-versus-one (OVO), depending on the dataset (compared to OVO: 0.8663 vs 0.8598 on Toulouse, 0.8123 vs 0.8521 on Potsdam). More importantly, it scales much more efficiently with the number of training examples, resulting in nearly constant time (compared to OVO: 85.72s vs 248.02s on Toulouse, 58.89s vs 580.17s on Potsdam). This work shows an approach for bringing together classical and quantum computation, solving practical problems in remote sensing with current hardware.
The recent availability of quantum annealers as cloud-based services has enabled new ways to handle machine learning problems, and several relevant algorithms have been adapted to run on these devices. In a recent work, linear regression was formulated as a quadratic binary optimization problem that can be solved via quantum annealing. Although this approach promises a computational time advantage for large datasets, the quality of the solution is limited by the necessary use of a precision vector, used to approximate the real-numbered regression coefficients in the quantum formulation. In this work, we focus on the practical challenge of improving the precision vector encoding: instead of setting an array of generic values equal for all coefficients, we allow each one to be expressed by its specific precision, which is tuned with a simple adaptive algorithm. This approach is evaluated on synthetic datasets of increasing size, and linear regression is solved using the D-Wave Advantage quantum annealer, as well as classical solvers. To the best of our knowledge, this is the largest dataset ever evaluated for linear regression on a quantum annealer. The results show that our formulation is able to deliver improved solution quality in all instances, and could better exploit the potential of current quantum devices.
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.