Puncturing Quantum Stabilizer Codes

Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code. The additional freedom in the procedure also opens up for new ways to construct new codes from old, and we present several ways to utilize this in the search for codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known and which are better than what general puncturing guarantees. Lastly, the freedom in our puncture procedure allowed us to generalize the proof of the Griesmer bound from the classical setting to stabilizer codes for qudits of prime dimension since the proof relies heavily on the puncturing technique.

Authors

Institutions

Publication Details

Journal
IEEE Journal on Selected Areas in Information Theory
Published
2025-01-01
DOI
https://doi.org/10.1109/jsait.2025.3562287
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Puncturing Quantum Stabilizer Codes

René Bødker Christensen, Markus Grassl, Rafał Wiśniewski, Petar Popovski et al.
1 citations
IEEE Journal on Selected Areas in Information Theory
Quantum Computing Algorithms and Architecture
2.48
article

Puncturing Quantum Stabilizer Codes

René Bødker Christensen, Markus Grassl, Rafał Wiśniewski, Petar Popovski, Jaron Skovsted Gundersen
article en
1 citations

Abstract

Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code. The additional freedom in the procedure also opens up for new ways to construct new codes from old, and we present several ways to utilize this in the search for codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known and which are better than what general puncturing guarantees. Lastly, the freedom in our puncture procedure allowed us to generalize the proof of the Griesmer bound from the classical setting to stabilizer codes for qudits of prime dimension since the proof relies heavily on the puncturing technique.

IEEE Journal on Selected Areas in Information TheoryVol. 6
University of Gdańsk (PL), Aalborg University (DK)
Villum Fonden, Poul Due Jensens Fond (Grundfos Foundation), National Research Foundation, Danmarks Grundforskningsfond
Openalex Percentile: Top 11%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Puncturing Quantum Stabilizer Codes — René Bødker Christensen, Markus Grassl, et al. · IEEE Journal on Selected Areas in Information Theory (2025) | TGRS Research Map | TGRS