Fetching the paper…
Reading the bibliography…
We introduce a sliding window decoder based on belief propagation (BP) with guided decimation for the purposes of decoding quantum low-density parity-check codes in the presence of circuit-level noise.
R. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A , vol. 54, no. 2, p. 1098, 1996
1996
Earlier work this paper cites.
A. Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society A , vol. 452, no. 1954, pp. 2551–2577, 1996
1996
Earlier work this paper cites.
A. M. Steane, “Active stabilization, quantum computation, and quantum state synthesis,” Phys. Rev. Lett. , vol. 78, pp. 2252–2255, 1997
1997
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4452–4505, 2002
2002
Earlier work this paper cites.
M. Mezard, G. Parisi, and R. Zecchina, “Analytic and algorithmic solution of random satisfiability problems,” Science , vol. 297, pp. 812–815, 2002
2002
Earlier work this paper cites.
T. Richardson, “Error floors of LDPC codes,” in Proceedings of the annual Allerton conference on Communication Control and Computing , 2003
2003
Earlier work this paper cites.
H. Pishro-Nik and F. Fekri, “On decoding of low-density parity-check codes over the binary erasure channel,” IEEE Transactions on Information Theory , vol. 50, no. 3, pp. 439–454, 2004
2004
Earlier work this paper cites.
A. Montanari, F. Ricci-Tersenghi, and G. Semerjian, “Solving constraint satisfaction problems through belief propagation-guided decimation,” 45th Annual Allerton Conference on Communication, Control, and Computing , vol. 1, 2007
2007
Earlier work this paper cites.
H. Pishro-Nik and F. Fekri, “Results on punctured low-density parity-check codes and improved iterative decoding techniques,” IEEE Transactions on Information Theory , vol. 53, no. 2, pp. 599–614, 2007
2007
Earlier work this paper cites.
D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” Quantum Information and Computation , vol. 8, no. 10, pp. 987–1000, 2008
2008
Earlier work this paper cites.
C. Measson, A. Montanari, and R. Urbanke, “Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding,” IEEE Transactions on Information Theory , vol. 54, no. 12, pp. 5277–5307, 2008
2008
Earlier work this paper cites.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code,” Phys. Rev. A , vol. 80, p. 052312, 2009
2009
Earlier work this paper cites.
A. R. Iyengar, P. H. Siegel, R. L. Urbanke, and J. K. Wolf, “Windowed decoding of spatially coupled codes,” IEEE Transactions on Information Theory , vol. 59, no. 4, pp. 2277–2292, 2013
2013
Cited alongside, same era.
Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Fifteen years of quantum LDPC coding and improved decoding strategies,” IEEE Access , vol. 3, pp. 2492–2519, 2015
2015
Cited alongside, same era.
V. Aref, N. Macris, and M. Vuffray, “Approaching the rate-distortion limit with spatial coupling, belief propagation, and decimation,” IEEE Transactions on Information Theory , vol. 61, no. 7, pp. 3954–3979, 2015
2015
Cited alongside, same era.
S. Cammerer, M. Ebada, A. Elkelesh, and S. ten Brink, “Sparse graphs for belief propagation decoding of polar codes,” in 2018 IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1465–1469
2018
Cited alongside, same era.
N. Raveendran, N. Rengaswamy, A. Pradhan, and B. Vasic, “Soft syndrome decoding of quantum LDPC codes for joint correction of data and syndrome errors,” in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , 2022, pp. 275–281
2022
Later among the works it cites.
J. Roffe, “LDPC: Python tools for low density parity check codes,” 2022. [Online]. Available: https://github.com/quantumgizmos/ldpc
2022
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape,” Phys. Rev. Res. , vol. 2, p. 043423, 2020
2020
Cited alongside, same era.
P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Transactions on Information Theory , vol. 68, no. 1, pp. 213–229, 2021
2021
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Transactions on Information Theory , vol. 67, no. 10, pp. 6653–6674, 2021
2021
Cited alongside, same era.
P. Panteleev and G. Kalachev, “Degenerate Quantum LDPC Codes With Good Finite Length Performance,” Quantum , vol. 5, p. 585, 2021
2021
Cited alongside, same era.
N. Raveendran and B. Vasić, “Trapping sets of quantum LDPC codes,” Quantum , vol. 5, p. 562, 2021
2021
Cited alongside, same era.
C. Gidney, “Stim: a fast stabilizer circuit simulator,” Quantum , vol. 5, p. 497, 2021
2021
Cited alongside, same era.
——, “Asymptotically good quantum and locally testable classical LDPC codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , 2022, p. 375–388
2022
Cited alongside, same era.
A. Leverrier and G. Zémor, “Quantum Tanner codes,” in IEEE 63rd Annual Symposium on Foundations of Computer Science , 2022, pp. 872–883
2022
Cited alongside, same era.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, “Logical quantum processor based on reconfigurable atom arrays,” Nature , vol. 626, no. 7997, p. 58–65, 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
X. Tan, F. Zhang, R. Chao, Y. Shi, and J. Chen, “Scalable surface-code decoders with parallelization in time,” PRX Quantum , vol. 4, p. 040344, 2023
2023
Later among the works it cites.
L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, “Parallel window decoding enables scalable fault tolerant quantum computation,” Nature Communications , vol. 14, p. 7040, 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
H.-K. Lin and L. P. Pryadko, “Quantum two-block group algebra codes,” Phys. Rev. A , vol. 109, p. 022407, 2024
2024
Closest in time.