Compare Papers
Paper 1
Parafermion stabilizer codes
Utkan Güngördü, Rabindra Nepal, Alexey A. Kovalev
- Year
- 2014
- Journal
- arXiv preprint
- DOI
- arXiv:1409.4724
- arXiv
- 1409.4724
We define and study parafermion stabilizer codes which can be viewed as generalizations of Kitaev's one dimensional model of unpaired Majorana fermions. Parafermion stabilizer codes can protect against low-weight errors acting on a small subset of parafermion modes in analogy to qudit stabilizer codes. Examples of several smallest parafermion stabilizer codes are given. A locality preserving embedding of qudit operators into parafermion operators is established which allows one to map known qudit stabilizer codes to parafermion codes. We also present a local 2D parafermion construction that combines topological protection of Kitaev's toric code with additional protection relying on parity conservation.
Open paperPaper 2
Fast surgery for quantum LDPC codes
Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen
- Year
- 2025
- Journal
- arXiv preprint
- DOI
- arXiv:2510.04521
- arXiv
- 2510.04521
Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads.
Open paper