arXiv (OAI Expanded)
open access
Alphabet-Dependent Bounds for Pure Quantum $(r,ρ)$-Locally Recoverable Codes
A quantum $(r,ρ)$-locally recoverable code ($(r,ρ)$-qLRC) is a quantum code in which every qudit can be recovered from at most $r+ρ-1$ other qudits, even after $ρ-1$ additional erasures inside the recovery set. The bounds currently known for this class, namely the Singleton-like and the GG Singleton
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Alphabet-Dependent Bounds for Pure Quantum $(r,ρ)$-Locally Recoverable Codes#792900
- Universality Sacrifices Reliability in Classical-Quantum Channel Coding#1157212
- Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes#792834
- Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes#788830
- Learning to Concatenate Quantum Codes#19031
Record · ID 788896
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive