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 条
  • [1] QUANTUM LOCALLY TESTABLE CODES
    Aharonov, Dorit
    Eldar, Lior
    SIAM JOURNAL ON COMPUTING, 2015, 44 (05) : 1230 - 1262
  • [2] Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
    Panteleev, Pavel
    Kalachev, Gleb
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 375 - 388
  • [3] Locally testable cyclic codes
    Babai, L
    Shpilka, A
    Stefankovic, D
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (08) : 2849 - 2858
  • [4] Tolerant locally testable codes
    Guruswami, V
    Rudra, A
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 306 - 317
  • [5] Locally testable cyclic codes
    Babai, L
    Shpilka, A
    Stefankovic, D
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 116 - 125
  • [6] Robust locally testable codes and products of codes
    Ben-Sasson, Eli
    Sudan, Madhu
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 387 - 402
  • [7] Robust locally testable codes and products of codes
    Ben-Sasson, E
    Sudan, M
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 286 - 297
  • [8] Short locally testable codes and proofs
    Goldreich O.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6650 LNCS : 333 - 372
  • [9] COMBINATORIAL CONSTRUCTION OF LOCALLY TESTABLE CODES
    Meir, Or
    SIAM JOURNAL ON COMPUTING, 2009, 39 (02) : 491 - 544
  • [10] Combinatorial Construction of Locally Testable Codes
    Meir, Or
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 285 - 294