Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order

• HATTORI Wakaki

  Graduate School of Information Science and Engineering, Ritsumeikan University

• YAMASHITA Shigeru

  College of Information Science and Engineering, Ritsumeikan University

Abstract

This paper proposes a new approach to optimize the number of necessary SWAP gates when we perform a quantum circuit on a two-dimensional (2D) NNA. Our new idea is to change the order of quantum gates (if possible) so that each sub-circuit has only gates performing on adjacent qubits. For each sub-circuit, we utilize a SAT solver to find the best qubit placement such that the sub-circuit has only gates on adjacent qubits. Each sub-circuit may have a different qubit placement such that we do not need SWAP gates for the sub-circuit. Thus, we insert SWAP gates between two sub-circuits to change the qubit placement which is desirable for the following sub-circuit. To reduce the number of such SWAP gates between two sub-circuits, we utilize A* algorithm.

Journal

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E102.D (11), 2127-2134, 2019-11-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• Nearest Neighbor Architecture (NNA)
• gate order

Details

• CRID: 1390845702310831232
• NII Article ID: 130007740443
• DOI: 10.1587/transinf.2018edp7439
• ISSN: 17451361
• ISSN: 09168532
• Web Site: https://www.jstage.jst.go.jp/article/transinf/E102.D/11/E102.D_2018EDP7439/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed