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.
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
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
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.
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· arXiv.org· 0 citations
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.
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· Computers, Materials & C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.