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

arXiv:2409.03725

Hardware-Assisted Parameterized Circuit Execution

Abhi Rajagopala, Akel Hashim, Neelay Fruitwala, Gang Huang, Yilun Xu, Jordan Hines, Irfan A. Siddiqi, Katherine Klymko, Kasra Nowrouzi

Published Sep 5, 2024• 7 citations
arXivHTMLPDF

Abstract

Standard compilers for quantum circuits decompose arbitrary single-qubit gates into a sequence of physical X(pi/2) pulses and virtual-Z phase gates. Consequently, many circuit classes implement different logic operations but have an equivalent structure of physical pulses that only differ by changes in virtual phases. When many structurally-equivalent circuits need to be measured, generating sequences for each circuit is unnecessary and cumbersome, since compiling and loading sequences onto classical control hardware is a primary bottleneck in quantum circuit execution. In this work, we develop a hardware-assisted protocol for executing parameterized circuits on our FPGA-based control hardware, QubiC. This protocol relies on a hardware-software co-design technique in which software identifies structural equivalency in circuits and "peels" off the relevant parameterized angles to reduce the overall waveform compilation time. The hardware architecture then performs real-time "stitching" of the parameters in the circuit to measure circuits that implement a different overall logical operation. This work demonstrates significant speed ups in the total execution time for several different classes of quantum circuits.

DOI
10.48550/arxiv.2409.03725

Related papers

Efficient Classical Processing of Constant-Depth Time Evolution Circuits in Control Hardware

Akhil Francis, Abhi Rajagopala, Norm M. Tubman +2 more

Improving quantum algorithms run-time performance involves several strategies such as reducing the quantum gate counts, decreasing the number of measurements, advancement in QPU technology for faster gate operations, or optimizing the classical processing. This work focuses on the latter, specifically reducing classical processing and compilation time via hardware-assisted parameterized circuit execution (PCE) for computing dynamical properties of quantum systems. PCE was previously validated for QCVV protocols, which leverages structural circuit equivalencies. We demonstrate the applicability of this approach to computing dynamical properties of quantum many-body systems using structurally equivalent time evolution circuits, specifically calculating correlation functions of spin models using constant-depth circuits generated via Cartan decomposition. Implementing this for spin-spin correlation functions in Transverse field XY (up to 6-sites) and Heisenberg spin models (up to 3-sites), we observed a run-time reduction of up to$\mathbf{5 0 \%}$compared to standard compilation methods. This highlights the adaptability of time-evolution circuit with hardware-assisted PCE to potentially mitigate the classical bottlenecks in near-term quantum algorithms.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Vectorizing Quantum Control: A RISC-V Vector Extension Architecture for Scalable Qubit Systems

Xiaorang Guo, Kun Qin, Yanbin Chen +2 more

The Quantum Control Processor (QCP) bridges the gap between compiler toolchains and control electronics, and is responsible for translating compiled quantum circuits into executable instructions that directly manipulate qubits and handle measurement feedback. However, existing designs rely primarily on customized instruction sets, limiting design reuse and requiring significant effort to build supporting toolchains. Furthermore, efficiently addressing qubits and scheduling operations in highly scalable scenarios remains a critical challenge. In this work, we present a vectorized quantum control approach built upon the RISC-V Vector (RVV) engine with a quantum-oriented extension. Leveraging the high parallelism of RVV, our approach can address up to 128 qubits in a single instruction. We also embed parameterized rotation information into the instruction set, enabling dynamic tuning of gate rotations in hybrid quantum-classical programs. To support mid-circuit measurements, we design a hardware-based halt-resume protocol that resumes pipeline execution within 80 $ns$ of receiving the measurement result. Comprehensive evaluation using both RISC-V toolchains and FPGA prototypes demonstrates that our design achieves up to 2.52$\times$ speedup over the baseline in program execution time, with excellent scalability.

cs.ARCross-listedarXiv:2607.07372•Jul 9, 2026•1 citation

Hardware-Efficient Randomized Compiling

Neelay Fruitwala, Akel Hashim, Abhi Rajagopala +7 more

Randomized compiling (RC) is an efficient method for tailoring arbitrary Markovian errors into stochastic Pauli channels. However, the standard procedure for implementing the protocol in software comes with a large experimental overhead -- namely, it scales linearly in the number of desired randomizations, each of which must be generated and measured independently. In this work, we introduce a hardware-efficient algorithm for performing RC on a cycle-by-cycle basis on the lowest level of our FPGA-based control hardware during the execution of a circuit. Importantly, this algorithm performs a different randomization per shot with zero runtime overhead beyond measuring a circuit without RC. We implement our algorithm using the QubiC control hardware, where we demonstrate significant reduction in the overall runtime of circuits implemented with RC, as well as a significantly lower variance in measured observables.

arXiv:2406.13967•Jun 20, 2024•12 citations

Adaptive Hardware-Software Co-Design for Quantum Computing

Jincheng Zhang

Quantum computing promises revolutionary advancements across various fields, but its practical realization hinges on overcoming significant challenges in algorithm execution. Traditional hardware-software co-design approaches for quantum computing often rely on pre-defined architectures and compilation strategies, which can be suboptimal for diverse quantum algorithms. This paper proposes an adaptive hardware-software co-design framework that dynamically adjusts the quantum computing system's configuration – encompassing both hardware architecture and software compilation – in response to the specific requirements of the algorithm being executed. The core claim is that optimized co-design is pivotal for efficient quantum algorithm execution. This framework leverages a dynamic optimization loop, continuously monitoring algorithm performance and adjusting parameters such as qubit connectivity, gate set selection, and compilation strategies. The system utilizes a mathematical model to represent the algorithm's computational demands and hardware capabilities, enabling real-time adaptation. This approach moves beyond static design methodologies, offering a pathway towards significantly improved performance and resource utilization in quantum computing systems. The framework's ability to adapt in real-time represents a crucial step towards unlocking the full potential of quantum algorithms.

•Sep 5, 2026•0 citations

No need to calibrate: characterization and compilation for high-fidelity circuit execution using imperfect gates

Ashish Kakkar, Samuel Marsh, Yulun Wang +5 more

We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and corrected in circuit compilation. Coherent contributions to the pulse unitary that would traditionally be considered sources of error are treated as part of the gate definition, and compensated in software via single-qubit rotations. This approach enables rapid device-wide generation of high-fidelity two-qubit entangling gates, which are combined with standard calibrated gates to produce an expanded gate set. We show how these gates are directly usable as part of a quantum compiler, synthesizing generic two-qubit circuit blocks into minimal-duration sequences of the characterized gates interleaved with compensating single-qubit rotations. Benchmarking against circuits compiled using the default $CX$ gate alone on 127-qubit IBM hardware shows up to 7X improvement in success probability for Quantum Fourier Transform circuits up to 26 qubits, and up to 9X lower mean-square error in Trotter simulations of the one-dimensional transverse-field Ising model. Our hardware-agnostic characterization and compilation methodology makes it practical to scale up expressive gate sets on quantum computing architectures while minimizing the need for onerous fine-tuning of low-level control waveforms.

quant-pharXiv:2511.21831•Nov 28, 2025•4 citations

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

Jincheng Zhang

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.

•Nov 7, 2026•0 citations
Standard compilers for quantum circuits decompose arbitrary single-qubit gates into a sequence of physical X(pi/2) pulses and virtual-Z phase gates. Consequently, many circuit classes implement different logic operations but have an equivalent structure of physical pulses that only differ by changes in virtual phases. When many structurally-equivalent circuits need to be measured, generating sequences for each circuit is unnecessary and cumbersome, since compiling and loading sequences onto classical control hardware is a primary bottleneck in quantum circuit execution. In this work, we develop a hardware-assisted protocol for executing parameterized circuits on our FPGA-based control hardware, QubiC. This protocol relies on a hardware-software co-design technique in which software identifies structural equivalency in circuits and "peels" off the relevant parameterized angles to reduce the overall waveform compilation time. The hardware architecture then performs real-time "stitching" of the parameters in the circuit to measure circuits that implement a different overall logical operation. This work demonstrates significant speed ups in the total execution time for several different classes of quantum circuits.
Improving quantum algorithms run-time performance involves several strategies such as reducing the quantum gate counts, decreasing the number of measurements, advancement in QPU technology for faster gate operations, or optimizing the classical processing. This work focuses on the latter, specifically reducing classical processing and compilation time via hardware-assisted parameterized circuit execution (PCE) for computing dynamical properties of quantum systems. PCE was previously validated for QCVV protocols, which leverages structural circuit equivalencies. We demonstrate the applicability of this approach to computing dynamical properties of quantum many-body systems using structurally equivalent time evolution circuits, specifically calculating correlation functions of spin models using constant-depth circuits generated via Cartan decomposition. Implementing this for spin-spin correlation functions in Transverse field XY (up to 6-sites) and Heisenberg spin models (up to 3-sites), we observed a run-time reduction of up to50%\mathbf{5 0 \%}50%compared to standard compilation methods. This highlights the adaptability of time-evolution circuit with hardware-assisted PCE to potentially mitigate the classical bottlenecks in near-term quantum algorithms.
The Quantum Control Processor (QCP) bridges the gap between compiler toolchains and control electronics, and is responsible for translating compiled quantum circuits into executable instructions that directly manipulate qubits and handle measurement feedback. However, existing designs rely primarily on customized instruction sets, limiting design reuse and requiring significant effort to build supporting toolchains. Furthermore, efficiently addressing qubits and scheduling operations in highly scalable scenarios remains a critical challenge. In this work, we present a vectorized quantum control approach built upon the RISC-V Vector (RVV) engine with a quantum-oriented extension. Leveraging the high parallelism of RVV, our approach can address up to 128 qubits in a single instruction. We also embed parameterized rotation information into the instruction set, enabling dynamic tuning of gate rotations in hybrid quantum-classical programs. To support mid-circuit measurements, we design a hardware-based halt-resume protocol that resumes pipeline execution within 80 nsnsns of receiving the measurement result. Comprehensive evaluation using both RISC-V toolchains and FPGA prototypes demonstrates that our design achieves up to 2.52×\times× speedup over the baseline in program execution time, with excellent scalability.
Randomized compiling (RC) is an efficient method for tailoring arbitrary Markovian errors into stochastic Pauli channels. However, the standard procedure for implementing the protocol in software comes with a large experimental overhead -- namely, it scales linearly in the number of desired randomizations, each of which must be generated and measured independently. In this work, we introduce a hardware-efficient algorithm for performing RC on a cycle-by-cycle basis on the lowest level of our FPGA-based control hardware during the execution of a circuit. Importantly, this algorithm performs a different randomization per shot with zero runtime overhead beyond measuring a circuit without RC. We implement our algorithm using the QubiC control hardware, where we demonstrate significant reduction in the overall runtime of circuits implemented with RC, as well as a significantly lower variance in measured observables.
Quantum computing promises revolutionary advancements across various fields, but its practical realization hinges on overcoming significant challenges in algorithm execution. Traditional hardware-software co-design approaches for quantum computing often rely on pre-defined architectures and compilation strategies, which can be suboptimal for diverse quantum algorithms. This paper proposes an adaptive hardware-software co-design framework that dynamically adjusts the quantum computing system's configuration – encompassing both hardware architecture and software compilation – in response to the specific requirements of the algorithm being executed. The core claim is that optimized co-design is pivotal for efficient quantum algorithm execution. This framework leverages a dynamic optimization loop, continuously monitoring algorithm performance and adjusting parameters such as qubit connectivity, gate set selection, and compilation strategies. The system utilizes a mathematical model to represent the algorithm's computational demands and hardware capabilities, enabling real-time adaptation. This approach moves beyond static design methodologies, offering a pathway towards significantly improved performance and resource utilization in quantum computing systems. The framework's ability to adapt in real-time represents a crucial step towards unlocking the full potential of quantum algorithms.
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and corrected in circuit compilation. Coherent contributions to the pulse unitary that would traditionally be considered sources of error are treated as part of the gate definition, and compensated in software via single-qubit rotations. This approach enables rapid device-wide generation of high-fidelity two-qubit entangling gates, which are combined with standard calibrated gates to produce an expanded gate set. We show how these gates are directly usable as part of a quantum compiler, synthesizing generic two-qubit circuit blocks into minimal-duration sequences of the characterized gates interleaved with compensating single-qubit rotations. Benchmarking against circuits compiled using the default CXCXCX gate alone on 127-qubit IBM hardware shows up to 7X improvement in success probability for Quantum Fourier Transform circuits up to 26 qubits, and up to 9X lower mean-square error in Trotter simulations of the one-dimensional transverse-field Ising model. Our hardware-agnostic characterization and compilation methodology makes it practical to scale up expressive gate sets on quantum computing architectures while minimizing the need for onerous fine-tuning of low-level control waveforms.
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.