- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper investigates Grover-based quantum minimum finding for selecting layer-group learning-rate profiles during language-model fine-tuning. It combines the Dürr–Høyer minimum-finding algorithm with BBHT search, compares several termination criteria, and evaluates their behavior using classically precomputed loss tables and small-scale quantum hardware experiments. The intended motivation is to translate a quadratic reduction in search queries into lower learning-rate selection costs.
Critical strengths
No
Critical weaknesses
My main concern is that the paper does not establish a credible path from oracle-query savings to an end-to-end computational advantage. In the experiments, every candidate profile is evaluated classically to construct the score table, but this preprocessing cost is excluded from the quantum selection time, whereas the classical exhaustive baseline is charged for evaluating all candidates. Once these scores have been computed, the minimum can already be identified classically with negligible additional overhead relative to model evaluation. Consequently, the reported speedups do not demonstrate a practical advantage for the implemented workflow.
Questions for authors
-
How would the coherent quantum loss oracle be implemented, and how would its cost affect the reported speedup?
-
Would the reported speedup over classical exhaustive search remain if the cost of constructing the score table were included?