arXiv:2505.06659 · Journal of Mathematical Physics

Structure theorem for quantum replacer codes

Eric Chitambar, Sarah Hagen, David W. Kribs, Mike I. Nelson, Andrew Nemec

Published Dec 1, 2025• 0 citations

Abstract

Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the erasures of subsets of qubits that arise in quantum error correction. We prove a structure theorem for such codes that synthesizes a variety of special cases with earlier theoretical work in quantum error correction. We present several examples and applications of the theorem, including a mix of new observations and results together with some subclasses of codes revisited from this new perspective.

DOI: 10.1063/5.0280149

Related papers

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

arXiv:quant-ph/9705052May 28, 1997753 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

May 28, 19971,237 citations

Quantum error correction on infinite-dimensional Hilbert spaces

Cédric Bény, Achim Kempf, David W. Kribs

We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. We find that, under relatively mild conditions, much of the structure known from systems in finite-dimensional Hilbert spaces carries straightforwardly over to infinite dimensions. We also find that, at least in principle, there exist qualitatively new classes of quantum error correcting codes that have no finite-dimensional counterparts. We begin with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. The new classes of codes that arise in infinite dimensions are shown to be characterized by von Neumann algebras of types II and III, for which we give in-principle physical examples.

arXiv:0811.0421Journal of Mathematical PhysicsJun 1, 200920 citations

A Code for Correcting Quantum Erasures

G. Santos, Francisco de Assis, Adriana Silva Lima

Quantum states are very delicate, so quantum error-correction procedures are believed to be essential for the successful implementation of quantum communications or computations.To erroneous qubits where the position is known, Grassl et al. [Phys.Rev. A 56, 33 (1997)] proposed an error model which they called quantum erasure channel.In this paper we present a quantum code capable of protecting nqubit of information against the occurrence of t erasures.This code is based on GHZ states.

International Telecommunications Symposium (ITS)Jan 1, 20100 citations

Unified and Generalized Approach to Entanglement-Assisted Quantum Error Correction

Priya J. Nadkarni, Serge Adonsou, Guillaume Dauphinais +2 more

We introduce a framework for entanglement-assisted quantum error correcting codes that unifies the three original frameworks for such codes called EAQEC, EAOQEC, and EACQ under a single umbrella. The unification is arrived at by viewing entanglement-assisted codes from the operator algebra quantum error correction perspective, and it is built upon a recently established extension of the stabilizer formalism to that setting. We denote the framework by EAOAQEC, and we prove a general error correction theorem for such codes, derived from the algebraic perspective, that generalizes each of the earlier results. This leads us to a natural notion of distance for such codes, and we derive a number of distance results for subclasses of the codes. We show how EACQ codes form a proper subclass of the entanglement-assisted subspace codes defined by EAOAQEC. We identify and construct new classes of entanglement-assisted subsystem codes and entanglement-assisted hybrid classical-quantum codes that are found outside of the earlier approaches.

arXiv:2411.14389IEEE Transactions on Quantum EngineeringJan 1, 20260 citations

Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information

Luis Colmenárez, S. Kim, Markus Müller

Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss of qubits at known positions. Correcting either type of error involves different correction mechanisms, which makes studying the interplay between erasure and computational errors particularly challenging. In this work, we propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes, for treating both types of errors together. We show how to rigorously derive different families of statistical mechanics mappings for generic stabilizer QEC codes in the presence of both types of errors. We observe that the erasure errors enter as a classical average over fully depolarizing channels. Further, we show that computing the CI for erasure errors only can be done efficiently upon sampling over erasure configurations. We then test our approach on the two-dimensional toric and color codes and compute optimal thresholds for erasure errors only, finding a 50 % threshold for both codes. This strengthens the notion that both codes share the same optimal thresholds. When considering both computational and erasure errors, the CI of small-size codes yields thresholds in very accurate agreement with established results that have been obtained in the thermodynamic limit. Next, we perform a similar analysis for a low-density parity-check (LDPC) code—the lift-connected surface code. We find a 50 % threshold under erasure errors alone and, for the first time, derive the exact statistical mechanics mappings in the presence of both computational and erasure errors. We thereby further establish the CI as a practical tool for studying optimal thresholds for code classes beyond topological codes under realistic noise, and as a means for uncovering new relations between QEC codes and statistical physics models.

PRX QuantumNov 7, 20253 citations