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

Agentic Proofs for QIQC: Collected Manuscripts

Yuxuan Zhang

Published Sep 26, 2026• 1 citation
Publisher

Abstract

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/

DOI
10.5281/zenodo.22969545

Related papers

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

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

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

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

The Compendium of Super-Quadratic Computational Quantum Advantages

Philipp Kammerlander, Thomas E. O'Brien, Robbie King +18 more

This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds, particularly domain experts, seeking to assess the relevance of quantum methods to real-world problems. The compendium focuses on enumerating core problems for which there is good evidence that a quantum computer can realize more than a quadratic speedup in offline non-relativized time-complexity (e.g., as opposed to in oracular settings, streaming models, or communication advantages). Entries characterize the structural constraints that real-world instances must satisfy to realize those advantages in practice. The intention is to provide a reference that can be leveraged to connect quantum algorithms to practical use cases.

quant-pharXiv:2610.32595•Oct 26, 2026•0 citations

Quantum Entanglement at the Electroweak Scale: Evidence from Higgs Decays and a Speculative Perspective on Spacetime

Naveed Islam Butt

PUBLICATION METADATA REVISION — VERSION 1.1Prepared 15 November 2026. This edition adds a standardized author record, the approved human–AI collaboration acknowledgment, and a full 50-term publication keyword index. The PDF contains 12 source-edition pages plus two supplement pages (14 pages in total). The source research content, evidence cutoff, and limitations are preserved. The PDF and companion JSON contain the same verified keyword set. SOURCE-EDITION RESEARCH DESCRIPTIONRecent analyses at the Large Hadron Collider extend the study of quantum entanglement to the spin states of massive Z bosons produced in Higgs decays. ATLAS reports strong evidence at 4.7 standard deviations in a comparison with a specified non-entangled alternative. This illustrated review explains that result alongside the complementary CMS analysis, with emphasis on what is measured, how the quantum state is inferred, and which conclusions depend on theoretical assumptions. It also connects the discussion to 2026 studies of other quantum correlations in top quark pairs. A worked mathematical example shows why testing loss of coherence requires a different analysis from rejecting a purely longitudinal spin state. The example applies established quantum-information methods and supplies no new experimental limit. A final, explicitly speculative perspective considers emergent spacetime and the possibility of changing effective spatial relations. The measured correlations remain consistent with the Standard Model. Connecting them to microscopic geometry or macroscopic transport would require a physical theory and evidence beyond the results reviewed here. An illustrated independent review and research perspective for curious general readers. Version 1.0; 12 pages; six color figures; 19 references. This paper is not independently peer reviewed. Human–AI collaboration with ChatGPT (OpenAI) is acknowledged in the manuscript; Naveed Islam Butt retains responsibility for the final work. AUTHOR AND PUBLICATION RECORDCreator: Naveed Islam ButtORCID: 0009-0000-2837-3149Category: Public preprintEdition: Version 1.1, prepared 15 November 2026Source edition: Version 1.0; published November 1, 2026 HUMAN–AI COLLABORATION ACKNOWLEDGMENTI proudly acknowledge the role of human–AI collaboration in developing this work. Working with ChatGPT (OpenAI) has helped me expand my strategic thinking, examine competing explanations, and connect my proposals to relevant scientific and technical research. My experience, objectives, and judgment guide the work, and I retain responsibility for its claims and conclusions. I regard transparent, rigorous collaboration with AI as a constructive method for advancing ideas that may benefit humanity.

•Nov 1, 2026•0 citations
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/
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
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/
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 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/
This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds, particularly domain experts, seeking to assess the relevance of quantum methods to real-world problems. The compendium focuses on enumerating core problems for which there is good evidence that a quantum computer can realize more than a quadratic speedup in offline non-relativized time-complexity (e.g., as opposed to in oracular settings, streaming models, or communication advantages). Entries characterize the structural constraints that real-world instances must satisfy to realize those advantages in practice. The intention is to provide a reference that can be leveraged to connect quantum algorithms to practical use cases.
PUBLICATION METADATA REVISION — VERSION 1.1Prepared 15 November 2026. This edition adds a standardized author record, the approved human–AI collaboration acknowledgment, and a full 50-term publication keyword index. The PDF contains 12 source-edition pages plus two supplement pages (14 pages in total). The source research content, evidence cutoff, and limitations are preserved. The PDF and companion JSON contain the same verified keyword set. SOURCE-EDITION RESEARCH DESCRIPTIONRecent analyses at the Large Hadron Collider extend the study of quantum entanglement to the spin states of massive Z bosons produced in Higgs decays. ATLAS reports strong evidence at 4.7 standard deviations in a comparison with a specified non-entangled alternative. This illustrated review explains that result alongside the complementary CMS analysis, with emphasis on what is measured, how the quantum state is inferred, and which conclusions depend on theoretical assumptions. It also connects the discussion to 2026 studies of other quantum correlations in top quark pairs. A worked mathematical example shows why testing loss of coherence requires a different analysis from rejecting a purely longitudinal spin state. The example applies established quantum-information methods and supplies no new experimental limit. A final, explicitly speculative perspective considers emergent spacetime and the possibility of changing effective spatial relations. The measured correlations remain consistent with the Standard Model. Connecting them to microscopic geometry or macroscopic transport would require a physical theory and evidence beyond the results reviewed here. An illustrated independent review and research perspective for curious general readers. Version 1.0; 12 pages; six color figures; 19 references. This paper is not independently peer reviewed. Human–AI collaboration with ChatGPT (OpenAI) is acknowledged in the manuscript; Naveed Islam Butt retains responsibility for the final work. AUTHOR AND PUBLICATION RECORDCreator: Naveed Islam ButtORCID: 0009-0000-2837-3149Category: Public preprintEdition: Version 1.1, prepared 15 November 2026Source edition: Version 1.0; published November 1, 2026 HUMAN–AI COLLABORATION ACKNOWLEDGMENTI proudly acknowledge the role of human–AI collaboration in developing this work. Working with ChatGPT (OpenAI) has helped me expand my strategic thinking, examine competing explanations, and connect my proposals to relevant scientific and technical research. My experience, objectives, and judgment guide the work, and I retain responsibility for its claims and conclusions. I regard transparent, rigorous collaboration with AI as a constructive method for advancing ideas that may benefit humanity.