Compare Papers
Paper 1
Reducing the overhead for quantum computation when noise is biased
Paul Webster, Stephen D. Bartlett, David Poulin
- Year
- 2015
- Journal
- arXiv preprint
- DOI
- arXiv:1509.05032
- arXiv
- 1509.05032
We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal fault-tolerant quantum computation using only Clifford gates that preserve the noise bias. We analyse the distillation of $|T\rangle$-type magic states using this gadget at the physical level, followed by concatenation with the 15-qubit quantum Reed-Muller code, and comparing our results with standard constructions. In the regime where the noise bias (rate of Pauli $Z$ errors relative to other single-qubit errors) is greater than a factor of 10, our scheme has lower overhead across a broad range of relevant noise rates.
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