QAP-Router models qubit routing as dynamic QAP and applies RL with a solution-aware Transformer to cut CNOT counts by 12-30% versus industry compilers on real circuit benchmarks.
On the qubit routing problem
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
years
2026 7representative citing papers
HBR decomposition quantifies per-phase fidelity loss in quantum compilers, revealing that routing causes up to 60% loss in search circuits while synthesis dominates Hamiltonian simulation, and correctly predicts SDK rankings on both simulation and real hardware.
Spectral qudit buses enable swap-free, congestion-free routing of nonlocal gates with 2L+1 primitives instead of 3L for path length L, plus support for Boolean fan-in.
Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.
Position graph abstraction with memoized SABRE heuristics scales qubit mapping and routing for TI-QCCD architectures by caching repeated evaluations without altering decisions.
A three-metric framework (SIS, OIS, IGS) detects anomalies in quantum circuits more reliably than structural checks alone, as shown by controlled injections where high structural similarity still misses most behavioral deviations.
Sparse qubit connectivity raises compiled depth in noisy IQP circuits, requiring lower effective noise to remain outside the classically simulatable regime compared to fully connected layouts.
citing papers explorer
-
Qubit Routing for (Almost) Free
Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.