Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations

Taegun An; Hoon Ryu; Changhee Joo

doi:10.1109/ICUFN49451.2021.9528550

Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations

Taegun An, Hoon Ryu, Changhee Joo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	ICUFN 2021 - 2021 12th International Conference on Ubiquitous and Future Networks
Publisher	IEEE Computer Society
Pages	213-215
Number of pages	3
ISBN (Electronic)	9781728164762
DOIs	https://doi.org/10.1109/ICUFN49451.2021.9528550
Publication status	Published - 2021 Aug 17
Event	12th International Conference on Ubiquitous and Future Networks, ICUFN 2021 - Virtual, Jeju Island, Korea, Republic of Duration: 2021 Aug 17 → 2021 Aug 20

Publication series

Name	International Conference on Ubiquitous and Future Networks, ICUFN
Volume	2021-August
ISSN (Print)	2165-8528
ISSN (Electronic)	2165-8536

Conference

Conference	12th International Conference on Ubiquitous and Future Networks, ICUFN 2021
Country/Territory	Korea, Republic of
City	Virtual, Jeju Island
Period	21/8/17 → 21/8/20

Bibliographical note

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.

ASJC Scopus subject areas

Computer Networks and Communications
Computer Science Applications
Hardware and Architecture

Access to Document

10.1109/ICUFN49451.2021.9528550

Cite this

Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations. / An, Taegun; Ryu, Hoon; Joo, Changhee.
ICUFN 2021 - 2021 12th International Conference on Ubiquitous and Future Networks. IEEE Computer Society, 2021. p. 213-215 (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2021-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

An, T, Ryu, H & Joo, C 2021, Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations. in ICUFN 2021 - 2021 12th International Conference on Ubiquitous and Future Networks. International Conference on Ubiquitous and Future Networks, ICUFN, vol. 2021-August, IEEE Computer Society, pp. 213-215, 12th International Conference on Ubiquitous and Future Networks, ICUFN 2021, Virtual, Jeju Island, Korea, Republic of, 21/8/17. https://doi.org/10.1109/ICUFN49451.2021.9528550

@inproceedings{0af806ce2ace433d892a4d9f4c3c9139,

title = "Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations",

abstract = "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. ",

author = "Taegun An and Hoon Ryu and Changhee Joo",

note = "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: {\textcopyright} 2021 IEEE.; 12th International Conference on Ubiquitous and Future Networks, ICUFN 2021 ; Conference date: 17-08-2021 Through 20-08-2021",

year = "2021",

month = aug,

day = "17",

doi = "10.1109/ICUFN49451.2021.9528550",

language = "English",

series = "International Conference on Ubiquitous and Future Networks, ICUFN",

publisher = "IEEE Computer Society",

pages = "213--215",

booktitle = "ICUFN 2021 - 2021 12th International Conference on Ubiquitous and Future Networks",

}

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 -

Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this