A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs

• URL: http://arxiv.org/abs/2609.01037v1
• Date: Tue, 01 Sep 2026 10:35:46 GMT
• Title: A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs
• Abstract summary: We introduce a new Intermediate Representation (IR) that elevates gates to first-class values.<n>This unified representation allows classical computation to steer quantum behaviour.<n>Case studies in noise modelling, randomised computation, error correction, and measurement-based quantum computing show that our IR expresses these programs compactly.
• Score: 0.4977315626758538
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum compilers typically follow the circuit model, representing programs as fixed sequences of gates. This static view breaks down in hybrid quantum-classical applications, where gate choices depend on runtime data or measurement results. We introduce a new Intermediate Representation (IR) that elevates gates to first-class values, enabling their dynamic creation, composition, and control. This unified representation allows classical computation to steer quantum behaviour, capturing phenomena including stochastic gate selection, adaptive error correction, and measurement-driven computation within a single framework. Case studies in noise modelling, randomised compilation, error correction, and measurement-based quantum computing show that our IR expresses these programs compactly and supports optimisations that were not possible in the circuit model. Evaluation on a benchmark suite of hybrid quantum-classical programs indicates that our IR represents programs compactly and facilitates compiler analysis and transformation.

Related papers

• Characterizing Large Scale Quantum Systems with Error Per Circuit Layer [0.23398054718043335]
  We introduce Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that estimates an effective layer polarization.<n>We derive the expected overlap decay under an ensemble-averaged depolarizing model and identify the assumptions under which the fitted decay parameter represents an effective layer polarization.<n>Experiments on IBM quantum hardware demonstrate clear EPCL decay in 8- and 16-qubit implementations.
  arXiv  Detail & Related papers  (2026-09-03T17:28:40Z)
• Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation [16.380589534840862]
  Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit.<n>This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process.
  arXiv  Detail & Related papers  (2026-08-07T07:25:18Z)
• Adaptive Fidelity Estimation for Quantum Programs with Graph-Guided Noise Awareness [30.900274564864223]
  QuFid is an adaptive and noise-aware framework that determines measurement budgets online.<n>We show that QuFid significantly reduces measurement cost compared to fixed-shot and learning-based baselines.
  arXiv  Detail & Related papers  (2026-01-21T07:04:05Z)
• Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
  Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
  arXiv  Detail & Related papers  (2026-01-11T11:17:37Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• ConQuER: Modular Architectures for Control and Bias Mitigation in IQP Quantum Generative Models [40.972673943861075]
  Quantum generative models based on instantaneous quantum (IQP) circuits show great promise in learning complex distributions.<n>Current implementations suffer from lack of controllability over generated outputs and severe generation bias towards certain expected patterns.<n>We present a Controllable Quantum Generative Framework, ConQuER, which addresses both challenges through a modular circuit architecture.
  arXiv  Detail & Related papers  (2025-09-26T16:32:41Z)
• Efficient calculation of Green's functions on quantum computers via simultaneous circuit perturbation [0.0]
  We propose a novel, ancilla-free algorithm to compute Retarded Green's Functions (RGFs) on quantum computers.<n>We benchmark the protocol on the one-dimensional Heisenberg and Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2025-05-08T18:00:03Z)
• AC/DC: Automated Compilation for Dynamic Circuits [0.41356970190072423]
  We present a novel framework for generating dynamic quantum circuits that automatically prepare any state or unitary operator.<n>We demonstrate the generation of dynamic circuits for state preparation, long-range entangling gates, circuit optimization, and the application of dynamic circuits to lattice simulations.
  arXiv  Detail & Related papers  (2024-12-10T23:14:42Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation [0.0]
  We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-09T05:10:59Z)
• Extending XACC for Quantum Optimal Control [70.19683407682642]
  Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control. We present an extension to the XACC system-level quantum-classical software framework. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
  arXiv  Detail & Related papers  (2020-06-04T13:13:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.