Puncturing Quantum Stabilizer Codes
Jaron Skovsted Gundersen, Ren\'e B{\o}dker Christensen, Markus Grassl, Petar Popovski, Rafa{\l} Wisniewski

TL;DR
This paper generalizes the puncturing technique for quantum stabilizer codes, enabling the construction of new codes with improved parameters and extending classical bounds to the quantum setting.
Contribution
It introduces a flexible puncturing method based on stabilizer matrices, allowing for new code constructions and a generalized proof of the Griesmer bound for quantum codes.
Findings
Constructed quantum codes with parameters exceeding previous bests
Developed a stabilizer matrix-based puncturing method
Extended the Griesmer bound to quantum stabilizer codes
Abstract
Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its generators. In this work, we generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed. We describe this puncturing by focusing on the stabilizer matrix containing the generators of the code. In this way, we are able to explicitly describe the stabilizer matrix of the punctured code given the stabilizer matrix of the original stabilizer code. The additional freedom in the procedure also opens up new ways to construct new codes from old, and we present several ways to utilize this for the search of codes with good or even optimal parameters. In particular, we use the construction to…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
