Tradeoff Constructions for Quantum Locally Testable Codes

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2024-11-20
DOI
https://doi.org/10.1109/tit.2024.3503500
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tradeoff Constructions for Quantum Locally Testable Codes

Adam Wills, Ting-Chun Lin, Min-Hsiu Hsieh
1 citations
IEEE Transactions on Information Theory
Quantum Computing Algorithms and Architecture
0.35
article

Tradeoff Constructions for Quantum Locally Testable Codes

Adam Wills, Ting-Chun Lin, Min-Hsiu Hsieh
article en
1 citations

Abstract

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.

IEEE Transactions on Information TheoryVol. 71(1)
Foxconn (Taiwan) (TW)
U.S. Department of Energy
Openalex Percentile: Top 32%
Quantum Computing Algorithms and Architecture
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Tradeoff Constructions for Quantum Locally Testable Codes — Adam Wills, Ting-Chun Lin, et al. · IEEE Transactions on Information Theory (2024) | TGRS Research Map | TGRS