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 条
  • [21] Locally Testable Codes with Constant Rate, Distance, and Locality
    Dinur, Irit
    Evra, Shai
    Livne, Ron
    Lubotzky, Alexander
    Mozes, Shahar
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 357 - 374
  • [22] Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
    Gopi, Sivakanth
    Kopparty, Swastik
    Oliveira, Rafael
    Ron-Zewi, Noga
    Saraf, Shubhangi
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2073 - 2091
  • [23] Quantum Locally Testable Code with Constant Soundness
    Cross, Andrew
    He , Zhiyang
    Natarajan, Anand
    Szegedy, Mario
    Zhu, Guanyu
    QUANTUM, 2024, 8
  • [24] Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
    Gopi, Sivakanth
    Kopparty, Swastik
    Oliveira, Rafael
    Ron-Zewi, Noga
    Saraf, Shubhangi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (08) : 5813 - 5831
  • [25] Constructions of quantum convolutional codes
    Grassl, Markus
    Roetteler, Martin
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 816 - +
  • [26] Constructions of quantum MDS codes
    Liu, Hualu
    Liu, Xiusheng
    QUANTUM INFORMATION PROCESSING, 2021, 20 (01)
  • [27] Geometric constructions of quantum codes
    Bierbrauer, Juergen
    Bartoli, D.
    Marcugini, S.
    Pambianco, F.
    ERROR-CORRECTING CODES, FINITE GEOMETRIES AND CRYPTOGRAPHY, 2010, 523 : 149 - +
  • [28] Constructions of quantum MDS codes
    Hualu Liu
    Xiusheng Liu
    Quantum Information Processing, 2021, 20
  • [29] On binary constructions of quantum codes
    Cohen, G
    Encheva, S
    Litsyn, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2495 - 2498
  • [30] SPARSE AFFINE-INVARIANT LINEAR CODES ARE LOCALLY TESTABLE
    Ben-Sasson, Eli
    Ron-Zewi, Noga
    Sudan, Madhu
    COMPUTATIONAL COMPLEXITY, 2017, 26 (01) : 37 - 77