Jul 2026· 2026 IEEE International Conference on Quantum Software (QSW)· pp. 89-94· 0 citations· 13 references
Abstract
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.
It is demonstrated that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types, and it is found that MPS efficiency depends sensitively on implementation choices.
A. Orioli, Chen Zhao, G. Masella et al.· 2 citations
Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that estimates an effective layer polarization by applying identical random circuits to two disjoint quantum registers and measuring the overlap between their output states as a function of circuit depth, is introduced.
Travis Hurant, A. Vezvaee, Swarnadeep Majumder et al.· 0 citations
A modular implementation in Qiskit that supports non-binary alphabets and incorporates several key enhancements, including a deterministic BBHT-inspired Grover search, domain expansion via ancillary qubits to stabilize amplitude amplification, and circuit-level optimizations that reduce overhead are developed.
R. Cantone, G. Falci, Simone Faro et al.· IEEE International Symposium...· 0 citations
FlatDD is presented, a parallel QCS that capitalizes on the strength of both DD- and array-based approaches and enhances the simulation performance for deep circuits, and introduces a gate-fusion algorithm to reduce the computational cost.
Shui Jiang, Heng-Rui Chen, Rong-Liang Fu et al.· ACM Transactions on Quantum...· 1 citation
This work establishes a quantitative, structure-aware framework for assessing circuit-level noise sensitivity and offers actionable insights for algorithm selection in the noisy intermediate-scale quantum era.
Quantum computing has the potential to accelerate various fields by solving specific problems significantly faster than classical computers. Solving more complex problems generally requires a larger number of qubits. However, current quantum devices are constrained by limited qubit counts and environmental noise. Quant...
Po-Hsuan Huang, Chun-Yen Tai, Chia-Heng Tu et al.· ACM Transactions on Design A...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.