Fetching the paper…
Reading the bibliography…
We introduce sequential and parallel decoders for quantum Tanner codes.
R. Tanner, “A recursive approach to low complexity codes,”
1981
Earlier work this paper cites.
M. Sipser and D. A. Spielman, “Expander codes,”
1996
Earlier work this paper cites.
A. Steane, “Multiple-particle interference and quantum error correction,”
1996
Earlier work this paper cites.
R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,”
1996
Earlier work this paper cites.
A. M. Steane, “Error correcting codes in quantum theory,”
1996
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, 1997
1997
Earlier work this paper cites.
S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications,”
2006
Earlier work this paper cites.
V. Guruswami, “Expander codes and their decoding,”
2010
Earlier work this paper cites.
A. A. Kovalev and L. P. Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling,”
2013
Earlier work this paper cites.
C. Monroe and J. Kim, “Scaling the ion trap quantum processor,”
2013
Earlier work this paper cites.
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,”
2014
Earlier work this paper cites.
J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,”
2014
Earlier work this paper cites.
M. H. Freedman and M. B. Hastings, “Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs,”
2014
Earlier work this paper cites.
A. Leverrier, J.-P. Tillich, and G. Zémor, “Quantum expander codes,” in
2015
Earlier work this paper cites.
T. Rudolph, “Why I am optimistic about the silicon-photonic route to quantum computing,”
2017
Cited alongside, same era.
O. Fawzi, A. Grospellier, and A. Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in
2018
Cited alongside, same era.
J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape,”
2020
Cited alongside, same era.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders,” in
2020
Cited alongside, same era.
2021
Cited alongside, same era.
A. Leverrier and G. Zémor, “Quantum Tanner codes,”
2022
Closest in time.
N. Delfosse, V. Londe, and M. E. Beverland, “Toward a union-find decoder for quantum LDPC codes,”
2022
Closest in time.
N. P. Breuckmann and V. Londe, “Single-shot decoding of linear rate LDPC quantum codes with high performance,”
2022
Closest in time.
2022
Closest in time.
S. Gu, C. A. Pattison, and E. Tang, “An efficient decoder for a linear distance quantum LDPC code,”
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,”
2021
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,”
2021
Cited alongside, same era.
M. Morgado and S. Whitlock, “Quantum simulation and computing with rydberg-interacting qubits,”
2021
Cited alongside, same era.
P. Panteleev and G. Kalachev, “Degenerate Quantum LDPC Codes With Good Finite Length Performance,”
2021
Cited alongside, same era.
A. Grospellier, L. Grouès, A. Krishna, and A. Leverrier, “Combining hard and soft decoders for hypergraph product codes,”
2021
Cited alongside, same era.
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, “Single-shot error correction of three-dimensional homological product codes,”
2021
Cited alongside, same era.
O. Goldreich, “On the Locally Testable Code of Dinur et al.( 2021).” in
2021
Cited alongside, same era.
2022
Closest in time.
2022
Closest in time.
I. Dinur, S. Evra, R. Livne, A. Lubotzky, and S. Mozes, “Locally testable codes with constant rate, distance, and locality,” in
2022
Closest in time.
G. Kalachev and P. Panteleev, “Two-sided robustly testable codes,”
2022
Closest in time.
M. Hopkins and T.-C. Lin, “Explicit Lower Bounds Against
2022
Closest in time.
A. Anshu, N. P. Breuckmann, and C. Nirkhe, “NLTS Hamiltonians from good quantum codes,”
2022
Closest in time.
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, “Low-overhead fault-tolerant quantum computing using long-range connectivity,”
2022
Closest in time.