Some Progress on Quantum Error Correction for Discrete and Continuous Error Models

被引:1
|
作者
Li, Jincao [1 ]
机构
[1] East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200062, Peoples R China
关键词
Quantum computing; quantum error correction; quantum information processing; discrete error models; continuous error models; quantum operations; MDS CODES; CONSTRUCTIONS;
D O I
10.1109/ACCESS.2020.2977344
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum computing has increasingly gained attention for decades since it can surpass classical computing in various aspects. A crucial issue of quantum computing is how to protect information from noise interference such that the error rate during quantum information processing can be limited within an acceptable bound. The technique to address this issue is quantum error correction (QEC). Developing QEC technologies needs to define noise as formal error models and design QEC approaches for these error models. Discrete error models and continuous error models are two kinds of definitions of noise. The former assumes noise occurs independently and can be discretized into a set of basic errors. The former also has a tool, named quantum operations, to describe a specific error model. The latter describes that noise is continuous in time by using differential equations. In this paper, we categorize QEC approaches into three types according to the different error models: discrete error models, specific error models, and continuous error models. We also analyze the state-of-the-art QEC approaches and discuss some future directions. Furthermore, we propose the perturbed error models and their possible definitions, aiming to find the effect of the perturbation during quantum information processing.
引用
收藏
页码:46998 / 47012
页数:15
相关论文
共 50 条
  • [31] Quantum error correction of photon loss with quantum encoding
    Han, Chao
    JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2013, 62 (05) : 721 - 724
  • [32] Quantum error correction of photon loss with quantum encoding
    Chao Han
    Journal of the Korean Physical Society, 2013, 62 : 721 - 724
  • [33] Towards the Acceleration of the Sparse Blossom Algorithm for Quantum Error Correction
    Venere, Marco
    Guerrini, Valentino
    Branchini, Beatrice
    Conficconi, Davide
    Sciuto, Donatella
    Santambrogio, Marco D.
    2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024, 2024, : 106 - 110
  • [34] QULATIS: A Quantum Error Correction Methodology toward Lattice Surgery
    Ueno, Yosuke
    Kondo, Masaaki
    Tanaka, Masamitsu
    Suzuki, Yasunari
    Tabuchi, Yutaka
    2022 IEEE INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE (HPCA 2022), 2022, : 274 - 287
  • [35] Quantum Error Correction Codes in Consumer Technology: Modeling and Analysis
    Thakur, Vikram Singh
    Kumar, Atul
    Das, Jishnu
    Dev, Kapal
    Magarini, Maurizio
    IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2024, 70 (04) : 7102 - 7111
  • [36] Extending Shor's Quantum Error Correction Circuits Using Quantum Adders
    Shahriar, Shadman
    Al Islam, A. B. M. Alim
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 1381 - 1386
  • [37] FAULT-TOLERANT QUANTUM ERROR CORRECTION CODE CONVERSION
    Hill, Charles D.
    Fowler, Austin G.
    Wang, David S.
    Hollenberg, Lloyd C. L.
    QUANTUM INFORMATION & COMPUTATION, 2013, 13 (5-6) : 439 - 451
  • [38] Better ThanWorst-Case Decoding for Quantum Error Correction
    Ravi, Gokul Subramanian
    Baker, Jonathan M.
    Fayyazi, Arash
    Lin, Sophia Fuhui
    Javadi-Abhari, Ali
    Pedram, Massoud
    Chong, Frederic T.
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, VOL 2, ASPLOS 2023, 2023, : 88 - 102
  • [39] Quantum error correction using weak measurements
    Parveen Kumar
    Apoorva Patel
    Quantum Information Processing, 2019, 18
  • [40] GENERALIZED NUMERICAL RANGES AND QUANTUM ERROR CORRECTION
    Li, Chi-Kwong
    Poon, Yiu-Tung
    JOURNAL OF OPERATOR THEORY, 2011, 66 (02) : 335 - 351