- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies critical-path membership prediction on quantum circuit DAGs, examining how task-relevant structural information and its propagation affect predictive performance. Building on the dependence of critical-path membership on forward depth, reverse depth, and graph-level longest-path length, the paper decomposes the prediction problem into within-graph ranking and threshold calibration. It investigates the relationship between information availability and predictive performance through input augmentation under a fixed architecture and comparisons of different propagation mechanisms. For the node-wise MLP, supplying the graph-level longest-path length increases standard-test F1 from 0.573 to 0.826, and additionally providing exact reverse depth raises it to 0.974; the corresponding depth-shift results are 0.518, 0.581, and 0.846. DAGNN and a graph Transformer with structural encodings achieve strong performance under depth shift, illustrating the influence of structural inputs and propagation mechanisms on this quantum circuit DAG prediction task.
Critical strengths
- The information-intervention design provides a focused assessment of structural inputs for critical-path prediction on quantum circuit DAGs while controlling model architecture and parameter count. Compared with aggregate performance comparisons across architectures, retaining the MLP backbone and using parameter-matched projection modules allows the incremental effects of graph-level longest-path length and exact reverse depth to be evaluated under more consistent model conditions. The graph-length broadcast experiment on GAT further shows that this input intervention also benefits a message-passing model. These controls improve the interpretability of the observed input-augmentation effects on this task.
- The ranking-equivalence analysis establishes a precise distinction between reverse-depth estimation accuracy and critical-path discrimination. Under the analyzed linear estimator, adding estimated reverse depth to forward depth provides no additional within-graph ranking information; a high regression R² therefore does not imply a stronger ability to distinguish critical nodes. The experiments corroborate this phenomenon, extending the evaluation of intermediate statistics beyond regression error and explaining the discrepancy between regression and discrimination performance on this task.
Critical weaknesses
-
In Section 5.3, the improvement obtained by broadcasting the graph-level longest-path length to GAT does not establish that the original model’s critical-path prediction errors arise from a failure to acquire graph-level information. The increase in standard-test F1 from 0.814 to 0.909 shows that explicitly supplying this statistic is beneficial, but the gain could also result from reduced computational difficulty, improved optimization, or a simpler readout. The interpretation that message passing fails to make graph-level length available to node representations therefore requires evidence distinguishing these explanations. Similarly, the ranking invariance of a fixed scoring function to a within-graph constant does not directly predict the behavior of a network retrained with that constant as an input. This gap weakens the paper’s central interpretation of information-acquisition mechanisms.
-
The DAGNN comparison in Section 5.5 and the Perceiver comparison in Section 5.7 vary several performance-relevant factors simultaneously, preventing the contribution of a particular information pathway from being isolated. In addition to full-graph topological propagation, DAGNN changes the directional channels and update mechanism, while its sampling and auxiliary-supervision settings also affect the acquisition of graph-level information. Perceiver receives a compressed node-level structural bias, whereas the graph Transformer retains pairwise structural biases. Consequently, the DAGNN advantage and the Perceiver degradation cannot be attributed specifically to topological propagation and latent routing, respectively. These comparisons primarily establish performance differences between particular configurations and provide insufficient control for the proposed pathway-level diagnosis.
-
The paper does not sufficiently establish its contribution specific to quantum circuits or the scope of the proposed diagnostic analysis. The unweighted critical-path criterion and its structural decomposition also apply to general DAGs, and the required statistics can be computed by linear-time dynamic programming. Performance gains from supplying exact structural information therefore do not, by themselves, establish additional diagnostic value over existing work on DAG representation learning. Moreover, the main mechanistic analysis is confined to critical-path node classification, and the deeper-circuit evaluation uses the same data-generation procedure as training, without validation on other structural prediction tasks or graphs from different sources. The evidence thus leaves the broader applicability of the conclusions unresolved and does not adequately explain how structural properties specific to quantum circuits affect those conclusions.
Questions for authors
- Section 5.3 reports that broadcasting the graph-level longest-path length to GAT increases standard-test F1 from 0.814 to 0.909 and uses this result to discuss whether message passing makes graph-level information available to node representations. How can this improvement distinguish information absent from the original representations from information that becomes easier to compute or read out when explicitly supplied? Could you provide representation analyses or intervention experiments that directly examine this distinction?
- In Section 5.5, DAGNN achieves an F1 of 0.956 on the depth-shift test set, but differs from the local models in propagation range, directional channels, update mechanism, and training settings. Could more targeted comparisons clarify which factors account for this advantage? For the Perceiver in Section 5.7, could you test whether the degradation persists when more complete pairwise structural information is preserved?
- The paper treats graph-level longest-path length as calibration information beyond what is required for within-graph ranking, but the input-augmentation experiments retrain the entire network. Please clarify what predictions the theoretical decomposition makes for F1 and AUPRC after retraining, and which empirical observations cannot be directly explained by the ranking invariance of a fixed scoring function.
- What is the specific connection between the critical-path task studied here and quantum circuits? Similar DAG representations and critical paths also arise in combinational logic circuits and general computational graphs. Which structural properties of quantum circuits materially affect the experimental design and model behavior? Compared with conducting analogous experiments on general DAGs, what additional insight does this study provide for learning on quantum circuits?
2 comments
Thank you for your response, and for acknowledging the limitations I pointed out in my review. Based on the discussion above, I have decided to maintain my original rating.
Thank you for the detailed and technically careful review. We largely agree.
On Section 5.3, the GAT broadcast gain alone does not distinguish absent information from easier readout. The depth-gain diagnostic in Appendix F (slope −0.17 for GAT-L4, versus roughly −1 for a model holding per-circuit L⋆) and the cone-coverage analysis are suggestive but not decisive.
On fixed versus retrained scoring, Appendix A.1 restricts rank invariance to a fixed scoring function and makes no sign prediction under retraining. We agree this belonged in the main text.
On DAGNN and the Perceiver, we agree these comparisons support sufficiency and configuration-specific claims, not pathway attribution, as noted in Section 5.7 and Appendix I. Factor-isolating ablations are the right next step.
On quantum specificity, the decomposition applies to general DAGs, and we agree the paper does not demonstrate quantum-specific insight.