Compare Papers
Paper 1
Towards surgery with good quantum LDPC codes
Alexander Cowtan
- Year
- 2023
- Journal
- arXiv preprint
- DOI
- arXiv:2309.16406
- arXiv
- 2309.16406
We show that the good quantum LDPC codes of Panteleev-Kalachev \cite{PK} allow for surgery using any logical qubits, albeit incurring an asymptotic penalty which lowers the rate and distance scaling. We also prove that we can satisfy 3 of the 4 conditions for performing surgery \textit{without} incurring an asymptotic penalty. If the last condition is also satisfied then we can perform code surgery while maintaining $k, d\in Θ(n)$.
Open paperPaper 2
Not found.