agentic research
A dated log of research on open problems, led by the author with AI assistance.
Over the last year I have watched AI systems go from fumbling textbook exercises to closing real gaps in research mathematics. The question I keep coming back to is how much of that carries into the problems I actually work on — quantum information, complexity, quantum many-body physics. The only honest way to find out is to run the experiment.
The manuscripts stay here as a public research log. Selected manuscripts are also archived on Zenodo so that a reader can retrieve and cite the exact version behind a claim. The archive provides a stable research record; external proof review and literature novelty remain separate questions.
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.
Most attempts do not close the problem. From 24 September 2026, new research entries are published only when they cover the complete original question and pass the project’s internal verification. Partial results and exploratory bounds stay in the local research log. Earlier entries retain their stated scope. Each public note records what was established and which checks, source questions, or external reviews remain outstanding.
The twenty-one archived manuscripts are collected in Agentic Proofs for QIQC: Collected Manuscripts, version 1.3 (16 October 2026). The archive index identifies each paper and its date; the website articles link to the corresponding QIQC reports. Version 1.3 adds the two-pass Chernoff counterexample, which refutes the universal measured-exponent equality while leaving the optimal unrestricted LOCC and SEP exponents unresolved. The twenty earlier manuscript PDFs and their source archive are unchanged. Each archived paper’s entry below links to its Zenodo record.
The 22 October 2026 release adds ten internally reviewed manuscripts on Gibbs preparation and mixing, shallow-circuit sampling, Gaussian entanglement, cooling, reflected entropy and an accepted-instance attack bound. Each has a full PDF and a source package with proof and checking records. These ten website papers are separate from the twenty-one archived manuscripts above.
The 26 October 2026 release adds M26 on large-order QAOA energy bounds and G02 on near-critical weak-field Ising Gibbs preparation. Both have complete candidate manuscripts, PDFs and source packages. Their current audit is sequential; independent review of the complete manuscripts and their novelty remains outstanding.
Log
- 27 October 2026 research note · proof candidateA small collective cooling advantage in a four-collision model Supplied problem P12 · Two thermal oscillators and at most four non-Gaussian collisions A finite-budget proof candidate comparing normalized collective and independent couplings, with its explicit protocol, proof outline and verification limits.
- 26 October 2026 proof candidate · sequential reviewPolynomial critical-distance bounds for weak-field Ising Gibbs preparation G02 · Actual mixed Gibbs-state preparation on square tori A proof candidate with a polynomial transverse-field window and explicit near-linear-volume preparation costs approaching the classical critical point. · PDF
- 26 October 2026 proof candidate · sequential reviewQAOA energy bounds at large interaction order M26 · Large odd interaction order, deterministic instance-independent QAOA angles A proof candidate for the large odd-order fixed-depth Gaussian obstruction, with a logarithmic-depth bound in the signed sparse model. · PDF
- 22 October 2026 proof candidateCertified global heat optimality of two full swaps for a qutrit cooling task The specified two-collision qutrit task, gap range, exact target and work budget Two full swaps attain the exact two-collision optimum, against arbitrary allowed unitaries and classical randomization. · PDF
- 22 October 2026 proof candidateSingle-exponential temperature cost for one-dimensional Gibbs preparation The implementation gap in Rouzé–Stilck França, Remark 3.12 A fully charged implementation of recursive QBP preparation with exp(Cx³) temperature overhead, near-linear system size, and explicit input-bit costs. · PDF
- 22 October 2026 proof candidateRapid dissipative preparation of weakly interacting real band insulators Real gapped fermionic band insulators with weak even interactions A volume-independent weak-interaction threshold and logarithmic mixing for a fixed energy-lowering dissipator with a filled negative band. · PDF
- 22 October 2026 proof candidateGeometric convergence of an exact randomized two-excitation cooling channel Exact random-time two-excitation cooling from the specified thermal initial state A full infinite-dimensional trace-distance bound for the specified random-time cooling channel, including initial-state tails and work accounting. · PDF
- 22 October 2026 proof candidateA rigorous success regime for the Radical Attack under uniform accepted-instance sampling Radical Attack success for the exact uniform accepted block-matrix ensemble An explicit failure-probability bound that accounts for acceptance bias and constrained code full support. · PDF
- 22 October 2026 proof candidatePolynomial-time sampling from peaked shallow quantum circuits with arbitrary connectivity Sampling peaked fixed-depth circuits with arbitrary connectivity Global L1 control and a polynomially normalized positive proposal turn peaked-circuit probability estimates into a bounded-time sampler. · PDF
- 22 October 2026 proof candidateGaussian entanglement of formation for one mode versus finitely many modes Entanglement of formation of generic finite one-mode versus many-mode Gaussian states A rank-two saturation witness reduces finite one-versus-many Gaussian formation to an extractable two-mode affine bound. · PDF
- 22 October 2026 counterexampleClassical counterexamples to monotonicity of noninteger Rényi reflected entropy Universal monotonicity of finite noninteger Rényi reflected entropy Actual classical probability laws and ordinary partial traces violate monotonicity at every finite noninteger order above one. · PDF
- 22 October 2026 proof candidateLogarithmic mixing of a Gaussian KMS sampler for weakly interacting hopping fermions Weakly interacting hopping fermions and the specified Gaussian KMS generator Logarithmic mixing at each fixed finite temperature for the prescribed sampler, retaining its coherent correction and physical-site couplings. · PDF
- 22 October 2026 proof candidateA certified memory advantage in four-collision non-Gaussian cooling Retained memory versus all allowed reset schedules at total time 4/5 One feasible retained-memory protocol beats a certified lower bound for every reset schedule at the same four-collision budget. · PDF
- 16 October 2026 counterexampleTwo-pass local measurements beat the measured Chernoff exponent Copywise Chernoff exponents — universal measured-exponent equality An explicit faithful four-dimensional counterexample: revisiting locally stored qubits strictly improves the asymptotic error exponent over every fixed single-copy measurement. · PDF · Zenodo archive
- 12 October 2026 proof candidateUniform single-copy tomography of fermionic Gaussian states Rubin Conjecture 10.1 (source-defined follow-up) A complete proof candidate for spectrum-uniform cubic sample complexity, including pure modes and pairing, resolving Rubin's Conjecture 10.1. · PDF
- 1 October 2026 proof candidateHeisenberg-scaling sparse Hamiltonian learning with a fixed minimum query duration QIQCOP problem op_30954594cf01ebb3 A complete proof candidate for learning unknown sparse Pauli interactions at inverse-linear precision cost when every evolution call has a fixed minimum duration. · PDF
- 29 September 2026 proof candidateAn exponential strong converse for general mixed-state quantum compression QIQCOP problem op_c9b532d3a7389c77 Below the full Koashi–Imoto entropy, every quantum compression code has exponentially vanishing reference-preserving fidelity. · PDF
- 28 September 2026 solved (negative)No six-qubit distance-three code admits a transversal T gate QIQCOP problem op_ddfbbe7ca0ead0c8 An arbitrary-angle reduction and exact exhaustive certificate exclude six qubits, matching the known seven-qubit construction. · PDF · Zenodo archive
- 28 September 2026 solved (negative)The spectral gap of random Pauli rotations on four qubits is 1/15 QIQCOP problem op_aaf9791beced84e4 A Clifford-invariant eigenvector in Λ⁸ℂ¹⁶ mixes more slowly than the conjectured fourth-moment mode, and a known lower bound then fixes the gap exactly. · PDF · Zenodo archive
- 28 September 2026 solved (negative)Eight-copy universal CCZ concentration beyond the two-thirds candidate optimum QIQCOP problem op_bc61eaba5c332fec An explicit catalyst-free stabilizer protocol turns eight copies of any unknown pure qubit into an exact CCZ state with probability m₃, not the candidate optimum (2/3)m₃. · PDF · Zenodo archive
- 28 September 2026 solved (negative)CGLMP measurements need not maximize statistical strength QIQCOP problem op_a34f0e2d6489068f A four-dimensional counterexample on the fixed maximally entangled state, with an exact separation exceeding 0.022 bits. · PDF · Zenodo archive
- 27 September 2026 proof candidateAdditivity of minimum output Rényi entropy can fail first at three copies QIQCOP problem op_c0b1045a614d2353 A complete proof candidate gives an explicit channel whose minimum output Rényi entropy is additive for one and two copies but strictly subadditive for three. · PDF · Zenodo archive
- 26 September 2026 proof candidateThird-level Clifford-hierarchy gates on at most six qubits are semi-Clifford QIQCOP problem op_5a17b19b8adeb191 A complete proof candidate shows that every third-level gate on at most six qubits is semi-Clifford, so the smallest non-semi-Clifford third-level gate acts on seven qubits. · PDF · Zenodo archive
- 24 September 2026 counterexample candidatePurifying an unknown qubit with stabilizer operations QIQCOP problem op_a64dc63d6ae49127 A five-copy deterministic protocol improves every pure qubit at a specified noise level, refuting the arbitrary-copy no-go equality. · PDF · Zenodo archive
- 24 September 2026 proof candidateThe high-dimensional crossover of optimized port-based teleportation QIQCOP problem op_25342dbb8d64e728 A complete proof candidate gives the joint-limit fidelity for every fixed ratio of ports to dimension squared. · PDF · Zenodo archive
- 24 September 2026 proof candidateA finite certificate for Gaussian attainment of the Holevo bound QIQCOP problem op_8f1853475db7ea27 A complete proof candidate characterizes equality for arbitrary faithful Gaussian models and constructs an attaining measurement. · PDF · Zenodo archive
- 22 September 2026 proof candidatePolynomial-time local-unitary equivalence of graph states QIQCOP problem op_66affd4b198fd445 A complete edge-change space connects incidence compression to the graph-state LU decision problem. · PDF · Zenodo archive
- 21 September 2026 solved (negative)The optimal check weight of an [[11,3,3]] stabilizer code is five QIQCOP problem op_458e9e86ccbddccb No eight weight-four generators exist, closing the one entry the low-weight-codes table leaves open at k=3, d=3. · PDF · Zenodo archive
- 21 September 2026 proof candidateOptimal precision dependence of low-energy Hamiltonian simulation QIQCOP problem op_25d9dee5435ea835 Matching query bounds improve the intermediate-regime precision dependence for exact factor access and clean-output vector error. · PDF · Zenodo archive
- 20 September 2026 solved (negative)A fourth-level non-semi-Clifford gate on two qudits QIQCOP problem op_cdd1f718ccfbccf6 An explicit counterexample in every odd prime dimension, with an algebraic proof and exact reproducible checks. · PDF · Zenodo archive
- 20 September 2026 counterexample candidateFixed-photon-number codes and a proposed pure-loss converse QIQCOP problem op_89fb664ba06ba5de A zero-leakage shell-code construction exceeds the proposed occupation-constrained second-order upper bound. · PDF · Zenodo archive
- 20 September 2026 proof candidateUniversality from every fixed non-Gaussian polynomial generator QIQCOP problem op_64046727b81b4024 Gaussian controls and any fixed essentially self-adjoint higher-degree Weyl polynomial strongly approximate every unitary. · PDF · Zenodo archive
- 20 September 2026 proof candidateAnticoncentration of independent complex Gaussian hafnians QIQCOP problem op_55be40726cdf7304 An all-dimension inverse-variance bound gives polynomial lower-tail control for the independent complex symmetric ensemble. · PDF · Zenodo archive
- 16 September 2026 solved (negative)A qutrit semigroup can lose mixed unitarity after a positive time QIQCOP problem op_722706a9205dcff2 An explicit analytic counterexample, with exact membership at one positive time and a separating witness at a later time. · PDF · Zenodo archive
- 16 September 2026 proof candidateConvergence of the JRF iteration for mixed-state discrimination QIQCOP problem op_76e284219621a785 An analytic proof candidate for convergence of the uniformly initialized iteration, including rank-deficient states and overlapping supports. · PDF · Zenodo archive
- 14 September 2026 partially solvedMulti-slot virtual channel conjugation QIQCOP problem op_06e9f0c7b3b62f3b An exact signed simulation of the conjugate of an unknown channel, a closed formula for the state subcase, and certified adaptive advantage at three slots. · PDF
- 12 September 2026 solved (negative)The ordinary Petz recovery bound fails for three qubits QIQC ordinary-Petz recovery bound for conditional mutual information An explicit rank-two counterexample, with a rational-arithmetic certificate and independent numerical verification. · PDF · Zenodo archive
- 8 August 2026 partially solved (unverified)A dimension-free lower bound on γ₃ NPT bound-entanglement distillability, 3-copy endpoint An 8.65% improvement over the published constant — prover round only, not yet adversarially checked. · PDF
- 20 June 2026 partially solvedSong–Chen Conjecture 2 at n = 4 — the uniform case Conjecture 2 of arXiv:2603.25410 A complete proof for uniform weights; the general case reduced to a finite linear program. · PDF
- 17 June 2026 improvedRepairing the linearization radius in shadow estimation Chen–Li–Liu, arXiv:2407.13874 A published lemma that does not close as printed, and the bound that fixes it. · PDF
- 17 June 2026 solved (negative)Open Problem 1 of Alhejji–Knill is false Section VI, question 1 of Alhejji–Knill, arXiv:2307.06894 An exact diagonal counterexample, with a complete all-word proof and minimal dimension three. · PDF · Zenodo archive
If you think one of these is wrong, I would like to know — that is rather the point of putting them somewhere public instead of on arXiv. Write to zhangyx@comp.nus.edu.sg.