Skip to content
Preprint

RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis

Jul 2026 · 0 citations · 66 references
Physics

TL;DR

RubriQ is introduced, a scalable framework that formulates circuit synthesis as a large language model (LLM) code-generation task, optimized via group relative policy optimization (GRPO), which establishes an automated, high-performance computing (HPC)-driven pipeline for generating hardware-ready, fault-tolerant quantum circuits at scale.

Abstract

Designing fault-tolerant quantum circuits that are both algorithmically correct and hardware compatible remains a major bottleneck in the transition to scalable quantum computing. We introduce RubriQ, a scalable framework that formulates circuit synthesis as a large language model (LLM) code-generation task, optimized via group relative policy optimization (GRPO). Unlike conventional black-box neural critics, RubriQ employs a domain-grounded programmatic rubric as the reinforcement learning reward function, evaluating circuits for T-gate reduction, hardware topology compliance, and unitary fidelity. To support high-throughput training, RubriQ integrates GPU-accelerated CUDA-Q simulation directly into the reinforcement learning (RL) loop and is deployed on NERSC Perlmutter using DeepSpeed ZeRO2 across multinode NVIDIA A100 clusters. On benchmark tasks, RubriQ achieves a mean T-gate compression of 3.31x, significantly outperforming sparse-reward RL baselines (2.05x), converging 2-3x faster, and maintaining less than 1\% hardware-constraint violations. Validated on IBM and IonQ quantum processors, RubriQ establishes an automated, high-performance computing (HPC)-driven pipeline for generating hardware-ready, fault-tolerant quantum circuits at scale.

View source

Similar papers

Preprint Aug 2026

Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation

An architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process (MDP), where compiler-level communication actions dynamically update logical-qubit placement and enable subsequent gate execution.

Chien-Tung Kuo, Felix Burt, Samuel Yen-Chi Chen et al. · 1 citation
Preprint Aug 2026

Quantum circuit optimization using deep reinforcement learning: Applications across multiple gate sets

A reinforcement learning framework that embeds a deterministic Commutation-and-Reduction (CR) algorithm directly into the training environment, enabling the agent to focus its learning capacity on the non-trivial optimizations where reinforcement learning adds real value.

Khoa Dang Tao, Sumin Jin, M. Raza et al. · 0 citations
#machine learning Preprint Jul 2026

DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search

These results establish a world-model design for QAS whose value lies in decision-useful feedback rather than exact energy prediction, and establish a world-model design for QAS whose value lies in decision-useful feedback rather than exact energy prediction.

Jiayang Niu, Yan Wang, Jie Li et al. · 0 citations
Jul 2026

When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis

The contrast between settings is the central finding: when approximate outputs can be rescued by post-processing, the transformer succeeds; when exact discrete correctness is required, autoregressive drift limits reliability, with both inference-time search and data scaling as effective levers while training-side fine-...

Mehdi Saeedi, E. Richter, P. Hartke · 0 citations
Open access Jul 2026

From circuits to hardware: benchmarking standard and qubit-efficient quantum optimization on real hardware

A hardware-aware benchmark of gate-based quantum optimization across four NP-hard problems: the multi-dimensional knapsack problem (MDKP), maximum independent set (MIS), quadratic assignment problem (QAP), and market-share problem, spanning variational methods and qubit-efficient encodings.

Monit Sharma, Hoong Chuin Lau · 2 citations
Open access 2026

Quantum-Inspired Optimization with Hamming-Distance Reinforcement for Hypercube-Encoded Reversible Circuit Synthesis

A novel hypercube-encoded quantum-inspired optimization framework is proposed to formulate the synthesis task as a trajectory-finding process, offering an effective, low-cost, and highly scalable avenue for reversible circuit synthesis.

Yu-Chi Jiang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.