Variational Quantum Approximate Support Vector Machine with Inference Transfer
Siheon Park, Daniel K. Park, June-Koo Kevin Rhee

TL;DR
This paper introduces VQASVM, a quantum machine learning algorithm that achieves faster classification with feasible quantum operations on NISQ computers, demonstrated through experiments on toy and standard datasets.
Contribution
The paper presents a novel variational quantum SVM algorithm with sub-quadratic runtime suitable for NISQ devices, advancing quantum machine learning scalability.
Findings
Empirical demonstration of VQASVM on toy datasets on cloud NISQ machines.
Numerical results on Iris and MNIST datasets showing scalability.
Sub-quadratic runtime complexity achieved with quantum operations.
Abstract
A kernel-based quantum classifier is the most practical and influential quantum machine learning technique for the hyper-linear classification of complex data. We propose a Variational Quantum Approximate Support Vector Machine (VQASVM) algorithm that demonstrates empirical sub-quadratic run-time complexity with quantum operations feasible even in NISQ computers. We experimented our algorithm with toy example dataset on cloud-based NISQ machines as a proof of concept. We also numerically investigated its performance on the standard Iris flower and MNIST datasets to confirm the practicality and scalability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
MethodsSupport Vector Machine
