TY - GEN
T1 - Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations
AU - An, Taegun
AU - Ryu, Hoon
AU - Joo, Changhee
N1 - Funding Information:
C. Joo is the corresponding author. This work is supported in part by the NRF grant funded by the Korea government (MSIT) (No. NRF-2021R1A2C2013065)
Publisher Copyright:
© 2021 IEEE.
PY - 2021/8/17
Y1 - 2021/8/17
N2 - With recognition of quantum computer's enormous computational ability, it is of paramount importance to develop fault-tolerant quantum computing systems for their practical use. Recently, it has been shown that fault-tolerant systems can be achieved using a small set of basic quantum operations. This, however, incurs technical difficulties in finding an optimal sequence of basic operations toward a specific target computation and may limit possible quantum computations. In this work, we aim to achieve arbitrary target quantum computations under the restriction of four universal quantum gates of Pauli-X, -Y, -Z and SWAP. We develop two gate-sequence search methods based on the fidelity measure and deep neural networks. We verify the performance of our proposed methods through numerical results comparing total search space and the number of searched nodes.
AB - With recognition of quantum computer's enormous computational ability, it is of paramount importance to develop fault-tolerant quantum computing systems for their practical use. Recently, it has been shown that fault-tolerant systems can be achieved using a small set of basic quantum operations. This, however, incurs technical difficulties in finding an optimal sequence of basic operations toward a specific target computation and may limit possible quantum computations. In this work, we aim to achieve arbitrary target quantum computations under the restriction of four universal quantum gates of Pauli-X, -Y, -Z and SWAP. We develop two gate-sequence search methods based on the fidelity measure and deep neural networks. We verify the performance of our proposed methods through numerical results comparing total search space and the number of searched nodes.
UR - http://www.scopus.com/inward/record.url?scp=85115658690&partnerID=8YFLogxK
U2 - 10.1109/ICUFN49451.2021.9528550
DO - 10.1109/ICUFN49451.2021.9528550
M3 - Conference contribution
AN - SCOPUS:85115658690
T3 - International Conference on Ubiquitous and Future Networks, ICUFN
SP - 213
EP - 215
BT - ICUFN 2021 - 2021 12th International Conference on Ubiquitous and Future Networks
PB - IEEE Computer Society
T2 - 12th International Conference on Ubiquitous and Future Networks, ICUFN 2021
Y2 - 17 August 2021 through 20 August 2021
ER -