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

Predictive Quantum Circuit Preparation: Forecasting Future Quantum Workloads and Proactively Preparing Quantum Computational Resources

Jincheng Zhang

Published Nov 7, 2026• 0 citations
Publisher

Abstract

The increasing development of quantum computing has introduced new computational challenges involving quantum circuit compilation, hardware-specific qubit mapping, gate decomposition, routing optimization, and the adaptation of quantum programs to changing quantum processor conditions. Although modern quantum computing platforms provide increasingly sophisticated compilation and execution services, the preparation of quantum circuits remains a potentially significant source of computational overhead. Conventional quantum computing workflows generally initiate circuit analysis, compilation, hardware mapping, and execution preparation after a user submits a computational task. Consequently, when multiple users submit related or structurally similar quantum workloads, certain preparation operations may be repeatedly performed even when their future requirements could potentially have been anticipated. This paper introduces Predictive Quantum Circuit Preparation (PQCP), a conceptual framework that investigates whether future quantum computational workloads can be forecast and their associated circuit preparation operations selectively completed before actual execution requests arrive. The proposed framework integrates quantum workload forecasting, future circuit structure prediction, circuit-family identification, proactive circuit analysis, hardware-aware gate decomposition, predictive qubit mapping, routing preparation, calibration-aware compatibility verification, and adaptive preparation scheduling. Rather than predicting quantum measurement outcomes or assuming that future quantum states can be generated in advance, PQCP focuses on preparing reusable classical representations and execution configurations associated with anticipated quantum circuits. Its architecture distinguishes between reusable circuit-independent preparation, circuit-structure-dependent compilation, hardware-specific execution preparation, and time-sensitive calibration-dependent optimization. A unified optimization formulation is developed to estimate the expected benefits of advance preparation while accounting for prediction uncertainty, compilation expenditure, hardware compatibility, calibration changes, memory requirements, preparation deadlines, and the probability of future workload reuse. The framework further investigates whether preparation during periods of relatively low computational demand can reduce post-submission preparation latency and improve quantum computing service throughput without interfering with currently executing tasks. An experimental methodology is established to evaluate circuit compilation time, qubit mapping time, routing overhead, circuit depth, gate count, preparation reuse rate, hardware compatibility, execution fidelity, and total computational expenditure. Particular attention is given to the distinction between reducing classical circuit preparation time and improving the physical execution quality of quantum circuits. The proposed framework does not assume that advance preparation is universally beneficial, since quantum hardware conditions may change and speculative preparation may produce unused or outdated results. Instead, it establishes a research foundation for determining when predicted quantum workloads provide sufficient opportunities for proactive preparation and when prepared computational resources remain valid for subsequent execution. By extending predictive computing into quantum circuit compilation and hardware adaptation, this research investigates a transition from exclusively reactive quantum task preparation toward predictive quantum computational preparation. Its practical effectiveness remains subject to empirical validation.

DOI
10.5281/zenodo.24029115

Related papers

Predictive Resource Allocation in Quantum Operating Systems Using Static Circuit Analysis

Tunjay Akbarli

This paper introduces a lightweight predictive resource allocation framework for Quantum Operating Systems in cloud quantum computing. Current platforms often run user-submitted circuits serially on Quantum Processing Units (QPUs), leaving many qubits idle even when smaller circuits could execute in parallel on disjoint partitions. The proposed approach performs static analysis on the transpiled circuit at submission time, extracting three key metrics: qubit count (n), circuit depth (d), and total gate count (g). These metrics enable accurate estimation of each job’s resource needs and predicted execution time without runtime profiling. The framework combines two scheduling strategies: Resource-Aware FCFS (RA-FCFS) with crosstalk-aware bin-packing, which packs compatible circuits into idle qubit fragments while enforcing a minimum separation constraint (δ_sep = 2 edges on heavy-hex topologies) to control ZZ crosstalk and preserve fidelity. Quantum Highest Response Ratio Next (Q-HRRN), a priority policy that prevents starvation of long/deep circuits while maintaining fast response for short jobs. Discrete-event simulations on 27-qubit to 127-qubit heavy-hex devices using VQE, QAOA, and QFT workloads show significant gains: qubit utilization rises from 31–38% (serial baseline) to 79–87%, and average wait times decrease by 1.8× to 3.4×. The crosstalk guard limits additional error-budget to only 3.1%. This low-overhead solution requires no hardware changes and offers a practical path to improve efficiency in NISQ-era quantum cloud services.

•Apr 15, 2026•0 citations

Self-Adaptive Quantum Circuits for NISQ Devices

PROF.JABEEN TAJ MK

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.

JOURNAL OF ADVANCE AND FUTURE RESEARCH•Aug 1, 2026•0 citations

Adaptive Quantum Circuit Compilation for Hardware-Aware Optimization

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.

•Sep 3, 2026•0 citations

Design Automation of Quantum Circuits for Engineering Systems: Gate Optimization and Noise-Aware Compilation in NISQ-Aware Hardware

Erim Engin

The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.

Next generation.•Nov 13, 2025•0 citations

Prioritization of Compiled Quantum Circuits for Different Quantum Computers

Marie Salm, Johanna Barzen, Frank Leymann +1 more

Quantum computers can solve certain problems faster than classical computers. The number of quantum computers offered via the cloud increases such that a variety is accessible for the public. However, current quantum computers still suffer from a small number of qubits and high error rates. Selecting a quantum computer providing enough qubits and low error rates is tremendously important to receive stable execution results for a given quantum circuit. The execution results are also influenced by the compilation result of the selected quantum compiler for hardware mapping and optimization. For computing time, the access is regulated by vendors of quantum computers resulting in waiting times for the user. Thus, a deep and manifold analysis of quantum computers and compiled circuits of different quantum compilers is required to estimate in advance which compiled circuit will return stable execution results also in consideration of non-functional requirements such as waiting times. To address this, we present a framework that analyzes and prioritizes compiled circuits for different quantum computers using several compilers based on the requirements of the user. We show the practical feasibility of our framework by a prototype and two use cases.

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)•Mar 1, 2022•19 citations

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
The increasing development of quantum computing has introduced new computational challenges involving quantum circuit compilation, hardware-specific qubit mapping, gate decomposition, routing optimization, and the adaptation of quantum programs to changing quantum processor conditions. Although modern quantum computing platforms provide increasingly sophisticated compilation and execution services, the preparation of quantum circuits remains a potentially significant source of computational overhead. Conventional quantum computing workflows generally initiate circuit analysis, compilation, hardware mapping, and execution preparation after a user submits a computational task. Consequently, when multiple users submit related or structurally similar quantum workloads, certain preparation operations may be repeatedly performed even when their future requirements could potentially have been anticipated. This paper introduces Predictive Quantum Circuit Preparation (PQCP), a conceptual framework that investigates whether future quantum computational workloads can be forecast and their associated circuit preparation operations selectively completed before actual execution requests arrive. The proposed framework integrates quantum workload forecasting, future circuit structure prediction, circuit-family identification, proactive circuit analysis, hardware-aware gate decomposition, predictive qubit mapping, routing preparation, calibration-aware compatibility verification, and adaptive preparation scheduling. Rather than predicting quantum measurement outcomes or assuming that future quantum states can be generated in advance, PQCP focuses on preparing reusable classical representations and execution configurations associated with anticipated quantum circuits. Its architecture distinguishes between reusable circuit-independent preparation, circuit-structure-dependent compilation, hardware-specific execution preparation, and time-sensitive calibration-dependent optimization. A unified optimization formulation is developed to estimate the expected benefits of advance preparation while accounting for prediction uncertainty, compilation expenditure, hardware compatibility, calibration changes, memory requirements, preparation deadlines, and the probability of future workload reuse. The framework further investigates whether preparation during periods of relatively low computational demand can reduce post-submission preparation latency and improve quantum computing service throughput without interfering with currently executing tasks. An experimental methodology is established to evaluate circuit compilation time, qubit mapping time, routing overhead, circuit depth, gate count, preparation reuse rate, hardware compatibility, execution fidelity, and total computational expenditure. Particular attention is given to the distinction between reducing classical circuit preparation time and improving the physical execution quality of quantum circuits. The proposed framework does not assume that advance preparation is universally beneficial, since quantum hardware conditions may change and speculative preparation may produce unused or outdated results. Instead, it establishes a research foundation for determining when predicted quantum workloads provide sufficient opportunities for proactive preparation and when prepared computational resources remain valid for subsequent execution. By extending predictive computing into quantum circuit compilation and hardware adaptation, this research investigates a transition from exclusively reactive quantum task preparation toward predictive quantum computational preparation. Its practical effectiveness remains subject to empirical validation.
This paper introduces a lightweight predictive resource allocation framework for Quantum Operating Systems in cloud quantum computing. Current platforms often run user-submitted circuits serially on Quantum Processing Units (QPUs), leaving many qubits idle even when smaller circuits could execute in parallel on disjoint partitions. The proposed approach performs static analysis on the transpiled circuit at submission time, extracting three key metrics: qubit count (n), circuit depth (d), and total gate count (g). These metrics enable accurate estimation of each job’s resource needs and predicted execution time without runtime profiling. The framework combines two scheduling strategies: Resource-Aware FCFS (RA-FCFS) with crosstalk-aware bin-packing, which packs compatible circuits into idle qubit fragments while enforcing a minimum separation constraint (δ_sep = 2 edges on heavy-hex topologies) to control ZZ crosstalk and preserve fidelity. Quantum Highest Response Ratio Next (Q-HRRN), a priority policy that prevents starvation of long/deep circuits while maintaining fast response for short jobs. Discrete-event simulations on 27-qubit to 127-qubit heavy-hex devices using VQE, QAOA, and QFT workloads show significant gains: qubit utilization rises from 31–38% (serial baseline) to 79–87%, and average wait times decrease by 1.8× to 3.4×. The crosstalk guard limits additional error-budget to only 3.1%. This low-overhead solution requires no hardware changes and offers a practical path to improve efficiency in NISQ-era quantum cloud services.
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.
Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.
Quantum computers can solve certain problems faster than classical computers. The number of quantum computers offered via the cloud increases such that a variety is accessible for the public. However, current quantum computers still suffer from a small number of qubits and high error rates. Selecting a quantum computer providing enough qubits and low error rates is tremendously important to receive stable execution results for a given quantum circuit. The execution results are also influenced by the compilation result of the selected quantum compiler for hardware mapping and optimization. For computing time, the access is regulated by vendors of quantum computers resulting in waiting times for the user. Thus, a deep and manifold analysis of quantum computers and compiled circuits of different quantum compilers is required to estimate in advance which compiled circuit will return stable execution results also in consideration of non-functional requirements such as waiting times. To address this, we present a framework that analyzes and prioritizes compiled circuits for different quantum computers using several compilers based on the requirements of the user. We show the practical feasibility of our framework by a prototype and two use cases.
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.