The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
조회수
85
본 논문에서는 2차원 NNA에서 양자 회로를 수행할 때 필요한 SWAP 게이트 수를 최적화하는 새로운 접근 방식을 제안합니다. 우리의 새로운 아이디어는 (가능한 경우) 양자 게이트의 순서를 변경하여 각 하위 회로가 인접한 큐비트에서 작동하는 게이트만 갖도록 하는 것입니다. 각 하위 회로에 대해 SAT 솔버를 활용하여 하위 회로가 인접한 큐비트의 게이트만 갖도록 최상의 큐비트 배치를 찾습니다. 각 하위 회로는 하위 회로에 SWAP 게이트가 필요하지 않도록 서로 다른 큐비트 배치를 가질 수 있습니다. 따라서 두 하위 회로 사이에 SWAP 게이트를 삽입하여 다음 하위 회로에 바람직한 큐비트 배치를 변경합니다. 두 하위 회로 사이의 SWAP 게이트 수를 줄이기 위해 A* 알고리즘을 사용합니다.
Wakaki HATTORI
Ritsumeikan University
Shigeru YAMASHITA
Ritsumeikan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
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
부
@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},}
부
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 -