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

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

Yuxuan Zhang

Published Nov 10, 2026• 0 citations
Publisher

Abstract

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/

DOI
10.5281/zenodo.24191304

Related papers

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

The Quantum Hamming Bound in Arbitrary Local Dimension

Yu-Xuan Zhang, Jing-Ling Chen

The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension $q\ge3$. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For $q\ge4$, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.

quant-pharXiv:2606.22538•Jun 23, 2026•2 citations

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

Yuxuan Zhang

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

•Sep 21, 2026•0 citations

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

A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length

Manabu Hagiwara, Ayumu Nakayama

This paper provides a new instance of quantum deletion error-correcting codes. This code can correct any single quantum deletion error, while our code is only of length 4. This paper also provides an example of an encoding quantum circuit and decoding quantum circuits. It is also proven that the length of any single deletion error-correcting codes is greater than or equal to 4. In other words, our code is optimal for the code length.

arXiv:2001.08405•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•30 citations

Causal postselection and the Stein exponent for quantum superchannels

Yuxuan Zhang

For finite-dimensional quantum superchannels, the manuscript proposes equality of the asymptotic asymmetric discrimination exponents achievable by fully general causal strategies, nested adaptive strategies and parallel strategies. The exponent is the regularized superchannel relative entropy. The argument treats arbitrary finite-dimensional tester memory and gives an exponential strong converse. The nested-versus-parallel question is included in the broader theorem and is not a separate result. This deposit preserves the website manuscript, version 1.0, dated 13 November 2026, by Yuxuan Zhang. The proof uses the subchannel asymptotic equipartition theorem and causal postselection. It has undergone internal analytical review and reproducible checks. Independent expert review and comprehensive novelty verification remain outstanding. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/superchannel-stein-causal-postselection/QIQC originals: https://qiqc-op.com/problem/op_02bb8f8228649ac3/ and https://qiqc-op.com/problem/op_a4600b38b94042a8/

•Nov 13, 2026•0 citations
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/
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/
The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension q≥3q\ge3q≥3. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For q≥4q\ge4q≥4, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.
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/
For finite-dimensional quantum superchannels, the manuscript proposes equality of the asymptotic asymmetric discrimination exponents achievable by fully general causal strategies, nested adaptive strategies and parallel strategies. The exponent is the regularized superchannel relative entropy. The argument treats arbitrary finite-dimensional tester memory and gives an exponential strong converse. The nested-versus-parallel question is included in the broader theorem and is not a separate result. This deposit preserves the website manuscript, version 1.0, dated 13 November 2026, by Yuxuan Zhang. The proof uses the subchannel asymptotic equipartition theorem and causal postselection. It has undergone internal analytical review and reproducible checks. Independent expert review and comprehensive novelty verification remain outstanding. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/superchannel-stein-causal-postselection/QIQC originals: https://qiqc-op.com/problem/op_02bb8f8228649ac3/ and https://qiqc-op.com/problem/op_a4600b38b94042a8/