Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Expert Systems with Applications

Diversity of quantum optimizations for training adaptive support vector regression and its prediction applications

B CHANG, H TSAI, Chung-Ping Young

Published May 15, 2007• 2 citations
Publisher
DOI
10.1016/j.eswa.2007.05.001

Related papers

Quantum optimization for training support vector machines

Davide Anguita, Sandro Ridella, Fabio Rivieccio +1 more

Neural Networks•May 19, 2003•120 citations

Nested local adiabatic evolution for quantum-neuron-based adaptive support vector regression and its forecasting applications

Bao Rong Chang, Hsiu Fen Tsai

Expert Systems with Applications•Mar 3, 2008•5 citations

Predictive Maintenance at the Edge: An Embedded Anomaly Detection Pipeline Trained with Quantum Optimization

Filipe Chagas Ferraz

This article presents a predictive-maintenance pipeline that detects anomalies in bearings from vibration signals, adapted for deployment at the edge on low-cost microcontrollers, and that uses quantum optimization in two steps of its training. The pipeline consists of a step of vibration feature extraction and a step of classification with a one-class support vector machine (OCSVM). The features are selected by minimum redundancy and maximum relevance (mRMR) with the variational quantum eigensolver (VQE), under a limit on computing time. The OCSVM is adapted for inference at the edge without floating-point operations and is trained by a variational quantum algorithm with Pauli-correlation encoding (PCE). In small-scale tests on a simulator, with the Paderborn bearing dataset, the VQE found the optimal selection in 36% of the runs with Adam, and PCE chose better support vectors than chance, until a classical local search made the two equal. A classical baseline, the usual OCSVM trained by SMO with its weights rounded, matched them without any search.

quant-pharXiv:2610.40848•Nov 2, 2026•0 citations

Quantum-assisted support vector regression

Archismita Dalal, Mohsen Bagherimehrab, Barry C. Sanders

arXiv:2111.09304•Quantum Information Processing•Mar 10, 2025•10 citations

Novel Approaches to Pervasive Applications Nested Local Adiabatic Evolution for Quantum-Neuron-Based Adaptive Support Vector Regression and Its Application

Bao Rong Chang, Chung-Ping Young, Hsiu Fen Tsai +3 more

Instead of traditionally (globally) adiabatic evolution algorithm for unstructured search, we focus on the structured adiabatic quantum search by nesting a partial search over a reduced set of variables into a global search for solving an optimization problem on adaptive support vector regression (ASVR) yielding an average complexity of order radicnalpha, with alpha<1, compared with a quadratic speedup of order radicN over a naive Grover 's search.

International Conference on Innovative Computing, Information and Control•Sep 1, 2007•0 citations

Quantum Support Vector Regression for High-Dimensional Data: A Hybrid Quantum-Classical Approach

RamMohan Reddy Kundavaram, Rahul Reddy Bandhela, Abhishake Reddy Onteddu

•Jan 1, 2025•1 citation
This article presents a predictive-maintenance pipeline that detects anomalies in bearings from vibration signals, adapted for deployment at the edge on low-cost microcontrollers, and that uses quantum optimization in two steps of its training. The pipeline consists of a step of vibration feature extraction and a step of classification with a one-class support vector machine (OCSVM). The features are selected by minimum redundancy and maximum relevance (mRMR) with the variational quantum eigensolver (VQE), under a limit on computing time. The OCSVM is adapted for inference at the edge without floating-point operations and is trained by a variational quantum algorithm with Pauli-correlation encoding (PCE). In small-scale tests on a simulator, with the Paderborn bearing dataset, the VQE found the optimal selection in 36% of the runs with Adam, and PCE chose better support vectors than chance, until a classical local search made the two equal. A classical baseline, the usual OCSVM trained by SMO with its weights rounded, matched them without any search.