arXiv AI

Who Earns the Safety? Intervention-Aware Quantum Predictive Control with Safety Attribution

arXiv:2606. 09778v1 Announce Type: cross Abstract: Hard safety filters are increasingly placed downstream of learned controllers to guarantee constraint satisfaction at run time.

arXiv AI
Sep 17

APGEM: Adaptive Policy-Guided Error Mitigation for Quantum Reinforcement Learning on a Real-World CVRP Case Study

The paper introduces APGEM, an adaptive controller that dynamically selects among four error‑mitigation techniques—Zero‑Noise Extrapolation, Probabilistic Error Cancellation, Clifford Data Regression, and Readout Error Mitigation—based on a utility function and Q‑learning scores. Applied to a realistic Delhi‑based Capacitated Vehicle Routing Problem, the adaptive approach improves the quantum reinforcement learning agent’s approximation ratios from 0.84‑0.87 to 0.92‑0.94 under high noise, outperforming constructive heuristics and approaching metaheuristics. The controller’s strategy shifts from a Clifford‑data‑regression‑heavy regime early in training to a balanced use of all techniques as training progresses, demonstrating regime‑dependent selection.

By Shabir Ahmad Sofi, Bisma Majid, Mir Mohammad Yousuf
arXiv AI
Aug 3

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

arXiv:2607. 29491v1 Announce Type: cross Abstract: Reinforcement-learning-based quantum architecture search (RL-QAS) repeatedly optimizes a variational quantum eigensolver (VQE) after extending a circuit, although circuit construction and action legality are deterministic and known.

By Jiayang Niu, Yan Wang, Jie Li, Ke Deng, Azadeh Alavi, Muhammad Usman, Yongli Ren
arXiv Machine Learning
1d ago

Context-Aware Error Mitigation Orchestration for Hybrid Quantum Reinforcement Learning on NISQ Systems

The paper introduces Adaptive Policy-Guided Error Mitigation (APGEM), a context-aware layer that dynamically selects error mitigation strategies—such as ZNE, PEC, CDR, and REM—during quantum reinforcement learning (QRL) training on NISQ devices. APGEM uses policy-level indicators (quantum-state fidelity, policy entropy, cumulative reward, and approximation ratio) to choose the most suitable mitigation method and integrates it directly into the reinforcement learning loop. Evaluated on the Capacitated Vehicle Routing Problem under various NISQ noise models, APGEM outperforms static mitigation techniques, achieving about 94% of an oracle strategy’s utility, maintaining higher fidelity as noise increases, and producing more stable learning behavior.

By Bisma Majid, Shabir Ahmed Sofi, Mir Mohammad Yousuf
arXiv Machine Learning
Sep 17

QEMScore: How Much Does the Measurement Add to Learned Quantum Error Mitigation?

The paper introduces QEMScore, a metric that compares learned quantum error mitigators to capacity‑matched controls that do not use measurement data. Using simulated circuits with exact ideal answers, the study finds that many mitigators gain little from measurement inputs, with a plain polynomial model often outperforming them. On real hardware data, however, measurement inputs can provide predictive benefits, highlighting that performance depends on representation and protocol specifics.

By Yue Zhao, Huayue Gu, Yushun Dong, Xiyang Hu
arXiv AI
Jul 22

Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions

arXiv:2509. 08654v2 Announce Type: replace-cross Abstract: Quantum network routing requires online decisions under probabilistic entanglement generation, finite quantum memories, decoherence, imperfect operations, and classical feedback, while the controller has incomplete knowledge of the physical state.

By Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Mazen Hasna
arXiv Machine Learning
Aug 19

Dynamic Entanglement-Weighted Pruning for Quantum Federated Unlearning in Supply-Chain Risk Prediction

The paper proposes Entanglement-Weighted Pruning (EWP), a method for unlearning a client’s contribution from a federated quantum classifier without retraining from scratch. EWP scores each trainable circuit parameter by combining a Fisher‑information estimate on the target client’s data with a structural entanglement weight, pruning the lowest‑scoring parameters and optionally fine‑tuning the remaining ones. Experiments on a four‑qubit data‑re‑uploading ansatz trained with FedAvg across five simulated supply‑chain‑risk clients show that EWP achieves accuracy comparable to full retraining while reducing forgetting and wall‑clock time by about sixteenfold, outperforming random, Fisher‑only, or entanglement‑only pruning.

By Aditya Kumar, Sumit Chongder