乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T11:41:31Z","timestamp":1742643691810},"reference-count":41,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T00:00:00Z","timestamp":1634169600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CIF-1855879"]},{"name":"National Science Foundation","award":["CIF-2106189"]},{"name":"National Science Foundation","award":["CCF2100013"]},{"name":"National Science Foundation","award":["CCSS-2052751"]},{"name":"National Science Foundation","award":["NSF-ERC 1941583"]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by short cycles, detrimental graphical configurations known as trapping sets (TSs) present in a code graph as well as symmetric degeneracy of errors. These factors significantly degrade the decoder decoding probability performance and cause so-called error floor. In this paper, we establish a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used. The conventional definition of a TS from classical error correction is generalized to address the syndrome decoding scenario for QLDPC codes. We show that the knowledge of QTSs can be used to design better QLDPC codes and decoders. Frame error rate improvements of two orders of magnitude in the error floor regime are demonstrated for some practical finite-length QLDPC codes without requiring any post-processing.<\/jats:p>","DOI":"10.22331\/q-2021-10-14-562","type":"journal-article","created":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T19:00:59Z","timestamp":1634238059000},"page":"562","update-policy":"http:\/\/dx.doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":27,"title":["Trapping Sets of Quantum LDPC Codes"],"prefix":"10.22331","volume":"5","author":[{"given":"Nithin","family":"Raveendran","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721, USA"}]},{"given":"Bane","family":"Vasi\u0107","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721, USA"}]}],"member":"9598","published-online":{"date-parts":[[2021,10,14]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"N. Raveendran and B. Vasi\u0107. Trapping set analysis of finite-length quantum LDPC codes. In IEEE Int. Symp. on Inform. Theory, pages 1564\u20131569, 2021. 10.1109\/ISIT45174.2021.9518154.","DOI":"10.1109\/ISIT45174.2021.9518154"},{"key":"1","doi-asserted-by":"publisher","unstructured":"D. J. C. MacKay, G. Mitchison, and P. L. McFadden. Sparse-graph codes for quantum error correction. IEEE Trans. on Inform. Theory, 50 (10): 2315\u20132330, Oct. 2004. 10.1109\/TIT.2004.834737.","DOI":"10.1109\/TIT.2004.834737"},{"key":"2","doi-asserted-by":"publisher","unstructured":"P. W. Shor. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A, 52: R2493\u2013R2496, Oct. 1995. 10.1103\/PhysRevA.52.R2493.","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"3","doi-asserted-by":"publisher","unstructured":"D. Gottesman. Fault-tolerant quantum computation with constant overhead. Quantum Inform. and Computation, 14 (15\u201316): 1338\u20131372, Nov. 2014. 10.26421\/QIC14.15-16-5.","DOI":"10.26421\/QIC14.15-16-5"},{"key":"4","doi-asserted-by":"publisher","unstructured":"A. A. Kovalev and L. P. Pryadko. Fault tolerance of quantum low-density parity check codes with sublinear distance scaling. Phys. Rev. A, 87: 020304, Feb. 2013a. 10.1103\/PhysRevA.87.020304.","DOI":"10.1103\/PhysRevA.87.020304"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo. The road from classical to quantum codes: A hashing bound approaching design procedure. IEEE Access, 3: 146\u2013176, 2015a. 10.1109\/ACCESS.2015.2405533.","DOI":"10.1109\/ACCESS.2015.2405533"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo. Fifteen years of quantum LDPC coding and improved decoding strategies. IEEE Access, 3: 2492\u20132519, 2015b. 10.1109\/ACCESS.2015.2503267.","DOI":"10.1109\/ACCESS.2015.2503267"},{"key":"7","doi-asserted-by":"publisher","unstructured":"J.-P. Tillich and G. Z\u00e9mor. Quantum LDPC codes with positive rate and minimum distance proportional to $n^{1\/2}$. Proc. IEEE Int. Symp. on Inform. Theory, pages 799\u2013803, Jul. 2009. 10.1109\/ISIT.2009.5205648.","DOI":"10.1109\/ISIT.2009.5205648"},{"key":"8","doi-asserted-by":"publisher","unstructured":"A. Leverrier, J.-P. Tillich, and G. Z\u00e9mor. Quantum expander codes. In Proc. IEEE 56th Ann. Symp. on Foundations of Computer Science, pages 810\u2013824, Berkeley, CA, USA, Oct. 2015. 10.1109\/FOCS.2015.55.","DOI":"10.1109\/FOCS.2015.55"},{"key":"9","unstructured":"P. Panteleev and G. Kalachev. Quantum LDPC codes with almost linear minimum distance. arXiv preprint:2012.04068, 2020. URL https:\/\/arxiv.org\/abs\/2012.04068."},{"key":"10","doi-asserted-by":"publisher","unstructured":"K.-Y. Kuo and C.-Y. Lai. Refined belief propagation decoding of sparse-graph quantum codes. IEEE Journal on Selected Areas in Information Theory, 1 (2): 487\u2013498, 2020. 10.1109\/jsait.2020.3011758.","DOI":"10.1109\/jsait.2020.3011758"},{"key":"11","doi-asserted-by":"publisher","unstructured":"C.-Y. Lai and K.-Y. Kuo. Log-domain decoding of quantum LDPC codes over binary finite fields. IEEE Trans. on Quantum Engineering, 2021. 10.1109\/TQE.2021.3113936.","DOI":"10.1109\/TQE.2021.3113936"},{"key":"12","doi-asserted-by":"publisher","unstructured":"D. Poulin and Y. Chung. On the iterative decoding of sparse quantum codes. Quantum Inform. and Computation, 8 (10): 987\u20131000, Nov. 2008. 10.26421\/QIC8.10-8.","DOI":"10.26421\/QIC8.10-8"},{"key":"13","unstructured":"T. J. Richardson. Error floors of LDPC codes. In Proc. 41st Ann. Allerton Conf. Commun., Contr. and Comp., pages 1426\u20131435, Monticello, IL, USA, Sept. 2003. URL https:\/\/web.stanford.edu\/class\/ee388\/papers\/ErrorFloors.pdf."},{"key":"14","unstructured":"P. Panteleev and G. Kalachev. Degenerate quantum LDPC codes with good finite length performance. arXiv preprint:1904.02703, 2019. URL https:\/\/arxiv.org\/abs\/1904.02703."},{"key":"15","doi-asserted-by":"publisher","unstructured":"B. Vasi\u0107, D. V. Nguyen, and S. K. Chilappagari. Chapter 6 - failures and error floors of iterative decoders. In Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Commun., pages 299\u2013341, Oxford, 2014. Academic Press. 10.1016\/B978-0-12-396499-1.00006-6.","DOI":"10.1016\/B978-0-12-396499-1.00006-6"},{"key":"16","doi-asserted-by":"publisher","unstructured":"J. Roffe, D. R. White, S. Burton, and E. Campbell. Decoding across the quantum low-density parity-check code landscape. Phys. Rev. Research, 2: 043423, Dec. 2020. 10.1103\/PhysRevResearch.2.043423.","DOI":"10.1103\/PhysRevResearch.2.043423"},{"key":"17","doi-asserted-by":"publisher","unstructured":"M. P. C. Fossorier and S. Lin. Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans. on Inform. Theory, 41: 1379 \u2013 1396, 10 1995. 10.1109\/18.412683.","DOI":"10.1109\/18.412683"},{"key":"18","doi-asserted-by":"publisher","unstructured":"M. Baldi, N. Maturo, E. Paolini, and F. Chiaraluce. On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links. EURASIP J. Wirel. Commun. Netw., 2016 (272): 1\u2013 15, 2016. 10.1186\/s13638-016-0769-z.","DOI":"10.1186\/s13638-016-0769-z"},{"key":"19","doi-asserted-by":"publisher","unstructured":"A. Rigby, J. C. Olivier, and P. Jarvis. Modified belief propagation decoders for quantum low-density parity-check codes. Phys. Rev. A, 100: 012330, Jul. 2019. 10.1103\/physreva.100.012330.","DOI":"10.1103\/physreva.100.012330"},{"key":"20","doi-asserted-by":"publisher","unstructured":"J. X. Li and P. O. Vontobel. Pseudocodeword-based decoding of quantum stabilizer codes. In Proc. IEEE Int. Symp. on Inform. Theory, pages 2888\u20132892, 2019. 10.1109\/ISIT.2019.8849833.","DOI":"10.1109\/ISIT.2019.8849833"},{"key":"21","doi-asserted-by":"publisher","unstructured":"N. Raveendran, D. Declercq, and B. Vasi\u0107. A sub-graph expansion-contraction method for error floor computation. IEEE Trans. on Commun., 68 (7): 3984\u20133995, 2020. 10.1109\/TCOMM.2020.2988676.","DOI":"10.1109\/TCOMM.2020.2988676"},{"key":"22","doi-asserted-by":"publisher","unstructured":"S. K. Planjery, D. Declercq, L. Danjean, and B. Vasi\u0107. Finite alphabet iterative decoders, Part I: Decoding beyond belief propagation on the binary symmetric channel. IEEE Trans. on Commun., 61 (10): 4033\u20134045, Nov. 2013. 10.1109\/TCOMM.2013.090513.120443.","DOI":"10.1109\/TCOMM.2013.090513.120443"},{"key":"23","doi-asserted-by":"publisher","unstructured":"A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. Physical Review A, 54 (2): 1098\u20131105, Aug. 1996. ISSN 1094-1622. 10.1103\/physreva.54.1098.","DOI":"10.1103\/physreva.54.1098"},{"key":"24","doi-asserted-by":"publisher","unstructured":"M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, New York, NY, USA, 10th edition, 2011. 10.1017\/CBO9780511976667.","DOI":"10.1017\/CBO9780511976667"},{"key":"25","doi-asserted-by":"publisher","unstructured":"D. Gottesman. Stabilizer codes and quantum error correction. Ph.D. Dissertation, California Institute of Technology, 1997. 10.7907\/rzr7-dt72. URL https:\/\/arxiv.org\/abs\/quant-ph\/9705052.","DOI":"10.7907\/rzr7-dt72"},{"key":"26","doi-asserted-by":"publisher","unstructured":"M. M. Wilde. Logical operators of quantum codes. Phys. Rev. A, 79: 062322, Jun. 2009. 10.1103\/PhysRevA.79.062322.","DOI":"10.1103\/PhysRevA.79.062322"},{"key":"27","doi-asserted-by":"publisher","unstructured":"N. Raveendran, P. J. Nadkarni, S. S. Garani, and B. Vasi\u0107. Stochastic resonance decoding for quantum LDPC codes. In Proc. IEEE Int. Conf. on Commun., pages 1\u20136, May 2017. 10.1109\/ICC.2017.7996747.","DOI":"10.1109\/ICC.2017.7996747"},{"key":"28","doi-asserted-by":"publisher","unstructured":"M. Karimi and A. H. Banihashemi. Efficient algorithm for finding dominant trapping sets of LDPC codes. IEEE Trans. on Inform. Theory, 58 (11): 6942\u20136958, Nov. 2012. 10.1109\/TIT.2012.2205663.","DOI":"10.1109\/TIT.2012.2205663"},{"key":"29","doi-asserted-by":"publisher","unstructured":"D. V. Nguyen, S. K. Chilappagari, M. W. Marcellin, and B. Vasi\u0107. On the construction of structured LDPC codes free of small trapping sets. IEEE Trans. on Inform. Theory, 58 (4): 2280\u20132302, Apr. 2012. 10.1109\/TIT.2011.2173733.","DOI":"10.1109\/TIT.2011.2173733"},{"key":"30","doi-asserted-by":"publisher","unstructured":"S. M. Khatami, L. Danjean, D. V. Nguyen, and B. Vasi\u0107. An efficient exhaustive low-weight codeword search for structured LDPC codes. In Proc. Inform. Theory and Applications Workshop, pages 1 \u2013 10, San Diego, CA, USA, Feb. 10\u201315 2013. 10.1109\/ITA.2013.6502981.","DOI":"10.1109\/ITA.2013.6502981"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo. Construction of quantum LDPC codes from classical row-circulant QC-LDPCs. IEEE Commun. Letters, 20 (1): 9\u201312, Jan. 2016. 10.1109\/LCOMM.2015.2494020.","DOI":"10.1109\/LCOMM.2015.2494020"},{"key":"32","doi-asserted-by":"publisher","unstructured":"M. Hagiwara and H. Imai. Quantum quasi-cyclic LDPC codes. In Proc. IEEE Int. Symp. on Inform. Theory, pages 806\u2013810, Jun. 2007. 10.1109\/ISIT.2007.4557323.","DOI":"10.1109\/ISIT.2007.4557323"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Y. Xie and J. Yuan. Reliable quantum LDPC codes over GF(4). In Proc. IEEE Globecom Workshops, pages 1\u20135, Dec. 2016. 10.1109\/GLOCOMW.2016.7849021.","DOI":"10.1109\/GLOCOMW.2016.7849021"},{"key":"34","doi-asserted-by":"publisher","unstructured":"A. A. Kovalev and L. P. Pryadko. Quantum kronecker sum-product low-density parity-check codes with finite rate. Phys. Rev. A, 88: 012311, Jul. 2013b. 10.1103\/PhysRevA.88.012311.","DOI":"10.1103\/PhysRevA.88.012311"},{"key":"35","doi-asserted-by":"publisher","unstructured":"A. A. Kovalev and L. P. Pryadko. Improved quantum hypergraph-product LDPC codes. In Proc. IEEE Int. Symp. on Inform. Theory, pages 348\u2013352, Jul. 2012. 10.1109\/ISIT.2012.6284206.","DOI":"10.1109\/ISIT.2012.6284206"},{"key":"36","doi-asserted-by":"publisher","unstructured":"M. P. C. Fossorier. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. on Inform. Theory, 50 (8): 1788\u20131793, Aug. 2004. 10.1109\/TIT.2004.831841.","DOI":"10.1109\/TIT.2004.831841"},{"key":"37","doi-asserted-by":"publisher","unstructured":"D. E. Hocevar. A reduced complexity decoder architecture via layered decoding of LDPC codes. In Proc. IEEE Workshop on Signal Processing Systems, pages 107\u2013112, 2004. 10.1109\/SIPS.2004.1363033.","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"38","doi-asserted-by":"publisher","unstructured":"E. Sharon, S. Litsyn, and J. Goldberger. Efficient serial message-passing schedules for LDPC decoding. IEEE Trans. on Inform. Theory, 53 (11): 4076\u20134091, 2007. 10.1109\/TIT.2007.907507.","DOI":"10.1109\/TIT.2007.907507"},{"key":"39","doi-asserted-by":"publisher","unstructured":"N. Raveendran and B. Vasi\u0107. Trapping set analysis of horizontal layered decoder. In Proc. IEEE Int. Conf. on Commun., pages 1\u20136, May 2018. 10.1109\/ICC.2018.8422965.","DOI":"10.1109\/ICC.2018.8422965"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Y.-J. Wang, B. C. Sanders, B.-M. Bai, and X.-M. Wang. Enhanced feedback iterative decoding of sparse quantum codes. IEEE Trans. on Inform. Theory, 58 (2): 1231\u20131241, Feb. 2012. 10.1109\/TIT.2011.2169534.","DOI":"10.1109\/TIT.2011.2169534"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2021-10-14-562\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T19:01:21Z","timestamp":1634238081000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2021-10-14-562\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,14]]},"references-count":41,"URL":"https:\/\/doi.org\/10.22331\/q-2021-10-14-562","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,14]]},"article-number":"562"}}