Entanglement-assisted quantum locally recoverable codes: bounds and constructions with availability

arXiv:2608.09886 · cs.IT, math.IT, quant-ph · Submitted 2026-08-10 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "Entanglement-assisted quantum locally recoverable codes".

Jane: Here's the gist of the paper. Entanglement-assisted quantum locally recoverable codes with availability allow for more flexible constructions than those relying on dual containment in CSS codes.

Tom: This work introduces (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t, which combine local recovery with the flexibility provided by shared entanglement.

Jane: The paper establishes a Singleton-like bound for this family of codes and presents both random and explicit constructions based on classical linear codes.

Tom: Defining the Code Family The authors define (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t as a code where any set of up to δ − 1 erased qudits can be recovered from one of t subsets of size at most r + δ − 1, each containing the erased qudits, and whose pairwise intersections are exactly the erased set.

Paper summary: Tom: So we're looking at this paper, "Entanglement-assisted quantum locally recoverable codes: bounds and constructions with availability." Basically, it’s about finding a way to make quantum data storage more flexible than what we usually see in classical codes.

Jane: What does that flexibility mean for us when we talk about these quantum systems? Is it just a slight tweak, or is this fundamentally different from what we thought was possible with local recovery?

Tom: It's more than a tweak; they define something called entanglement-assisted quantum locally recoverable codes with availability. They show that if you have shared entanglement, you can recover data even if some qubits are lost.

Lu: The core idea here is combining local recovery—where you only connect to a few nearby qubits—with the ability to use shared entanglement for better reconstruction capabilities. It moves beyond just having one way to fix an error when it happens locally <ref:2608.09886#pg1>.

Meng: But how does this translate to what I deal with in production? If you're deploying a system, does the required shared entanglement become a bottleneck for scaling up or maintaining availability?

Jane: That’s a big question, Meng. The paper sets up this structure where any set of up to delta minus one erased qubits can be recovered from t subsets of size at most r plus delta minus one.

Tom: See, the 't' is key here; it shows that shared entanglement actually permits you to have multiple local recovery sets available for the same set of erasures <ref:2608.09886#pg1>. This is a direct advantage over standard codes where you might only have one recovery path.

Lalam: From my perspective, this structure lets us use shared entanglement to relax the dual-containment constraints that were often required in classical constructions like CSS codes <ref:2608.09886#pg1>.

Jane: That’s what really matters for the freedom they get when choosing which underlying classical codes to build upon. What kind of bounds are they setting for these new codes?

Tom: They establish a Singleton-like bound, which is like a maximum capacity limit, and it depends on an entanglement parameter c <ref:2608.09886#pg3>. The bound looks like k less than or equal to n minus two times delta minus one less s1 less s2 plus some constant c.

Lu: That Singleton-like bound is important because it gives us a concrete limit on how much data we can pack into these codes, and that limit directly depends on the entanglement parameter c <ref:2608.09886#pg3>.

Meng: A bound is fine for theory, but what does this mean for real-world deployment? Are these constructions feasible to build using existing hardware or at least theoretical blueprints?

Jane: They provide both random and explicit constructions. For the random ones, they use classical linear codes like fiber product codes and Tamo–Barg codes <ref:2608.09886#pg1>.

Tom: And for the explicit constructions, they’re using things like Tamo–Barg codes on projective lines and one-point Hermitian and Suzuki codes <ref:2608.09886#pg1>. They are showing that you can build these quantum systems from several classical families and their folded versions.

Lu: It’s interesting because they show that entanglement-assisted codes can be built from any two classical LRC codes, even those that weren't dual-containing in the first place <ref:2608.09886#pg3>. This relaxes a major constraint from previous work <ref:2608.09886#pg3>.

Jane: So, what’s the bigger picture here? What does this mean for how we approach building quantum distributed storage systems?

Tom: It shows that entanglement allows for more flexible constructions than relying on dual containment in CSS codes <ref:2608.09886#pg1>. The parameter c essentially relaxes that constraint C sub zero less than or equal to C sub one, which gives us greater freedom in selecting our classical building blocks <ref:2608.09886#pg3>.

Meng: If we think about the cost of running these, does this flexibility translate into a smaller overhead for the actual quantum operations?

Lalam: The paper provides explicit examples of entanglement-assisted quantum locally recoverable codes with availability from several classical code families, and they summarize their basic parameters in Table two <ref:2608.09886#pg1>.

Jane: So, to wrap up this section, the main thing is that entanglement allows us to build codes with more flexibility than previously thought because of how it relaxes those constraints on classical codes. What are the implications for future research?

Tom: They've given us a Singleton-like bound for these codes and provided both random and explicit constructions based on classical linear codes <ref:2608.09886#pg1>. The next step is seeing how these bounds perform when we move from theory to actual experimental parameters.

Lu: I think the most important direction is exploring how this entanglement parameter c influences the achievable performance in real quantum memory systems, as they relate to future quantum data storage frameworks <ref:2608.09886#pg2>.

Meng: From an operational standpoint, I'm interested in what the practical limitations are for implementing these specific explicit constructions—the ones from Tamo–Barg codes and fiber-product codes <ref:2608.09886#pg1>.

Jane: We’ll get into those details next, but for now, the paper shows a solid mathematical framework where entanglement gives us the necessary leverage to design these systems more efficiently.

Conclusion: Tom: So we've looked at how entanglement helps us recover data when qubits get lost in these quantum codes.

Jane: Right, so this paper is about these specific codes called entanglement-assisted quantum locally recoverable codes with availability, and it's showing that they are way more flexible than some older methods.

Lu: Basically, the authors are defining a new structure where you combine local recovery—fixing problems nearby—with shared entanglement to make the overall system robust.

Meng: So what does this actually mean for building something real? Does it just mean we can pack more data in there?

Tom: It means they established a Singleton-like bound for these codes, which is a limit on how much data you can fit into the system, and that limit depends on an entanglement parameter called c.

Jane: The big point they are making is that because of this entanglement, you don't have to worry about certain strict rules about how the classical parts of the code overlap anymore.

Lu: They show that this entanglement parameter c relaxes a constraint called dual containment, which was a major roadblock for previous constructions using things like CSS codes.

Meng: So if we can relax those constraints, it gives us more freedom when picking which classical building blocks we use to construct the whole quantum code.

Tom: Exactly. They provide both random ways to build these codes and explicit constructions from specific algebraic geometry codes, showing they work with a bunch of different classical families.

Jane: It seems like entanglement is the lever that allows us to combine different types of classical coding structures in a way that wasn't possible before.

Lu: The paper summarizes all these explicit families and their basic parameters in a table, giving us concrete examples to look at.

Meng: So what's the immediate value for someone who just wants to deploy this on hardware? Is there anything practical they flag as hard?

Tom: They give you the bound, but now you have concrete blueprints from things like Tamo–Barg codes and fiber product codes. The next thing we need to look at is how these specific structures actually perform when we start testing them with real parameters.

Rutuja Kshirsagar, Gretchen L. Matthews, Julia Shapiro

Fujitsu Research of America, Inc. · Virginia Tech

cs.IT, math.IT, quant-ph

Submitted: 2026-08-10

Updated: 2026-11-10

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 90/100

The gist: Entanglement-assisted quantum locally recoverable codes with availability allow for more flexible constructions than those relying on dual containment in CSS codes.

Key concepts

(r, δ) EAQLRCs with availability t
These are quantum codes designed to recover erased qudits. They require any set of up to delta-1 erased qudits to be recovered from one of t subsets, where each subset has size at most r plus delta-1. The key is that the intersections between these recovery subsets must exactly match the erased set, linking local recovery with entanglement.
Singleton-like bound
This is a mathematical limit on how large a quantum code can be relative to its parameters. The bound provided, k ≤ n − 2(d − 1) − s1 − s2 + c, sets an upper limit on the code's size (k) based on the dimension (n), minimum distance (d), and entanglement parameter (c). It shows the structural constraints imposed by the entanglement.
Entanglement-assisted setting
This refers to a coding scheme where shared quantum entanglement is used to enhance recovery capabilities. Unlike standard codes that must satisfy strict dual containment rules, this setting relaxes those rules. This relaxation grants greater freedom when selecting classical linear codes for construction, as the entanglement parameter c plays a crucial role in this flexibility.

Terminology

Summary

Entanglement-assisted quantum locally recoverable codes with availability allow for more flexible constructions than those relying on dual containment in CSS codes. p. 2

Where the paper says it

The hull or relative hull of the underlying classical codes controls the entanglement consumption and therefore affects the resulting entanglement-assisted dimension. Compared with CSS-type constructions built from the same underlying classical data, the entanglement-assisted framework can allow more flexible parameter choices because it does not require dual containment.

This work introduces (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t, which combine local recovery with the flexibility provided by shared entanglement. p. 1
Where the paper says it

In this work, we introduce (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t, with the property that any set of δ − 1 qudits can be recovered from one of t subsets of size at most r+δ−1, each containing the erased qudits, and whose pairwise intersections are exactly the erased set. Such codes combine the advantages of local recovery with the flexibility provided by shared entanglement.

The paper establishes a Singleton-like bound for this family of codes and presents both random and explicit constructions based on classical linear codes. p. 0
Where the paper says it

We establish a Singleton-like bound for this family of codes and present random constructions based on classical linear codes with Vandermonde parity-check matrices. We also provide explicit constructions of entanglement-assisted quantum locally recoverable codes with availability from several classical code families and their folded versions, including Tamo– Barg codes, fiber-product codes, and algebraic-geometry codes such as one-point Hermitian and Suzuki codes.

Defining the Code Family

The authors define (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t as a code where any set of up to δ − 1 erased qudits can be recovered from one of t subsets of size at most r + δ − 1, each containing the erased qudits, and whose pairwise intersections are exactly the erased set. This structure combines local recovery with the flexibility provided by shared entanglement. p. 1

Where the paper says it

In this work, we introduce (r, δ) entanglement-assisted quantum locally recoverable codes (EAQLRCs) with availability t, with the property that any set of δ − 1 qudits can be recovered from one of t subsets of size at most r+δ−1, each containing the erased qudits, and whose pairwise intersections are exactly the erased set. Such codes combine the advantages of local recovery with the flexibility provided by shared entanglement.

Establishing Bounds

The paper establishes a Singleton-like bound for these codes. The bound is given by k ≤ n − 2(d − 1) − s1 − s2 + c. p. 9

Where the paper says it

The same work also generalizes the definition to recovery sets capable of correcting multiple erasures. Given ∅ ̸= I ⊊ J ⊆ [n], a quantum code Q ⊆ (C q ) ⊗n is said to be an (I, J) QLRC if there exists a trace-preserving quantum operation RJ Q,I , which acts only on the qudits corresponding to J and leaves all other qudits unchanged, such that RJ Q,I ◦ τI |φ⟩⟨φ| = |φ⟩⟨φ| , for all |φ⟩ ∈ Q.

This bound depends on the entanglement parameter c. p. 2
Where the paper says it

1] Table 1: Comparison of bounds on the dimension of QLRCs from the literature and the entanglement-assisted codes studied in this work. Here c = dim(C1)−dim(HullC2 (C1)) denotes the entanglement parameter (see Remark 2.

Random Constructions

The paper provides random constructions of EAQLRCs where the underlying codes are from several families of classical LRCs, including fiber product codes, Tamo–Barg codes, and Suzuki curves. A random EAQLRC can be constructed using a Vandermonde matrix similar to one constructed in [25]. p. 6

Where the paper says it

An entanglement-assisted code can be constructed using two classical codes as follows. Let C ′ , C ⊆ F n q be linear codes with parameters [n, k′ , d′ ] and [n, k, d], respectively.

Explicit Constructions from Algebraic Geometry

The paper provides explicit constructions of EAQLRCs from several classical code families and their folded versions, including Tamo–Barg codes, fiber-product codes, one-point Hermitian and Suzuki codes. These constructions are found in Section 5. p. 3

Where the paper says it

Section 3 introduces entanglement-assisted quantum locally recoverable codes, and Section 4 provides random constructions. Constructions derived from algebraic-geometry codes and curves over finite fields are found in Section 5.

Specializations to Curves

The paper constructs EAQLRCs from several families of algebraic-geometry codes over finite fields, including Tamo–Barg codes on the projective line, and more general fiber product constructions. These constructions yield explicit examples of EAQLRCs with availability. p. 7

Where the paper says it

In algebraic-geometry constructions, these recovery sets often arise from the geometry of the evaluation set, especially from fibers of suitable morphisms to auxiliary curves. We therefore review both the coding-theoretic definition of locality and the geometric setup that will later allow us to construct explicit families of EAQLRCs with availability.

Conclusion

The work concludes by summarizing the explicit EAQLRC families obtained above and their basic parameters in Table 2. The paper demonstrates that entanglement-assisted codes can be built from any two classical LRCs, including those that are not dual-containing. p. 1

Where the paper says it

Such codes combine the advantages of local recovery with the flexibility provided by shared entanglement. Consequently, one can build an EAQLRC from any two classical LRCs, including codes that are not dual-containing.

The results show that the entanglement parameter c relaxes the dual-containment constraint C⊥ ⊆ C1, which is not required in the entanglement-assisted setting and therefore gives greater freedom in the choice of LRCs. p. 3
Where the paper says it

case and the general (r, δ) bound from [25]. For t = 1 and c ≥ 0, our bound is a generalization of the other two Singleton bounds, applicable in the entanglement-assisted setting, where the c ebits relax the dual-containment constraint C ⊥ 2 ⊆ C1, which is not required in the entanglement-assisted setting and therefore gives greater freedom in the choice of LRCs.

The paper provides a Singleton-like bound for (r, δ) EAQLRCs with availability t. p. 3
Where the paper says it

In the entanglement-assisted quantum local recovery setting, we are able to provide a Singleton bound for (r, δ) EAQLRCs with availability t, whereas in the CSS setting previously considered, availability in this disjointrecovery-set sense is not possible. The remainder of this paper is organized as follows.

The remainder of the paper is organized as follows. p. 3
Where the paper says it

In the entanglement-assisted quantum local recovery setting, we are able to provide a Singleton bound for (r, δ) EAQLRCs with availability t, whereas in the CSS setting previously considered, availability in this disjointrecovery-set sense is not possible. The remainder of this paper is organized as follows.

The paper concludes with a summary and open problems in Section 6. p. 3
Where the paper says it

Constructions derived from algebraic-geometry codes and curves over finite fields are found in Section 5. The paper concludes with a summary and open problems in Section 6.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved AI systems can perform quantum error correction for data storage by implementing entanglement-assisted quantum locally recoverable codes with availability, allowing recovery of up to delta minus one erased qudits from a set of at most r plus delta minus one local recovery sets.

  2. The improved systems can utilize the Singleton-like bound for these codes to establish a trade-off among length, dimension, distance, locality, availability, and entanglement consumption with an upper bound on the logical dimension k.

  3. Explicit constructions based on classical codes such as Tamo-Barg codes or fiber product codes allow for the design of concrete entanglement-assisted quantum locally recoverable codes with availability from algebraic geometry.

Abstract

In this work, we define entanglement-assisted quantum locally recoverable codes with availability, in which any set of up to δ-1 erased qudits can be recovered from any one of t local recovery sets, each of size at most r+δ-1, with the recovery sets intersecting exactly in the erased coordinates, where r is a (small) positive integer. We show that shared entanglement permits t>1, meaning that multiple local recovery sets can be available for the same set of up to δ-1 erasures. We establish a Singleton-like bound for this family of codes and present random constructions based on classical linear codes with Vandermonde parity-check matrices. We also provide explicit constructions of entanglement-assisted quantum locally recoverable codes with availability from several classical code families and their folded versions, including Tamo-Barg codes, fiber-product codes, and algebraic-geometry codes such as one-point Hermitian and Suzuki codes.

Sources

Related papers