Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.

Authors

Institutions

Publication Details

Published
2024-09-15
DOI
https://doi.org/10.1109/qce60285.2024.10378
Citations
1
Primary Topic
Spectroscopy Techniques in Biomedical and Chemical Research
Type
article
Field-Weighted Citation Impact
0.66
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Moe Shimada, Jun‐ichi Shirakashi, Jargalsaikhan Artag
1 citations
Spectroscopy Techniques in Biomedical and Chemical Research
0.66
article

Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Moe Shimada, Jun‐ichi Shirakashi, Jargalsaikhan Artag
article en
1 citations

Abstract

Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.

Tokyo University of Agriculture and Technology (JP)
Openalex Percentile: Top 18%
Spectroscopy Techniques in Biomedical and Chemical Research
0.66
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.