Average-case hardness under natural TDA input distributions
Determine whether any natural distribution over topological-data-analysis inputs makes Betti-number estimation hard on average for both classical and quantum algorithms.
References
Whether any natural distribution over inputs makes Betti-number estimation hard on average for classical and quantum algorithms alike has, to our knowledge, remained open.
A polynomial time quantum algorithm for Betti number estimation in the hard regime would render the conjecture false and the problems in section \ref{sec:implications} quantum-average-case easy, while remaining classical average-case hard. This remains an open problem.
Nevertheless, the main observation is that the average-case hardness we establish for the problem does not reach into this region. This is the interesting and non-trivial regime our reduction does not affect and the question of average-case quantum advantage remains open and plausible.
Whether homology vanishing of the clique complex itself is hard on average under any other natural distribution remains open.