Approximate symmetries and quantum error correction

被引:3
|
作者
Liu, Zi-Wen [1 ,2 ]
Zhou, Sisi [1 ,3 ,4 ]
机构
[1] Perimeter Inst Theoret Phys, Waterloo, ON N2L 2Y5, Canada
[2] Tsinghua Univ, Yau Math Sci Ctr, Beijing 100084, Peoples R China
[3] CALTECH, Inst Quantum Informat & Matter, Pasadena, CA 91125 USA
[4] Univ Chicago, Pritzker Sch Mol Engn, Chicago, IL 60637 USA
关键词
COMPUTATION; TELEPORTATION; DISTANCE; GEOMETRY; PHYSICS;
D O I
10.1038/s41534-023-00788-4
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. There are fundamental tensions between continuous symmetries and QEC. One vital situation is unfolded by the Eastin-Knill theorem, which forbids the existence of QEC codes that admit transversal continuous symmetry actions (transformations). Here, we systematically study the competition between continuous symmetries and QEC in a quantitative manner. We first define a series of meaningful measures of approximate symmetries motivated from different perspectives, and then establish a series of trade-off bounds between them and QEC accuracy utilizing multiple different methods. Remarkably, the results allow us to derive general quantitative limitations of transversally implementable logical gates, an important topic in fault-tolerant quantum computation. As concrete examples, we showcase two explicit types of quantum codes, obtained from quantum Reed-Muller codes and thermodynamic codes, respectively, that nearly saturate our bounds. Finally, we discuss several potential applications of our results in physics.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Comparison of a quantum error-correction threshold for exact and approximate errors
    Gutierrez, Mauricio
    Brown, Kenneth R.
    PHYSICAL REVIEW A, 2015, 91 (02):
  • [32] Linear Programming Bounds for Approximate Quantum Error Correction Over Arbitrary Quantum Channels
    Ouyang, Yingkai
    Lai, Ching-Yi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5234 - 5247
  • [33] Error Correction for Approximate Computing
    Zhang, Hang
    Abdi, Afshin
    Fekri, Faramarz
    Esmaeilzadeh, Hadi
    2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2016, : 948 - 953
  • [34] Classical symmetries and the Quantum Approximate Optimization Algorithm
    Ruslan Shaydulin
    Stuart Hadfield
    Tad Hogg
    Ilya Safro
    Quantum Information Processing, 2021, 20
  • [35] Classical symmetries and the Quantum Approximate Optimization Algorithm
    Shaydulin, Ruslan
    Hadfield, Stuart
    Hogg, Tad
    Safro, Ilya
    QUANTUM INFORMATION PROCESSING, 2021, 20 (11)
  • [36] Renormalization group and approximate error correction
    Furuya, Keiichiro
    Lashkari, Nima
    Moosa, Mudassir
    PHYSICAL REVIEW D, 2022, 106 (10)
  • [37] General Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels
    Beny, Cedric
    Oreshkov, Ognyan
    PHYSICAL REVIEW LETTERS, 2010, 104 (12)
  • [38] Quantum interleaver: Quantum error correction for burst error
    Kawabata, S
    JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2000, 69 (11) : 3540 - 3543
  • [39] Error mitigation for quantum approximate optimization
    Weidinger, Anita
    Mbeng, Glen Bigan
    Lechner, Wolfgang
    PHYSICAL REVIEW A, 2023, 108 (03)
  • [40] Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
    Kubica, Aleksander
    Demkowicz-Dobrzanski, Rafal
    PHYSICAL REVIEW LETTERS, 2021, 126 (15)