- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes QRG-EEG, a quantum-enhanced Riemannian-conditioned graph representation learning framework for cross-patient ALS-EEG decoding. The method combines component-wise EEG feature extraction, Riemannian covariance representations, and graph-conditioned variational quantum circuits.
Critical strengths
The paper addresses the important and challenging problem of cross-patient EEG decoding under limited clinical data.
The component-aligned node–edge conditioning mechanism is clearly formulated and supported by theoretical analysis.
The experimental evaluation is relatively comprehensive, including patient-level LOSO validation, multiple classical and quantum baselines, targeted ablations, and paired statistical comparisons.
Critical weaknesses
The proposed framework mainly integrates existing EEG encoders, Riemannian representations, graph modeling, and variational quantum circuits. Although component-aligned conditioning is an interesting design choice, its methodological novelty over existing structured node–edge interaction mechanisms remains insufficiently established.
The theoretical analysis demonstrates that quantum measurements can capture joint node–node–edge dependencies. However, similar nonlinear interactions can also be modeled using classical architectures. It has not yet been fully explained why this correspondence must be implemented via quantum circuits. Classical graph neural networks, bilinear interactions, or explicit node-edge multiplicative interactions could also preserve the correspondence.
The current Fixed-entanglement VQC changes both the edge values and the graph topology. Could the authors provide a controlled comparison that preserves the original graph topology and quantum gates while replacing only trial-dependent edge values with source-derived constants?
The method relies on a source-fitted CSP, PCA, or xDAWN projection. Could the authors examine whether the proposed interaction mechanism remains effective under different latent representations and consistent component re-indexing, and clarify whether component identity has any interpretation beyond computational index correspondence?
Questions for authors
See the weakness.
3 comments
Thank you for the detailed responses. My concerns have been adequately addressed, and I will increase my rating.
Thank you for your prompt response. We sincerely appreciate your positive feedback.
We sincerely thank the reviewer for the careful and constructive questions. Signed values are QRG-EEG minus comparator Macro-F1 on bigP3BCI/BNCI/EEGET/UCL (seeds averaged within patient; all 30 patient-level LOSO folds; 95% patient-bootstrap intervals in Tab. 12, all excluding 0); unsigned values are absolute scores.
W1. The problem existing node–edge mechanisms leave open. Cross-patient ALS-EEG decoding needs local temporal evidence of each latent component and trial-specific relations between components. Riemannian–deep hybrids (CRGNet, Graph-CSPNet) fuse or aggregate them after compression; EEG quantum models (QEEGNet; pyRiemann-qiskit) process flattened vectors; weighted-graph quantum circuits (Skolik et al.; Mernyei et al.) condition gates on generic graph weights not tied to signal components. QRG-EEG keeps both kinds of evidence separately addressable while making them interact by component identity: one index i is shared by spatial filter, node feature, covariance row, graph node, and qubit, so [Hb]ij drives exactly the RZZ on qubits i and j. Controls support this: the same Riemannian information vectorized into a generic VQC (C9) gives +.083/+.148/+.066/+.106, and test-time edge misassignment (C8) +.082/+.132/+.052/+.077; consistent permutation during training (C7) keeps a clear gap on P300 (+.058/+.104) and a smaller one on MI (+.031/+.050), where the benefit comes mainly from trial-specific relations (C5, W3).
Revision: Sec. 1, Sec. 3, Tab. 2, Tab. 12, Fig. 5.
W2. Why a VQC for node–edge interaction? As stated in the Introduction, message-passing GNNs propagate relations by neighbourhood aggregation, which mixes each node's state with its neighbours' and, as layers deepen, can over-smooth node representations (Li et al., 2018), diluting component-level evidence. In the graph-conditioned circuit, node i sets the rotation on qubit i, relation (i,j) generates the two-qubit gate on exactly that pair, the mixer turns the edge phase into terms multiplicative in both incident nodes and the relation (Eq. 15; App. B.8), and the Z/ZZ readout keeps per-node and per-edge coordinates. The circuit thus jointly preserves local temporal–spatial evidence and trial-specific relational geometry. Classical operators with identical aligned inputs, objective, selection, and calibration remain below QRG-EEG, with the largest gap for the GAT that aggregates the same graph:
The edge-conditioned GNNs remain below QRG-EEG as well: where QRG-EEG obtains .512/.699/.524/.583 Macro-F1, NNConv/ECC obtains .508/.642/.450/.334, GINE .498/.636/.398/.287, and a pairwise MLP ϕ(vi,vj,eij) .482/.641/.417/.378.
Revision: Sec. 1, Sec. 5 (RQ1, Fig. 4), Tab. 12, App. J (Tab. 18).
W3. Same topology and gates, only trial-dependent edges removed. C5 is exactly this control: topology, RZZ gates, mixers, and readout are unchanged (identical parameter count), and each eb,ij is replaced by its source mean. C6 changes only the topology:
Removing trial dependence alone lowers performance on every cohort, by more than changing the topology.
Revision: Tab. 2, Tab. 5, Tab. 12, Sec. 5 (RQ2).
W4. Latent representations and component identity.
Revision: Sec. 3 (Eq. 1), App. B.2.1, B.3, App. K (Tab. 19).