Tradeoff Constructions for Quantum Locally Testable Codes

被引:0
|
作者
Wills, Adam [1 ,2 ]
Lin, Ting-Chun [1 ,3 ]
Hsieh, Min-Hsiu [1 ]
机构
[1] Hon Hai Foxconn Res Inst, Taipei 114699, Taiwan
[2] MIT, Cambridge, MA 02139 USA
[3] Univ Calif San Diego, Dept Phys, La Jolla, CA 92092 USA
关键词
Codes; Parity check codes; Qubit; Quantum mechanics; Polynomials; Product codes; Writing; Weight measurement; Testing; Standards; Quantum locally testable codes; soundness; weight reduction; distance amplification;
D O I
10.1109/TIT.2024.3503500
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, we continue the search for quantum locally testable codes (qLTCs) of new parameters by presenting three constructions that can make new qLTCs from old. The first analyses the soundness of a quantum code under Hastings' weight reduction construction for qLDPC codes to give a weight reduction procedure for qLTCs. Secondly, we describe a novel 'soundness amplification' procedure for qLTCs which can increase the soundness of any qLTC to a constant while preserving its distance and dimension, with an impact only felt on its locality. Finally, we apply the AEL distance amplification construction to the case of qLTCs for the first time which can turn a high-distance qLTC into one with linear distance, at the expense of other parameters. These constructions can be used on as-yet undiscovered qLTCs to obtain new parameters, but we also find a number of present applications to prove the existence of codes in previously unknown parameter regimes. In particular, applications of these operations to the hypersphere product code and the hemicubic code yield many previously unknown parameters. In addition, applications of all three results are described to an upcoming work.
引用
收藏
页码:426 / 458
页数:33
相关论文
共 50 条
  • [41] Constructions of near MDS codes which are optimal locally recoverable codes
    Li, Xiaoru
    Heng, Ziling
    FINITE FIELDS AND THEIR APPLICATIONS, 2023, 88
  • [42] Several Constructions of Near MDS Codes and Optimal Locally Recoverable Codes
    Wang X.-R.
    Heng Z.-L.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2024, 52 (03): : 957 - 966
  • [43] Constructions of Optimal (r, δ) Locally Repairable Codes via Constacyclic Codes
    Chen, Bin
    Fang, Weijun
    Xia, Shu-Tao
    Fu, Fang-Wei
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (08) : 5253 - 5263
  • [44] Towards lower bounds on locally testable codes via density arguments
    Ben-Sasson, Eli
    Viderman, Michael
    2011 IEEE 26TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2011, : 66 - 76
  • [45] Towards lower bounds on locally testable codes via density arguments
    Eli Ben-Sasson
    Michael Viderman
    computational complexity, 2012, 21 : 267 - 309
  • [46] On the Constructions of Quantum MDS Convolutional Codes
    Sujuan Huang
    Shixin Zhu
    International Journal of Theoretical Physics, 62
  • [47] Some constructions of quantum MDS codes
    Ball, Simeon
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (05) : 811 - 821
  • [48] Constructions of Asymmetric Quantum Alternant Codes
    Fan, Jihao
    Chen, Hanwu
    Xu, Juan
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2016, 55 (01) : 313 - 328
  • [49] Some constructions of quantum MDS codes
    Simeon Ball
    Designs, Codes and Cryptography, 2021, 89 : 811 - 821
  • [50] Asymmetric Quantum Codes: Characterization and Constructions
    Wang, Long
    Feng, Keqin
    Ling, San
    Xing, Chaoping
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (06) : 2938 - 2945