- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces SpooQ, which the authors claim is the first quantum machine learning architecture for skeleton-based action recognition. The core motivation is to extend QML beyond static benchmarks to complex spatio-temporal tasks while addressing the constraints of noisy intermediate-scale quantum (NISQ) devices. Instead of encoding entire poses into a monolithic quantum circuit, SpooQ decomposes the skeleton into six anatomical parts (arms, legs, head, torso) and assigns compact quantum circuits at three scales—local part circuits, relational region circuits (arms, legs, upper body), and a global body circuit. The method is evaluated on NW-UCLA and a single-person-filtered subset of NTU RGB+D 60 (cross-view), outperforming parameter-matched classical baselines, including CTR-GCN.
Critical strengths
- Applying QML to skeleton-based action recognition with anatomy-guided circuit design is novel. Treating anatomical structure as a circuit design template is conceptually sound.
- The paper's experiments show that the anatomy hierarchy is helpful (Classical SpooQ > CTR-GCN), and quantum circuits add further gains beyond the hierarchy.
Critical weaknesses
- The current results are on filtered datasets with very limited scale: the NTU60 experiments use only single-person clips (30,683 training clips) rather than the full dataset. The "parameter-matched" comparison to CTR-GCN is misleading since the parameter counts are remarkably small (13K vs. 1.4M for full CTR-GCN).
- The paper compares against only a reduced CTR-GCN, a flat quantum baseline, and a classical version of SpooQ. However, it omits recent strong skeleton-based methods, such as PoseC3D, ST-GCN++, 2s-AGCN, and especially modern transformer-based approaches (e.g., STTFormer, MotionBERT).
- The claim that quantum circuits "capture correlations costly to represent classically" is not tested, no explicit comparison is made to nonlinear classical feature maps (e.g., random Fourier features, polynomial kernel approximations) at matched parameter counts.
- The experimental setup uses analytic simulation (default.qubit), which does not reflect real NISQ execution realities.
Questions for authors
- What would be the resource requirements on actual quantum hardware?
- How many classes retain sufficient samples after filtering? Does the performance on mutual-action classes differ from single-actor classes?
- Under Brisbane noise, SpooQ retains ~95% of its accuracy (80.1/84.3) while the Quantum Baseline retains only ~60% (42.6/70.9). Can you provide more insight into why?
- Can you provide comparisons with other QML approaches such as quantum recurrent networks and QLSTM?
- SpooQ processes frames independently through quantum circuits and then uses a GRU for temporal aggregation. What is the maximum sequence length you can handle given quantum circuit depth constraints?