arXiv:2609.23316
Simultaneous Reduction of Observables and Measured Qudits in Entanglement-Assisted Quantum Local Recovery
Ryutaroh Matsumoto
Abstract
For a general entanglement-assisted or unassisted quantum error-correcting code, a set of erasures, and an associated repair group, we propose a linear algebraic procedure to compute a reduced set of observables and a reduced repair group of codeword qudits for correcting the given erasures. The procedure has cubic complexity in the repair group size and the computed set of observables has the smallest possible size for correcting the given erasures. We specialize the general procedure to quantum codes constructed from Euclidean and Hermitian orthogonality, and provide closed-form upper bounds on the size of reduced repair groups for those special cases. Based on these closed-form bounds, we propose quantum counterparts of the information locality of classical local recovery.
AI Summary
The paper studies simultaneous reduction of the number of measured observables and the number of codeword qudits accessed during local erasure recovery. It extends procedures previously available for Hermitian dual-containing stabilizer codes to general finite-field-linear stabilizer codes, with or without entanglement assistance, including CSS codes with distinct constituent codes. Given an erasure set $I$, a valid repair group $K$, and a defining space $C\subseteq\mathbf F_q^{2n}$, the procedure decomposes the shortened check space into components supported on $I$, outside $I$, and across both. A greedy paired-column rank test selects helper qudits whose two symplectic coordinates can be eliminated by adding checks supported outside $I$. Assuming a basis of $\sigma_K(C^{\perp s})$ is precomputed, this takes $O(|K|^3)$ field operations. The resulting observables attain the minimum check-space dimension $\dim\pi_I(C^{\perp s})$, while their codeword support satisfies $|J|\leq |K|-|P|$. Rank-nullity and puncturing–shortening duality yield closed-form bounds: for CSS-type constructions, $|J|-|I|\leq\dim\pi_K(C_X+C_Z)-\dim\sigma_I(\pi_K(C_X+C_Z))$; for Hermitian constructions, $|J|-|I|\leq\dim_{q^2}\pi_K(D)-\dim_{q^2}\sigma_I(D^{\perp h}\cap D)$. These motivate definitions of quantum information locality. The greedy selection is order-dependent and need not maximize $|P|$; matroid parity can maximize it in $O(|K|^4)$. Even this need not minimize $|J|$, as an explicit five-qubit example shows. Finding a smallest repair group is shown NP-hard via reduction from classical minimum distance. Codeword-support bounds exclude decoder-held entanglement halves.
The paper title and Appendix \ref{app:A} were generated using generative AI based on preliminary drafts of this paper.
Central claim may not hold: The abstract's cubic runtime claim omits the theorem's assumption that a basis of the shortened dual space for the supplied repair group has already been computed. The abstract advertises general quantum error-correcting codes, whereas the construction and proofs cover codes represented by F_q-linear symplectic spaces. The claimed unrestricted minimum number of correction observables is false: for the permitted code |0>_1 tensor |psi>_2 with qubit 1 erased, the formula gives one observable although replacement with |0> corrects the erasure without measurement.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- This is a continuation of arXiv:2608.04403