Pruning bivariate bicycle codes produces open-boundary codes with the same locality and distance and half the logical qubits, proven for cyclic hypergraph products and shown on explicit examples.
Breuckmann and Jens Niklas Eberhardt
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions
Pruning bivariate bicycle codes produces open-boundary codes with the same locality and distance and half the logical qubits, proven for cyclic hypergraph products and shown on explicit examples.