- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper investigates the design of sampling circuits for SQDs, employing particle-number-preserving fixed-angle Givens rotations, predefined "bricks," and "stop actions." An actor-critic approach is used to search for gate sequences, with the final SQD energy and the number of operations serving as the reward.
Critical strengths
There is a sound rationale for evaluating circuit architectures using SQD results rather than simply optimizing VQE expectation values. The set of particle-number-preserving gates also facilitates the interpretation of the circuit's physical constraints.
Table 2 reports the hardware results, and Table 5 lists the corresponding job identifiers; the authors also explicitly acknowledge limitations regarding small-space saturation, classical recovery, single-spin-sector sampling, and stretched geometry. Seed-specific ablation data are available for verification.
Critical weaknesses
In the ablation study on pages 7–8, both the learning strategy and the unguided search yielded circuits with 24 logic gates and 48 CZ gates, all reaching the maximum depth limit. Consequently, this set of experiments did not demonstrate a reduction in gate count through learning; the length penalty remained constant across these runs.
Page 9 explicitly acknowledges that the maximum spatial dimension is only 14,400, comparable to the sample budget of 30,000, and that uniform sector sampling can also recover the FCI result after configuration recovery. While the authors have recognized this issue, it implies that the near-FCI energies reported in Table 1 do not prove that a more valuable subspace was learned.
Questions for authors
When both sets achieve chemical accuracy and share the same length, can learning reduce the number of reward evaluations needed to reach the target or improve the success rate on difficult instances?
How do single-brick, fixed-brick (with limited rotation), random, greedy, and beam search strategies compare under the same budget? The existing ADAPT-QSCI method, which explores the adaptive construction of QSCI input states, should also serve as a relevant baseline.
What are the training time, number of samples, number of SQD solver calls, and validation costs per molecule and per geometry? How much subsequent usage is required to amortize the search costs?
What specific cost does the length-based reward optimize? A single "brick" may involve multiple rotations yet counts as only one action, while all episodes in the large search space reach the 24-step limit. Does the compactness stem from the reward function, the depth limit, or the hand-crafted action set?