Continuous-Variable Quantum MacWilliams Identities
Ansgar G. Burchards
TL;DR
This work introduces continuous-variable weight distributions A(r) and B(r) and establishes a CV quantum MacWilliams identity that links them for any pair of trace-class operators. Using these tools, the authors derive a quantum analogue of the Cohn-Elkies sphere-packing bound and a CV Levenshtein bound, bounding code size K in terms of distance d and number of modes N under a displacement-noise model. They show that ideal GKP codes based on the E8 and Leech lattices achieve maximal distances under natural assumptions, highlighting a form of optimality for CV quantum codes in high-dimensional sphere-packings. The framework also connects weight distributions to entanglement fidelities and phase-space representations, offering a versatile set of methods for CV quantum error correction and potentially enabling SDP-based refinements in the future.
Abstract
We derive bounds on general quantum error correcting codes against the displacement noise channel. The bounds limit the distances attainable by codes and also apply in an approximate setting. Our main result is a quantum analogue of the classical Cohn-Elkies bound on sphere packing densities attainable in Euclidean space. We further derive a quantum version of Levenshtein's sphere packing bound and argue that Gottesman--Kitaev--Preskill (GKP) codes based on the $E_8$ and Leech lattices achieve optimal distances. The main technical tool is a continuous-variable version of the quantum MacWilliams identities, which we introduce. The identities relate a pair of weight distributions which can be obtained for any two trace-class operators. General properties of these weight distributions are discussed, along with several examples.
