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

Engineering Applications of Artificial Intelligence

Quantum computing for capacity checks of reinforced concrete sections

Salvatore Sessa, Luciano Rosati

Published Feb 5, 2026• 1 citation
Publisher

Abstract

We explore the application of quantum-enhanced machine learning techniques for the structural analysis of reinforced concrete sections subjected to combined axial force and biaxial bending. A quantum support vector machine framework is developed and employed to approximate the limit state surface that defines the ultimate capacity of Reinforced Concrete cross-sections. Several quantum kernel architectures, namely Fidelity, Mercer-inspired, ZZ-Feature Map, and HE2, are implemented and tested on two representative geometries: a symmetric rectangular section and an asymmetric L-shaped one. Kernel performance is evaluated in terms of classification accuracy, generalization behavior, and decision boundary coherence, showing strengths and limitations of each quantum feature map. Analyses have shown that the Fidelity, Mercer Static, and single-layer HE2 kernels provide the most robust and geometrically sound decision surfaces, thus achieving high classification accuracy and stability. On the contrary, deeper or highly expressive circuits exhibit overfitting and reduced generalization. Despite the limited accuracy observed for some kernel configurations, the results prove that quantum kernels can effectively approximate capacity domains, particularly in symmetric cases. Hence, quantum-enhanced models represent a promising direction for efficient structural verification, even if the technology is still in its early stages.

DOI
10.1016/j.engappai.2026.113970

Related papers

Learning to Build Quantum Kernels: A Reinforcement Learning Framework for Quantum SVC Optimization

Luigi , Giuseppe Buonaiuto, Lidia Marassi +4 more

Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.

•Mar 4, 2026•0 citations

Comparative performance analysis of quantum feature maps for quantum kernel-based machine learning

Ravi Kumar Jha, Nikola Kirilov Kasabov, Saugat Bhattacharyya +2 more

Quantum algorithms have become a popular research domain in recent times for discovering quantum-enhanced solutions in machine learning applications. Quantum kernels are one of the directions that establish such quantum-enhanced solutions to some extent. This work presents a detailed analysis of the quantum kernel approach leveraging feature maps and relevant hyperparameters to develop enhanced quantum kernels. The study includes a new high-order feature map and assesses five existing state-of-the-art feature maps for enhanced quantum kernel classifiers. Additionally, the significance of the rotational factor as a hyperparameter is highlighted for improving kernel performance. Also, it is analyzed whether different hyperparameter-tuned feature maps can lead to enhanced decision boundaries, demonstrating kernel expressivity. The analysis is undertaken on classification tasks using four different nonlinear datasets of distinct complexity. Comparative evaluations are also made with traditional machine learning models-Support Vector Machines (Linear and RBF), Naïve Bayes, Linear Discriminant Analysis, Decision Tree, Random Forest, Adaptive Boosting, and MLP. Overall, the study demonstrates that a well-tuned quantum feature map can enhance the generalization ability of quantum kernels, making them more effective for broader quantum-enhanced machine learning applications.

Scientific Reports•Feb 10, 2026•3 citations

Design and Evaluation of a Quantum Kernel Support Vector Classifier using Qiskit for Hybrid Quantum–Classical Binary Classification

H.Shree Kumar, Eslavath Hemanth Naik, Gadige Hemanth +1 more

Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.

International Conference on Computing Methodologies and Communication (ICCMC)•Jul 1, 2026•0 citations

Quantum Support Vector Machines and Quantum Kernel Methods

Li Xu, Jing Wang, Jiang Chen +3 more

Background Quantum support vector machines and quantum kernel methods have emerged as promising approaches within quantum machine learning, with the goal of leveraging quantum computing to enhance classification performance and computational efficiency. This review systematically surveys recent advances in QSVM and kernel‐based quantum classifiers, and analyzes their algorithmic frameworks, experimental implementations, and practical challenges. Methods We systematically examine QSVM approaches, including three schemes based on HHL algorithm, Hadamard test, and variational optimization, alongside multi‐class extension and quantum feature mapping. Result Findings indicate that QSVM can offer theoretical speed‐ups in specific settings, particularly when combined with quantum feature mappings that encode data into high‐dimensional Hilbert spaces. However, current implementations remain constrained by hardware limitations, and a lack of large‐scale general validation. Most studies focus on proof‐of‐principle experiments with limited real‐world applicability. Conclusion While promising, QSVM requires further work on scalability, noise resilience, and real‐world integration. Future research should focus on robust algorithms and empirical studies.

Software Practice and Experience•Apr 13, 2026•0 citations

Large-Scale Quantum Kernels for Hyperspectral Data Classification

Amer Delilbasic, Artur Miroszewski, Agata M. Wijata +4 more

Quantum kernel methods have emerged as a promising approach for leveraging high-dimensional feature spaces in machine learning, particularly in domains where classical kernel methods face scalability limitations. In this work, we present the first large-scale study of fidelity-quantum-kernel support vector machines for hyperspectral data classification without requiring heavy prior feature selection or dimensionality reduction. By simulating quantum kernels using tensor network contraction techniques and graphics processing unit acceleration, we overcome the computational bottlenecks traditionally associated with quantum models, achieving quadratic scaling $O(n^2)$ in the number of qubits. Our approach enables the evaluation of quantum kernels on hyperspectral data with hundreds of spectral bands, aligning quantum feature spaces with real-world remote sensing applications. We provide an in-depth analysis of kernel bandwidth optimization, demonstrating its crucial role in mitigating exponential concentration effects and ensuring the model's ability to generalize. Experimental results on binary classification (Indian Pines and methane detection) and multiclass classification (Indian Pines) demonstrate that quantum kernels achieve competitive performance compared to a broad range of state-of-the-art classical baselines. As illustrative cases, on four 50-band splits selected from Indian Pines, the quantum model achieved a $78.0±6.2\%$ accuracy for a binary classification task compared to $72.0±5.0\%$ for the standard radial basis function kernel. For a four-class classification task, the quantum kernel reached $83.3±3.1\%$ accuracy, outperforming several state-of-the-art baselines. On five 75-band splits selected from the methane detection dataset, the quantum approach yielded $58.5±5.0\%$ accuracy versus $55.1±2.5\%$ for the classical counterpart. This study provides a foundation for future exploration of quantum machine learning in high-dimensional Earth observation tasks.

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing•Jan 1, 2026•0 citations

Quantum Kernel-Based Classification: An Optimized Quantum Support Vector Classifier Approach

Xiaoman Liu

Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.

IEEE International Conference on Frontiers Technology of Information and Computer (ICFTIC)•Dec 13, 2024•0 citations
We explore the application of quantum-enhanced machine learning techniques for the structural analysis of reinforced concrete sections subjected to combined axial force and biaxial bending. A quantum support vector machine framework is developed and employed to approximate the limit state surface that defines the ultimate capacity of Reinforced Concrete cross-sections. Several quantum kernel architectures, namely Fidelity, Mercer-inspired, ZZ-Feature Map, and HE2, are implemented and tested on two representative geometries: a symmetric rectangular section and an asymmetric L-shaped one. Kernel performance is evaluated in terms of classification accuracy, generalization behavior, and decision boundary coherence, showing strengths and limitations of each quantum feature map. Analyses have shown that the Fidelity, Mercer Static, and single-layer HE2 kernels provide the most robust and geometrically sound decision surfaces, thus achieving high classification accuracy and stability. On the contrary, deeper or highly expressive circuits exhibit overfitting and reduced generalization. Despite the limited accuracy observed for some kernel configurations, the results prove that quantum kernels can effectively approximate capacity domains, particularly in symmetric cases. Hence, quantum-enhanced models represent a promising direction for efficient structural verification, even if the technology is still in its early stages.
Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.
Quantum algorithms have become a popular research domain in recent times for discovering quantum-enhanced solutions in machine learning applications. Quantum kernels are one of the directions that establish such quantum-enhanced solutions to some extent. This work presents a detailed analysis of the quantum kernel approach leveraging feature maps and relevant hyperparameters to develop enhanced quantum kernels. The study includes a new high-order feature map and assesses five existing state-of-the-art feature maps for enhanced quantum kernel classifiers. Additionally, the significance of the rotational factor as a hyperparameter is highlighted for improving kernel performance. Also, it is analyzed whether different hyperparameter-tuned feature maps can lead to enhanced decision boundaries, demonstrating kernel expressivity. The analysis is undertaken on classification tasks using four different nonlinear datasets of distinct complexity. Comparative evaluations are also made with traditional machine learning models-Support Vector Machines (Linear and RBF), Naïve Bayes, Linear Discriminant Analysis, Decision Tree, Random Forest, Adaptive Boosting, and MLP. Overall, the study demonstrates that a well-tuned quantum feature map can enhance the generalization ability of quantum kernels, making them more effective for broader quantum-enhanced machine learning applications.
Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.
Background Quantum support vector machines and quantum kernel methods have emerged as promising approaches within quantum machine learning, with the goal of leveraging quantum computing to enhance classification performance and computational efficiency. This review systematically surveys recent advances in QSVM and kernel‐based quantum classifiers, and analyzes their algorithmic frameworks, experimental implementations, and practical challenges. Methods We systematically examine QSVM approaches, including three schemes based on HHL algorithm, Hadamard test, and variational optimization, alongside multi‐class extension and quantum feature mapping. Result Findings indicate that QSVM can offer theoretical speed‐ups in specific settings, particularly when combined with quantum feature mappings that encode data into high‐dimensional Hilbert spaces. However, current implementations remain constrained by hardware limitations, and a lack of large‐scale general validation. Most studies focus on proof‐of‐principle experiments with limited real‐world applicability. Conclusion While promising, QSVM requires further work on scalability, noise resilience, and real‐world integration. Future research should focus on robust algorithms and empirical studies.
Quantum kernel methods have emerged as a promising approach for leveraging high-dimensional feature spaces in machine learning, particularly in domains where classical kernel methods face scalability limitations. In this work, we present the first large-scale study of fidelity-quantum-kernel support vector machines for hyperspectral data classification without requiring heavy prior feature selection or dimensionality reduction. By simulating quantum kernels using tensor network contraction techniques and graphics processing unit acceleration, we overcome the computational bottlenecks traditionally associated with quantum models, achieving quadratic scaling O(n2)O(n^2)O(n2) in the number of qubits. Our approach enables the evaluation of quantum kernels on hyperspectral data with hundreds of spectral bands, aligning quantum feature spaces with real-world remote sensing applications. We provide an in-depth analysis of kernel bandwidth optimization, demonstrating its crucial role in mitigating exponential concentration effects and ensuring the model's ability to generalize. Experimental results on binary classification (Indian Pines and methane detection) and multiclass classification (Indian Pines) demonstrate that quantum kernels achieve competitive performance compared to a broad range of state-of-the-art classical baselines. As illustrative cases, on four 50-band splits selected from Indian Pines, the quantum model achieved a 78.0±6.2%78.0±6.2\%78.0±6.2% accuracy for a binary classification task compared to 72.0±5.0%72.0±5.0\%72.0±5.0% for the standard radial basis function kernel. For a four-class classification task, the quantum kernel reached 83.3±3.1%83.3±3.1\%83.3±3.1% accuracy, outperforming several state-of-the-art baselines. On five 75-band splits selected from the methane detection dataset, the quantum approach yielded 58.5±5.0%58.5±5.0\%58.5±5.0% accuracy versus 55.1±2.5%55.1±2.5\%55.1±2.5% for the classical counterpart. This study provides a foundation for future exploration of quantum machine learning in high-dimensional Earth observation tasks.
Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.