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

Scientific Reports

A hybrid framework based on quantum genetic algorithm and quantum support vector machine for noise-aware qubit mapping in NISQ systems

Muhammad Vesali, Reza Sabbaghi‐Nadooshan, Mahboobeh Houshmand, Monireh Houshmand

Published Aug 21, 2026• 0 citations
Publisher

Abstract

Quantum circuit compilation and qubit mapping represent critical challenges in noisy intermediate-scale quantum (NISQ) devices due to limited qubit connectivity and the presence of hardware noise. Conventional heuristic mapping methods often generate suboptimal solutions under realistic noisy execution conditions. This paper proposes a hybrid learning-guided framework that integrates a quantum genetic algorithm (QGA) with a quantum support vector machine (QSVM) for noise-aware qubit mapping optimization in NISQ systems. In the proposed framework, QGA generates diverse candidate mappings, while QSVM-based supervised ranking identifies high-quality mappings using structural and execution-related features. To evaluate the effectiveness of the proposed mapping selection strategy, a QROC/Q-AUC-based evaluation mechanism is introduced to quantify the decision reliability and ranking capability of the mapping selection process under noisy quantum execution conditions. Extensive experiments on benchmark quantum circuits using noisy simulation environments derived from IBM Quantum hardware models demonstrate that the proposed framework reduces SWAP overhead and circuit depth while improving execution fidelity and the reliability of selecting high-quality mappings compared with conventional heuristic and evolutionary approaches. The results indicate that the integration of evolutionary optimization and quantum machine learning provides an effective solution for noise-aware qubit mapping in NISQ-era quantum compilation.

DOI
10.1038/s41598-026-67369-1

Related papers

Integration of Machine Learning with Quantum Computing: Compilation of Quantum Circuit for Efficacy on Noisy Intermediate-Scale Quantum Devices

M. Praba, Ahmad Abdelhafiz Ali Samhan, V. Samuthira Pandi +3 more

Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.

Asian Conference on Innovation in Technology (ASIANCON)•Aug 22, 2025•1 citation

Error-Resilient Quantum Compiler Design for Efficient Qubit Mapping, Gate Optimization, and Noise Mitigation in NISQ-Era Devices,

Beyza Altan

The rapid evolution of Noisy Intermediate-Scale Quantum (NISQ) devices has intensified the need for robust compilation strategies capable of mitigating hardware-induced errors while maximizing computational efficiency. Quantum compilers play a pivotal role in translating high-level quantum algorithms into hardware-executable instructions, yet they face significant challenges related to qubit connectivity constraints, limited coherence times, and stochastic noise. This paper examines error-resilient quantum compiler design for efficient qubit mapping, gate optimization, and noise mitigation in NISQ-era devices, proposing a framework that integrates topology-aware mapping, adaptive gate synthesis, and probabilistic error suppression techniques. By synthesizing advances in quantum circuit optimization, hardware-aware scheduling, and hybrid classical–quantum error correction strategies, the study evaluates how compiler-level innovations can substantially enhance execution fidelity and resource efficiency. The findings suggest that intelligent compiler architectures are critical enablers of practical quantum advantage during the transitional NISQ phase, bridging theoretical algorithm design with real-world hardware constraints.

Next generation.•Feb 20, 2026•0 citations

Flexible Genetic Algorithm for Quantum Support Vector Machines

Nguyen Minh Duc, Vu Tuan Hai, Le Bin Ho +1 more

Quantum Support Vector Machines (QSVM) is one of the most promising frameworks in quantum machine learning, yet their performance depends on the design of the feature map. Conventional approaches rely on fixed quantum circuits, which often fail to generalize across datasets. To address this limitation, we propose GA-QSVM, a hybrid framework that employs Genetic Algorithms (GA) to automatically optimize feature maps. The proposed method introduces a configurable framework that flexibly defines the evolutionary parameters, enabling the construction of adaptive circuits. Experimental evaluation of datasets, including Digits, Fashion, Wine, and Breast Cancer, demonstrates that GA-QSVMs achieve a comparable accuracy compared to classical SVMs and standard QSVMs. Furthermore, transfer learning results indicate that GA-QSVM's circuits generalize effectively across datasets. These findings highlight the potential of evolutionary strategies to automate and enhance kernel design for future quantum machine learning applications.

quant-pharXiv:2511.19160•Machine Learning Science and Technology•Nov 25, 2025•1 citation

Noise-Aware Evaluation and Adaptive Optimization Level Selection for Quantum Circuits in NISQ Systems

Mahesh Babu Chittem, Varsha Sambhaje

Quantum circuit optimization plays a critical role in improving the performance of algorithms executed on noisy intermediate-scale quantum (NISQ) devices. While modern quantum compilers provide multiple optimization levels, selecting an appropriate optimization strategy remains a non-trivial task due to the complex interplay between circuit structure and hardware noise. In this work, we present a comprehensive noise-aware evaluation of quantum circuit optimization strategies using a diverse set of 33 circuits, including Quantum Fourier Transform (QFT), Grover's search, Variational Quantum Eigensolver (VQE), and randomly generated circuits. We analyze the impact of different transpiler optimization levels on circuit depth, entanglement (CNOT count), and output fidelity under a realistic depolarizing noise model. Our experimental results reveal that no single optimization level consistently yields the best performance across all circuit types. While aggressive optimization is beneficial for structured circuits such as QFT and VQE, moderate optimization levels often provide a better trade-off between circuit complexity and fidelity for unstructured or randomly generated circuits. These findings highlight that optimization-level selection is inherently dependent on circuit characteristics and cannot be effectively addressed using static or heuristic approaches alone. To address this challenge, we further propose a lightweight learning-based model that predicts the optimal optimization level based on circuit features. The model achieves an accuracy of 93.9% across the evaluated dataset, demonstrating that simple machine learning techniques can effectively approximate optimal compiler decisions without requiring exhaustive evaluation. Overall, this work provides practical insights into optimization behavior in NISQ systems and introduces a scalable approach for adaptive optimization selection, contributing toward more efficient quantum software development.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2026•0 citations

Hardware-Aware Quantum Support Vector Machines

Adil Mubashir Chaudhry, Ali Raza Haider, Hanzla Khan +1 more

Deploying quantum machine learning algorithms on near-term quantum hardware requires circuits that respect device-specific gate sets, connectivity constraints, and noise characteristics. We present a hardware-aware Neural Architecture Search (NAS) approach for designing quantum feature maps that are natively executable on IBM quantum processors without transpilation overhead. Using genetic algorithms to evolve circuit architectures constrained to IBM Torino native gates (ECR, RZ, SX, X), we demonstrate that automated architecture search can discover quantum Support Vector Machine (QSVM) feature maps achieving competitive performance while guaranteeing hardware compatibility. Evaluated on the UCI Breast Cancer Wisconsin dataset, our hardware-aware NAS discovers a 12-gate circuit using exclusively IBM native gates (6 ECR, 3 SX, 3 RZ) that achieves 91.23 % accuracy on 10 qubits-matching unconstrained gate search while requiring zero transpilation. This represents a 27 percentage point improvement over hand-crafted quantum feature maps (64 % accuracy) and approaches the classical RBF SVM baseline (93 %). We show that removing architectural constraints (fixed RZ placement) within hardware-aware search yields 3.5 percentage point gains, and that 100 % native gate usage eliminates decomposition errors that plague universal gate compilations. Our work demonstrates that hardware-aware NAS makes quantum kernel methods practically deployable on current noisy intermediate-scale quantum (NISQ) devices, with circuit architectures ready for immediate execution without modification.

quant-pharXiv:2604.07856•Apr 10, 2026•0 citations

Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to Heuristics

Janusz Kusyk, Samah Mohamed Saeed, M. Ümit Uyar

Computationally expensive applications, including machine learning, chemical simulations, and financial modeling, are promising candidates for noisy intermediate scale quantum (NISQ) computers. In these problems, one important challenge is mapping a quantum circuit onto NISQ hardware while satisfying physical constraints of an underlying quantum architecture. Quantum circuit compilation (QCC) aims to generate feasible mappings such that a quantum circuit can be executed in a given hardware platform with acceptable confidence in outcomes. Physical constraints of a NISQ computer change frequently, requiring QCC process to be repeated often. When a circuit cannot directly be executed on a quantum hardware due to its physical limitations, it is necessary to modify the circuit by adding new quantum gates and auxiliary qubits, increasing its space and time complexity. An inefficient QCC may significantly increase error rate and circuit latency for even the simplest algorithms. In this article, we present artificial intelligence (AI)-based and heuristic-based methods recently reported in the literature that attempt to address these QCC challenges. We group them based on underlying techniques that they implement, such as AI algorithms including genetic algorithms, genetic programming, ant colony optimization and AI planning, and heuristics methods employing greedy algorithms, satisfiability problem solvers, dynamic, and graph optimization techniques. We discuss performance of each QCC technique and evaluate its potential limitations.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•91 citations
Quantum circuit compilation and qubit mapping represent critical challenges in noisy intermediate-scale quantum (NISQ) devices due to limited qubit connectivity and the presence of hardware noise. Conventional heuristic mapping methods often generate suboptimal solutions under realistic noisy execution conditions. This paper proposes a hybrid learning-guided framework that integrates a quantum genetic algorithm (QGA) with a quantum support vector machine (QSVM) for noise-aware qubit mapping optimization in NISQ systems. In the proposed framework, QGA generates diverse candidate mappings, while QSVM-based supervised ranking identifies high-quality mappings using structural and execution-related features. To evaluate the effectiveness of the proposed mapping selection strategy, a QROC/Q-AUC-based evaluation mechanism is introduced to quantify the decision reliability and ranking capability of the mapping selection process under noisy quantum execution conditions. Extensive experiments on benchmark quantum circuits using noisy simulation environments derived from IBM Quantum hardware models demonstrate that the proposed framework reduces SWAP overhead and circuit depth while improving execution fidelity and the reliability of selecting high-quality mappings compared with conventional heuristic and evolutionary approaches. The results indicate that the integration of evolutionary optimization and quantum machine learning provides an effective solution for noise-aware qubit mapping in NISQ-era quantum compilation.
Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.
The rapid evolution of Noisy Intermediate-Scale Quantum (NISQ) devices has intensified the need for robust compilation strategies capable of mitigating hardware-induced errors while maximizing computational efficiency. Quantum compilers play a pivotal role in translating high-level quantum algorithms into hardware-executable instructions, yet they face significant challenges related to qubit connectivity constraints, limited coherence times, and stochastic noise. This paper examines error-resilient quantum compiler design for efficient qubit mapping, gate optimization, and noise mitigation in NISQ-era devices, proposing a framework that integrates topology-aware mapping, adaptive gate synthesis, and probabilistic error suppression techniques. By synthesizing advances in quantum circuit optimization, hardware-aware scheduling, and hybrid classical–quantum error correction strategies, the study evaluates how compiler-level innovations can substantially enhance execution fidelity and resource efficiency. The findings suggest that intelligent compiler architectures are critical enablers of practical quantum advantage during the transitional NISQ phase, bridging theoretical algorithm design with real-world hardware constraints.
Quantum Support Vector Machines (QSVM) is one of the most promising frameworks in quantum machine learning, yet their performance depends on the design of the feature map. Conventional approaches rely on fixed quantum circuits, which often fail to generalize across datasets. To address this limitation, we propose GA-QSVM, a hybrid framework that employs Genetic Algorithms (GA) to automatically optimize feature maps. The proposed method introduces a configurable framework that flexibly defines the evolutionary parameters, enabling the construction of adaptive circuits. Experimental evaluation of datasets, including Digits, Fashion, Wine, and Breast Cancer, demonstrates that GA-QSVMs achieve a comparable accuracy compared to classical SVMs and standard QSVMs. Furthermore, transfer learning results indicate that GA-QSVM's circuits generalize effectively across datasets. These findings highlight the potential of evolutionary strategies to automate and enhance kernel design for future quantum machine learning applications.
Quantum circuit optimization plays a critical role in improving the performance of algorithms executed on noisy intermediate-scale quantum (NISQ) devices. While modern quantum compilers provide multiple optimization levels, selecting an appropriate optimization strategy remains a non-trivial task due to the complex interplay between circuit structure and hardware noise. In this work, we present a comprehensive noise-aware evaluation of quantum circuit optimization strategies using a diverse set of 33 circuits, including Quantum Fourier Transform (QFT), Grover's search, Variational Quantum Eigensolver (VQE), and randomly generated circuits. We analyze the impact of different transpiler optimization levels on circuit depth, entanglement (CNOT count), and output fidelity under a realistic depolarizing noise model. Our experimental results reveal that no single optimization level consistently yields the best performance across all circuit types. While aggressive optimization is beneficial for structured circuits such as QFT and VQE, moderate optimization levels often provide a better trade-off between circuit complexity and fidelity for unstructured or randomly generated circuits. These findings highlight that optimization-level selection is inherently dependent on circuit characteristics and cannot be effectively addressed using static or heuristic approaches alone. To address this challenge, we further propose a lightweight learning-based model that predicts the optimal optimization level based on circuit features. The model achieves an accuracy of 93.9% across the evaluated dataset, demonstrating that simple machine learning techniques can effectively approximate optimal compiler decisions without requiring exhaustive evaluation. Overall, this work provides practical insights into optimization behavior in NISQ systems and introduces a scalable approach for adaptive optimization selection, contributing toward more efficient quantum software development.
Deploying quantum machine learning algorithms on near-term quantum hardware requires circuits that respect device-specific gate sets, connectivity constraints, and noise characteristics. We present a hardware-aware Neural Architecture Search (NAS) approach for designing quantum feature maps that are natively executable on IBM quantum processors without transpilation overhead. Using genetic algorithms to evolve circuit architectures constrained to IBM Torino native gates (ECR, RZ, SX, X), we demonstrate that automated architecture search can discover quantum Support Vector Machine (QSVM) feature maps achieving competitive performance while guaranteeing hardware compatibility. Evaluated on the UCI Breast Cancer Wisconsin dataset, our hardware-aware NAS discovers a 12-gate circuit using exclusively IBM native gates (6 ECR, 3 SX, 3 RZ) that achieves 91.23 % accuracy on 10 qubits-matching unconstrained gate search while requiring zero transpilation. This represents a 27 percentage point improvement over hand-crafted quantum feature maps (64 % accuracy) and approaches the classical RBF SVM baseline (93 %). We show that removing architectural constraints (fixed RZ placement) within hardware-aware search yields 3.5 percentage point gains, and that 100 % native gate usage eliminates decomposition errors that plague universal gate compilations. Our work demonstrates that hardware-aware NAS makes quantum kernel methods practically deployable on current noisy intermediate-scale quantum (NISQ) devices, with circuit architectures ready for immediate execution without modification.
Computationally expensive applications, including machine learning, chemical simulations, and financial modeling, are promising candidates for noisy intermediate scale quantum (NISQ) computers. In these problems, one important challenge is mapping a quantum circuit onto NISQ hardware while satisfying physical constraints of an underlying quantum architecture. Quantum circuit compilation (QCC) aims to generate feasible mappings such that a quantum circuit can be executed in a given hardware platform with acceptable confidence in outcomes. Physical constraints of a NISQ computer change frequently, requiring QCC process to be repeated often. When a circuit cannot directly be executed on a quantum hardware due to its physical limitations, it is necessary to modify the circuit by adding new quantum gates and auxiliary qubits, increasing its space and time complexity. An inefficient QCC may significantly increase error rate and circuit latency for even the simplest algorithms. In this article, we present artificial intelligence (AI)-based and heuristic-based methods recently reported in the literature that attempt to address these QCC challenges. We group them based on underlying techniques that they implement, such as AI algorithms including genetic algorithms, genetic programming, ant colony optimization and AI planning, and heuristics methods employing greedy algorithms, satisfiability problem solvers, dynamic, and graph optimization techniques. We discuss performance of each QCC technique and evaluate its potential limitations.