Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture

Ilkwon Sohn, Jeongho Bang, Jun Heo

Research output: Contribution to journalArticle

Abstract

Resource overhead problem caused by concatenation in quantum error correction (QEC) is of significant importance for the realization of fault-tolerant quantum computation (FTQC). To attack this problem, we propose a novel scheme by considering integrated FTQC architecture where the concatenation level is controlled dynamically; i.e., less (or more) concatenation levels are imposed by good (or poor) performance gates—we call this scheme “dynamic concatenation” in this sense. Such a dynamic concatenation is realizable in an integrated structure of FTQC, as the information of the concatenation can be communicated between classical system elements (e.g., compiler and system organizer) and the logical qubits in real-time. We derive the effective lower and upper bounds of the length of gate decomposition in order to achieve the practical advantage, namely of reduction of the overall operation time. By considering two non-trivial examples, it is shown that the aforementioned advantage can indeed be achieved in the presented scheme. Our result also provides an important scientific message, i.e., the interplay between “classical” and “quantum” can be helpful in QEC.

Original languageEnglish
Article number3302
JournalScientific Reports
Volume9
Issue number1
DOIs
Publication statusPublished - 2019 Dec 1

ASJC Scopus subject areas

  • General

Cite this

Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture. / Sohn, Ilkwon; Bang, Jeongho; Heo, Jun.

In: Scientific Reports, Vol. 9, No. 1, 3302, 01.12.2019.

Research output: Contribution to journalArticle

@article{675e8c6640394e5398a8e47c70748497,
title = "Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture",
abstract = "Resource overhead problem caused by concatenation in quantum error correction (QEC) is of significant importance for the realization of fault-tolerant quantum computation (FTQC). To attack this problem, we propose a novel scheme by considering integrated FTQC architecture where the concatenation level is controlled dynamically; i.e., less (or more) concatenation levels are imposed by good (or poor) performance gates—we call this scheme “dynamic concatenation” in this sense. Such a dynamic concatenation is realizable in an integrated structure of FTQC, as the information of the concatenation can be communicated between classical system elements (e.g., compiler and system organizer) and the logical qubits in real-time. We derive the effective lower and upper bounds of the length of gate decomposition in order to achieve the practical advantage, namely of reduction of the overall operation time. By considering two non-trivial examples, it is shown that the aforementioned advantage can indeed be achieved in the presented scheme. Our result also provides an important scientific message, i.e., the interplay between “classical” and “quantum” can be helpful in QEC.",
author = "Ilkwon Sohn and Jeongho Bang and Jun Heo",
year = "2019",
month = "12",
day = "1",
doi = "10.1038/s41598-019-39439-0",
language = "English",
volume = "9",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",
number = "1",

}

TY - JOUR

T1 - Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture

AU - Sohn, Ilkwon

AU - Bang, Jeongho

AU - Heo, Jun

PY - 2019/12/1

Y1 - 2019/12/1

N2 - Resource overhead problem caused by concatenation in quantum error correction (QEC) is of significant importance for the realization of fault-tolerant quantum computation (FTQC). To attack this problem, we propose a novel scheme by considering integrated FTQC architecture where the concatenation level is controlled dynamically; i.e., less (or more) concatenation levels are imposed by good (or poor) performance gates—we call this scheme “dynamic concatenation” in this sense. Such a dynamic concatenation is realizable in an integrated structure of FTQC, as the information of the concatenation can be communicated between classical system elements (e.g., compiler and system organizer) and the logical qubits in real-time. We derive the effective lower and upper bounds of the length of gate decomposition in order to achieve the practical advantage, namely of reduction of the overall operation time. By considering two non-trivial examples, it is shown that the aforementioned advantage can indeed be achieved in the presented scheme. Our result also provides an important scientific message, i.e., the interplay between “classical” and “quantum” can be helpful in QEC.

AB - Resource overhead problem caused by concatenation in quantum error correction (QEC) is of significant importance for the realization of fault-tolerant quantum computation (FTQC). To attack this problem, we propose a novel scheme by considering integrated FTQC architecture where the concatenation level is controlled dynamically; i.e., less (or more) concatenation levels are imposed by good (or poor) performance gates—we call this scheme “dynamic concatenation” in this sense. Such a dynamic concatenation is realizable in an integrated structure of FTQC, as the information of the concatenation can be communicated between classical system elements (e.g., compiler and system organizer) and the logical qubits in real-time. We derive the effective lower and upper bounds of the length of gate decomposition in order to achieve the practical advantage, namely of reduction of the overall operation time. By considering two non-trivial examples, it is shown that the aforementioned advantage can indeed be achieved in the presented scheme. Our result also provides an important scientific message, i.e., the interplay between “classical” and “quantum” can be helpful in QEC.

UR - http://www.scopus.com/inward/record.url?scp=85062262578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062262578&partnerID=8YFLogxK

U2 - 10.1038/s41598-019-39439-0

DO - 10.1038/s41598-019-39439-0

M3 - Article

VL - 9

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

IS - 1

M1 - 3302

ER -