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%, 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.
Several variational quantum circuits for machine learning have been proposed in recent years, with one promising class of variational algorithms involving tensor networks operating on states resulting from local feature maps. In contrast, a random feature approach known as quantum kitchen sinks (C. M. Wilson et al., Quantum kitchen sinks: An algorithm for machine learning on near-term quantum computers, arXiv:1806.08321) provides comparable performance, but leverages nonlocal feature maps. Here we combine these two approaches by proposing a circuit Ansatz where a tree tensor network coherently processes the nonlocal feature maps of quantum kitchen sinks and we run numerical experiments to evaluate the performance of the Ansatz on image classification. From the perspective of classification performance, we find that simply combining quantum kitchen sinks with tensor networks yields no qualitative improvements. However, the addition of feature optimization greatly boosts performance, leading to state-of-the-art quantum circuits for image classification, requiring only shallow circuits and a small number of qubits, both well within reach of near-term quantum devices.
While quantum annealing (QA) has been developed for combinatorial optimization, practical QA devices operate at finite temperature and under noise, and their outputs can be regarded as stochastic samples close to a Gibbs--Boltzmann distribution. In this study, we propose a QA-in-the-loop kernel learning framework that integrates QA not merely as a substitute for Markov-chain Monte Carlo sampling but as a component that directly determines the learned kernel for regression. Based on Bochner's theorem, a shift-invariant kernel is represented as an expectation over a spectral distribution, and random Fourier features (RFF) approximate the kernel by sampling frequencies. We model the spectral distribution with a (multi-layer) restricted Boltzmann machine (RBM), generate discrete RBM samples using QA, and map them to continuous frequencies via a Gaussian--Bernoulli transformation. Using the resulting RFF, we construct a data-adaptive kernel and perform Nadaraya--Watson (NW) regression. Because the RFF approximation based on
cos(ω⊤Δx) can yield small negative values and cancellation across neighbors, the Nadaraya--Watson denominator
∑jkij may become close to zero. We therefore employ nonnegative squared-kernel weights
wij=k(xi,xj)2, which also enhances the contrast of kernel weights. The kernel parameters are trained by minimizing the leave-one-out NW mean squared error, and we additionally evaluate local linear regression with the same squared-kernel weights at inference. Experiments on multiple benchmark regression datasets demonstrate a decrease in training loss, accompanied by structural changes in the kernel matrix, and show that the learned kernel tends to improve
R2 and RMSE over the baseline Gaussian-kernel NW. Increasing the number of random features at inference further enhances accuracy.