New Quantum LDPC Codes Based on Euclidean Geometry
Ya'nan Feng, Chuchen Tang, Chenming Bai
TL;DR
This paper introduces new quantum LDPC codes derived from Euclidean geometry, expanding the design space for quantum error correction with geometrically inspired structures.
Contribution
It presents a novel construction of QLDPC codes based on Euclidean geometry, including codes from all lines and parallel classes, addressing specific geometric constraints.
Findings
Codes based on all lines show improved error correction capabilities.
Parallel class-based codes offer efficient decoding algorithms.
The geometric approach enhances the diversity of quantum LDPC code constructions.
Abstract
With the development of quantum error correction techniques, quantum low density parity check (QLDPC) codes become a promising area in quantum error correction codes. In this paper, the requirements of QLDPC codes based on points except the origin and lines not passing through the origin of Euclidean geometry are given. QLDPC codes based on all the lines and parallel classes are obtained respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Data Storage Technologies