Quantum Locally Testable Code with Constant Soundness

In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product, and show how this operation gives rise to QLTCs of constant soundness, constant rate, and distance scaling with locality. In the second approach, we consider hypergraph product of a quantum code and a classical repetition code, and observe a special case in which the soundness of component codes is preserved. This insight leads us to construct QLTCs of constant soundness, scalable rate and distance, and constant average locality. Our work marks a step towards constructing QLTCs of high soundness and distance, which would give a different construction to the No Low-Energy Trivial States (NLTS) theorem.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2024-10-18
DOI
https://doi.org/10.22331/q-2024-10-18-1501
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

Quantum Locally Testable Code with Constant Soundness

Anand Natarajan, Zhiyang He, Andrew W. Cross, Guanyu Zhu et al.
1 citations
Quantum
Quantum Computing Algorithms and Architecture
0.35
article

Quantum Locally Testable Code with Constant Soundness

Anand Natarajan, Zhiyang He, Andrew W. Cross, Guanyu Zhu, Márió Szegedy
article en
1 citations

Abstract

In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product, and show how this operation gives rise to QLTCs of constant soundness, constant rate, and distance scaling with locality. In the second approach, we consider hypergraph product of a quantum code and a classical repetition code, and observe a special case in which the soundness of component codes is preserved. This insight leads us to construct QLTCs of constant soundness, scalable rate and distance, and constant average locality. Our work marks a step towards constructing QLTCs of high soundness and distance, which would give a different construction to the No Low-Energy Trivial States (NLTS) theorem.

QuantumVol. 8
Rutgers, The State University of New Jersey (US), IBM (United States) (US), IBM Research - Thomas J. Watson Research Center (US), Massachusetts Institute of Technology (US)
U.S. Department of Energy, Office of Science
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.