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 International Geoscience and Remote Sensing Symposium (IGARSS)

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

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

Published Jul 16, 2023• 1 citation
Publisher

Abstract

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.

DOI
10.1109/igarss52108.2023.10281523

Related papers

Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks

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

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 Remote Sensing (RS) community. This paper proposes an Adiabatic Quantum Kitchen Sinks (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to Support Vector Regression (SVR) and Gaussian Process Regression (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentra-tion in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained from a classical implementation of kernel-based algorithms and a Random Kitchen Sinks (RKS) implementation. On average, the parallel AQKS achieved comparable results to the benchmark methods, indicating its potential for future applications.

•May 12, 2023•0 citations

Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks

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

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 Remote Sensing (RS) community. This paper proposes an Adiabatic Quantum Kitchen Sinks (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to Support Vector Regression (SVR) and Gaussian Process Regression (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentra-tion in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained from a classical implementation of kernel-based algorithms and a Random Kitchen Sinks (RKS) implementation. On average, the parallel AQKS achieved comparable results to the benchmark methods, indicating its potential for future applications.

•May 12, 2023•0 citations

Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks

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

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.

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing•Jan 1, 2024•5 citations

Analog-Quantum Feature Mapping for Machine-Learning Applications

Moslem Noori, Seyed Shakib Vedaie, Inderpreet Singh +4 more

Quantum information processing is likely to have a far-reaching impact in the field of artificial intelligence. Noisy, intermediate-scale quantum devices provide a platform for exploring the possibility of attaining a quantum advantage through hybrid quantum-classical machine-learning algorithms. One example of such a hybrid algorithm is ``quantum kitchen sinks,'' which builds upon a classical algorithm known as ``random kitchen sinks'' to leverage a gate model quantum computer for machine-learning applications. We propose an alternative algorithm called ``analog-quantum kitchen sinks'' (AQKSs), which employs an analog-quantum computer for mapping data features into new features in a nonlinear manner. The new features can then be used by a classical algorithm to perform machine-learning tasks. We show the effectiveness of our algorithm for performing binary classification on both a synthetic dataset and a real-world dataset by simulating the operations of a quantum annealer. We demonstrate that the AQKS algorithm reduces the classification error of a linear classifier from $50\mathrm{%}$ to $0.6\mathrm{%}$ for the synthetic dataset and from $4.4\mathrm{%}$ to $1.6\mathrm{%}$ for the other dataset. Our proposed AQKS algorithm presents the possibility to use current quantum annealers for solving practical machine-learning problems.

arXiv:1909.08131•Physical Review Applied•Sep 14, 2020•17 citations

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

Quantum Kitchen Sinks: An algorithm for machine learning on near-term quantum computers

Christopher M. Wilson, Johannes Otterbach, Nikolas Tezak +7 more

Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications. Performing nontrivial tasks in such devices requires a fundamentally different approach than what would be used on an error-corrected quantum computer. One such approach is to use hybrid algorithms, where problems are reduced to a parameterized quantum circuit that is often optimized in a classical feedback loop. Here we describe one such hybrid algorithm for machine learning tasks by building upon the classical algorithm known as random kitchen sinks. Our technique, called quantum kitchen sinks, uses quantum circuits to nonlinearly transform classical inputs into features that can then be used in a number of machine learning algorithms. We demonstrate the power and flexibility of this proposal by using it to solve binary classification problems for synthetic datasets as well as handwritten digits from the MNIST database. Using the Rigetti quantum virtual machine, we show that small quantum circuits provide significant performance lift over standard linear classical algorithms, reducing classification error rates from 50% to $<0.1\%$, and from $4.1\%$ to $1.4\%$ in these two examples, respectively. Further, we are able to run the MNIST classification problem, using full-sized MNIST images, on a Rigetti quantum processing unit, finding a modest performance lift over the linear baseline.

arXiv:1806.08321•Jun 21, 2018•30 citations
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 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 Remote Sensing (RS) community. This paper proposes an Adiabatic Quantum Kitchen Sinks (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to Support Vector Regression (SVR) and Gaussian Process Regression (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentra-tion in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained from a classical implementation of kernel-based algorithms and a Random Kitchen Sinks (RKS) implementation. On average, the parallel AQKS achieved comparable results to the benchmark methods, indicating its potential for future applications.
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 Remote Sensing (RS) community. This paper proposes an Adiabatic Quantum Kitchen Sinks (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to Support Vector Regression (SVR) and Gaussian Process Regression (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentra-tion in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained from a classical implementation of kernel-based algorithms and a Random Kitchen Sinks (RKS) implementation. On average, the parallel AQKS achieved comparable results to the benchmark methods, indicating its potential for future applications.
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.
Quantum information processing is likely to have a far-reaching impact in the field of artificial intelligence. Noisy, intermediate-scale quantum devices provide a platform for exploring the possibility of attaining a quantum advantage through hybrid quantum-classical machine-learning algorithms. One example of such a hybrid algorithm is ``quantum kitchen sinks,'' which builds upon a classical algorithm known as ``random kitchen sinks'' to leverage a gate model quantum computer for machine-learning applications. We propose an alternative algorithm called ``analog-quantum kitchen sinks'' (AQKSs), which employs an analog-quantum computer for mapping data features into new features in a nonlinear manner. The new features can then be used by a classical algorithm to perform machine-learning tasks. We show the effectiveness of our algorithm for performing binary classification on both a synthetic dataset and a real-world dataset by simulating the operations of a quantum annealer. We demonstrate that the AQKS algorithm reduces the classification error of a linear classifier from $50\mathrm{%}$ to $0.6\mathrm{%}$ for the synthetic dataset and from $4.4\mathrm{%}$ to $1.6\mathrm{%}$ for the other dataset. Our proposed AQKS algorithm presents the possibility to use current quantum annealers for solving practical machine-learning problems.
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.
Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications. Performing nontrivial tasks in such devices requires a fundamentally different approach than what would be used on an error-corrected quantum computer. One such approach is to use hybrid algorithms, where problems are reduced to a parameterized quantum circuit that is often optimized in a classical feedback loop. Here we describe one such hybrid algorithm for machine learning tasks by building upon the classical algorithm known as random kitchen sinks. Our technique, called quantum kitchen sinks, uses quantum circuits to nonlinearly transform classical inputs into features that can then be used in a number of machine learning algorithms. We demonstrate the power and flexibility of this proposal by using it to solve binary classification problems for synthetic datasets as well as handwritten digits from the MNIST database. Using the Rigetti quantum virtual machine, we show that small quantum circuits provide significant performance lift over standard linear classical algorithms, reducing classification error rates from 50% to <0.1%<0.1\%<0.1%, and from 4.1%4.1\%4.1% to 1.4%1.4\%1.4% in these two examples, respectively. Further, we are able to run the MNIST classification problem, using full-sized MNIST images, on a Rigetti quantum processing unit, finding a modest performance lift over the linear baseline.