Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices

Li, Gushu, Ding, Yufei, Xie, Yuan · 2019 · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems

| 编号 NA101 | 主题 线路综合与等价验证 | DOI 10.1145/3297858.3304023 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

2019 · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems Due to little consideration in the hardware constraints, e.g., limited connections between physical qubits to enable two-qubit gates, most quantum algorithms cannot be directly executed on the Noisy Intermediate-Scale Quantum (NISQ) devices. Dynamically remapping logical qubits to physical qubits in the compiler is needed to enable the two-qubit gates in the algorithm, which introduces additional operations and inevitably reduces the fidelity of the algorithm. Previous solutions in finding such remapping suffer from high complexity, poor initial mapping quality, and limited flexibility and controllability. To address these drawbacks mentioned above, this paper proposes a SWAP-based BidiREctional heuristic search algorithm SABRE, which is applicable to NISQ devices with arbitrary connections between qubits. By optimizing every search attempt,globally optimizing the initial mapping using a novel reverse traversal technique, introducing the decay effect to enable the trade-off between the depth and the number of gates of the entire algorithm, SABRE outperforms the best known algorithm with exponential speedup and comparable or better results on various benchmarks.

全文共 13 页；文本提取件位于 .extracted/papers/NA101.txt（不随站点发布）。

本站词条在引用该文献时，会以 wikilink（sources/NA101）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。