Fetching the paper…
Reading the bibliography…
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$.
Self-testing/correcting with applications to numerical problems
Manuel Blum, Michael Luby, and Ronitt Rubinfeld · 1993
Earlier work this paper cites.
An introduction to homological algebra
Charles A Weibel · 1995
Earlier work this paper cites.
Good quantum error-correcting codes exist
A. R. Calderbank and Peter W. Shor · 1996
Earlier work this paper cites.
Multiple-particle interference and quantum error correction
Andrew Steane · 1996
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Z 2 Z_{2} -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.
Approximate quantum error-correcting codes and secret sharing schemes
Claude Crépeau, Daniel Gottesman, and Adam Smith · 2005
Earlier work this paper cites.
Stabilizer formalism for operator quantum error correction
David Poulin · 2005
Earlier work this paper cites.
Lieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order
S. Bravyi, M. B. Hastings, and F. Verstraete · 2006
Earlier work this paper cites.
The PCP theorem by gap amplification
Irit Dinur · 2007
Earlier work this paper cites.
An introduction to homological algebra
Joseph J Rotman · 2008
Earlier work this paper cites.
Locally testable codes require redundant testers
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, and Michael Viderman · 2010
Earlier work this paper cites.
General conditions for approximate quantum error correction and near-optimal recovery channels
Cédric Bény and Ognyan Oreshkov · 2010
Cited alongside, same era.
Short Locally Testable Codes and Proofs: A Survey in Two Parts , pages 65–104
Oded Goldreich · 2010
Cited alongside, same era.
Guest column: the quantum PCP conjecture
Dorit Aharonov, Itai Arad, and Thomas Vidick · 2013
Cited alongside, same era.
Product-state approximations to quantum ground states
Fernando GSL Brandao and Aram W Harrow · 2013
Cited alongside, same era.
The (co) isoperimetric problem in (random) polyhedra
Dominic Dotterrer · 2013
Cited alongside, same era.
Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture
Matthew B Hastings · 2013
Cited alongside, same era.
Local Hamiltonians whose ground states are hard to approximate
Lior Eldar and Aram W Harrow · 2017
Later among the works it cites.
Quantum codes from high-dimensional manifolds
Matthew B Hastings · 2017
Later among the works it cites.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Later among the works it cites.
Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
Anand Natarajan and Thomas Vidick · 2018
Later among the works it cites.
Approximate low-weight check codes and circuit lower bounds for noisy ground states
Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen · 2018
Later among the works it cites.
On tensor products of CSS codes
Benjamin Audoux and Alain Couvreur · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An application of Khovanov homology to quantum codes
Benjamin Audoux · 2014
Cited alongside, same era.
Quantum locally testable codes
Dorit Aharonov and Lior Eldar · 2015
Cited alongside, same era.
Sparse quantum codes from quantum circuits
Dave Bacon, Steven T Flammia, Aram W Harrow, and Jonathan Shi · 2015
Cited alongside, same era.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Cited alongside, same era.
The filling problem in the cube
Dominic Dotterrer · 2016
Cited alongside, same era.
Isoperimetric inequalities for Ramanujan complexes and topological expanders
Tali Kaufman, David Kazhdan, and Alexander Lubotzky · 2016
Cited alongside, same era.
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
Thomas C Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, and Henry Yuen · 2019
Closest in time.
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders
S. Evra, T. Kaufman, and G. Zémor · 2020
Closest in time.
Quantum LDPC Codes with Almost Linear Minimum Distance
Pavel Panteleev and Gleb Kalachev · 2020
Closest in time.
Robust Quantum Entanglement at (Nearly) Room Temperature
Lior Eldar · 2021
Closest in time.
Fiber Bundle Codes: Breaking the n 1 / 2 P o l y l o g ( n ) n^{1/2}Polylog(n) Barrier for Quantum LDPC Codes , page 1276–1288
Matthew B. Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Closest in time.
New Cosystolic Expanders from Tensors Imply Explicit Quantum LDPC Codes with Ω ( n log k n ) \Omega(\sqrt{n}\log^{k}n) Distance , page 1317–1329
Tali Kaufman and Ran J. Tessler · 2021
Closest in time.