Wakaki Hattori
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Wakaki Hattori has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Shigeru Yamashita
Ritsumeikan University
1 shared publication- Shigeru Yamashita
College of Information Science and Engineering, Ritsumeikan University, Osaka 567-8570, Japan
1 shared publication
Latest Publications
- Open Access
- 1 November 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (11) , 2127-2134
Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order
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.
- 1 November 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (11) , 2127-2134
Open AccessMapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order
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.
- 22 August 2018
- Published by Springer Nature
- p. 228-243
Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures
- 22 August 2018
- Published by Springer Nature
- p. 228-243
Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures