Abstract
This chapter is devoted to quantum LDPC codes, which have many advantages compared to other classes of quantum codes thanks to the sparseness of their quantum-check matrices. Both semi-random and structured quantum LDPC codes are described. The chapter begins with the introduction of classical LDPC codes, their design and decoding algorithms. Further, dual-containing quantum LDPC codes are described. Next section is devoted to the entanglement-assisted quantum LDPC codes. The final section of this chapter describes the probabilistic sum-product algorithm based on quantum-check matrix instead of classical parity-check matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Quantum Information Processing and Quantum Error Correction
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
