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/
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/
Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time T, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal 1/ε scaling in total evolution time for any arbitrary constant minimum evolution time T. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.
This preprint studies learning an unknown bounded-degree n-qubit Hamiltonian in a known Pauli basis from independent copies of a single-temperature Gibbs state. For fixed locality, interaction degree and fixed positive rational inverse temperature and coefficient bound, it gives a polynomial-resource algorithm using product single-qubit Pauli measurements, without geometry, a gap, correlation decay or a minimum nonzero coefficient. The output has rational coefficients, support inside the true support and total coefficient error at most the requested tolerance with the stated success probability. The temperature-dependent exponents are extremely large; the result is asymptotic. The refinement certificate is formalized in Lean conditionally on explicit analytic inputs. Initialization, iteration, solver, sampling and full resource bounds remain paper proofs. A companion source note preserves the separate hidden-Majorana discussion and its open calibration problem; it is not a proof of that broader learner. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.
We study Hamiltonian learning for k-local Hamiltonians at large step size, using only forward time evolution at integer multiples of a fixed time interval. For this task, our new technique, which we call eigenphase engineering, achieves Heisenberg-limited learning with a step size that is optimal up to logarithmic factors. For an unknown s-sparse Hamiltonian with fixed locality k and ∥H∥op≤Λ, our algorithm recovers its Pauli coefficients to ℓ2 error ε in total evolution time O(s/ε), matching the best known scaling while allowing a near-maximal step size Θ(1/Λ). As an independent contribution, we strengthen the evolution-time lower bound to Ωk(s1−1/(2k)/ε), placing our algorithm within a factor O(s1/(2k)) of being optimal. Eigenphase engineering departs from approaches based on dynamical approximation or iteratively canceling the unknown Hamiltonian. It encodes energy expectation differences in the perturbative response of eigenphases of the actual controlled evolution, then extracts them through phase estimation and high-order extrapolation. This avoids the need for polynomially shorter evolution steps as the target precision improves. A version using only single-qubit operations retains the same step size with a n overhead in ℓ2 learning time for n qubits. The method also enables tolerant Hamiltonian certification and estimation of a specified Pauli coefficient, the latter without locality or sparsity assumptions. These results establish eigenphase engineering as a versatile approach to extracting Hamiltonian information with infrequent control.
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 consider the problems of testing and learning an unknown n -qubit quantum Hamiltonian H =∑ x λ x σ x expressed in its Pauli basis, from queries to its evolution operator e − iHt under the normalized Frobenius norm. To this end, we prove the following results (with and without quantum memory) for Hamiltonians whose Pauli spectrum involves only k -local terms or has sparsity at most s : (1) Local Hamiltonians : We give a tolerant testing protocol to decide if a Hamiltonian is ε 1 -close to k -local or ε 2 -far from k -local, with O (1/(ε 2 −ε 1 ) 4 ) queries, thereby solving two open questions posed in a recent work by Bluhm, Caro and Oufkir [BCO’24]. For learning a k -local Hamiltonian up to error ε, we give a protocol with query complexity and total time evolution exp( O ( k 2 + k log(1/ε))). Our algorithm leverages the non-commutative Bohnenblust-Hille inequality in order to get a complexity independent of n . (2) Sparse Hamiltonians : We give a protocol for testing whether a Hamiltonian is ε 1 -close to being s -sparse or ε 2 -far from being s -sparse, with O ( s 6 /(ε 2 2 −ε 1 2 ) 6 ) queries. For learning up to error ε, we show that O ( s 4 /ε 8 ) queries suffices. (3) Learning without quantum memory : The learning results stated above have no dependence on the system size n , but require n -qubit quantum memory. We give subroutines that allow us to reproduce all the above learning results without quantum memory; increasing the query complexity by a (log n )-factor in the local case and an n -factor in the sparse case. (4) Testing without quantum memory : We give a new subroutine called Pauli hashing , which allows one to tolerantly test s -sparse Hamiltonians using Õ( s 14 /(ε 2 2 −ε 1 2 ) 18 ) query complexity. A key ingredient is showing that s -sparse Pauli channels can be tested in a tolerant fashion as being ε 1 -close to being s -sparse or ε 2 -far under the diamond norm, using Õ( s 2 /(ε 2 −ε 1 ) 6 ) queries via Pauli hashing. In order to prove these results, we prove new structural theorems for local Hamiltonians, sparse Pauli channels and sparse Hamiltonians. We complement our learning algorithms with lower bounds that are polynomially weaker. Furthermore, our algorithms use short time evolutions and do not assume prior knowledge of the terms on which the Pauli spectrum is supported on, i.e., we do not require prior knowledge about the support of the Hamiltonian terms.
We give quantum algorithms for Hamiltonian simulation, linear differential equations, and linear systems with square-root dependence on sparsity. For an s-sparse Hermitian matrix with row and column Euclidean norms bounded by η, evolution for time t to error ε uses O(sτ+sτlog(1/ε)+log(1/ε)) queries, where τ=η∣t∣. The same bound holds for time-dependent Hamiltonians with coherent time-indexed sparse access and certified time discretisation. Our construction combines an exact entrywise representation with Cayley transducers. A joint lower bound nearly matches the time, sparsity, and precision dependence, ruling out a uniformly additive bound in sτ and log(1/ε). For dissipative linear differential equations we obtain O(gˉ[s(τ+τ)+1]log(Cgˉ/ε)) queries, where τ is the evolution time multiplied by a norm bound, gˉ bounds the ratio of combined input and source norms to the final-solution norm, and C is an absolute constant. We sharpen this bound by separating Hamiltonian and dissipative components, and treat general constant generators. Lower bounds capture joint parameter dependence for time-dependent equations and precision hardness for constant positive semidefinite dissipation. For linear systems, a Cayley walk and Chebyshev filter give O(κslog(1/ε)) queries when ∥A∥≤1 and ∥A−1∥≤κ, and we give an alternative proof of a matching joint lower bound. We also give gate-efficient implementations of time-independent Hamiltonian simulation and the dissipative ODE solver, including Lipschitz time dependence, retaining the query bounds with polylogarithmic overhead in inverse precision given efficient entry decoding, arithmetic, and required source preparations.