Fetching the paper…
Reading the bibliography…
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance.
P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Physical Review A 52
1995
Earlier work this paper cites.
D. Gottesman, Class of quantum error-correcting codes saturating the quantum Hamming bound, Physical Review A 54
1996
Earlier work this paper cites.
P. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (IEEE Comput. Soc. Press, 1996) pp. 56–65
1996
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54
1996
Earlier work this paper cites.
A. M. Steane, Active stabilization, quantum computation, and quantum state synthesis, Physical Review Letters 78
1997
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
Earlier work this paper cites.
E. Knill, Quantum computing with realistically noisy devices, Nature 434
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
E. Ben-Sasson and M. Sudan, Robust locally testable codes and products of codes, Random Structures & Algorithms 28
2006
Earlier work this paper cites.
H. Bombín and M. Martin-Delgado, Exact topological quantum order in D = 3 D=3 and beyond: Branyons and brane-net condensates, Physical Review B 75
2007
Earlier work this paper cites.
S. Bravyi and B. Terhal, A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes, New Journal of Physics 11
2009
Earlier work this paper cites.
S. Bravyi, D. Poulin, and B. Terhal, Tradeoffs for reliable quantum information storage in 2D systems, Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
T. Kaufman and A. Lubotzky, High dimensional expanders and property testing (2013), arXiv:1312.2367
2013
Earlier work this paper cites.
Y. Fujiwara, Ability of stabilizer quantum error correction to protect itself from its own imperfection, Physical Review A 90
2014
Earlier work this paper cites.
D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Info. Comput. 14
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
H. Bombín, Single-shot fault-tolerant quantum error correction, Phys. Rev. X 5
2015
Cited alongside, same era.
H. Bombín, Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes, New Journal of Physics 17
2015
Cited alongside, same era.
D. Aharonov and L. Eldar, Quantum locally testable codes, SIAM Journal on Computing 44
2015
Cited alongside, same era.
M. B. Hastings, Quantum codes from high-dimensional manifolds, in 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017)
2017
Cited alongside, same era.
A. Kubica and M. Vasmer, Single-shot quantum error correction with the three-dimensional subsystem toric code, Nature Communications 13
2022
Later among the works it cites.
N. Delfosse, B. W. Reichardt, and K. M. Svore, Beyond single-shot fault-tolerant quantum error correction, IEEE Transactions on Information Theory 68
2022
Later among the works it cites.
I. Dinur, S. Evra, R. Livne, A. Lubotzky, and S. Mozes, Locally testable codes with constant rate, distance, and locality, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (2022) pp. 357–374
2022
Later among the works it cites.
G. Kalachev and P. Panteleev, Two-sided robustly testable codes (2022), arXiv:2206.09973
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…
A. Kubica, The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter , Ph.D. thesis , Caltech (2018)
2018
Cited alongside, same era.
O. Fawzi, A. Grospellier, and A. Leverrier, Constant overhead quantum fault-tolerance with quantum expander codes, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2018)
2018
Cited alongside, same era.
E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology 4
2019
Cited alongside, same era.
A. Grospellier, Constant time decoding of quantum expander codes and application to fault-tolerant quantum computation , Ph.D. thesis , Sorbonne Université (2019)
2019
Cited alongside, same era.
A. Ashikhmin, C. Y. Lai, and T. A. Brun, Quantum Data-Syndrome Codes, IEEE Journal on Selected Areas in Communications 38
2020
Cited alongside, same era.
M. B. Hastings, J. Haah, and R. O’Donnell, Fiber bundle codes: breaking the n 1 / 2 polylog ( n ) n^{1/2}\text{polylog}(n) barrier for quantum LDPC codes, in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) pp. 1276–1288
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, PRX Quantum 2
2021
Cited alongside, same era.
2022
Later among the works it cites.
A. Leverrier, V. Londe, and G. Zémor, Towards local testability for quantum coding, Quantum 6
2022
Later among the works it cites.
2022
Later among the works it cites.
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Science Advances 8
2022
Later among the works it cites.
M. A. Tremblay, N. Delfosse, and M. E. Beverland, Constant-overhead quantum error correction with thin planar connectivity, Physical Review Letters 129
2022
Later among the works it cites.
A. Leverrier and G. Zémor, Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes, in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (SIAM, 2023) pp. 1216–1244
2023
Closest in time.
S. Gu, C. A. Pattison, and E. Tang, An efficient decoder for a linear distance quantum LDPC code, in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , STOC 2023 (Association for Computing Machinery, New York, NY, USA, 2023) p. 919–932
2023
Closest in time.
2023
Closest in time.
A. Leverrier and G. Zémor, Decoding quantum tanner codes, IEEE Transactions on Information Theory , 1 (2023)
2023
Closest in time.
2023
Closest in time.