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

Vìsnik Nacìonalʹnogo unìversitetu Lʹvìvsʹka polìtehnìka Serìâ Ìnformacìjnì sistemi ta merežì

Hybrid Quantum Logistic Regression Model with Amplitude Data Encoding

Petro A. Kravets

Published May 17, 2026• 0 citations
Publisher

Abstract

This paper presents a hybrid quantum logistic regression model for binary data classification that combines classical logistic regression methods with quantum computing to improve efficiency and speed up the learning process. Quantum computing is used to represent and process feature and weight vectors as quantum states and to efficiently compute the dot product underlying the logistic function. The use of normalized amplitude coding allows for compact representation of feature vectors and weights, reducing the number of qubits required and potentially speeding up computations for high-dimensional classification problems where classical methods may encounter scalability limitations. The quantum dot product computation is performed using the Hadamard test, which provides a statistical estimate of the probability of measuring an auxiliary qubit. The auxiliary qubit is first put into a superposition state, and after performing controlled unitary operations, amplitude interference is formed, which depends on the scalar product of the feature vector and weight coefficients. The obtained measurement probability is used to estimate the scalar product of the feature vectors and weights. The classical part of the model provides for the execution of operations that are difficult to implement on modern quantum devices, in particular, vector normalization, application of the sigmoid function to estimate the probability of an object belonging to a certain class, calculation of the loss function and iterative update of weight coefficients by the gradient descent method. The purpose of classification is to predict the binary class for an unknown sample based on the training sample. To demonstrate the model, a numerical example is given with a step-by-step calculation of one iteration of logistic regression training. In addition, computer modeling of the hybrid algorithm training process was performed, taking into account the influence of noise on the results of quantum state measurements. A quantum noise model was developed based on the probability of confidence in the measurement result, which is interpreted as an assessment of its reliability in a Bernoulli experiment. Comparison of the obtained results with the classical approach confirms the practical suitability of the hybrid algorithm for binary classification problems. The hybrid model preserves the key properties of classical logistic regression – parameter interpretability and optimization stability, while allowing for the use of quantum advantages for compact data encoding and scalar product computation. This makes the study of hybrid logistic regression relevant for the development of machine learning algorithms on modern quantum platforms.

DOI
10.23939/sisn2026.19.350

Related papers

Quantum algorithm for logistic regression

Hailing Liu, Chao‐Hua Yu, Yusen Wu +4 more

Logistic regression (LR) is an important machine learning model for classification, with wide applications in text classification, image analysis and medicine diagnosis, etc. However, training LR generally entails an iterative gradient descent method, and is quite time consuming when processing big data sets. To solve this problem, we present a quantum algorithm for LR to implement the key task of the gradient descent method, obtaining the classical gradients in each iteration. It is shown that our algorithm achieves exponential speedup over its classical counterpart in each iteration when the dimension of each data point M grows polylogarithmically with the number of data points N, i.e.,M=O(polylog N). It is worth noting that the optimal model parameters are finally derived by performing simple calculations on the obtained gradients. So once the optimal model parameters are determined, one can use them to classify new data at little cost.

arXiv:1906.03834•Jun 10, 2019•13 citations

Hybrid Quantum-Classical Logistic Regression for Calibrated Classification of Pulsar Candidates

Chanelle Matadah Manfouo, Donovan Slabbert, Prince Koree Osei +1 more

Reliable pulsar candidate ranking requires probability estimates that are not only discriminative but also well calibrated. We evaluate hybrid quantum-calssical logistic regression on the imbalanced HTRU-2 dataset using three quantum feature encodings: angle encoding, amplitude encoding, and data re-uploading. The models are trained using analytic gradients and compared with classical baselines and a quantum support vector machine reference model under a paired-seed protocol. Evaluation combines rare-event discrimination, low-false-positive-rate recovery, probability calibration, and runtime analysis. Angle encoding gives the strongest performance among the quantum logistic regression variants. At shallow depth, the angle-encoded model remains close to the best classical baselines in discrimination and low-false-positive-rate recovery, while also giving the lowest calibration error at the benchmark configuration. Murphy decomposition shows that the angle-encoded model maintains low reliability error and high, stable resolution across circuit depths and training-set sizes. This means that its probability estimates preserve both calibration and meaningful separation between candidate groups. Data re-uploading is competitive at small depth but loses discrimination and resolution at larger depth in the present multi-qubit implementation, while amplitude encoding remains weaker across dataset sizes. Shallow angle-encoded quantum logistic regression therefore gives the best balance among the tested quantum logistic models, although simulation runtime remains a practical limitation.

quant-pharXiv:2605.07866•May 11, 2026•0 citations

Quantum-Inspired Data Representations for Classical Machine Learning

Sanjay Kumar, Hitesh Binjrawat, Gorav Singal

Quantum computing has inspired new ways to represent and process data, offering perspectives that can also benefit classical machine learning. In this work, we investigate how quantum-inspired data representations can be integrated into classical machine learning classifiers such as Logistic Regression, Support Vector Machines, and Naive Bayes for binary classification tasks. The proposed approach utilizes a simple amplitude-based encoding that normalizes feature vectors and incorporates phase-like transformations, assisting classical models to capture complex interactions and patterns in the data similar to quantum information processing. We evaluate this approach on both synthetic and three other benchmark datasets, comparing standard and quantum-inspired data representations. The results highlights that the quantum-inspired data encoding often matches or improves classifier performance in terms of accuracy, F1-Score, and precision. Additionally, the normalized encoding provides a more structured representation of the data, which can help with interpretability and visualization. These results highlight the potential of quantum-inspired transformations as a practical and effective tool for improving classical machine learning pipelines without requirement of quantum hardware.

International Conference on Computational Intelligence in Data Science (ICCIDS)•Jan 8, 2026•0 citations

A HYBRID QUANTUM-CLASSICAL MACHINE LEARNING FRAMEWORK FOR IMPROVED CLASSIFICATION ACCURACY

Shweta Narayan Bamne, Prof. M.S Shegokar

Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.

International Journal of Engineering Applied Sciences and Technology•Oct 1, 2026•0 citations

Hybrid Quantum-Classical Algorithm for an Integrated Feature Selection and Logistic Regression Model

Linlin Ye, Muyang Wen, Fenglin Zhang +4 more

Feature selection is a pivotal step in machine learning, aimed at reducing feature dimensionality and improving model performance. Conventional feature selection methods, typically framed as NP-hard problems, focus primarily on selecting non-redundant and discriminative features but neglect how these selected features influence downstream machine learning tasks. To bridge this gap, we propose a mixed-integer non-linear programming-based integrated feature selection and logistic regression (IFSLR) model that jointly optimizes feature selection and classifier parameters. To solve the proposed IFSLR model efficiently, we reformulate it into two quantum-computing-compatible quadratic unconstrained binary optimization (QUBO) models via discretization of continuous variables and Taylor expansions, and provide a theoretical approximation guarantee for the proposed QUBO models. To adaptively optimize both the discretization step length optimization sub-problems and the parameterized QUBO sub-problems, we develop a dual-level Q-learning-guided hybrid quantum-classical algorithm that dynamically selects which sub-problem to solve. At the upper level, an adaptive Q learning agent is employed to select appropriate sub-problems during the search process. At the lower level, each iteration addresses either discretization step length optimization sub-problems or parameterized QUBO sub-problems. Experiments on the German credit dataset demonstrate that our method achieves a 10.83% improvement in accuracy and a 4.54-fold enhancement in computational efficiency on average compared with state-of-the-art methods. It also achievesF1 score improvements of 2.86% on the Wisconsin diagnostic breast cancer dataset and 7.65% on the Portuguese bank marketing dataset. The improvements further validate the effectiveness and generalizability of the proposed model and algorithm.

IEEE Transactions on Engineering Management•Jan 1, 2026•3 citations

A quantum computing approach for brain tumor image classification using amplitude encoding technique

K. P. Maheswari, Kalaiselvi Thiruvenkadam, Sriramakrishnan Pathmanaban

Brain tumor image classification is an essential pre-processing task for tumor diagnosis and treatment planning. In medical imaging, quantum computing analyse medical imaging data, offering potential speedups and new representations compared to classical methods. The brain images are transformed through resizing and normalization to a uniform 32 × 32 × 3 resolution. Subsequently, these processed images are converted into vectors to enable encoding into quantum states. The feature set is reduced using Principal Component Analysis (PCA) to ensure compatibility with the restricted qubit count in the quantum circuits. Through amplitude encoding, these vectors are mapped to quantum states, allowing for a compact and efficient data representation within the quantum domain. A parameterized Variational Quantum Circuit(VQC), consisting of entangling gates and trainable rotations, processes the encoded quantum states to learn features that can effectively discriminate between classes. The loss is calculated from the measured expectation values of Pauli-Z observables and optimized using classical gradient descent, where the objective function is the mean squared error. The trained quantum model is designed for multi-class classification, specifically distinguishing between meningioma, glioma tumors, pituitary tumors, and the absence of a tumor. The outcome of this proposed work demonstrates the VQC’s advantage over classical baselines, including Random Forest, and Support Vector Machine (SVM) and Multi-Layer Perceptron (MLP). The VQC achieved the highest accuracy of 95% and the best robustness (Specificity 0.983). Crucially, the VQC accomplished this using only 24 trainable parameters, showcasing a significant increase in parameter efficiency compared to the classical models. The novelty of this work is the quantitative demonstration that a custom-designed, resource-efficient quantum model can outperform established classical deep learning methods in both performance and efficiency for complex medical image classification. The VQC provides a 3.5-fold gain in parameter efficiency, achieving the highest accuracy of 95% using only 24 trainable parameters. This efficiency is enabled by the novel application of amplitude encoding to the medical images, which compresses 16 features into just 4 qubits. The VQC demonstrates robustness vital for medical diagnostics, achieving a Specificity of 0.983. Its shallow architecture is also NISQ-friendly and remains stable by avoiding the Barren Plateau issue (Gradient Norm: 0.11), validating the path toward quantum advantage in diagnostic tools. The results of this approach highlight the potential amplitude encoding in quantum machine learning, as a feasible and effective method for classifying real-world medical images. This work also opens avenues for future hybrid quantum-classical diagnostic systems that could utilize richer quantum state encodings for significant gains in computational efficiency and accuracy.

Discover Quantum Science•Mar 3, 2026•0 citations
This paper presents a hybrid quantum logistic regression model for binary data classification that combines classical logistic regression methods with quantum computing to improve efficiency and speed up the learning process. Quantum computing is used to represent and process feature and weight vectors as quantum states and to efficiently compute the dot product underlying the logistic function. The use of normalized amplitude coding allows for compact representation of feature vectors and weights, reducing the number of qubits required and potentially speeding up computations for high-dimensional classification problems where classical methods may encounter scalability limitations. The quantum dot product computation is performed using the Hadamard test, which provides a statistical estimate of the probability of measuring an auxiliary qubit. The auxiliary qubit is first put into a superposition state, and after performing controlled unitary operations, amplitude interference is formed, which depends on the scalar product of the feature vector and weight coefficients. The obtained measurement probability is used to estimate the scalar product of the feature vectors and weights. The classical part of the model provides for the execution of operations that are difficult to implement on modern quantum devices, in particular, vector normalization, application of the sigmoid function to estimate the probability of an object belonging to a certain class, calculation of the loss function and iterative update of weight coefficients by the gradient descent method. The purpose of classification is to predict the binary class for an unknown sample based on the training sample. To demonstrate the model, a numerical example is given with a step-by-step calculation of one iteration of logistic regression training. In addition, computer modeling of the hybrid algorithm training process was performed, taking into account the influence of noise on the results of quantum state measurements. A quantum noise model was developed based on the probability of confidence in the measurement result, which is interpreted as an assessment of its reliability in a Bernoulli experiment. Comparison of the obtained results with the classical approach confirms the practical suitability of the hybrid algorithm for binary classification problems. The hybrid model preserves the key properties of classical logistic regression – parameter interpretability and optimization stability, while allowing for the use of quantum advantages for compact data encoding and scalar product computation. This makes the study of hybrid logistic regression relevant for the development of machine learning algorithms on modern quantum platforms.
Logistic regression (LR) is an important machine learning model for classification, with wide applications in text classification, image analysis and medicine diagnosis, etc. However, training LR generally entails an iterative gradient descent method, and is quite time consuming when processing big data sets. To solve this problem, we present a quantum algorithm for LR to implement the key task of the gradient descent method, obtaining the classical gradients in each iteration. It is shown that our algorithm achieves exponential speedup over its classical counterpart in each iteration when the dimension of each data point M grows polylogarithmically with the number of data points N, i.e.,M=O(polylog N). It is worth noting that the optimal model parameters are finally derived by performing simple calculations on the obtained gradients. So once the optimal model parameters are determined, one can use them to classify new data at little cost.
Reliable pulsar candidate ranking requires probability estimates that are not only discriminative but also well calibrated. We evaluate hybrid quantum-calssical logistic regression on the imbalanced HTRU-2 dataset using three quantum feature encodings: angle encoding, amplitude encoding, and data re-uploading. The models are trained using analytic gradients and compared with classical baselines and a quantum support vector machine reference model under a paired-seed protocol. Evaluation combines rare-event discrimination, low-false-positive-rate recovery, probability calibration, and runtime analysis. Angle encoding gives the strongest performance among the quantum logistic regression variants. At shallow depth, the angle-encoded model remains close to the best classical baselines in discrimination and low-false-positive-rate recovery, while also giving the lowest calibration error at the benchmark configuration. Murphy decomposition shows that the angle-encoded model maintains low reliability error and high, stable resolution across circuit depths and training-set sizes. This means that its probability estimates preserve both calibration and meaningful separation between candidate groups. Data re-uploading is competitive at small depth but loses discrimination and resolution at larger depth in the present multi-qubit implementation, while amplitude encoding remains weaker across dataset sizes. Shallow angle-encoded quantum logistic regression therefore gives the best balance among the tested quantum logistic models, although simulation runtime remains a practical limitation.
Quantum computing has inspired new ways to represent and process data, offering perspectives that can also benefit classical machine learning. In this work, we investigate how quantum-inspired data representations can be integrated into classical machine learning classifiers such as Logistic Regression, Support Vector Machines, and Naive Bayes for binary classification tasks. The proposed approach utilizes a simple amplitude-based encoding that normalizes feature vectors and incorporates phase-like transformations, assisting classical models to capture complex interactions and patterns in the data similar to quantum information processing. We evaluate this approach on both synthetic and three other benchmark datasets, comparing standard and quantum-inspired data representations. The results highlights that the quantum-inspired data encoding often matches or improves classifier performance in terms of accuracy, F1-Score, and precision. Additionally, the normalized encoding provides a more structured representation of the data, which can help with interpretability and visualization. These results highlight the potential of quantum-inspired transformations as a practical and effective tool for improving classical machine learning pipelines without requirement of quantum hardware.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Feature selection is a pivotal step in machine learning, aimed at reducing feature dimensionality and improving model performance. Conventional feature selection methods, typically framed as NP-hard problems, focus primarily on selecting non-redundant and discriminative features but neglect how these selected features influence downstream machine learning tasks. To bridge this gap, we propose a mixed-integer non-linear programming-based integrated feature selection and logistic regression (IFSLR) model that jointly optimizes feature selection and classifier parameters. To solve the proposed IFSLR model efficiently, we reformulate it into two quantum-computing-compatible quadratic unconstrained binary optimization (QUBO) models via discretization of continuous variables and Taylor expansions, and provide a theoretical approximation guarantee for the proposed QUBO models. To adaptively optimize both the discretization step length optimization sub-problems and the parameterized QUBO sub-problems, we develop a dual-level Q-learning-guided hybrid quantum-classical algorithm that dynamically selects which sub-problem to solve. At the upper level, an adaptive Q learning agent is employed to select appropriate sub-problems during the search process. At the lower level, each iteration addresses either discretization step length optimization sub-problems or parameterized QUBO sub-problems. Experiments on the German credit dataset demonstrate that our method achieves a 10.83% improvement in accuracy and a 4.54-fold enhancement in computational efficiency on average compared with state-of-the-art methods. It also achievesF1 score improvements of 2.86% on the Wisconsin diagnostic breast cancer dataset and 7.65% on the Portuguese bank marketing dataset. The improvements further validate the effectiveness and generalizability of the proposed model and algorithm.
Brain tumor image classification is an essential pre-processing task for tumor diagnosis and treatment planning. In medical imaging, quantum computing analyse medical imaging data, offering potential speedups and new representations compared to classical methods. The brain images are transformed through resizing and normalization to a uniform 32 × 32 × 3 resolution. Subsequently, these processed images are converted into vectors to enable encoding into quantum states. The feature set is reduced using Principal Component Analysis (PCA) to ensure compatibility with the restricted qubit count in the quantum circuits. Through amplitude encoding, these vectors are mapped to quantum states, allowing for a compact and efficient data representation within the quantum domain. A parameterized Variational Quantum Circuit(VQC), consisting of entangling gates and trainable rotations, processes the encoded quantum states to learn features that can effectively discriminate between classes. The loss is calculated from the measured expectation values of Pauli-Z observables and optimized using classical gradient descent, where the objective function is the mean squared error. The trained quantum model is designed for multi-class classification, specifically distinguishing between meningioma, glioma tumors, pituitary tumors, and the absence of a tumor. The outcome of this proposed work demonstrates the VQC’s advantage over classical baselines, including Random Forest, and Support Vector Machine (SVM) and Multi-Layer Perceptron (MLP). The VQC achieved the highest accuracy of 95% and the best robustness (Specificity 0.983). Crucially, the VQC accomplished this using only 24 trainable parameters, showcasing a significant increase in parameter efficiency compared to the classical models. The novelty of this work is the quantitative demonstration that a custom-designed, resource-efficient quantum model can outperform established classical deep learning methods in both performance and efficiency for complex medical image classification. The VQC provides a 3.5-fold gain in parameter efficiency, achieving the highest accuracy of 95% using only 24 trainable parameters. This efficiency is enabled by the novel application of amplitude encoding to the medical images, which compresses 16 features into just 4 qubits. The VQC demonstrates robustness vital for medical diagnostics, achieving a Specificity of 0.983. Its shallow architecture is also NISQ-friendly and remains stable by avoiding the Barren Plateau issue (Gradient Norm: 0.11), validating the path toward quantum advantage in diagnostic tools. The results of this approach highlight the potential amplitude encoding in quantum machine learning, as a feasible and effective method for classifying real-world medical images. This work also opens avenues for future hybrid quantum-classical diagnostic systems that could utilize richer quantum state encodings for significant gains in computational efficiency and accuracy.