bibkey: lijiang2026highrank authors: Bikun Li; Liang Jiang year: 2026 title: “High-Rank Encoding Can Improve Approximate Quantum Error Correction” doi: null url: https://arxiv.org/abs/2609.00778v1 claim: “Exact optimality of this pair at fixed p > 0 remains open.” strata_touched:
- D5/S3/Quantum/Recovery/LiJiangPolarPairOptimalityRefutation license: citation-only triage: anchor
High-Rank Encoding Can Improve Approximate Quantum Error Correction
Verified locator
- URL: https://arxiv.org/abs/2609.00778v1 (version 1, the source record inspected).
- Scope: printed p. 17 immediately after Eq. S64 for the fixed-noise optimality statement; Eqs. 18–23 and S60 on printed pp. 16–17 for the definitions used by the repository refutation.
Bikun Li and Liang Jiang, arXiv:2609.00778v1, 1 September 2026, quant-ph. The source is this version, rather than an unverified later or journal text. Printed p. 17, immediately after Eq. S64, states:
Exact optimality of this pair at fixed p > 0 remains open.
The pair is , where Eq. S60 on printed p. 16 defines and . The inverse square root is the positive Gram square root followed by its inverse. The code space is in logical, auxiliary order; removes the right factor.
Eqs. 18–23 specify the actual noise. In the notation of the source module,
For and , Eq. 18 is . Eqs. 19 and 22 give , , and . Eq. 23 acts on every code matrix by
The optimization class in Eq. 13 comprises completely positive trace-nonincreasing encoders and decoders, with encoder Choi rank at most one for the rank-one optimum. The source uses input-first Choi order. For , its canonical-purification fidelity is the unrenormalized overlap . No output trace normalization is applied. The source admits ; the question at nonzero noise has and .
The module refutes the universal exact-optimality reading at , , . It preserves the actual noise and decoder and replaces one polar column by a strictly better feasible column. It does not determine the global rank-one optimum. The source’s optimal quadratic asymptotic coefficient in Eqs. S63–S64 and its high-rank advantage theorem are not refuted.
The preregistration is issue #13324.
Its bounded literature check of 5 October 2026 reports
not-found-in-searched-scope. It inspected the single citing paper
arXiv:2609.40203v1, whose single-channel convex iteration does not settle
this joint pair question, and the unrelated author paper arXiv:2609.17439.
Semantic Scholar was rate limited; nonindexed/private work and worldwide
priority remain unverified. This note attributes the question and source
definitions to Li and Jiang; the refutation is a repository result.