Support vector machines on the D-Wave quantum annealer

Abstract

Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in comparison to SVMs trained on conventional computers. The method is applied to both synthetic data and real data obtained from biology experiments. We find that the quantum annealer produces an ensemble of different solutions that often generalizes better to unseen data than the single global minimum of an SVM trained on a conventional computer, especially in cases where only limited training data is available. For cases with more training data than currently fits on the quantum annealer, we show that a combination of classifiers for subsets of the data almost always produces stronger joint classifiers than the conventional SVM for the same parameters.

corrected typo in Eq. (11) and relation to SVM variant on p. 4; open source code available at https://gitlab.version.fz-juelich.de/cavallaro1/svm_quantum-annealer

References in corpus (16)

• Scikit-learn: Machine Learning in Python
• Quantum support vector machine for big data classification
• Deep Learning using Linear Support Vector Machines
• Architectural considerations in the design of a superconducting quantum annealing processor
• Robustness and Regularization of Support Vector Machines
• Experimental signature of programmable quantum annealing
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Experimental Realization of Quantum Artificial Intelligence
• A practical heuristic for finding graph minors
• Application of Quantum Annealing to Training of Deep Neural Networks
• Quantum annealing versus classical machine learning applied to a simplified computational biology problem
• Nonnegative/binary matrix factorization with a D-Wave quantum annealer
• Quantum adiabatic machine learning
• Reverse annealing for the fully connected $p$-spin model
• Training a Binary Classifier with the Quantum Adiabatic Algorithm
• Low Rank Non-Negative Matrix Factorization with D-Wave 2000Q

Cited by in corpus (37)

• Quantum Annealing for Industry Applications: Introduction and Review
• QUBO Formulations for Training Machine Learning Models
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
• Recent advances for quantum classifiers
• Classification with Quantum Machine Learning: A Survey
• Feature Selection for Recommender Systems with Quantum Computing
• Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealers
• Quantum processor-inspired machine learning in the biomedical sciences
• Training a quantum annealing based restricted Boltzmann machine on cybersecurity data
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Quantum Transfer Learning for Real-World, Small, and High-Dimensional Datasets
• Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
• Quantum adiabatic machine learning with zooming
• Quantum algorithms for scientific computing
• Quantum support vector machines for aerodynamic classification
• Garden optimization problems for benchmarking quantum annealers
• Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
• An Efficient Binary Harris Hawks Optimization based on Quantum SVM for Cancer Classification Tasks
• Kernel-based quantum regressor models learn non-Markovianity
• Balanced k-Means Clustering on an Adiabatic Quantum Computer
• Local Binary and Multiclass SVMs Trained on a Quantum Annealer
• Quantum optimization with linear Ising penalty functions for customer data science
• Quantum computing for data science
• A general learning scheme for classical and quantum Ising machines
• Quantum-Assisted Support Vector Regression
• Analyzing the Effectiveness of Quantum Annealing with Meta-Learning
• Supercomputer simulations of transmon quantum computers
• Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems
• Minor Embedding for Quantum Annealing with Reinforcement Learning
• Efficient correlation-based discretization of continuous variables for annealing machines
• Quantum Annealing Formulation for Binary Neural Networks
• Collaborative filtering based on nonnegative/binary matrix factorization
• Performance Evaluation of CMOS Annealing with Support Vector Machine
• Range dependent Hamiltonian Algorithm for numerical QUBO formulation
• The Holy Grail of Quantum Artificial Intelligence: Major Challenges in Accelerating the Machine Learning Pipeline
• Analog Quantum Approximate Optimization Algorithm