Scalar compressions and asymptotically optimal tough error models
Research manuscript on the tough-error-model problem in the QIQCOP Zoo (op_b1b41f737f9b4aeb). For arbitrary e-dimensional complex linear error spaces on C^n, the manuscript gives max{1, floor((n+1)/(e^2+1))} <= c(e,n) <= ceil(n/(e^2+1)), with explicit error spaces attaining the upper bound. The endpoints differ by at most one, covering the original question's asymptotically matching-bounds alternative. Some exact finite values remain open.The proposed new ingredient is a variational scalar-compression bound for arbitrary operator systems. The explicit upper models use inherited frame and block-rank constructions, with attribution in the manuscript.Status: complete asymptotic proof candidate with sequential internal analytical review and exact finite computational controls. Independent proof review and comprehensive novelty assessment remain pending. AI-assisted derivation, literature work, computation and drafting were carried out under human direction.Version 1.1 adds the user-confirmed author line to the website review version 1.0; the mathematical content is unchanged. The source archive includes the full manuscript and reproducibility checks.
Authors
- Yuxuan Zhang
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24207863
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- preprint