- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper considers the temporal link prediction (TLP) on discrete-time dynamic graphs (DTDGs), a new PHoTE method was proposed. It was claimed to be a photonic framework combing non-trainable continuous-time quantum-walk encodings, which avoids the time-consuming structural encoder optimization. Experiments on real and synthetic dynamic graphs support non-trainable photonic encodings for temporal prediction and demonstrate small-scale hardware feasibility.
Critical strengths
S1. This paper's basic idea about non-trainable photonic encodings for TLP seem interesting.
S2. This paper conducts a great amount of experiments to validate the proposed method's effectiveness.
Critical weaknesses
W1. It was claimed that this paper still adopts the conventional data model of discrete-time dynamic graphs (DTDGs), which may not be considered as a state-of-the-art (SOTA) settings. In contrast, most SOTA techniques for TLP adopt the advanced setting of continuous-time dynamic graphs (CTDGs), with several superiorities beyond DTDGs. Moreover, it was claimed that PHoTE leverages continuous-time quantum walks, which seems to be inconsistent with the setting of DTDGs.
W2. Also as claimed in Section 2, the proposed method can only support the conventional transductive TLP with a fixed node set for all time steps. In contrast, most SOTA TLP approaches (e.g., TGAT, TGN, DyGFormer, etc. in Table 2) can handle the more advanced inductive inference that predicts links for new unseen nodes. Consistent with W1, at least from the perspective of problem statement, this paper cannot be considered as the SOTA.
W3. The main novelty of this paper relies on some photonic preliminaries from recent advances in physics (e.g., "Fock state", "linear-optical circuit", "beam splitters", "phase shifters", "one-photon probabilities", "two-photon coindidence probabilities", "HOM effect", etc.). Although this paper gives definitions for some of these terminologies in Section 2, they were described only in lengthy text, which is hard to read. More importantly, it is also hard to understand how these concepts are linked to TLP on dynamic graphs, hindering a comprehensive evaluation about this paper's novelty. It is suggested to add some toy running examples (e.g., in terms of figures) to further interpret these terminologies.
W4. It was not clearly stated in Section 2 (i.e., problem statement) whether PHoTE need graph attributes inputs (e.g., each node is associated with a feature vector), while some baselines in experiments (e.g., EvoleveGCN, TGAT, TGN, DyGFormer, etc.) relies on such an attribute input, resulting in potential unfair comparison in experiments.
W5. Consistent with W3, there seem no any pseudo-codes to describe the overall pre-processing, training, and inference procedures of PHoTE. As a result, it still hard to understand how does PHoTE exactly work.
W6. While high training efficiency is one of PHoTE's advantages, there seems no formal complexity analysis and comparisons with other methods' complexities to highlight this advantage.
W7. It was claimed that the proposed method can ensure much better training efficiency, while it was also mentioned at the end that "scalability to substantially larger networks remains untested", which may fail to validate this advantage given the close relation between efficiency and scalability.
W8. This paper doses not anonymously provide its code and data to ensure the reproducibility of experiments as some other submissions do.
Questions for authors
See W1-W8.
5 comments
W6.
We have added a computational-cost analysis in Appendix G.1, separating one-time feature construction from the training and inference costs of the temporal readout.
For nodes, edges in snapshot , evolution times, and projection dimension , the direct dense per-snapshot encoding costs are
These account for matrix exponentials, explicit accumulation of the two-photon coincidence table, and projection. They are upper bounds for the direct implementation, not universal lower bounds.
Let be the encoded node-feature dimension, the common LSTM/MLP hidden width, the number of candidate pairs scored in one pass, and the number of snapshots. A representative readout cost for one non-overlapping pass is
Here for projected profiles and for role summaries. Reprocessing overlapping temporal windows adds corresponding readout work. The fixed graph encodings are constructed once and reused over training epochs, whereas a learned structural encoder generally incurs training-time forward and backward computation. LapPE and RWPE paired with the same readout share the same readout complexity when dimensions match.
The key training-efficiency advantage comes from computing structural features once and reusing them across epochs, rather than repeatedly differentiating through a structural encoder. This distinction also applies to LapPE and RWPE, which share the same readout complexity when feature dimensions match. The quantum-walk encodings are therefore not claimed to provide an intrinsic acceleration of the training stage.
For empirical comparison with the heterogeneous temporal GNN architectures, Appendix G.2, Tables 37–40 report per-epoch training times and separate one-time preparation times. All methods were timed on NVIDIA H100 GPUs with PyTorch 2.9. The per-epoch measurements exclude feature preparation, validation, and testing. We do not equate lower per-epoch training time with lower total computational cost in every setting.
W7.
We appreciate the reviewer's suggestion to evaluate PHoTE on larger graphs. We have extended the evaluation to two TGB datasets, tgbl-wiki (9,227 nodes) and tgbl-flight (18,143 nodes), using the official TGB splits, negative samples, and mean reciprocal rank (MRR) metric. The results are reported in Appendix A.5, Table 7.
On tgbl-flight, the two-photon and one-photon encodings achieve the two highest mean MRR scores among the methods reported in Table 7, reaching 0.861 ± 0.001 and 0.852 ± 0.000, respectively. The strongest evaluated temporal GNN, GC-LSTM, achieves 0.842 ± 0.002.
On tgbl-wiki, one-photon achieves 0.512 ± 0.004, outperforming every evaluated discrete-time GNN. However, EdgeBank (0.569), CTAN (0.605), and DyGFormer (0.735) achieve higher scores. Thus, PHoTE remains competitive at larger scales, although its performance varies across datasets.
We also report feature-construction costs. On one GPU, precomputing features for the full tgbl-flight sequence takes approximately 26 minutes for one-photon and 90 minutes for two-photon. For tgbl-wiki, isolated nodes can be handled analytically, reducing the matrix-exponential computation to approximately 150 active nodes per hourly snapshot.
These results extend the evaluation substantially beyond the original networks, while also illustrating the cost of feature precomputation. They do not establish an end-to-end runtime advantage in every setting or demonstrate large-scale photonic hardware execution.
We have accordingly updated the Limitations section (Section 7) to reflect the larger datasets while retaining the limitation that scalability to substantially larger networks and photonic devices remains untested.
W8.
We thank the reviewer for emphasizing reproducibility. We have made an anonymized replication package available to reviewers:
Replication package: https://anonymous.4open.science/r/photonic_quantum_walk-32E8
We have also added Algorithm 1, which describes the complete PHoTE pipeline, and expanded the implementation details in Appendix G. Together, these resources are intended to facilitate independent verification and reproduction of our experimental results.
Thank you again for these comments. We hope the clarifications and additional evidence address your concerns. If they do, we would be grateful if you would reconsider your assessment.
Follow-up on Our Rebuttal
We hope to have addressed your concerns and answered your questions. We remain available if you have any more questions during the end of the discussion period. If we properly addressed your concerns and questions, we kindly ask you to consider raising your score.
Thank you for the detailed review and for recognizing the motivation and breadth of the experimental study. We agree that the paper should explain its prediction setting, physical construction, computational cost, and reproducibility more clearly. Below we address W1–W8 in order.
W1.
PHoTE studies next-snapshot link prediction on discrete-time dynamic graphs (DTDGs). A continuous-time quantum walk does not change the temporal-data setting. The two time parameters refer to different operations Gt=(V,Et) and Ut(τ)=exp(−iτAt)
Here t indexes the graph snapshot, while τ is an evolution parameter for a walk on the fixed adjacency matrix At. We use the walk to construct structural features for each observed snapshot; the temporal readout subsequently processes those features across snapshots. Given G1,…,Gt, the prediction target is the edge set of Gt+1.
DTDG and CTDG are different representations of temporal data, not a hierarchy in which one makes the other invalid. UTG and T-GRAB evaluate both snapshot-based and event-based temporal methods. We have clarified this distinction in Section 2 and made the prediction setting explicit in the Introduction.
W2.
We clarify that PHoTE is designed for transductive temporal link prediction on a fixed node set. Generalization to unseen nodes is not the research question addressed in this work. Our focus is on whether fixed quantum-walk representations can capture temporal graph information and support accurate next-snapshot link prediction.
The DTDG/CTDG distinction concerns the representation of temporal change. However, transductive/inductive refer to different settings of generalization beyond training nodes. Methods such as TGAT, TGN, and DyGFormer can have inductive capabilities, but in our comparison they are evaluated on the same specified transductive target as PHoTE.
W3/W5.
We thank the reviewer for the suggestions on improving the presentation. We have clarified the methodological workflow through Figure 1 and Algorithm 1, covering feature precomputation, chronological training, and test-time prediction.
The photonic concepts describe how the graph-dependent statistics can be physically obtained. Our methodological contribution lies in constructing node representations from one-photon transition probabilities and edge-aggregated two-photon coincidence statistics, and in studying how identity-sensitive profiles and role summaries support temporal prediction.
To make these representations more intuitive, Appendix F.2 uses simple graph structures to illustrate the information captured at different evolution times. Appendix F.3 (Figure 8 and Table 36) provides a concrete example in which node 17 changes its interaction partner from node 42 to node 88. The identity-sensitive features change their destination coordinates, whereas the role summaries remain unchanged.
We have also added control experiments in Appendix D.1, comparing the quantum-walk encodings with node identifiers, adjacency vectors, heat kernels, and personalized PageRank under the same temporal readout. These comparisons help distinguish the contribution of quantum-walk features from that of node identity and simpler structural information.
Together, these revisions clarify how the physical construction produces features used for temporal link prediction and how the proposed representations differ from existing alternatives.
W4.
PHoTE requires only binary snapshot adjacency matrices and does not use observed node or edge attributes. In the main experiments, the temporal GNN baselines receive one-hot node identifiers following the T-GRAB protocol. No observed node or edge attributes are supplied in these comparisons. The methods are evaluated on the same prediction target and chronological splits, although their input representations and architectures differ.
LapPE and RWPE provide an additional controlled comparison: like PHoTE, they construct structural features from adjacency matrices and use the same temporal readout.
For the additional TGB experiments in Appendix A.5, the continuous-time baselines also receive the benchmark edge attributes, whereas PHoTE continues to use only adjacency matrices. We have made this distinction explicit to clarify the information available to each method.