We present a constructive falsification of the quantum advantage claims in Lakhdar-Hamina et al. (2025, PRL). A classical BinaryConnect binarized MLP ensemble achieves 92.73% accuracy on BQNN's 55-image MNIST protocol, exceeding quantum inference (~82-85%) by 7-11pp at 0.0365 J vs 550,000 J (ratio 1.5e7). CAL-BQNN-05 confirmed one year early. arXiv:2507.21222v2 audit series v2.
We present a constructive falsification of the quantum advantage claims in Lakhdar-Hamina et al. (2025, PRL). A classical BinaryConnect binarized MLP ensemble achieves 92.73% accuracy on BQNN's 55-image MNIST protocol, exceeding quantum inference (~82-85%) by 7-11pp at 0.0365 J vs 550,000 J (ratio 1.5e7). CAL-BQNN-05 confirmed one year early. arXiv:2507.21222v2 audit series v2.
We audit the BQNN paper by Lakhdar-Hamina et al. (2025, PRL / arXiv:2507.21222v2) which implements a tunable quantum neural network on three quantum computing platforms. Through a complete Phase 1-4 research pipeline including a 5-adversary red-team audit, we evaluate every claim against the Physics of Computation criterion (joules-per-solution < classical alternative). We find the paper's strongest claim (multi-platform QNN benchmarking methodology) is sustained, while its quantum advantage claims are not sustained. Includes 5 calibration register predictions for future verification.
Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.
The combination of the principles of quantum computing and classical deep learning is a potentially fruitful direction to develop the field of artificial intelligence, but the benchmarking of such hybrid architectures against standard computer vision problems is an under-explored area. The paper explores the behavior of Hybrid Quantum-Classical Neural Network (HQNN) in the classification of images into multiple classes using the MNIST database. Our architecture is an HQNN implementing an 8-qubit and 2-layer variational circuit, and it is parameterized by a classical multi-layer perceptron (MLP). To make the evaluation process rigorous and fair, the hybrid was benchmarked on a purely classical MLP, which had almost the same parameter footprint ( 105,000 parameters). Results over 50 training epochs show that the classical MLP reached its highest test accuracy of 96.50% and Macro F1 of 0.96. The HQNN was able to converge and learn the data of high dimensions delivering a competitive but slightly lower maximum accuracy of 94.35% and Macro F1 of 0.94. Moreover, there was a high computational cost on the simulation of the quantum layers, which increased the training time by 233 times the classical baseline. These results suggest that while the quantum layer is expressive and capable of learning complex representations, the current state of quantum simulation on classical hardware is a significant bottleneck. Which can be reduced by QPU/NISQ hardware, lighter quantum circuits and better dta encoding.
A systematic epistemic-hygiene audit of quantum computational advantage claims (1985-2025). Surveying 29 major claims across five regimes (oracle separations, sampling-based, query-complexity, communication-complexity, Shor's algorithm), we find zero unconditional proofs that BQP != BPP. Every surveyed claim depends on at least one unverified assumption: unproven cryptographic hardness, untestable average-case conjectures, or oracle-relative constructions that do not transfer to the uniform model. Published 2026-07-11. Live at https://8d0a2a5c.qwav.pages.dev/
Quantum machine learning on noisy intermediate-scale quantum (NISQ) devices often suffers from noise sensitivity, small-data overfitting, and miscalibrated predictive confidence. We propose an uncertainty-aware hybrid Bayesian quantum neural network (BQNN) that couples a Bayesian convolutional front-end with a parameterized quantum circuit (PQC), forming a three-stage pipeline: Bayesian feature extraction, quantum state evolution, and classical decision making. For 28 ×28 grayscale inputs, the front-end uses an 8-filter 3 ×3 Bayesian convolution followed by 2 ×2 max-pooling and a fully connected layer to produce a 10-dimensional embedding, which is mapped to four rotation angles and encoded on 4 qubits. Two parameterized quantum circuit designs are considered for the quantum classification layer. On MNIST and Fashion-MNIST, repeated experiments over five independent random seeds show that the proposed BQNN variants consistently outperform the corresponding QCNN baselines. On MNIST, BQNN-2 achieves a mean best test accuracy of 95.46 ± 0.36%, a mean final test accuracy of 95.44 ± 0.38%, and a mean final test loss of 0.169 ± 0.012. On Fashion-MNIST, BQNN-1 attains the best mean overall performance, with a mean best test accuracy of 87.59 ± 0.62%, a mean final test accuracy of 87.49 ± 0.73%, and a mean final test loss of 0.385 ± 0.017, while BQNN-2 exhibits slightly smaller run-to-run variation. Additional representative comparisons with QNN baselines under the same training configuration further suggest faster convergence and higher peak accuracy for BQNN. Using 30 Monte-Carlo forward passes, BQNN achieves better calibration (ECE 0.007-0.009) than QCNN (ECE 0.016-0.020), thereby reducing overconfident predictions. Additional robustness experiments under noisy mixed-state simulation further show that, under depolarizing noise, BQNN consistently preserves higher peak test accuracy than QCNN across both circuit variants on MNIST, demonstrating improved robustness in NISQ-like noisy settings.
Quantum computing has generated significant expectations for its potential to enhance machine learning (ML) tasks, with theoretical research proposing computational advantages ranging from polynomial to exponential speedups for specific subroutines.However, a critical disconnect remains: theoretical or asymptotic speedup claims do not automatically imply a practical, end-to-end advantage.Current evidence does not clearly establish whether these claimed advantages translate into measurable superiority over optimised classical approaches.This review critically assesses the relationship between theoretical claims of quantum advantage and the currently available practical and experimental evidence.We critically examine the evidence and assumptions underlying claimed speedups, including the overheads associated with data encoding and access, as well as the use of appropriate and competitive classical baselines for fair comparison.The scope of this assessment covers key limiting factors, such as scalability, trainability, hardware noise in the noisy intermediate-scale quantum (NISQ) era, and overall resource requirements.By distinguishing between theoretical potential and demonstrated practical performance, this work identifies where current evidence is convincing and where it remains insufficient.The review identifies the specific conditions required for the credible validation of quantum advantage and argues that future progress must be positioned around rigorous, realistic, and end-to-end evaluation rather than theoretical complexity claims alone.