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 条
  • [31] Short Locally Testable Codes and Proofs: A Survey in Two Parts
    Goldreich, Oded
    PROPERTY TESTING: CURRENT RESEARCH AND SURVEYS, 2010, 6390 : 65 - 104
  • [32] Sparse affine-invariant linear codes are locally testable
    Ben-Sasson, Eli
    Ron-Zewi, Noga
    Sudan, Madhu
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 561 - 570
  • [33] Locally testable codes and PCPs of almost-linear length
    Goldreich, O
    Sudan, M
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 13 - 22
  • [34] Sparse affine-invariant linear codes are locally testable
    Eli Ben-Sasson
    Noga Ron-Zewi
    Madhu Sudan
    computational complexity, 2017, 26 : 37 - 77
  • [35] Locally testable codes and PCPs of almost-linear length
    Goldreich, Oded
    Sudan, Madhu
    JOURNAL OF THE ACM, 2006, 53 (04) : 558 - 655
  • [36] Constructions and Properties of Linear Locally Repairable Codes
    Ernvall, Toni
    Westerback, Thomas
    Freij-Hollanti, Ragnar
    Hollanti, Camilla
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1129 - 1143
  • [37] Constructions of locally recoverable codes with large availability
    Micheli, Giacomo
    Lavorante, Vincenzo Pallozzi
    Shukul, Abhi
    Smith, Noah
    DESIGNS CODES AND CRYPTOGRAPHY, 2025,
  • [39] Some Constructions of Optimal Locally Repairable Codes
    Song, Wentu
    Cai, Kui
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 688 - 692
  • [40] ON SEPARATION BY LOCALLY TESTABLE AND LOCALLY THRESHOLD TESTABLE LANGUAGES
    Place, Thomas
    Van Rooijen, Lorijn
    Zeitoun, Marc
    LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (03)