Quantum computing promises to solve complex problems beyond the capabilities of classical computers. However, the practical implementation of quantum algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices is significantly challenged by various noise sources that degrade computational fidelity. Transpilation—the process of converting high-level quantum circuits into optimized, hardware-specific instructions—plays a crucial role in mitigating these noise effects. In this paper, we present a comprehensive study on enhancing noise resilience in quantum algorithms through advanced transpilation techniques, evaluated using the SupermarQ benchmarking suite. By systematically analyzing the impact of different optimization levels in Qiskit’s transpiler on a diverse set of quantum algorithms, we demonstrate how specific transpilation strategies influence key performance metrics related to noise resilience. Our results show that higher optimization levels can improve metrics such as Liveness (LV) and Parallelism (PL), leading to more reliable quantum computations on NISQ hardware. This work contributes to the development of noise-adaptive transpilation methods that incorporate noise characteristics into the optimization process, ultimately enhancing the practical viability of quantum algorithms.
Quantum computing promises to solve complex problems beyond the capabilities of classical computers. However, the practical implementation of quantum algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices is significantly challenged by various noise sources that degrade computational fidelity. Transpilation—the process of converting high-level quantum circuits into optimized, hardware-specific instructions—plays a crucial role in mitigating these noise effects. In this paper, we present a comprehensive study on enhancing noise resilience in quantum algorithms through advanced transpilation techniques, evaluated using the SupermarQ benchmarking suite. By systematically analyzing the impact of different optimization levels in Qiskit’s transpiler on a diverse set of quantum algorithms, we demonstrate how specific transpilation strategies influence key performance metrics related to noise resilience. Our results show that higher optimization levels can improve metrics such as Liveness (LV) and Parallelism (PL), leading to more reliable quantum computations on NISQ hardware. This work contributes to the development of noise-adaptive transpilation methods that incorporate noise characteristics into the optimization process, ultimately enhancing the practical viability of quantum algorithms.
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.
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.
The benchmark of Noisy Intermediate-Scale Quantum (NISQ) computers plays a major role in the research and development of quantum devices and algorithms. Our study aims to investigate a single metric of benchmarking for the Noisy Intermediate-Scale Quantum device. We use state-of-the-art applications to generate a device-score according to our proposed formula. Our study utilizes Quantum Volume (QV) to determine the qubit circuit size for each device. Furthermore, we utilize SupermarQ to determine each application's benchmark score, utilizing their 5 feature vectors to indicate the circuit performance, and applying their circuit optimization techniques to configure the transpiler. Our experiment shows that device-score of the simulated IBM backend are directly correlated to Quantum Volume. However, it should be noted that topology and gate error are also embedded in the benchmark scores of the applications. Because of this, our study introduces the device-score, a single number metric that provides a more precise scale with the assistance of Quantum Volume and SupermarQ.
Noisy Intermediate-Scale Quantum (NISQ) devices are promising platforms for practical quantum computing, but their performance is significantly affected by limited qubit availability, gate errors, decoherence, circuit depth, and hardware-dependent noise. Conventional quantum circuits are generally designed and optimized before execution and may not respond effectively to changing hardware conditions during computation. This research proposes a Self-Adaptive Quantum Circuit framework that dynamically modifies quantum circuits according to the current computational resources and noise characteristics of NISQ devices. The proposed framework monitors parameters such as qubit fidelity, gate error rates, circuit depth, execution time, and resource availability, and automatically selects suitable circuit configurations to improve computational performance. Adaptive mechanisms can be employed to reduce unnecessary gates, optimize qubit utilization, and mitigate the impact of hardware noise while maintaining the required computational accuracy. The framework will be evaluated using simulation platforms and available NISQ quantum hardware, comparing adaptive circuits with conventional static circuits using metrics such as accuracy, fidelity, circuit depth, gate count, execution time, and error rate. The expected outcome is a resource-efficient and noise-aware quantum circuit optimization approach capable of improving the reliability and performance of quantum applications on near-term quantum hardware. The proposed research aims to contribute toward more practical, flexible, and hardware-aware quantum computing systems for NISQ-era applications. Keywords: NISQ Computing, Self-Adaptive Quantum Circuits, Quantum Circuit Optimization, Quantum Error Mitigation, Quantum Noise, Quantum Computing.
Noise in current quantum hardware (NISQ devices) poses a major obstacle by degrading gate operations and overall circuit fidelity toward FTQC. Traditional quantum error correction (QEC) is effective but resource-intensive, requiring several extra qubits and operations beyond the reach of near-term devices. Quantum error mitigation (QEM) offers a complementary path by reducing the impact of error prior to full correction. We present an adaptive pulse-level QEM using genetic algorithms to dynamically adjust control pulses in real-time, improving algorithm fidelity without modifying the logic structure of a quantum circuit. By targeting pulse parameters directly, this method reduces the impact of various noise sources, improving algorithm resilience in quantum circuits. To demonstrate the effectiveness of our methodology, we apply our protocol to five key quantum algorithms, including Bernstein-Vazirani, DeutschJozsa, Grover's search, Quantum Fourier Transform (QFT), and its inverse (IQFT). Experimental results show that our pulse-level optimization strategy provides a flexible and efficient solution for increasing fidelity during the noisy execution of quantum circuits. Our work contributes to advance error mitigation techniques, essential for robust quantum computing, which will increasingly require HPC infrastructure as quantum systems scale.
In recent years, quantum computing has shown promise in solving certain problems more efficiently than classical methods. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a leading candidate for achieving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. This study explores the application of QAOA to the Maximum Weighted Independent Set (MWIS) problem, with particular focus on circuit transpilation strategies and parameter optimization methods. Using IBM Qiskit, we systematically examine factors affecting QAOA performance, including different transpilation optimization levels and classical optimizer selection. Our results demonstrate that optimization level 3 reduced circuit depth by 32% compared to level 0 for p=3 circuits, while maintaining solution quality. Among classical optimizers, COBYLA achieved an 81.24% approximation ratio with only 54.8 function evaluations at p=2, outperforming both grid search and SPSA methods. Execution on IBM’s real quantum hardware resulted in performance degradation ranging from 16% at p=1 to 34% at p=3 compared to ideal simulations, highlighting the compounding impact of noise and gate errors as circuit depth increases.These findings provide practical guidance for quantum algorithm implementation on NISQ devices, demonstrating that appropriate selection of transpilation techniques and optimization methods can substantially improve quantum resource efficiency while maintaining solution quality.