arXiv:2609.36273
Puncturing for Adaptive Entanglement-Assisted Stabilizer Codes
Nicolai Peder Bülow Pedersen, Jakob Kaltoft Søndergaard, Jaron Skovsted Gundersen, René Bødker Christensen, Petar Popovski
Abstract
Quantum error-correcting codes are essential for reliable quantum communication. The achievable parameters can be improved by using entanglement-assisted stabilizers at the cost of consuming pre-shared Bell pairs. If the availability of such Bell pairs is intermittent, the ability to adapt the code to available resources is beneficial. That is, to pick a single mother code that can be adapted to different entanglement budgets. To achieve this, we extend an existing puncturing construction for standard/unassisted stabilizers to the entanglement-assisted setting through a three-step procedure: Interpreting the code as an unassisted stabilizer, puncturing a receiver-side qubit, and recovering an entanglement-assisted representation. This procedure reduces the number of required Bell pairs by one while preserving the number of transmitted and logical qubits. We derive a bound on the resulting distance loss and establish conditions for preserving the original code distance. Finally, we analyse distinct, randomly generated, entanglement-assisted stabilizers with five to eight transmitted qubits. Of these codes, 14.75% have a greater distance than their associated unassisted representations. Among this subset, 81.4% admit at least one puncturing choice that preserves the original entanglement-assisted distance. These results illustrate how puncturing can reduce entanglement requirements while maintaining code distance.
AI Summary
The paper asks how a single entanglement-assisted stabilizer code can accommodate fluctuating availability of pre-shared Bell pairs without changing its transmitted block length or logical dimension. It extends an existing stabilizer-puncturing construction by treating the joint sender–receiver stabilizer as unassisted, puncturing a receiver-side qubit, and recovering an entanglement-assisted representation. The construction maps $[[n,k,d;c]]$ to $[[n,k,d_p;c-1]]$: one symplectic pair becomes an isotropic generator, replacing one entanglement resource with a local ancilla. If the joint unassisted code has distance $d'$, the distance satisfies $d'-1\leq d_p\leq d$, so the loss is bounded by $d-d_p\leq(d-d')+1$. A sufficient distance-preservation criterion excludes low-weight joint logical operators that could become channel-only logical errors after puncturing. These results follow from the stabilizer’s symplectic structure and tracking logical operators through the transformations. A numerical study evaluates 9,999 distinct randomly generated codes with five to eight transmitted qubits, covering 79,437 single-pair puncturing choices. Distance is preserved in 64.4% of choices; fewer than 4% lose more than one unit. Among the 14.75% of codes whose entanglement-assisted distance exceeds their joint unassisted distance, 81.4% admit a distance-preserving choice. The analysis assumes noiseless receiver-side qubits and joint unassisted distance at least two. The numerical results concern small random codes rather than scalable families. Imperfect Bell pairs, logical-error performance under combined memory and channel noise, and general efficient encoder/decoder updates remain unaddressed; the construction does not guarantee optimal codes for each entanglement budget.
Error found: Algorithm 1 is incorrect as printed because it omits the pivot-row additions required by the puncturing definition and does not enforce the constraint on the additional centralizer rows. For the displayed [[5,1,3;2]] example, puncturing receiver qubit 6 with respect to X gives distance two, contradicting the claim that this choice attains a distance loss of two.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.