Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies

Bhattacharjee, Debjyoti, Chattopadhyay, Anupam · 2017

| 编号 NA094 | 主题 线路综合与等价验证 |

摘要

摘要保留原文（英文）

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

2017 · 预印本；未核实后续正式发表 A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongly require the interacting qubits to be arranged in a nearest neighbor (NN) fashion. The current literature on converting a given quantum circuit to an NN-arranged one mainly considered chained qubit topologies or Linear Nearest Neighbor (LNN) topology. However, practical quantum circuit realizations, such as Nuclear Magnetic Resonance (NMR), may not have an LNN topology. To address this gap, we consider an arbitrary qubit topology. We present an Integer Linear Programming (ILP) formulation for achieving minimal logical depth while guaranteeing the nearest neighbor arrangement between the interacting qubits. We substantiate our claim with studies on diverse network topologies and prominent quantum circuit benchmarks.

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

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