Fetching the paper…
Reading the bibliography…
Quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections.
R. G. Gallager, Low-Density Parity-Check Codes , ser. no. 21 in Research Monograph Series. MIT Press, 1963
1963
Earlier work this paper cites.
J. Edmonds, “Paths, trees, and flowers,” Can. J. Math. , vol. 17, pp. 449–467, 1965
1965
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes . North-Holland Publishing Company, 1977
1977
Earlier work this paper cites.
R. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” in Proc. IEEE Int. Conf. Comput., Syst., Signal Process. , 1984, pp. 175–179
1984
Earlier work this paper cites.
J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference . Kaufmann, 1988
1988
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,” Phys. Rev. Lett. , vol. 69, pp. 2881–2884, 1992
1992
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels,” Phys. Rev. Lett. , vol. 70, pp. 1895–1899, 1993
1993
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. Annu. Symp. Found. Comput. Sci. (FOCS) , 1994, pp. 124–134
1994
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proc. Annu. ACM Symp. Theory Comput. (STOC) , 1996, pp. 212–219
1996
Earlier work this paper cites.
P. W. Shor, “Fault-tolerant quantum computation,” in Proc. Annu. Conf. Found. Comput. Sci. (FOCS) , 1996, pp. 56–65
1996
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters , vol. 32, no. 18, pp. 1645–1646, 1996
1996
Earlier work this paper cites.
J. I. Cirac, P. Zoller, H. J. Kimble, and H. Mabuchi, “Quantum state transfer and entanglement distribution among distant nodes in a quantum network,” Phys. Rev. Lett. , vol. 78, p. 3221, 1997
1997
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, Pasadena, CA, USA, 1997. [Online]. Available: {https://doi.org/10.7907/rzr7-dt72}
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A , vol. 55, pp. 900–911, 1997
1997
Earlier work this paper cites.
H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, “Quantum repeaters: the role of imperfect local operations in quantum communication,” Phys. Rev. Lett. , vol. 81, p. 5932, 1998
1998
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4),” IEEE Trans. Inf. Theory , vol. 44, no. 4, pp. 1369–1387, 1998
1998
Earlier work this paper cites.
D. J. C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inf. Theory , vol. 45, no. 2, pp. 399–431, 1999
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge University Press, 2000
2000
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 498–519, 2001
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys. , vol. 43, no. 9, pp. 4452–4505, 2002
2002
Earlier work this paper cites.
C. Wang, J. Harrington, and J. Preskill, “Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory,” Ann. Phys. , vol. 303, no. 1, pp. 31–58, 2003
2003
Earlier work this paper cites.
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Ann. Phys. , vol. 303, no. 1, pp. 2–30, 2003,
2003
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Inf. Theory , vol. 50, no. 10, pp. 2315–2330, 2004
2004
Earlier work this paper cites.
J. W. Harrington, “Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes,” Ph.D. dissertation, California Institute of Technology, Pasadena, CA, USA, 2004
2004
Earlier work this paper cites.
T. Ohno, G. Arakawa, I. Ichinose, and T. Matsui, “Phase structure of the random-plaquette Z 2 Z_{2} gauge model: accuracy threshold for a toric quantum memory,” Nucl. Phys. B , vol. 697, no. 3, pp. 462–480, 2004
2004
Earlier work this paper cites.
M. P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices,” IEEE Trans. Inf. Theory , vol. 50, no. 8, pp. 1788–1793, 2004
2004
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation,” Phys. Rev. Lett. , vol. 97, p. 180501, 2006
2006
Earlier work this paper cites.
——, “Optimal resources for topological two-dimensional stabilizer codes: Comparative study,” Phys. Rev. A , vol. 76, p. 012305, 2007
2007
Cited alongside, same era.
G. A. Malema, “Low-density parity-check codes: construction and implementation,” Ph.D. dissertation, University of Adelaide, Adelaide, SA, Australia, 2007
2007
Cited alongside, same era.
D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” Quantum Inf. Comput. , vol. 8, pp. 987–1000, 2008
2008
Cited alongside, same era.
D. S. Wang, A. G. Fowler, A. M. Stephens, and L. C. L. Hollenberg, “Threshold error rates for the toric and planar codes,” Quantum Inf. Comput. , vol. 10, no. 5, pp. 456–469, 2010
2010
Cited alongside, same era.
G. Duclos-Cianci and D. Poulin, “Fast decoders for topological quantum codes,” Phys. Rev. Lett. , vol. 104, p. 050504, 2010
2010
W. Zeng, A. Ashikhmin, M. Woolls, and L. P. Pryadko, “Quantum convolutional data-syndrome codes,” in Proc. IEEE Int. Workshop Signal Process. Adv Wireless Commun. (SPAWC) , 2019, pp. 1–5
2019
Later among the works it cites.
E. T. Campbell, “A theory of single-shot error correction for adversarial noise,” Quantum Sci. Technol. , vol. 4, no. 2, p. 025006, 2019
2019
Later among the works it cites.
A. Kubica and J. Preskill, “Cellular-automaton decoders with provable thresholds for topological codes,” Phys. Rev. Lett. , vol. 123, p. 020501, 2019
2019
Later among the works it cites.
——, “Quantum data-syndrome codes,” IEEE J. Sel. Areas Commun. , vol. 38, no. 3, pp. 449–462, 2020
2020
Later among the works it cites.
J. Roffe, D. R. White, S. Burton, and E. T. Campbell, “Decoding across the quantum low-density parity-check code landscape,” Phys. Rev. Res. , vol. 2, p. 043423, 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Y.-J. Wang, B. C. Sanders, B.-M. Bai, and X.-M. Wang, “Enhanced feedback iterative decoding of sparse quantum codes,” IEEE Trans. Inf. Theory , vol. 58, no. 2, pp. 1231–1241, 2012
2012
Cited alongside, same era.
C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery,” New J. Phys. , vol. 14, no. 12, p. 123011, 2012
2012
Cited alongside, same era.
M. Hagiwara, M. P. C. Fossorier, and H. Imai, “Fixed initialization decoding of LDPC codes over a binary symmetric channel,” IEEE Trans. Inf. Theory , vol. 58, no. 4, pp. 2321–2329, 2012
2012
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Quantum Kronecker sum-product low-density parity-check codes with finite rate,” Phys. Rev. A , vol. 88, p. 012311, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2014
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nat. Commun. , vol. 5, pp. 1–7, 2014
2014
Cited alongside, same era.
2020
Later among the works it cites.
K.-Y. Kuo and C.-Y. Lai, “Refined belief propagation decoding of sparse-graph quantum codes,” IEEE J. Sel. Areas Inf. Theory , vol. 1, no. 2, pp. 487–498, 2020
2020
Later among the works it cites.
K.-Y. Kuo and C.-C. Lu, “On the hardnesses of several quantum decoding problems,” Quantum Inf. Process. , vol. 19, no. 4, pp. 1–17, 2020
2020
Later among the works it cites.
C. Ryan-Anderson, J. G. Bohnet, K. Lee, D. Gresh, A. Hankin, J. Gaebler, D. Francois, A. Chernoguzov, D. Lucchetti, N. C. Brown et al. , “Realization of real-time fault-tolerant quantum error correction,” Phys. Rev. X , vol. 11, p. 041058, 2021
2021
Later among the works it cites.
A. Grospellier, L. Grouès, A. Krishna, and A. Leverrier, “Combining hard and soft decoders for hypergraph product codes,” Quantum , vol. 5, p. 432, 2021
2021
Later among the works it cites.
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, “Single-shot error correction of three-dimensional homological product codes,” PRX Quantum , vol. 2, p. 020340, 2021
2021
Later among the works it cites.
N. P. Breuckmann and V. Londe, “Single-shot decoding of linear rate LDPC quantum codes with high performance,” IEEE Trans. Inf. Theory , vol. 68, no. 1, pp. 272–286, 2021
2021
Later among the works it cites.
P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum , vol. 5, p. 585, 2021
2021
Later among the works it cites.
C.-Y. Lai and K.-Y. Kuo, “Log-domain decoding of quantum LDPC codes over binary finite fields,” IEEE Trans. Quantum Eng. , vol. 2, 2021, article no. 2103615
2021
Later among the works it cites.
K.-Y. Kuo, I.-C. Chern, and C.-Y. Lai, “Decoding of quantum data-syndrome codes via belief propagation,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2021, pp. 1552–1557
2021
Later among the works it cites.
M. Abobeih, Y. Wang, J. Randall, S. Loenen, C. Bradley, M. Markham, D. Twitchen, B. Terhal, and T. Taminiau, “Fault-tolerant operation of a logical qubit in a diamond quantum processor,” Nature , vol. 606, pp. 884–889, 2022
2022
Later among the works it cites.
S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann et al. , “Realizing repeated quantum error correction in a distance-three surface code,” Nature , vol. 605, pp. 669–674, 2022
2022
Later among the works it cites.
A. Kubica and M. Vasmer, “Single-shot quantum error correction with the three-dimensional subsystem toric code,” Nat. Commun. , vol. 13, p. 6272, 2022
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 Trans. Inf. Theory , vol. 68, no. 1, pp. 287–301, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
——, “Comparison of 2D topological codes and their decoding performances,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2022, pp. 186–191
2022
Later among the works it cites.
P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Trans. Inf. Theory , vol. 68, no. 1, pp. 213–229, 2022
2022
Later among the works it cites.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, “Evidence for the utility of quantum computing before fault tolerance,” Nature , vol. 618, pp. 500–505, 2023
2023
Closest in time.
O. Higgott and N. P. Breuckmann, “Improved single-shot decoding of higher-dimensional hypergraph-product codes,” PRX Quantum , vol. 4, p. 020332, 2023
2023
Closest in time.
K.-Y. Kuo and C.-Y. Lai, “Decoding strategies for generalized quantum data-syndrome coding problems,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2024, pp. 2490–2495
2024
Closest in time.
H. Yao, W. A. Laban, C. Häger, A. G. i Amat, and H. D. Pfister, “Belief propagation decoding of quantum ldpc codes with guided decimation,” in 2024 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2024, pp. 2478–2483
2024
Closest in time.
D. Chytas, M. Pacenti, N. Raveendran, M. F. Flanagan, and B. Vasić, “Enhanced message-passing decoding of degenerate quantum codes utilizing trapping set dynamics,” IEEE Communications Letters , 2024
2024
Closest in time.
R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New J. Phys. , vol. 9, no. 6, p. 199, 2007
2024
Closest in time.