Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The optimal check weight of an [[11,3,3]] stabilizer code is five

Yuxuan Zhang

Published Sep 21, 2026• 0 citations
Publisher

Abstract

The manuscript excludes eight independent commuting Pauli generators of weight at most four for an [[11,3,3]] qubit stabilizer code, including degenerate and non-CSS codes. The published weight-five construction supplies the matching upper bound. The main PDF contains the cluster proof; the separate round-37 archive contains an alternative incidence-profile proof and its checker. This deposit identifies and preserves the manuscript reporting the result. It is an AI-assisted, unrefereed research manuscript. Archival publication does not establish novelty, external proof validation, or QIQC catalog acceptance. Archival version: 1.0. Manuscript date: 21 September 2026. The manuscript and source files are unchanged from the website snapshot taken on 25 September 2026. Background references are listed separately in the manuscript bibliography. Website: https://yuxuanzhang1995.github.io/agentic-research/lowweight-11-3-3/QIQC report: https://github.com/Naixu-Guo/quantum-open-problems/issues/110

DOI
10.5281/zenodo.22968592

Related papers

Agentic Proofs for QIQC: Collected Manuscripts

Yuxuan Zhang

A versioned collection of twenty-one distinct AI-assisted research manuscripts on quantum information and quantum computation. Each manuscript is supplied as a separate PDF, identified by title, author, date, scope, website and QIQC report in README.md and MANUSCRIPTS.json. Sources for manuscripts 1–20 remain in sources-and-verification.zip; the new Chernoff manuscript's source and checking records are in chernoff-two-pass-source.zip. Collection version 1.3, 16 October 2026. This version adds Yuxuan Zhang, Two-pass local measurements beat the measured Chernoff exponent, manuscript version 1.0, 16 October 2026, 10 pages, file chernoff-two-pass.pdf. Theorem 1 gives faithful noncommuting four-dimensional states and a two-pass copywise LOCC counterexample to the universal equality in Eq. (4): the measured Chernoff exponent is below 0.677144, while the displayed protocol's exact exponent exceeds 0.68250256. The optimal unrestricted LOCC and SEP exponents, convergence of their optimal exponent sequences, and possible equality between the two classes remain unresolved. All twenty earlier manuscript PDFs and the earlier source archive are unchanged. Human and AI contributions. The author set the research directions, designed the harness that coordinated model tasks, tools, memory, and checking, supplied physical and mathematical intuitions and proof skeletons, and guided the development and revision of the research ideas. AI models developed detailed candidate arguments and derivations, searched the literature, wrote and ran computational checks, and drafted and revised the manuscripts under this supervision. This is an independently authored collection, not an official publication of the QIQC catalog. Archival publication does not establish novelty, external proof validation or catalog acceptance. Individual verification qualifications remain in each manuscript and index. Background references are distinguished from the manuscripts reporting the results. Withdrawn partial results and research logs are excluded. The eleven-qubit manuscript retains its individual DOI, 10.5281/zenodo.22968593. Prefer that individual DOI when citing that manuscript alone. Research website: https://yuxuanzhang1995.github.io/agentic-research/

•Sep 26, 2026•1 citation

Nineteen qubits are necessary and sufficient for symmetric quantum codes correcting two errors

Yuxuan Zhang

We determine the minimum length of a two-dimensional code in the fully symmetric subspace of qubits that corrects arbitrary errors on two qubits. The manuscript excludes every length at most eighteen, including complex and degenerate codes, and combines the lower bound with the existing nineteen-qubit construction of Aydin, Alekseyev and Barg. The new boundary claim is the exclusion at length eighteen; the shorter-length scalar bounds are attributed to previous work. This deposit preserves the website manuscript, version 1.0, dated 10 November 2026, by Yuxuan Zhang. Internal analytical review, exact certificates and a fresh-context same-model audit are available; independent expert verification and exhaustive priority confirmation have not been completed. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/symmetric-two-error-code-length/QIQC original: https://qiqc-op.com/problem/op_a72722e455d85d55/

•Nov 10, 2026•0 citations

Heisenberg-scaling sparse Hamiltonian learning with a fixed minimum query duration

Yuxuan Zhang

The manuscript gives a proposed learning algorithm for an unknown polynomially sparse Pauli Hamiltonian of operator norm at most one, using only forward evolution queries whose durations are all at least a fixed positive constant T. It obtains maximum coefficient error epsilon with constant success probability and total evolution time polynomial in the qubit number and sparsity, divided by epsilon, up to logarithmic factors. Circuit and classical processing costs are polynomial; constants may depend on T. The construction uses a two-time residual inverse and does not assume controlled access to, or the inverse of, the unknown evolution. This deposit preserves the website manuscript, version 1.0, dated 1 October 2026, by Yuxuan Zhang. It is a complete proof candidate with internal review and supporting checks; independent expert verification and exhaustive priority confirmation remain outstanding. Website and supporting material: https://yuxuanzhang1995.github.io/agentic-research/fixed-duration-hamiltonian-learning/QIQC original: https://qiqc-op.com/problem/op_30954594cf01ebb3/

•Oct 1, 2026•0 citations

One ebit is necessary and sufficient for the elegant joint measurement

Yuxuan Zhang

We determine the exact pure-state entanglement cost of deterministic LOCC implementation of the elegant joint measurement, with classical outcome output. The lower bound applies to arbitrary finite Schmidt rank and is matched by the one-ebit teleportation protocol. This deposit preserves the website manuscript, version 1.0, dated 9 November 2026. Author: Yuxuan Zhang (no affiliation listed). The manuscript is a complete proof candidate, with internal analytical review and a fresh-context same-model audit; it has not received independent expert or formal verification. No claim of confirmed priority is made. Website manuscript and supporting material: https://yuxuanzhang1995.github.io/agentic-research/elegant-joint-measurement-cost/QIQC original: https://qiqc-op.com/problem/op_d40d1f65b5aaaefd/

•Nov 9, 2026•0 citations

Theory of low-weight quantum codes

Fuchuan Wei, Zhengyi Han, Austin Yubo He +2 more

Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is $\mathsf{NP}$-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with $n\le9$. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.

quant-pharXiv:2601.19848•Jan 28, 2026•3 citations

Toward a Microscopic Mechanism for Pauli Exclusion: A State-Selective Repulsive Wall Between Identical Solitons in a Nonlinear Medium

Thomas Riedel

Manuscript submitted to Atoms (MDPI) on 30 September 2026 (manuscript atoms-4632260), with all code and data needed to reproduce its numerical results. Files: the manuscript (PDF, version 3.9), its LaTeX source with the ten figures (pauli_exclusion_wall_atoms_submission.zip), the supplementary material File S1 (pauli_exclusion_wall_supplementary.zip: the two-dimensional Q-ball scripts P1, P1b/P1c, P2 and P4 with their machine-readable outputs; the three-dimensional isorotating-cell analysis scripts and run reports, including the free-amplitude finite-element solver; the fully three-dimensional fixed-isospin pair relaxation; and the two-triad relaxation solver and reports, in phase to 3200 steps and out of phase to 4000 steps), and README.md, which describes the contents. The isorotating-cell technical note that the paper cites is a separate record, doi:10.5281/zenodo.23036586. This version completes the file set of the record first published on 30 September 2026, whose first version lacked the supplementary archive.

•Sep 30, 2026•1 citation
The manuscript excludes eight independent commuting Pauli generators of weight at most four for an [[11,3,3]] qubit stabilizer code, including degenerate and non-CSS codes. The published weight-five construction supplies the matching upper bound. The main PDF contains the cluster proof; the separate round-37 archive contains an alternative incidence-profile proof and its checker. This deposit identifies and preserves the manuscript reporting the result. It is an AI-assisted, unrefereed research manuscript. Archival publication does not establish novelty, external proof validation, or QIQC catalog acceptance. Archival version: 1.0. Manuscript date: 21 September 2026. The manuscript and source files are unchanged from the website snapshot taken on 25 September 2026. Background references are listed separately in the manuscript bibliography. Website: https://yuxuanzhang1995.github.io/agentic-research/lowweight-11-3-3/QIQC report: https://github.com/Naixu-Guo/quantum-open-problems/issues/110
A versioned collection of twenty-one distinct AI-assisted research manuscripts on quantum information and quantum computation. Each manuscript is supplied as a separate PDF, identified by title, author, date, scope, website and QIQC report in README.md and MANUSCRIPTS.json. Sources for manuscripts 1–20 remain in sources-and-verification.zip; the new Chernoff manuscript's source and checking records are in chernoff-two-pass-source.zip. Collection version 1.3, 16 October 2026. This version adds Yuxuan Zhang, Two-pass local measurements beat the measured Chernoff exponent, manuscript version 1.0, 16 October 2026, 10 pages, file chernoff-two-pass.pdf. Theorem 1 gives faithful noncommuting four-dimensional states and a two-pass copywise LOCC counterexample to the universal equality in Eq. (4): the measured Chernoff exponent is below 0.677144, while the displayed protocol's exact exponent exceeds 0.68250256. The optimal unrestricted LOCC and SEP exponents, convergence of their optimal exponent sequences, and possible equality between the two classes remain unresolved. All twenty earlier manuscript PDFs and the earlier source archive are unchanged. Human and AI contributions. The author set the research directions, designed the harness that coordinated model tasks, tools, memory, and checking, supplied physical and mathematical intuitions and proof skeletons, and guided the development and revision of the research ideas. AI models developed detailed candidate arguments and derivations, searched the literature, wrote and ran computational checks, and drafted and revised the manuscripts under this supervision. This is an independently authored collection, not an official publication of the QIQC catalog. Archival publication does not establish novelty, external proof validation or catalog acceptance. Individual verification qualifications remain in each manuscript and index. Background references are distinguished from the manuscripts reporting the results. Withdrawn partial results and research logs are excluded. The eleven-qubit manuscript retains its individual DOI, 10.5281/zenodo.22968593. Prefer that individual DOI when citing that manuscript alone. Research website: https://yuxuanzhang1995.github.io/agentic-research/
We determine the minimum length of a two-dimensional code in the fully symmetric subspace of qubits that corrects arbitrary errors on two qubits. The manuscript excludes every length at most eighteen, including complex and degenerate codes, and combines the lower bound with the existing nineteen-qubit construction of Aydin, Alekseyev and Barg. The new boundary claim is the exclusion at length eighteen; the shorter-length scalar bounds are attributed to previous work. This deposit preserves the website manuscript, version 1.0, dated 10 November 2026, by Yuxuan Zhang. Internal analytical review, exact certificates and a fresh-context same-model audit are available; independent expert verification and exhaustive priority confirmation have not been completed. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/symmetric-two-error-code-length/QIQC original: https://qiqc-op.com/problem/op_a72722e455d85d55/
The manuscript gives a proposed learning algorithm for an unknown polynomially sparse Pauli Hamiltonian of operator norm at most one, using only forward evolution queries whose durations are all at least a fixed positive constant T. It obtains maximum coefficient error epsilon with constant success probability and total evolution time polynomial in the qubit number and sparsity, divided by epsilon, up to logarithmic factors. Circuit and classical processing costs are polynomial; constants may depend on T. The construction uses a two-time residual inverse and does not assume controlled access to, or the inverse of, the unknown evolution. This deposit preserves the website manuscript, version 1.0, dated 1 October 2026, by Yuxuan Zhang. It is a complete proof candidate with internal review and supporting checks; independent expert verification and exhaustive priority confirmation remain outstanding. Website and supporting material: https://yuxuanzhang1995.github.io/agentic-research/fixed-duration-hamiltonian-learning/QIQC original: https://qiqc-op.com/problem/op_30954594cf01ebb3/
We determine the exact pure-state entanglement cost of deterministic LOCC implementation of the elegant joint measurement, with classical outcome output. The lower bound applies to arbitrary finite Schmidt rank and is matched by the one-ebit teleportation protocol. This deposit preserves the website manuscript, version 1.0, dated 9 November 2026. Author: Yuxuan Zhang (no affiliation listed). The manuscript is a complete proof candidate, with internal analytical review and a fresh-context same-model audit; it has not received independent expert or formal verification. No claim of confirmed priority is made. Website manuscript and supporting material: https://yuxuanzhang1995.github.io/agentic-research/elegant-joint-measurement-cost/QIQC original: https://qiqc-op.com/problem/op_d40d1f65b5aaaefd/
Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is NP\mathsf{NP}NP-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with n≤9n\le9n≤9. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.
Manuscript submitted to Atoms (MDPI) on 30 September 2026 (manuscript atoms-4632260), with all code and data needed to reproduce its numerical results. Files: the manuscript (PDF, version 3.9), its LaTeX source with the ten figures (pauli_exclusion_wall_atoms_submission.zip), the supplementary material File S1 (pauli_exclusion_wall_supplementary.zip: the two-dimensional Q-ball scripts P1, P1b/P1c, P2 and P4 with their machine-readable outputs; the three-dimensional isorotating-cell analysis scripts and run reports, including the free-amplitude finite-element solver; the fully three-dimensional fixed-isospin pair relaxation; and the two-triad relaxation solver and reports, in phase to 3200 steps and out of phase to 4000 steps), and README.md, which describes the contents. The isorotating-cell technical note that the paper cites is a separate record, doi:10.5281/zenodo.23036586. This version completes the file set of the record first published on 30 September 2026, whose first version lacked the supplementary archive.