Classical Hardness of Learning Functions of Hamiltonians
The paper proves that learning two specific types of Hamiltonian function problems—fcos and fexp—efficiently using classical randomized methods implies that factoring random RSA moduli is hard in the average case. This means if you could efficiently learn these functions, you could factor large numbers quickly, which contradicts current assumptions about factoring hardness.