Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning
Atiye Zeynali, Zahra Bakhshi

TL;DR
DeepQMap employs deep reinforcement learning with noise adaptation to optimize quantum circuit mapping in multi-chip NISQ systems, significantly improving fidelity and reducing communication overhead.
Contribution
This work introduces a novel deep reinforcement learning framework that dynamically adapts to hardware noise, outperforming static QUBO-based methods in quantum circuit mapping.
Findings
Achieves 49.3% higher circuit fidelity than state-of-the-art methods.
Reduces inter-chip communication overhead by 79.8%.
Maintains high performance across 20-100 qubit systems.
Abstract
The transition from monolithic to distributed multi-chip quantum architectures has fundamentally altered the circuit compilation landscape, introducing challenges in managing temporal noise variations and minimizing expensive inter-chip operations. We present DeepQMap, a deep reinforcement learning framework that integrates a bidirectional Long Short-Term Memory based Dynamic Noise Adaptation (DNA) network with multi-head attention mechanisms and Rainbow DQN architecture. Unlike conventional static optimization approaches such as QUBO formulations, our method continuously adapts to hardware dynamics through learned temporal representations of quantum system behavior. Comprehensive evaluation across 270 benchmark circuits spanning Quantum Fourier Transform, Grover's algorithm, and Variational Quantum Eigensolver demonstrates that DeepQMap achieves mean circuit fidelity of $0.920 \pm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
