TY - JOUR
T1 - Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture
AU - Sohn, Ilkwon
AU - Bang, Jeongho
AU - Heo, Jun
N1 - Publisher Copyright:
© 2019, The Author(s).
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
U2 - 10.1038/s41598-019-39439-0
DO - 10.1038/s41598-019-39439-0
M3 - Article
C2 - 30824753
AN - SCOPUS:85062262578
SN - 2045-2322
VL - 9
JO - Scientific reports
JF - Scientific reports
IS - 1
M1 - 3302
ER -