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

Wakaki HATTORI; Shigeru YAMASHITA

doi:10.1587/transinf.2018EDP7439

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

Wakaki HATTORI, Shigeru YAMASHITA

Full Text Views

85

Cite this

Free PDF (602.4KB)

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E102-D No.11 pp.2127-2134

Publication Date: 2019/11/01

Publicized: 2019/07/25

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2018EDP7439

Type of Manuscript: PAPER

Category: Fundamentals of Information Systems

Authors

Wakaki HATTORI
Ritsumeikan University
Shigeru YAMASHITA
Ritsumeikan University

Keyword

Nearest Neighbor Architecture (NNA), gate order

Cite this

Copy

Wakaki HATTORI, Shigeru YAMASHITA, "Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order" in IEICE TRANSACTIONS on Information, vol. E102-D, no. 11, pp. 2127-2134, November 2019, doi: 10.1587/transinf.2018EDP7439.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018EDP7439/_p

Copy

@ARTICLE{e102-d_11_2127,
author={Wakaki HATTORI, Shigeru YAMASHITA, },
journal={IEICE TRANSACTIONS on Information},
title={Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order},
year={2019},
volume={E102-D},
number={11},
pages={2127-2134},
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.},
keywords={},
doi={10.1587/transinf.2018EDP7439},
ISSN={1745-1361},
month={November},}

Copy

TY - JOUR
TI - Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order
T2 - IEICE TRANSACTIONS on Information
SP - 2127
EP - 2134
AU - Wakaki HATTORI
AU - Shigeru YAMASHITA
PY - 2019
DO - 10.1587/transinf.2018EDP7439
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2019
AB - 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.
ER -