Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.
Quantum Hamiltonian Complexity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
citing papers explorer
-
Fine-Tuning Small Reasoning Models for Quantum Field Theory
Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.