Quantum Circuit Transformation: A Monte Carlo Tree Search Framework

Zhou, Xiangzhen, Feng, Yuan, Li, Sanjiang · 2022 · ACM Transactions on Design Automation of Electronic Systems

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

摘要

摘要保留原文（英文）

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

2022 · ACM Transactions on Design Automation of Electronic Systems In Noisy Intermediate-Scale Quantum (NISQ) era, quantum processing units (QPUs) suffer from, among others, highly limited connectivity between physical qubits. To make a quantum circuit effectively executable, a circuit transformation process is necessary to transform it, with overhead cost the smaller the better, into a functionally equivalent one so that the connectivity constraints imposed by the QPU are satisfied. While several algorithms have been proposed for this goal, the overhead costs are often very high, which degenerates the fidelity of the obtained circuits sharply. One major reason for this lies in that, due to the high branching factor and vast search space, almost all these algorithms only search very shallowly and thus, very often, only (at most) locally optimal solutions can be reached. In this paper, we propose a Monte Carlo Tree Search (MCTS) framework to tackle the circuit transformation problem, which enables the search process to go much deeper. The general framework supports implementations aiming to reduce either the size or depth of the output circuit through introducing SWAP or remote CNOT gates. The algorithms, called MCTS-Size and MCTS-Depth, are polynomial in all relevant parameters. Empirical results on extensive realistic circuits and IBM Q Tokyo show that the MCTS-based algorithms can reduce the size (depth, resp.) overhead by, on average, 66% (84%, resp.) when compared with tket, an industrial level compiler.

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

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