Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features

Abstract

Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build an error-corrected quantum computer is ongoing, noisy, intermediate-scale quantum (NISQ) devices provide an immediate platform for exploring a possible quantum advantage through hybrid quantum--classical machine learning algorithms. One example of such a hybrid algorithm is "quantum kitchen sinks", which builds upon the classical algorithm known as "random kitchen sinks" to leverage a gate model quantum computer for machine learning applications. We propose an alternative algorithm called "adiabatic quantum kitchen sinks", which employs an adiabatic quantum device to transform data features into new features in a non-linear manner, which can then be employed by classical machine learning algorithms. We present the effectiveness of our algorithm for performing binary classification on both a synthetic dataset and a real-world dataset. In terms of classification accuracy, our algorithm significantly enhances the performance of a classical linear classifier on the studied binary classification tasks and can potentially be implemented on a current adiabatic quantum device to solve practical problems.

References in corpus (17)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Machine Learning
• Supervised learning with quantum enhanced feature spaces
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Kernel methods in machine learning
• Adiabatic Quantum Computing
• Quantum Convolutional Neural Networks
• Quantum algorithms: an overview
• Quantum Computational Supremacy
• Digitized adiabatic quantum computing with a superconducting circuit
• Observation of topological phenomena in a programmable lattice of 1,800 qubits
• Inconsistency in the application of the adiabatic theorem
• Polynomial-Time Simulation of Pairing Models on a Quantum Computer
• A NASA Perspective on Quantum Computing: Opportunities and Challenges
• Kernel Approximation Methods for Speech Recognition
• Experimental demonstration of quantum learning speed-up with classical input data

Cited by in corpus (4)

• Quantum reservoir computation utilising scale-free networks
• Fock State-enhanced Expressivity of Quantum Machine Learning Models
• Impact of the form of weighted networks on the quantum extreme reservoir computation
• Analog quantum variational embedding classifier