Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2511.18079v1
• Date: Sat, 22 Nov 2025 14:27:55 GMT
• Title: Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning
• Authors: Atiye Zeynali, Zahra Bakhshi,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 0.023$, representing a statistically significant 49.3\% improvement over state-of-the-art QUBO methods ($0.618 \pm 0.031$, $t_{98} = 4.87$, $p = 0.0023$, Cohen's $d = 2.34$). Inter-chip communication overhead reduces by 79.8\%, decreasing from 2.34 operations per circuit to 0.47. The DNA network maintains noise prediction accuracy with coefficient of determination $R^2 = 0.912$ and mean absolute error of 0.87\%, enabling proactive compensation for hardware fluctuations. Scalability analysis confirms sustained performance across 20-100 qubit systems, with fidelity remaining above 0.87 even at maximum scale where competing methods degrade below 0.60. Training convergence occurs 8.2$\times$ faster than baseline approaches, completing in 45 minutes versus 370 minutes for QUBO optimization. Very large effect sizes validate practical significance for near-term noisy intermediate-scale quantum computing applications.

Related papers

• 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)
• A Neural-Guided Variational Quantum Algorithm for Efficient Sign Structure Learning in Hybrid Architectures [11.258303973058377]
  Variational quantum algorithms hold great promise for unlocking the power of near-term quantum processors.<n>Here, we introduce sVQNHE, a neural-guided variational quantum algorithm that decouples amplitude and sign learning across classical and quantum modules.<n>This hybrid quantum-classical synergy not only reduces measurement costs but also achieves high expressivity with limited quantum resources.
  arXiv  Detail & Related papers  (2025-07-10T08:54:49Z)
• Unified evolutionary optimization for high-fidelity spin qubit operations [0.0]
  We develop a unified global optimization-driven automated calibration routine on a six dot semiconductor quantum processor.<n>We optimize readout, shuttling and single-qubit quantum gates by tailoring task-specific cost functions and tuning parameters based on the underlying physics of each operation.<n>The flexibility of our gradient-free closed loop algorithmic procedure allows for seamless application across diverse qubit functionalities.
  arXiv  Detail & Related papers  (2025-03-15T20:49:34Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping [2.6447353939786296]
  Noise-Directed Remapping (NDAR) is a algorithm for approximately solving binary optimization problems by leveraging certain types of noise.<n>We consider access to a noisy quantum processor with dynamics that features a global attractor state.<n>Our algorithm bootstraps the noise attractor state by iteratively gauge-transforming the cost-function Hamiltonian in a way that transforms the noise attractor into higher-quality solutions.
  arXiv  Detail & Related papers  (2024-04-01T18:28:57Z)
• Performing Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid [0.0]
  We numerically simulate the execution of the distributed phase estimation algorithm in a proposed novel superconducting-resonator-atom hybrid system. An entangling gate between two qubits is utilised in the distributed phase estimation algorithm, called an E2 gate. The GRAPE algorithm showed very accurate engineering of Rydberg atom single and multi-qubit gates with fidelities higher than 90%.
  arXiv  Detail & Related papers  (2024-02-22T16:11:48Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Toward Consistent High-fidelity Quantum Learning on Unstable Devices via Efficient In-situ Calibration [5.0854551390284]
  In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. In this paper, we propose a novel quantum pulse-based noise adaptation framework, namely QuPAD. Experiments show that the runtime on quantum devices of QuPAD with 8-10 qubits is less than 15 minutes, which is up to 270x faster than the parameter-shift approach.
  arXiv  Detail & Related papers  (2023-09-12T15:39:06Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits [0.0]
  We embed 1-layer QAOA circuits into the larger class of parameterized Instantaneous Quantum Polynomial circuits. The use of analytic expressions to find optimal parameters makes our protocol robust against barren plateaus and hardware noise. Our protocol outperforms 1-layer QAOA on the recently released Quantinuum H2 trapped-ion quantum hardware and emulator.
  arXiv  Detail & Related papers  (2022-10-11T15:16:44Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.