Mason Archival Repository Service

Classes of High-Performance Quantum LDPC Codes From Finte Projective Geometries

Show simple item record

dc.contributor.advisor Agnarsson, Geir
dc.contributor.author Farinholt, Jacob M.
dc.creator Farinholt, Jacob M.
dc.date 2012-07-05
dc.date.accessioned 2012-10-05T14:21:27Z
dc.date.available NO_RESTRICTION en_US
dc.date.available 2012-10-05T14:21:27Z
dc.date.issued 2012-10-05
dc.identifier.uri https://hdl.handle.net/1920/7947
dc.description.abstract Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been invesitgated as a solution to the problem of decoherence in fragile quantum states [1, 2]. However, the additional twisted inner product requirements of quantum stabilizer codes force four-cycles and eliminate the possibility of randomly generated quantum LDPC codes. Moreover, the classes of quantum LDPC codes discovered thus far generally have unknown or small minimum distance, or a fixed rate (see [3, 4] and references therin). This paper presents several new classes of quantum LDPC codes constructed from finite projective planes. These codes have rates that increase with the block length n and minimum weights proportional to n1=2. For the sake of completeness, we include an introduction to classical error correction and LDPC codes, and provide a review of quantum communication, quantum stabilizer codes, and finite projective geometry.
dc.language.iso en en_US
dc.subject quantum error correction en_US
dc.subject error correcting codes en_US
dc.subject finite geometry en_US
dc.title Classes of High-Performance Quantum LDPC Codes From Finte Projective Geometries en_US
dc.type Thesis en
thesis.degree.name Master of Science in Mathematics en_US
thesis.degree.level Master's en
thesis.degree.discipline Mathematics en
thesis.degree.grantor George Mason University en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Browse

My Account

Statistics