Pith. sign in

REVIEW 5 major objections 5 minor 22 references

Quantum Machine Learning in Transportation: A Case Study of Pedestrian Stress Modelling

T0 review · 5 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper reports that a quantum neural network with a tree-tensor-network ansatz classifies pedestrian stress events from skin-conductance data more accurately than a quantum kernel SVM or the classical neural network, while using far…

desk verdict A sincere but statistically under-powered case study; the comparative claim about quantum advantage rests on two test predictions. read the letter →

arxiv 2507.01235 v3 pith:YM5FAARL submitted 2025-07-01 cs.LG quant-ph

Bara Rababah , Bilal Farooq This is my paper · ORCID
classification cs.LGquant-ph
keywords quantummachinelearningneuralnetworksupportvectorskinconductanceresponsepedestrianstressZZfeaturemaptreetensorintelligenttransportationsystems
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that quantum machine learning can be applied to a real transportation problem: classifying pedestrian stress from skin-conductance response (SCR) events captured during a virtual-reality road-crossing experiment. Its main result is that a quantum neural network built on an eight-qubit ZZ feature map and a tree-tensor-network ansatz reaches 55% test accuracy, outperforming both a quantum support vector machine (45%) and a classical neural network (45%) on the same binary high/low stress task. The same report shows the QSVM overfits sharply (78.75% training accuracy versus 45% test), which it attributes to a fixed high-dimensional quantum kernel without regularization. This matters because it is a concrete, real-data comparison of how quantum classifiers behave on a small physiological dataset, including a parameter-efficiency observation: 24 trainable parameters for the QNN versus 145 for the classical network.

What carries the argument

The central machinery is the pairing of an eight-qubit ZZ feature map with a tree-tensor-network variational ansatz. The ZZ feature map encodes normalized features as $R_z$ rotations on Hadamard-initialized qubits and introduces pairwise CNOT-$R_z$-CNOT interactions, producing the quantum state $|\phi(x)\rangle$ whose overlap defines the quantum kernel $k(x,y)=|\langle\phi(x)|\phi(y)\rangle|^2$. The QNN then feeds this encoded state through a binary-tree circuit of two entangling layers and 24 trainable $R_y$ rotations, measures the Pauli-$Z$ expectation on an output qubit, and maps that value through a sigmoid to a stress-class probability. This trainable structure is what lets the QNN adjust its decision boundary during optimization, whereas the QSVM's kernel remains fixed.

What would settle it

Run the same comparison under repeated random 80/20 splits or k-fold cross-validation and compute confidence intervals for test accuracy; if the QNN is not consistently more accurate than the classical neural network by more than the split-to-split noise, the paper's central performance claim collapses.

Watch

Extended reading notes

Core claim

On the SCR dataset, with identical inputs and preprocessing, the variational QNN reaches 55% test accuracy for the binary classification of high versus low stress amplitude, higher than the QSVM (45%) and the classical neural network (45%), while using 24 trainable parameters instead of 145. The QSVM attains 78.75% training accuracy but only 45% test accuracy, a generalization gap the paper ascribes to the fixed ZZ-feature-map kernel and the absence of regularization. The paper's conclusion is that variational quantum circuits can adapt their decision boundary during training and are therefore more effective on this small, noisy physiological dataset than fixed quantum kernel methods.

Load-bearing premise

The load-bearing assumption is that a single random sample of 100 SCR events, split 80/20 into training and test sets, produces stable test accuracies; with 20 test samples the reported 55% versus 45% difference is just two misclassified events and could invert under another split.

Editorial extensions

If this is right

  • If the reported accuracies are stable, variational quantum classifiers can match or beat classical neural networks on small physiological datasets while using far fewer trainable parameters.
  • The QSVM's large generalization gap implies that expressive quantum feature maps such as the ZZ map need regularization or more training data before they generalize on small intelligent-transportation datasets.
  • The comparison suggests that quantum-classical benchmarks in transportation should report training-test generalization gaps and parameter counts alongside classification accuracy.
  • The authors' expectation is that moving from an eight-qubit emulator to 20-30 qubits on actual hardware could improve the accuracy of both quantum models.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is to match the classical network's capacity to the QNN's 24 parameters; if the classical model then reaches the same accuracy, the reported advantage is about capacity rather than quantum mechanics.
  • Because the SCR dataset has only four input features, the exponential Hilbert-space advantage of the quantum feature map is not actually exercised; a more informative test would apply the same QNN to higher-dimensional transportation data.
  • The overfitting pattern suggests quantum kernel methods will need classical-style regularization strategies before they can be trusted on small physiological datasets, a point the paper raises but does not test.
  • For crossing-safety applications, the practical value of a 55% accuracy classifier depends on the relative cost of missing a high-stress event versus raising a false alarm, so cost-sensitive evaluation would be the next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 5 minor

Summary. The paper presents a case study applying quantum support vector machines (QSVM) and quantum neural networks (QNN) to classify skin conductance response (SCR) events from a virtual-reality pedestrian stress experiment. Three quantum feature maps are compared; the ZZ feature map is selected. The QSVM and QNN are then compared against classical SVM and neural network baselines on a random sample of 100 SCR events with an 80/20 train/test split. The paper claims the QNN achieved a higher test accuracy (55%) than the QSVM and classical versions (45%), and that both quantum models used far fewer parameters, concluding that quantum approaches are more effective for this task. The central evidence is a single split with 20 test samples, and no uncertainty quantification is provided.

Significance. If the comparative claims were statistically supported, this would be a useful data point on parameter-efficient quantum classifiers for small physiological datasets and a concrete comparison of quantum kernels versus variational circuits on a real transportation-related problem. The paper also makes an effort to compare three feature maps and to align quantum and classical model families. However, the headline claim that the QNN is a 'better classification model' is not supported by the evidence as reported: the entire advantage rests on a two-prediction difference in a 20-sample test set, and additional methodological inconsistencies and apparent reporting errors further undermine the conclusions.

major comments (5)
  1. [V and IV-A] The central comparative claim rests on a single 80/20 split of a random sample of 100 SCR events, giving only 20 test samples. With n_test=20, the reported QNN accuracy of 55% (11/20) versus QSVM/classical NN accuracy of 45% (9/20) is a two-prediction difference, well within sampling noise. The paper reports no confidence intervals, repeated splits, cross-validation results, or significance tests such as McNemar's test. The abstract and conclusion therefore overstate the evidence: the claim that the QNN is 'a better classification model' is not supported by the point estimates alone.
  2. [III, IV-E, IV-F] The class definitions are inconsistent across the compared models. Section III defines a four-class target variable amp_class (classes 0–3), while Sections IV-E and IV-F explicitly reduce the task to binary low/high classification for the classical neural network and the QNN. It is not stated whether the QSVM and classical SVMs are trained on the four-class or binary target. If the models are evaluated on different tasks, the accuracies in Figures 4 and 5 are not directly comparable, and the 'better classification model' claim is ill-posed.
  3. [V] The metrics reported for the QNN are internally inconsistent. For a balanced binary test set, precision and recall of 0.75 for the 'high amplitude' class imply an accuracy of approximately 75%, not the reported 55%. Specifically, with equal positive and negative examples, accuracy = (1 + 2*recall - recall/precision) / 2 = (1 + 1.5 - 1) / 2 = 0.75. This discrepancy suggests an error in metric computation, class labeling, or the stated class balance, and it casts doubt on the quantitative comparisons in Figures 4 and 5.
  4. [V] The selection of the ZZ feature map is post hoc and biased. Figure 3 shows that the ZZ map has the largest generalization gap (33.75%) and the worst test performance compared to angle encoding (8.75% gap) and amplitude encoding (2.50% gap). The authors state they 'decided to use ZZ map in the rest of the analysis' because it has the highest training accuracy. Choosing the model with the highest training accuracy rewards overfitting and undermines the subsequent conclusion that quantum models overfit; a principled feature-map selection based on validation performance or a held-out set is needed.
  5. [Abstract and IV] The qubit count is inconsistent. The abstract describes an 'eight-qubit ZZ feature map', and Sections IV-D and IV-F refer to an eight-qubit system, but Section IV and Figure 2(a) describe a four-qubit circuit with pairwise interactions only between x0–x1 and x2–x3. Since the number of qubits directly affects the feature space and the circuit complexity, this inconsistency must be resolved for the reported models to be reproducible.
minor comments (5)
  1. [References] Reference [11] contains corrupted text ('J. M. Gambett that like 6 years to people a') and reference [2] lists 'P. yeah' as an author; both appear to be placeholder or OCR errors and should be corrected.
  2. [V] There are typos in Section V: 'QSVN' should be 'QSVM' in the paragraph comparing QNN and QSVM, and 'overfiting' should be 'overfitting'.
  3. [II] The phrase 'traveller scales person problem' in the background section is garbled; it likely refers to the 'traveling salesman problem' and should be rewritten.
  4. [IV-A] The paper does not report the total size of the original dataset, the class distribution before sampling, or the composition of the 100-sample random draw. This information is necessary for reproducibility and for assessing how representative the sampled subset is.
  5. [V] The precision/recall and F1 values for the classical neural network (0.42/0.24, F1=0.31) are reported without discussion of how they relate to the stated balanced class distribution; the low recall suggests a possible mismatch between the reported accuracy and the class balance.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the reported model comparison is empirical and self-contained, with proper external citations for the quantum methods and data provenance.

full rationale

The paper's central comparison is empirical: all models are trained and evaluated on the same 80/20 split of 100 SCR events, and the reported accuracies (QNN 55%, QSVM 45%, classical NN 45%, classical SVM 30%) are observed test results rather than quantities derived from fitted constants or from the paper's own prior conclusions. The quantum kernel k(x,y)=|<phi(x)|phi(y)>|^2 is the standard definition given in Eq. (2), and the ZZ feature map is explicitly attributed to Havlicek et al. [11], an external published source. The dataset is sourced from Nazemi et al. [3], which includes two of the present authors, but this is proper data provenance rather than a load-bearing self-citation: the data are an external empirical input, and the paper's claims do not reduce to any conclusion asserted by [3]. Hyperparameters such as C=0.5 and gamma=2.0 are described as results of sensitivity analysis, but they are ordinary model-tuning choices, not fitted parameters renamed as predictions. The selection of the ZZ feature map based on its training accuracy and entanglement, described in Section V, is a model-selection step; the selected model's test accuracy is then evaluated on held-out data, so the comparison is not forced by construction. The fragility of the headline comparison due to a single 80/20 split with only 20 test samples is a statistical-correctness concern, not circularity. No step in the derivation chain equates its output to its input by definition or by self-citation.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central comparison depends on several hand-chosen hyperparameters (C, gamma, entanglement scaling, learning rate) and on domain assumptions that amplitude classes proxy stress and that the 100-point sample represents the full dataset. No new physical entities are introduced.

free parameters (4)
  • SVM regularization parameter C = 0.5
    Chosen by sensitivity analysis in Section IV-A; affects both classical SVM and QSVM performance.
  • RBF kernel width gamma = 2.0
    Selected by sensitivity analysis for the classical RBF SVM baseline in Section IV-A.
  • ZZ entanglement scaling factor = 0.7
    Hand-set in Section IV-D to avoid overcomplexity; directly changes the quantum kernel and QNN encoding.
  • QNN learning rate = 0.05
    Given in Section IV-F without a sweep; influences convergence and final accuracy.
assumptions (4)
  • standard math Quantum kernel from Eq. (2) is a valid kernel for the SVM solver.
    Section IV-B defines k(x,y)=|<phi(x)|phi(y)>|^2 and feeds it to a classical SVM; this is standard QML.
  • domain assumption The SCR amplitude classes are a valid proxy for stress levels.
    Section III defines four amplitude classes and treats them as stress levels; no physiological validation is provided.
  • domain assumption The 100-point random sample and 80/20 split are representative and balanced.
    Section IV-A says a random sample of 100 data points was taken and split; no repeated sampling or stratification details are given.
  • domain assumption The Pennylane simulator reproduces ideal quantum circuit behavior.
    Section VI states all experiments used a quantum emulator; results are not from real hardware, so noise is absent.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Machine Learning in Transportation: A Case Study of Pedestrian Stress Modelling." pith.science (2026). https://pith.science/paper/YM5FAARL

@misc{pith2026250701235,
  author       = {Pith},
  title        = {Pith review of: Quantum Machine Learning in Transportation: A Case Study of Pedestrian Stress Modelling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YM5FAARL}},
  note         = {Machine review of arXiv:2507.01235}
}
read the original abstract

Quantum computing has opened new opportunities to tackle complex machine learning tasks, for instance, high-dimensional data representations commonly required in intelligent transportation systems. We explore quantum machine learning to model complex skin conductance response (SCR) events that reflect pedestrian stress in a virtual reality road crossing experiment. For this purpose, Quantum Support Vector Machine (QSVM) with an eight-qubit ZZ feature map and a Quantum Neural Network (QNN) using a Tree Tensor Network ansatz and an eight-qubit ZZ feature map, were developed on Pennylane. The dataset consists of SCR measurements along with features such as the response amplitude and elapsed time, which have been categorized into amplitude-based classes. The QSVM achieved good training accuracy, but had an overfitting problem, showing a low test accuracy of 45% and therefore impacting the reliability of the classification model. The QNN model reached a higher test accuracy of 55%, making it a better classification model than the QSVM and the classic versions.

Figures

Figures reproduced from arXiv: 2507.01235 by the authors.

Figure 1
Figure 1. VR environment & GSR sensor (demonstration only) The SCR amplitude is measured in micro Siemens units, and grouped into four classes, each having its own am￾plitude range: 0.1 ≤ SCR < 0.4), class 1 (moderate: 0.4 ≤ SCR < 0.7), class 2 (high: 0.7 ≤ SCR < 1.0), and class 3 (very high: SCR ≥ 1.0). Each data sample is made up of four features: elapsed_time, scr_amplitude, scr, and detected_scr_number. The target variabl… view at source ↗
Figure 2
Figure 2. Example workflow of quantum models with four qubits Here: • xk is the kth entry of the classical vector x, • |k⟩ is the n-qubit computational-basis state labelled by the integer k, • The prefactor P2 n−1 k=0 |xk| 2 −1/2 normalizes |ϕ(x)⟩ so that its measurement probabilities sum to 1. Because an n-qubit state must have unit norm, only 2 n − 1 of its real amplitudes can be chosen independently. This method uses n qu… view at source ↗
Figure 3
Figure 3. Performance comparison of quantum feature maps [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Performance comparison of classical SVM and QSVM models. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: Performance comparison of classical NN and QNN models. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 18 canonical work pages

  1. [1]

    Classical simulation of quantum many-body systems with a tree tensor network,

    Y .-Y . Shi, L.-M. Duan, and G. Vidal, “Classical simulation of quantum many-body systems with a tree tensor network,”Physical Review A, vol. 74, no. 2, p. 022320, 2006

    work page 2006

  2. [2]

    Quantum machine learning,

    J. Biamonte, P. Wittek, and P. yeah, “Quantum machine learning,” 2017

    work page 2017

  3. [3]

    De- coding pedestrian stress on urban streets using electrodermal activity monitoring in virtual immersive reality,

    M. Nazemi, B. Rababah, D. Ramos, T. Zhao, and B. Farooq, “De- coding pedestrian stress on urban streets using electrodermal activity monitoring in virtual immersive reality,”Transportation Research Part C: Emerging Technologies, vol. 171, p. 104952, 2025

    work page 2025

  4. [4]

    Pennylane: Automatic differentiation of hybrid quantum-classical computations,

    V . Bergholm, J. Izaac, M. Schuld, C. Gogolin,et al., “Pennylane: Automatic differentiation of hybrid quantum-classical computations,” arXiv preprint arXiv:1811.04968, 2018

    arXiv 2018

  5. [5]

    Quantum computing in intelligent transportation systems: A survey,

    Y . Zhuang, T. Azfar, Y . Wang, W. Sun, X. Wang, Q. Guo, and R. Ke, “Quantum computing in intelligent transportation systems: A survey,” CHAIN, vol. 1, no. 2, pp. 138–149, 2024

    work page 2024

  6. [6]

    Qdcnn: Quantum deep learning for enhancing safety and reliability in autonomous transportation systems,

    A. Meghanath, S. Das, B. K. Behera, M. A. Khan, S. Al-Kuwari, and A. Farouk, “Qdcnn: Quantum deep learning for enhancing safety and reliability in autonomous transportation systems,”IEEE Transactions on Intelligent Transportation Systems, pp. 1–11, 2025

    work page 2025

  7. [7]

    Data re-uploading in quantum machine learning for time series: application to traffic forecasting,

    N. Schetakis, P. Bonfini, N. Alisoltani, K. Blazakis, S. I. Tsintzos, A. Askitopoulos, D. Aghamalyan, P. Fafoutellis, and E. I. Vlahogianni, “Data re-uploading in quantum machine learning for time series: application to traffic forecasting,” 2025

    work page 2025

  8. [8]

    Solving the vehicle routing problem via quantum support vector machines,

    N. Mohanty, B. K. Behera, and C. Ferrie, “Solving the vehicle routing problem via quantum support vector machines,”Quantum Machine Intelligence, vol. 6, no. 1, p. 34, 2024

    work page 2024

Show all 22 references
  1. [9]

    A supervised hybrid quantum machine learning solution to the emergency escape routing problem,

    N. Haboury, M. Kordzanganeh, S. Schmitt, A. Joshi, I. Tokarev, L. Abdallah, A. Kurkin, B. Kyriacou, and A. Melnikov, “A supervised hybrid quantum machine learning solution to the emergency escape routing problem,” 2023

    2023

  2. [10]

    Per- formance optimization using quantum machine learning technique for predicting flight delays,

    S. S. Pophale, P. R. Patil, A. D. Potgantwar, and P. R. Bhaladhare, “Per- formance optimization using quantum machine learning technique for predicting flight delays,”Journal of Data Acquisition and Processing, vol. 38, no. 1, p. 208, 2023

    2023

  3. [11]

    Supervised learning with quantum-enhanced feature spaces,

    V . Havl´ıˇcek, A. D. C ´orcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambett that like 6 years to people a, “Supervised learning with quantum-enhanced feature spaces,”Nature, vol. 567, no. 7747, pp. 209–212, 2019

    2019

  4. [12]

    Universal approximation property of quantum machine learning models in quantum-enhanced feature spaces,

    T. Goto, Q. H. Tran, and K. Nakajima, “Universal approximation property of quantum machine learning models in quantum-enhanced feature spaces,”Physical Review Letters, vol. 127, no. 9, p. 090506, 2021

    2021

  5. [13]

    Support-vector networks,

    C. Cortes and V . Vapnik, “Support-vector networks,”Machine Learn- ing, vol. 20, no. 3, pp. 273–297, 1995

    1995

  6. [14]

    Hierarchical quantum classifiers,

    E. Grant, M. Benedetti, S. Cao, A. Hallam, J. Lockhart, V . Stojevic, A. G. Green, and S. Severini, “Hierarchical quantum classifiers,”npj Quantum Information, vol. 4, no. 1, p. 65, 2018

    2018

  7. [15]

    Kernel methods in machine learning,

    T. Hofmann, B. Sch ¨olkopf, and A. J. Smola, “Kernel methods in machine learning,”The Annals of Statistics, vol. 36, no. 3, pp. 1171– 1220, 2008

    2008

  8. [16]

    Quantum machine learning in feature Hilbert spaces,

    M. Schuld and N. Killoran, “Quantum machine learning in feature Hilbert spaces,”Physical Review Letters, vol. 122, no. 4, p. 040504, 2019

    2019

  9. [17]

    Circuit-centric quantum classifiers,

    M. Schuld, A. Bocharov, K. M. Svore, and N. Wiebe, “Circuit-centric quantum classifiers,”Physical Review A, vol. 101, no. 3, p. 032308, 2020

    2020

  10. [18]

    Quantum support vector machine for big data classification,

    P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,”Physical Review Letters, vol. 113, no. 13, p. 130503, 2014

    2014

  11. [19]

    Pauli fusion: a computational model to realise quantum transformations from zx terms,

    N. de Beaudrap, R. Duncan, D. Horsman, and S. Perdrix, “Pauli fusion: a computational model to realise quantum transformations from zx terms,”arXiv preprint arXiv:1904.12817, 2019

    1904 arXiv

  12. [20]

    Tree tensor networks for generative modeling,

    S. Cheng, L. Wang, T. Xiang, and P. Zhang, “Tree tensor networks for generative modeling,”Physical Review B, vol. 99, no. 15, p. 155131, 2019

    2019

  13. [21]

    Classification with quantum neural networks on near term processors,

    E. Farhi and H. Neven, “Classification with quantum neural networks on near term processors,”arXiv preprint arXiv:1802.06002, 2018

    2018 arXiv

  14. [22]

    A precarious milestone for quantum computing,

    D. Castelvecchi, “A precarious milestone for quantum computing,” Nature, vol. 574, no. 7779, pp. 487–488, 2019. [Accessed: Apr. 30, 2025]

    2019

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.