Complete written proofs and two exact replayable checker implementations classify all full-Schmidt-rank equality states without assuming stabilizer structure, classify every two-qudit pure stabilizer score at odd prime dimension, and determine the sharp pure-state ratio p/2 for every prime p congruent to 1 modulo 4. The general rank-deficient equality classification and the sharp ratio for primes congruent to 3 modulo 4, p at least 7, remain open in this record. This is an independently authored preprint with AI-assisted research and self-audit, not external professional peer review or a priority claim. The fixed immutable GitHub Release is https://github.com/mxym/math/releases/tag/ecqc-extremal-classification-v1. AI-assisted research and writing; no external funding. Existing licenses and third-party notices are retained.
Complete written proofs and two exact replayable checker implementations classify all full-Schmidt-rank equality states without assuming stabilizer structure, classify every two-qudit pure stabilizer score at odd prime dimension, and determine the sharp pure-state ratio p/2 for every prime p congruent to 1 modulo 4. The general rank-deficient equality classification and the sharp ratio for primes congruent to 3 modulo 4, p at least 7, remain open in this record. This is an independently authored preprint with AI-assisted research and self-audit, not external professional peer review or a priority claim. The fixed immutable GitHub Release is https://github.com/mxym/math/releases/tag/ecqc-extremal-classification-v1. AI-assisted research and writing; no external funding. Existing licenses and third-party notices are retained.
Complete written proof and exact checkers for the pure-state prime-dimensional ECQC question: it holds universally exactly at p=2; every odd prime has a full-Schmidt-rank pure-state counterexample; dimensions 3 and 5 attain the sharp pure-state ratios 3/2 and 5/2. The three-dimensional witness has a separate complete Lean proof, but the full prime-dimensional classification is not claimed Lean-complete. This record explicitly distinguishes prior mixed-state counterexamples and does not claim first priority. The fixed immutable GitHub Release is https://github.com/mxym/math/releases/tag/ecqc-pure-state-classification-v1. AI-assisted research and writing; no external funding. Existing licenses and third-party notices are retained.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
Unrefereed research candidate. Two results on complementary (mutually unbiased) measurements and the complementary quantum correlation (CQC) inequality of Schneeloch, Broadbent and Howell (2014), which proposed that the classical correlations in two complementary measurement tables never exceed the quantum mutual information. 1. Sharp qutrit discrimination. For every pair of complementary bases of a qutrit and every two orthogonal states, the triangular discrimination summed over the two bases is at most 8/3 (the trivial ceiling is 4), answering Qian, arXiv:2608.14806v2, Section 11(4). Every equality case is classified; for the computational and Fourier bases they are tied to the nine Hesse SIC rays. Consequences: choosing one of the two measurements at random recovers at most two thirds of the quantum Fisher information in a two-state estimation task, and Qian's two-ray qubit-qutrit family obeys CQC with margin at least 0.1005 nats. The proof is computer-assisted: an exact rational sum-of-squares certificate (scout_qutrit/exact_sos_certificate.json, 660,609 bytes, SHA-256 825bb8108096d38a44f63f1bc91964405d189ad57b5f568530b5d8e27d598c2f) checked by a standalone exact verifier; this deposit is the certificate's citable locator. 2. Every prescribed pair fails for a qubit and a qudit of dimension n ≥ 4. For every prescribed pair of complementary measurements on each side there is a separable state violating CQC, with a uniform certified margin below −9/20,000,000 nats (previously the every-pair statement was known only for n ≥ 164). A phase-averaging extension of the known shared-label mechanism covers every prescribed pair when both dimensions are at least three; an earlier, unchecked every-pair statement for equal dimensions by E. O'Connor is credited. Open: the full qubit-qutrit CQC question and the sharp constant in dimension 5 (numerics only). The margins are tiny and structural, not experimental. The archive contains the manuscript (PDF and LaTeX), the exact certificate and verifier, negative controls, an exact rational margin checker, numerical cross-checks, working proof notes, novelty audits, the bibliography with registry records, CI and SHA-256 sums. Assurance: computer-assisted exact rational arithmetic, not a formal proof; internal AI-assisted review only (not human peer review or independent reproduction). Creator: Anonymous. Text CC0-1.0; code MIT.
This preprint investigates when a qutrit offers no operational advantage over a qubit in prepare-and-measure scenarios involving three antipodal pairs of quantum states, fixed binary measurements, and no shared randomness. Previous results establish that two antipodal pairs cannot distinguish qutrits from qubits, whereas four pairs can. The case of three pairs remains open. This fourth note develops structural reductions, explicit equality constructions, and a conditional classification to clarify this boundary. The main contributions are: Finite-query and extremality reductions. We prove that four binary queries suffice to detect any separation involving three antipodal pairs. We show that extreme admissible measurements have at most one eigenvalue strictly inside (−1, 1), and that, for fixed average states, potential separating configurations can be reduced to extreme state pairs. A common-average-state theorem. We prove that when all antipodal pairs share the same average density matrix, every resulting correlation table satisfies the Euclidean factorization bound γ₂ ≤ 1, regardless of the number of pairs or queries. For at most three pairs, this guarantees qubit reproducibility. Two exact equality families. We construct genuinely three-dimensional qutrit configurations that reproduce entire qubit correlation ellipsoids. The first extends spin-1 coherent-state constructions through non-unitary transformations. The second uses state-pair planes sharing a common vector and yields an explicit five-dimensional Euclidean-ball representation for any number of pairs. A conditional structural classification. For three orthogonal pure pairs satisfying an additional algebraic singularity hypothesis, we prove that every configuration belongs, up to unitary equivalence, to an embedded-qubit configuration or one of the two equality families. The proof uses the classification of complex matrix spaces of bounded rank. Reproducible computational investigations. Preregistered numerical studies (B4f and B4g) explore possible three-pair separations, equality configurations, and candidate proof certificates. No separation was found. The studies also identify limitations of fixed-weight Hilbert–Schmidt factorizations and simple Gram-matrix constructions. Open questions. The general conjecture that three antipodal pairs never separate a qutrit from a qubit remains unproved. It is also unknown whether every equality configuration of three orthogonal pure pairs satisfies the algebraic hypothesis required for the classification theorem. Numerical observations are explicitly distinguished from rigorous results. The accompanying reproducibility archive contains symbolic verification scripts, numerical experiments, preregistration records, computational results, and SHA-256 manifests. This is the fourth preprint in a series investigating qubit–qutrit equivalence, separation, and quantum dimension witnesses. Previous preprints: https://doi.org/10.5281/zenodo.24093433 https://doi.org/10.5281/zenodo.24121836 https://doi.org/10.5281/zenodo.24130557 Status: Research preprint; not peer reviewed.
We report the stabilizer rank of the 8-qubit magic cat state |cat_8> (the magic-basis cat state of Qassim–Pashayan–Gosset, Quantum 5, 606 (2021)). Result. (i) Upper bound: chi(cat_8) <= 6, PROVEN exactly. An explicit rank-6 decomposition over 6-qubit-stabilizer-derived states is verified with sympy over Q(i): each candidate is checked to be a genuine stabilizer state by exact integer arithmetic (stabilizer group order exactly 2^n), target membership in the span is decided by exact rational rank, coefficients are produced exactly and the identity re-checked, and the whole decomposition is lifted back to 8 qubits and re-verified there. Reproduction: python3 verify.py ckpt_cat8_k6_cd.json (files bundled). (ii) Lower bound: chi(cat_8) >= 6, COMPUTATIONAL EVIDENCE, not a theorem. Two structurally independent searches over 5-tuples of stabilizer states — discrete pool coordinate descent (481 restarts, 30.9 core-hours) and continuous gradient descent with rounding (42 restarts, 1.99 core-hours) — both bottom out at 5-term residual 0.086664036 (9 hits each, never below, 523 restarts total) while both recover planted exact rank-5 witnesses at ~90% rate, calibrating the solvers against the exactness they fail to reach for cat_8. On this basis chi(cat_8)=6 is stated as a conjecture with a proven upper bound. Relation to Qassim–Pashayan–Gosset: their construction already implies chi(cat_8) <= 6; the present work adds the first explicit exact rank-6 decomposition of cat_8 and calibrated evidence against rank 5. The exponent log_2(6)/6 = 0.43083 does not improve their alpha = log_2(3)/4 = 0.39624; no published bound is improved and QPG's open questions remain open. The collapse-engine screen mandated by this machine's protocol was run on the continuation path (24-stage annealing path, one scale): read NULL (control -2.60 sigma = the flat-vector floor; permute gate ORDER-INVARIANT; counterfactual random walk reads identically). No claim in this record rests on it; the upper bound rests on the exact verification, the lower bound on search calibration. License: record CC-BY-4.0; bundled code additionally AGPL-3.0-or-later.