We construct distributed encodings with matching upper and lower bounds on hidden message length, quantum communication, and initial quantum memory. Among n laboratories of fixed local dimension, orthogonal product states remain locally stable against every coalition of fixed maximum size. Above their exact minimum cardinality, a budget of R additional states permits at most O(log(R + 2)) hidden bits at vanishing leakage. Our family attains q = Θ(log R) against arbitrary-round block LOCC for R → ∞ and R = o(√n). Its message occupies one of G = Θ(√n/R) disjoint candidate subsystems. Recovery costs Θ(q) communicated qubits after the location is revealed, or Θ(Gq) initially stored qubits when resources are placed beforehand and subsequent quantum communication is unavailable. The storage bound allows arbitrary multipartite entanglement. Both lower bounds already apply to fixed-advantage prediction of any balanced message bit. Complete 98-page manuscript dated 26 October 2026, including the main text, Appendices A–M, and Supplementary Proofs, Parts I–VII. Author contributions (as stated in the manuscript): Yiming Liu is the sole author. AI tools assisted mathematical reasoning, bibliographic research, code and figure generation, drafting, and language editing.
We construct distributed encodings with matching upper and lower bounds on hidden message length, quantum communication, and initial quantum memory. Among n laboratories of fixed local dimension, orthogonal product states remain locally stable against every coalition of fixed maximum size. Above their exact minimum cardinality, a budget of R additional states permits at most O(log(R + 2)) hidden bits at vanishing leakage. Our family attains q = Θ(log R) against arbitrary-round block LOCC for R → ∞ and R = o(√n). Its message occupies one of G = Θ(√n/R) disjoint candidate subsystems. Recovery costs Θ(q) communicated qubits after the location is revealed, or Θ(Gq) initially stored qubits when resources are placed beforehand and subsequent quantum communication is unavailable. The storage bound allows arbitrary multipartite entanglement. Both lower bounds already apply to fixed-advantage prediction of any balanced message bit. Complete 98-page manuscript dated 26 October 2026, including the main text, Appendices A–M, and Supplementary Proofs, Parts I–VII. Author contributions (as stated in the manuscript): Yiming Liu is the sole author. AI tools assisted mathematical reasoning, bibliographic research, code and figure generation, drafting, and language editing.
Bounds for General (r,δ)-Quantum Locally Recoverable Codes
We study general (r,δ)-quantum locally recoverable codes (qLRCs) without assuming purity or a stabilizer structure, and with arbitrarily overlapping recovery blocks. Using a selection lemma for multiple-erasure recovery, we establish a Singleton-like upper bound for general quantum subspaces. When δ=2, this bound reduces to the general single-erasure bound of Golowich and Guruswami. An integer optimization yields an explicit remainder correction that tightens the bound by up to δ−2. For pure codes, local decoupling and entropy arguments extend the parameter bound of Galindo et al., originally obtained for pure stabilizer codes constructed from Euclidean or Hermitian dual-containing classical codes, to arbitrary pure quantum subspaces. We also remove the partition assumption from several existing pure-code bounds for disjoint recovery blocks and obtain a further remainder correction by optimizing the budget. Finally, we analyze three families attaining these bounds: pure codes with overlapping recovery blocks and d=δ, which exhibit both a strict improvement of the pure-code bound and simultaneous equality in the pure-code and general bounds; impure codes with disjoint recovery blocks attaining the general bound; and an existing family of pure codes with overlapping recovery blocks and d>δ, which simultaneously attains all these bounds.
Overview This preprint develops a finite-history framework for quantifying how coherently stored environment records reveal logical quantum information. Instead of considering only which error occurred, the analysis treats the full complementary environment channel associated with a labeled family of finite quantum-error histories. For two selected history labels, the leakage is expressed exactly through the numerical-range diameter of the compressed relative operator. This yields global finite-history compression bounds, a zero-leakage characterization equivalent to Knill–Laflamme scalarity, and lower and upper bounds for recovery by a single common channel. Main results For a balanced independent two-step dephasing model on one logical qubit encoded into two physical qubits, the paper solves the worst-case optimization over the full rank-two code Grassmannian: infV∈Gr(2,4)supϕ,ψLhist(V)=21. The transverse leakage is determined exactly by Ltr(η,t)=max{21,2η,41−η21+t}. All global minimizers are classified. Besides the parity-isoclinic orthogonal-axis family, the minimizer set contains a genuine non-isoclinic region characterized by 0<η≤41,ez=oz=0,∣e⋅o∣≤1−4η24η2. A universal quartic inequality needed for the all-code theorem is reduced analytically to an exact polynomial-positivity problem and closed using rational Bernstein-basis verification. Distributional stability On a fixed labeled history-operator family, the complementary channel, worst-parameter leakage, and all-code minimax value are Lipschitz-stable under changes of the history probability distribution. With dA(p,q)=[∑h(ph−qh)2]1/2, the minimax value satisfies ∣Λ(p)−Λ(q)∣≤2dA(p,q). Consequently, key quantitative implications of the balanced complete solution—including the minimax value, principal near-minimizer coordinate constraints, and a universal operational recovery lower bound—remain stable under nearby biased or correlated perturbations.
Classical locally recoverable codes, which permit highly efficient recovery from localized errors as well as global recovery from larger errors, provide some of the most useful codes for distributed data storage in practice. In this paper, we initiate the study of quantum locally recoverable codes (qLRCs). In the long term, like their classical counterparts, such qLRCs may be used for large-scale quantum data storage. Furthermore, our results have concrete implications for quantum LDPC codes, which are widely applicable to near-term quantum error-correction, as local recoverability is a weakening of the LDPC property.
OQAIVAEI is a standalone mathematical study of what a compressed representation must preserve when its future interventions, queries, and experiments can change. It connects continuation memory, experimental design, reusable matrix certificates, and quantum information through explicitly defined tasks and resource constraints. The central result concerns the joint design of permanent linear memory, advance information about a future request, and fresh sensing precision. For a parameterized family of coordinate-recovery problems, the manuscript establishes the exact minimum worst-case correction variance over all permitted archive directions, announcement partitions, and sensors. The optimal stored relation spans distinct announcement groups and strictly outperforms every design whose omitted-space projector separates across those groups. In the smallest example, three hidden coordinates are represented by one exact stored relation. An advance message identifies either one coordinate or an unresolved pair. Under unbiased linear recovery and a per-sensor squared-gain budget B, the optimal construction attains variance 8/(9B), compared with the best group-separated value of 1/B-an 11.11% reduction. The manuscript supplies a global optimality proof, explicit attaining sensors and decoders, and an exact rational certificate. Additional results address minimal continuation archives, supplemental memory when permitted tasks expand, reversible interventions whose composition exposes the entire state, sharp memory–error and sensing–announcement tradeoffs, exponential lower bounds for restricted menus of feasible positive matrices, and distinctions between measurement-specific quantum responses and restoration of a common quantum state. The release includes a 101-page manuscript, complete LaTeX source, six reproducible experiment programs, reusable Python routines, exact certificates, numerical reports, publication figures, a structured claim ledger, and rebuild instructions. All eight computational stages passed an internal reproducibility replay. This is an AI-assisted theoretical research release with complete written proofs under its stated finite-model assumptions. Established foundations are attributed in the manuscript. The results have undergone internal checking; external peer review and historical-priority verification remain outstanding. Made by Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
By incorporating the concept of locality into quantum information theory, quantum locally recoverable codes (qLRCs) have been proposed, motivated by their potential applications in large-scale quantum data storage and their relevance to quantum LDPC codes. Despite the progress in optimal quantum error-correcting codes (QECCs), optimal constructions of qLRCs remain largely unexplored, partly due to the fact that the existing bounds for qLRCs are not sufficiently tight. In this paper, we focus on pure qLRCs derived from the Hermitian construction. We provide several new bounds for pure qLRCs and demonstrate that they are tighter than previously known bounds. Moreover, we show that a variety of classical QECCs, including quantum Hamming codes, quantum GRM codes, and quantum Solomon-Stiffler codes, give rise to pure qLRCs with explicit parameters. Based on these constructions, we further identify many infinite families of optimal qLRCs with respect to different bounds, achieving code lengths much larger than those of known optimal qLRCs.