9 papers · 1 filter
Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes
Anthony Gómez-Fonseca, Gretchen L. Matthews, Kirsten D. Morris +1
Quantum low-density parity-check (QLDPC) codes offer a promising route to scalable fault-tolerant quantum computation, but their performance under iterative decoding is strongly in…
Absorbing Sets in Quantum LDPC Codes
Kirsten D. Morris, Tefjol Pllaha, Christine A. Kelley
Iterative decoder failures of quantum low density parity check (QLDPC) codes are attributed to substructures in the code's graph, known as trapping sets, as well as degenerate erro…
On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers
Matteo Allaix, Seunghoan Song, Lukas Holzbaur +3
In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file.…
Binary Subspace Chirps
Tefjol Pllaha, Olav Tirkkonen, Robert Calderbank
We describe in details the interplay between binary symplectic geometry and quantum computation, with the ultimate goal of constructing highly structured codebooks. The Binary Chir…
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes
Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identit…
Reconstruction of Multi-user Binary Subspace Chirps
Tefjol Pllaha, Olav Tirkkonen, Robert Calderbank
We consider codebooks of Complex Grassmannian Lines consisting of Binary Subspace Chirps (BSSCs) in dimensions. BSSCs are generalizations of Binary Chirps (BCs), their en…