Replay-buffer engineering for noise-robust quantum circuit optimization
- URL: http://arxiv.org/abs/2604.21863v1
- Date: Thu, 23 Apr 2026 16:59:40 GMT
- Title: Replay-buffer engineering for noise-robust quantum circuit optimization
- Abstract summary: We treat the replay buffer as a primary algorithmic lever for quantum optimization.<n>We introduce ReaPER$+$, an annealed replay rule that transitions from TD error-driven prioritization early in training to reliability-aware sampling as value estimates mature.<n>We also introduce OptCRLQAS which amortizes expensive evaluations over multiple architectural edits, cutting wall-clock time per episode by up to $67.5%$ on a 12-qubit optimization problem without degrading solution quality.
- Score: 2.816047365212878
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Deep reinforcement learning (RL) for quantum circuit optimization faces three fundamental bottlenecks: replay buffers that ignore the reliability of temporal-difference (TD) targets, curriculum-based architecture search that triggers a full quantum-classical evaluation at every environment step, and the routine discard of noiseless trajectories when retraining under hardware noise. We address all three by treating the replay buffer as a primary algorithmic lever for quantum optimization. We introduce ReaPER$+$, an annealed replay rule that transitions from TD error-driven prioritization early in training to reliability-aware sampling as value estimates mature, achieving $4-32\times$ gains in sample efficiency over fixed PER, ReaPER, and uniform replay while consistently discovering more compact circuits across quantum compilation and QAS benchmarks; validation on LunarLander-v3 confirms the principle is domain-agnostic. Furthermore we eliminate the quantum-classical evaluation bottleneck in curriculum RL by introducing OptCRLQAS which amortizes expensive evaluations over multiple architectural edits, cutting wall-clock time per episode by up to $67.5\%$ on a 12-qubit optimization problem without degrading solution quality. Finally we introduce a lightweight replay-buffer transfer scheme that warm-starts noisy-setting learning by reusing noiseless trajectories, without network-weight transfer or $ε$-greedy pretraining. This reduces steps to chemical accuracy by up to $85-90\%$ and final energy error by up to $90\%$ over from-scratch baselines on 6-, 8-, and 12-qubit molecular tasks. Together, these results establish that experience storage, sampling, and transfer are decisive levers for scalable, noise-robust quantum circuit optimization.
Related papers
- Physics-Guided Linear Mapper for Quantum Error Mitigation [0.0]
We introduce a novel physics-guided linear mapper (PGLM) for quantum error mitigation.<n>The goal is to provide a data-efficient, interpretable, and low-latency alternative to the black-box machine learning for quantum error mitigation.
arXiv Detail & Related papers (2026-08-24T11:19:10Z) - Quantum circuit optimization using deep reinforcement learning: Applications across multiple gate sets [0.8166364251367626]
We propose a learning framework that embeds a deterministic Commutation-and-Reduction (CR) algorithm directly into the training environment.<n>After every agent action, the CR algorithm automatically resolves elementary commutations and cancellations.<n>We demonstrate that RL trained on smaller quantum circuits can be applied to larger quantum circuits.
arXiv Detail & Related papers (2026-08-19T16:54:17Z) - Quantum Noise Mitigation with Adaptive Zero-Noise Extrapolation: A Contextual Multi-Armed Bandits Approach [8.98664000532717]
Variational quantum circuits (VQCs) are central to near-term quantum computing, yet their practical deployment is severely hindered by noise.<n>Our work introduces a novel adaptive noise mitigation framework for VQCs that integrates zero-noise extrapolation (ZNE) with contextual multi-armed bandits (CMAB)<n>Unlike fixed-fold ZNE, our approach uses online adaptation to improve the accuracy of ZNE and reduce quantum circuit executions.
arXiv Detail & Related papers (2026-08-05T19:07:26Z) - Qubit-Scalable CVRP via Lagrangian Knapsack Decomposition and Noise-Aware Quantum Execution [3.652509571098291]
We present an end-to-end framework for scaling hybrid quantum CVRP optimization through OR decomposition, learning-augmented dual control, and adaptive hardware-aware execution.<n>We do not claim quantum advantage. Instead, the contribution is a practical end-to-end framework for scaling hybrid quantum CVRP optimization through OR decomposition, learning-augmented dual control, and adaptive hardware-aware execution.
arXiv Detail & Related papers (2026-04-24T03:46:25Z) - 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) - Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning [0.0]
We present DeepQMap, a deep reinforcement learning framework that integrates a bidirectional Long Short-Term Memory based Dynamic Noise Adaptation network.<n>Our method continuously adapts to hardware dynamics through learned temporal representations of quantum system behavior.<n>DeepQMap achieves mean circuit fidelity of $0.920 pm 0.023$, representing a statistically significant 49.3% improvement over state-of-the-art QUBO methods.
arXiv Detail & Related papers (2025-11-22T14:27:55Z) - CAGE: Curvature-Aware Gradient Estimation For Accurate Quantization-Aware Training [73.46600457802693]
We introduce a new method that counteracts the loss induced by quantization.<n>CAGE significantly improves upon the state-of-theart methods in terms of accuracy, for similar computational cost.<n>For QAT pre-training of Llama models, CAGE matches the accuracy achieved at 4-bits (W4A4) with the prior best method.
arXiv Detail & Related papers (2025-10-21T16:33:57Z) - End-to-End On-Device Quantization-Aware Training for LLMs at Inference Cost [53.25965863436039]
Quantization-aware training (QAT) provides a more principled solution, but its reliance on backpropagation incurs prohibitive memory costs.<n>We propose ZeroQAT, a zeroth-order optimization-based QAT framework that supports both weight and activation quantization.<n>Experiments show that ZeroQAT consistently outperforms representative PTQ and QAT baselines while requiring significantly less memory.
arXiv Detail & Related papers (2025-08-21T01:18:27Z) - Revisiting Noise-adaptive Transpilation in Quantum Computing: How Much Impact Does it Have? [2.8256522972153335]
We revisit the necessity of frequent noise-adaptive transpilation on superconducting quantum computers.<n>Noise-aware transpilation leads to a heavy concentration of workloads on a small subset of qubits.<n> circuits compiled once with calibration data can be reliably reused across multiple calibration cycles.
arXiv Detail & Related papers (2025-07-01T21:20:51Z) - TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search [2.345518191053745]
Variational quantum algorithms hold the promise to address meaningful quantum problems already on noisy intermediate-scale quantum hardware.<n>Quantum architecture search (QAS) automates the design process of quantum circuits.<n> reinforcement learning (RL) emerging as a promising approach.<n>$textitTensorRL-QAS$ is an improved framework that combines network methods with RL.
arXiv Detail & Related papers (2025-05-14T13:23:34Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Cost Explosion for Efficient Reinforcement Learning Optimisation of
Quantum Circuits [55.616364225463066]
Reinforcement Learning (RL) is a recent approach for learning strategies to optimise quantum circuits by increasing the reward of an optimisation agent.
Our goal is to improve the agent's optimization strategy, by including hints about how quantum circuits are optimized manually.
We show that allowing cost explosions offers significant advantages for RL training, such as reaching optimum circuits.
arXiv Detail & Related papers (2023-11-21T10:16:03Z) - Graph Neural Network Autoencoders for Efficient Quantum Circuit
Optimisation [69.43216268165402]
We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits.
We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states.
Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
arXiv Detail & Related papers (2023-03-06T16:51:30Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits [26.130594925642143]
Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers.
We propose and experimentally implement QuantumNAS, the first comprehensive framework for noise-adaptive co-search of variational circuit and qubit mapping.
For QML tasks, QuantumNAS is the first to demonstrate over 95% 2-class, 85% 4-class, and 32% 10-class classification accuracy on real quantum computers.
arXiv Detail & Related papers (2021-07-22T17:58:13Z)
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.