Fetching the paper…
Reading the bibliography…
In this paper, we prove a lower bound on the soundness of quantum locally testable codes under the distance balancing construction of Evra et al.
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy · 1998
Earlier work this paper cites.
Probabilistic checking of proofs: A new characterization of np
Sanjeev Arora and Shmuel Safra · 1998
Earlier work this paper cites.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
The pcp theorem by gap amplification
Irit Dinur · 2007
Earlier work this paper cites.
Michael H Freedman and Matthew B Hastings · 2013
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 ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2013
Earlier work this paper cites.
Quantum locally testable codes
Dorit Aharonov and Lior Eldar · 2015
Earlier work this paper cites.
Quantum codes from high-dimensional manifolds
Matthew B Hastings · 2016
Earlier work this paper cites.
Weight reduction for quantum codes
Matthew B Hastings · 2016
Cited alongside, same era.
Local hamiltonians whose ground states are hard to approximate
Lior Eldar and Aram W Harrow · 2017
Cited alongside, same era.
Coded merkle tree: Solving data availability attacks in blockchains
Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, and Pramod Viswanath · 2020
Cited alongside, same era.
Fiber bundle codes: breaking the n 1/2 polylog (n) barrier for quantum ldpc codes
Matthew B 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.
Balanced product quantum codes
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Towards local testability for quantum coding
Anthony Leverrier, Vivien Londe, and Gilles Zémor · 2022
Later among the works it cites.
Quantum locally testable code with exotic parameters
Andrew Cross, Zhiyang He, Anand Natarajan, Mario Szegedy, and Guanyu Zhu · 2022
Later among the works it cites.
Nlts hamiltonians from good quantum codes
Anurag Anshu, Nikolas Breuckmann, and Chinmay Nirkhe · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical ldpc codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Matthew B Hastings · 2021
Cited alongside, same era.
Quantum low-density parity-check codes
Nikolas P Breuckmann and Jens Niklas Eberhardt · 2021
Cited alongside, same era.
Decodable quantum ldpc codes beyond the n distance barrier using high-dimensional expanders
Shai Evra, Tali Kaufman, and Gilles Zémor · 2022
Cited alongside, same era.
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2022
Later among the works it cites.
Good quantum ldpc codes with linear time decoder from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Later among the works it cites.
Locally testable codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2022
Later among the works it cites.
c 3-locally testable codes from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Later among the works it cites.