Fetching the paper…
Reading the bibliography…
In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness.
“Self-testing/correcting with applications to numerical problems”
M. Blum, M. Luby and R. Rubinfeld · 1990
Earlier work this paper cites.
“Proof verification and the hardness of approximation problems”
Sanjeev Arora et al · 1998
Earlier work this paper cites.
“The PCP theorem by gap amplification”
Irit Dinur · 2007
Earlier work this paper cites.
“Guest column: the quantum PCP conjecture”
Dorit Aharonov, Itai Arad and Thomas Vidick · 2013
Earlier work this paper cites.
“Quantum Systems on Non- k k -Hyperfinite Complexes: A Generalization of Classical Statistical Mechanics on Expander Graphs”
Michael Freedman and Matthew Hastings · 2013
Earlier work this paper cites.
“Quantum Locally Testable Codes”
Dorit Aharonov and Lior Eldar · 2015
Earlier work this paper cites.
“Local Hamiltonians Whose Ground States Are Hard to Approximate”
L. Eldar and A.. Harrow · 2017
Earlier work this paper cites.
“Weight reduction for quantum codes”
Mathew. Hastings · 2017
Cited alongside, same era.
“Quantum Codes from High-Dimensional Manifolds”
Matthew. Hastings · 2017
Cited alongside, same era.
“Balanced Product Quantum Codes”
Nikolas. Breuckmann and Jens. Eberhardt · 2021
Cited alongside, same era.
“Fiber bundle codes: breaking the n 1 / 2 n^{1/2} polylog(n) barrier for Quantum LDPC codes”
Matthew. Hastings, Jeongwan Haah and Ryan O’Donnell · 2021
Cited alongside, same era.
“Quantum LDPC Codes With Almost Linear Minimum Distance”
Pavel Panteleev and Gleb Kalachev · 2021
Cited alongside, same era.
“Locally testable codes with constant rate, distance, and locality”
Irit Dinur et al · 2022
Cited alongside, same era.
“Towards local testability for quantum coding”
Anthony Leverrier, Vivien Londe and Gilles Zémor · 2022
Closest in time.
“Quantum Tanner codes”
A. Leverrier and G. Zemor · 2022
Closest in time.
“Asymptotically good Quantum and locally testable classical LDPC codes”
Pavel Panteleev and Gleb Kalachev · 2022
Closest in time.
“NLTS Hamiltonians from Good Quantum Codes”
Anurag Anshu, Nikolas. Breuckmann and Chinmay Nirkhe · 2023
Closest in time.
“Good Quantum LDPC Codes with Linear Time Decoders”
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin and Thomas Vidick · 2023
Closest in time.
“A theory of single-shot error correction for adversarial noise”
Earl Campbell · 2058
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…