Quantum error correction with degenerate codes for correlated noise
Giulio Chiribella, Michele Dall'Arno, Giacomo Mauro D'Ariano, Chiara, Macchiavello, Paolo Perinotti
TL;DR
This paper demonstrates that degenerate quantum error correction codes can outperform nondegenerate codes under correlated noise, challenging existing bounds and highlighting the potential for more resource-efficient quantum error correction.
Contribution
It introduces a quantum packing bound for nondegenerate codes and shows that degenerate codes can surpass this bound in correlated noise scenarios.
Findings
Degenerate codes can violate the quantum packing bound.
Correlated noise allows degenerate codes to outperform nondegenerate codes.
The paper provides explicit examples of such outperformances.
Abstract
We introduce a quantum packing bound on the minimal resources required by nondegenerate error correction codes for any kind of noise. We prove that degenerate codes can outperform nondegenerate ones in the presence of correlated noise, by exhibiting examples where the quantum packing bound is violated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.