Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Auditing the BQNN: Does a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware Demonstrate a Route to Near-Term Quantum Advantage?

Rowan Brad Quni-Gudzinas

Published Jul 25, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.21566034

Related papers

Quantum Machine Learning: Theoretical Foundations, Algorithmic Frameworks, and Path to Quantum Advantage

Ghefar Alaa Aldeen Alrefai, Jouma Ali Al-Mohamad, Christo Ananth +3 more

Quantum machine learning sits at the intersection of two paradigm-shifting technologies: quantum computing and deep learning. By exploiting quantum mechanical phenomena – superposition, entanglement, and interference – QML promises exponential or quadratic speedups over classical algorithms for certain learning tasks, as well as the ability to model quantum data natively. However, the path to practical quantum advantage remains contested, constrained by noisy intermediate-scale quantum (NISQ) hardware, limited qubit counts (50–1,000), coherence times (50–500 μs), and high gate error rates (10⁻³–10⁻⁴). This paper provides a rigorous, technically deep survey of QML: mathematical foundations (Hilbert spaces, unitary evolution, measurement, quantum circuits), canonical algorithms (quantum kernel methods, variational quantum circuits (VQCs), quantum neural networks (QNNs), QSVMs, quantum generative adversarial networks (QGANs), encoding strategies (angle, amplitude, basis, and Hamiltonian encoding), optimization landscapes (barren plateaus, parameter shift rules, ansatz design), hardware aware implementation on superconducting (IBM, Google), trapped ion (IonQ), and neutral atom (Pasqal) platforms, empirical benchmarks on near term devices for classification, generative modeling, and quantum chemistry, and pathways to fault tolerant quantum machine learning (FTQML) with error correction (surface codes, logical qubits). Researchers critically assess claims of quantum advantage, identify scenarios where QML may outperform classical ML (small data, high-dimensional feature spaces from quantum systems, kernel estimation), and propose concrete evaluation metrics (quantum-classical cross-validation, resource estimation).

FMDB Transactions on Sustainable Intelligent Networks•Aug 15, 2026•0 citations

Integration of Quantum Computing with Artificial Intelligence: A Systematic Review

Ankit Sharma, Zohaib Ali

Objective: To synthesize the state of the art on how quantum computing (QC) and artificial intelligence (AI) intersect, including algorithmic foundations, software/hardware stacks, empirical evidence of advantage, applications, and open challenges. Methods: We executed a structured search (2019 – 20th August 2025) across major journals (Nature portfolio, APS/PR, Elsevier), arXiv, and official framework documentation (Qiskit, Cirq/TFQ, PennyLane; AWS Braket; NVIDIA CUDA-Q). We included peer‑reviewed studies, comprehensive surveys, and official docs; we excluded opinion pieces and non-reproducible claims. Results: The field converges on hybrid quantum‑classical workflows with two dominant AI families: (i) quantum kernel methods and (ii) variational circuits/QNNs. Trainability remains a core challenge (barren plateaus and noise), with mitigation strategies advancing (local costs, layerwise training, engineered dissipation, learned decoders). Frameworks and cloud orchestrators now support end‑to‑end hybrid training. Empirical “utility” demonstrations in physics‑inspired tasks exist, while domain‑level advantage in mainstream ML is unproven and data‑dependent. Conclusions: QC‑AI integration is maturing into reproducible hybrid stacks. Near‑term value lies in quantum kernels with tailored feature maps, physics‑regularized QNNs, simulator‑accelerated pipelines, and AI‑for‑QC (calibration/decoding). Broad ML advantage awaits lower‑noise hardware and quantum‑friendly data embeddings.

Journal of Engineering Research and Reports•Sep 16, 2025•1 citation

Limits of quantum run-time advantage

Jan Tuziemski, Jakub Pawłowski, Paweł Tarasiuk +2 more

A robust definition of quantum runtime is essential for assessing the performance of quantum algorithms and claims of quantum advantage. While for most classical hardware the total runtime is well approximated by computation plus a weakly varying constant, on current quantum hardware a clean experimental separation between "pure computation" and "overhead" is often not justified. Consequently, conventional quantum runtime analyses excluding substantial system-level overheads can lead to biased performance assessments. In this work we introduce experimentally grounded, end-to-end definitions of quantum runtime for digital and analogue quantum computers, together with a methodology for selecting strong classical baselines for quantum-classical runtime comparisons. Within this framework, we evaluate recent claims of quantum advantage in annealing and gate-based algorithms. We examine three representative case studies. First, we revisit annealing for approximate QUBO problems PRL 134, 160601 (2025), which employs a well-motivated time-to-$ε$ metric but effectively uses annealing time as a proxy for runtime. Second, we analyze a restricted implementation of Simon's problem PRX 15, 021082 (2025), where the favorable scaling in oracle calls is undisputed; however, we show that the estimated runtime of the quantum experiment is approximately two orders of magnitude slower than a tuned classical baseline at the tested sizes. Finally, we find that the runtime advantage of the BF-DCQO hybrid algorithm arXiv:2505.08663 is not observed under more comprehensive benchmarking. Therefore, on current NISQ hardware, runtime-based quantum advantage has not yet been demonstrated under experimentally grounded performance metrics, and credible claims require careful time accounting, appropriate performance measures, and properly chosen classical reference implementations, as discussed in this work.

arXiv:2510.06337•Physical Review Applied•Mar 17, 2026•1 citation

The Quantum AI Convergence: State-of-the-Art Architectures, Enterprise Applications, and Post-Quantum Paradigms

Michael Pendleton

This paper explores the transformative intersection of quantum computing and artificial intelligence, a synergy poised to redefine the limits of computational power. As classical deep learning approaches the "scaling wall," quantum-enhanced architectures offer a path forward through superior optimization and high-dimensional data processing. Abstract / Research Description The Quantum AI Convergence provides a comprehensive technical audit of how quantum mechanics is being integrated into modern machine learning workflows. The research transitions from theoretical foundations to practical enterprise deployment, focusing on three core pillars: 1. Hybrid Quantum-Classical Architectures The study analyzes the current state of Noisy Intermediate-Scale Quantum (NISQ) devices. It explores the efficacy of Quantum Neural Networks (QNNs) and Variational Quantum Eigensolvers (VQE), demonstrating how hybrid models utilize classical hardware for backpropagation while leveraging quantum circuits for complex feature mapping. 2. Enterprise Scaling and Application Beyond the laboratory, the paper investigates high-impact industry use cases where quantum advantage is becoming tangible: Pharmaceuticals: Accelerating molecular docking and drug discovery through quantum-enhanced simulations. Finance: Optimizing multi-variable portfolios and risk assessment models that exceed the capacity of Monte Carlo simulations. Logistics: Solving NP-hard optimization problems in global supply chain routing. 3. The Post-Quantum Paradigm As AI models become more powerful, the research addresses the critical security "double-edged sword." It evaluates the necessity of Post-Quantum Cryptography (PQC) to protect sensitive AI training data against future Shor’s algorithm-based attacks, ensuring that the evolution of intelligence does not come at the cost of absolute privacy. Key Technical Themes Quantum Supremacy vs. Quantum Advantage: Distinguishing between theoretical milestones and practical business value. Tensor Networks: Their role as a bridge between classical deep learning and quantum state representations. Algorithmic Efficiency: Comparing the complexity classes of classical vs. quantum kernels, specifically focusing on Grover’s and HHL algorithms. Research Objective: To provide a roadmap for CTOs and researchers to transition from "Quantum Curious" to "Quantum Ready," establishing a framework for integrating quantum-enhanced AI into existing enterprise tech stacks.

•Apr 9, 2026•0 citations

Quantum Neural Networks via Multi-Body Entanglement Optimization

Jincheng Zhang

This paper investigates the potential of quantum neural networks (QNNs) by focusing on optimizing multi-body entanglement within the network architecture. The core claim is that strategic manipulation of entanglement between multiple nodes in a neural network can significantly enhance computational capabilities and improve information encoding efficiency. The proposed mechanism involves designing an algorithm to dynamically control the entanglement strength between nodes. This allows for the realization of more efficient parallel computation and enhanced information encoding. We explore theoretical frameworks and mathematical formulations to demonstrate the potential advantages of this approach compared to classical neural networks. The research highlights a novel pathway toward constructing quantum-enhanced neural network models by leveraging the unique properties of quantum entanglement. The primary focus is on the mathematical modeling and optimization strategies required to effectively harness entanglement for QNN performance.

•Aug 31, 2026•0 citations

The BQNN Classical Baseline: Constructive Falsification of Near-Term Quantum Advantage at a Fifteen-Million-to-One Energy Disadvantage

Rowan Brad Quni-Gudzinas

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.

•Jul 27, 2026•0 citations
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 sits at the intersection of two paradigm-shifting technologies: quantum computing and deep learning. By exploiting quantum mechanical phenomena – superposition, entanglement, and interference – QML promises exponential or quadratic speedups over classical algorithms for certain learning tasks, as well as the ability to model quantum data natively. However, the path to practical quantum advantage remains contested, constrained by noisy intermediate-scale quantum (NISQ) hardware, limited qubit counts (50–1,000), coherence times (50–500 μs), and high gate error rates (10⁻³–10⁻⁴). This paper provides a rigorous, technically deep survey of QML: mathematical foundations (Hilbert spaces, unitary evolution, measurement, quantum circuits), canonical algorithms (quantum kernel methods, variational quantum circuits (VQCs), quantum neural networks (QNNs), QSVMs, quantum generative adversarial networks (QGANs), encoding strategies (angle, amplitude, basis, and Hamiltonian encoding), optimization landscapes (barren plateaus, parameter shift rules, ansatz design), hardware aware implementation on superconducting (IBM, Google), trapped ion (IonQ), and neutral atom (Pasqal) platforms, empirical benchmarks on near term devices for classification, generative modeling, and quantum chemistry, and pathways to fault tolerant quantum machine learning (FTQML) with error correction (surface codes, logical qubits). Researchers critically assess claims of quantum advantage, identify scenarios where QML may outperform classical ML (small data, high-dimensional feature spaces from quantum systems, kernel estimation), and propose concrete evaluation metrics (quantum-classical cross-validation, resource estimation).
Objective: To synthesize the state of the art on how quantum computing (QC) and artificial intelligence (AI) intersect, including algorithmic foundations, software/hardware stacks, empirical evidence of advantage, applications, and open challenges. Methods: We executed a structured search (2019 – 20th August 2025) across major journals (Nature portfolio, APS/PR, Elsevier), arXiv, and official framework documentation (Qiskit, Cirq/TFQ, PennyLane; AWS Braket; NVIDIA CUDA-Q). We included peer‑reviewed studies, comprehensive surveys, and official docs; we excluded opinion pieces and non-reproducible claims. Results: The field converges on hybrid quantum‑classical workflows with two dominant AI families: (i) quantum kernel methods and (ii) variational circuits/QNNs. Trainability remains a core challenge (barren plateaus and noise), with mitigation strategies advancing (local costs, layerwise training, engineered dissipation, learned decoders). Frameworks and cloud orchestrators now support end‑to‑end hybrid training. Empirical “utility” demonstrations in physics‑inspired tasks exist, while domain‑level advantage in mainstream ML is unproven and data‑dependent. Conclusions: QC‑AI integration is maturing into reproducible hybrid stacks. Near‑term value lies in quantum kernels with tailored feature maps, physics‑regularized QNNs, simulator‑accelerated pipelines, and AI‑for‑QC (calibration/decoding). Broad ML advantage awaits lower‑noise hardware and quantum‑friendly data embeddings.
A robust definition of quantum runtime is essential for assessing the performance of quantum algorithms and claims of quantum advantage. While for most classical hardware the total runtime is well approximated by computation plus a weakly varying constant, on current quantum hardware a clean experimental separation between "pure computation" and "overhead" is often not justified. Consequently, conventional quantum runtime analyses excluding substantial system-level overheads can lead to biased performance assessments. In this work we introduce experimentally grounded, end-to-end definitions of quantum runtime for digital and analogue quantum computers, together with a methodology for selecting strong classical baselines for quantum-classical runtime comparisons. Within this framework, we evaluate recent claims of quantum advantage in annealing and gate-based algorithms. We examine three representative case studies. First, we revisit annealing for approximate QUBO problems PRL 134, 160601 (2025), which employs a well-motivated time-to-εεε metric but effectively uses annealing time as a proxy for runtime. Second, we analyze a restricted implementation of Simon's problem PRX 15, 021082 (2025), where the favorable scaling in oracle calls is undisputed; however, we show that the estimated runtime of the quantum experiment is approximately two orders of magnitude slower than a tuned classical baseline at the tested sizes. Finally, we find that the runtime advantage of the BF-DCQO hybrid algorithm arXiv:2505.08663 is not observed under more comprehensive benchmarking. Therefore, on current NISQ hardware, runtime-based quantum advantage has not yet been demonstrated under experimentally grounded performance metrics, and credible claims require careful time accounting, appropriate performance measures, and properly chosen classical reference implementations, as discussed in this work.
This paper explores the transformative intersection of quantum computing and artificial intelligence, a synergy poised to redefine the limits of computational power. As classical deep learning approaches the "scaling wall," quantum-enhanced architectures offer a path forward through superior optimization and high-dimensional data processing. Abstract / Research Description The Quantum AI Convergence provides a comprehensive technical audit of how quantum mechanics is being integrated into modern machine learning workflows. The research transitions from theoretical foundations to practical enterprise deployment, focusing on three core pillars: 1. Hybrid Quantum-Classical Architectures The study analyzes the current state of Noisy Intermediate-Scale Quantum (NISQ) devices. It explores the efficacy of Quantum Neural Networks (QNNs) and Variational Quantum Eigensolvers (VQE), demonstrating how hybrid models utilize classical hardware for backpropagation while leveraging quantum circuits for complex feature mapping. 2. Enterprise Scaling and Application Beyond the laboratory, the paper investigates high-impact industry use cases where quantum advantage is becoming tangible: Pharmaceuticals: Accelerating molecular docking and drug discovery through quantum-enhanced simulations. Finance: Optimizing multi-variable portfolios and risk assessment models that exceed the capacity of Monte Carlo simulations. Logistics: Solving NP-hard optimization problems in global supply chain routing. 3. The Post-Quantum Paradigm As AI models become more powerful, the research addresses the critical security "double-edged sword." It evaluates the necessity of Post-Quantum Cryptography (PQC) to protect sensitive AI training data against future Shor’s algorithm-based attacks, ensuring that the evolution of intelligence does not come at the cost of absolute privacy. Key Technical Themes Quantum Supremacy vs. Quantum Advantage: Distinguishing between theoretical milestones and practical business value. Tensor Networks: Their role as a bridge between classical deep learning and quantum state representations. Algorithmic Efficiency: Comparing the complexity classes of classical vs. quantum kernels, specifically focusing on Grover’s and HHL algorithms. Research Objective: To provide a roadmap for CTOs and researchers to transition from "Quantum Curious" to "Quantum Ready," establishing a framework for integrating quantum-enhanced AI into existing enterprise tech stacks.
This paper investigates the potential of quantum neural networks (QNNs) by focusing on optimizing multi-body entanglement within the network architecture. The core claim is that strategic manipulation of entanglement between multiple nodes in a neural network can significantly enhance computational capabilities and improve information encoding efficiency. The proposed mechanism involves designing an algorithm to dynamically control the entanglement strength between nodes. This allows for the realization of more efficient parallel computation and enhanced information encoding. We explore theoretical frameworks and mathematical formulations to demonstrate the potential advantages of this approach compared to classical neural networks. The research highlights a novel pathway toward constructing quantum-enhanced neural network models by leveraging the unique properties of quantum entanglement. The primary focus is on the mathematical modeling and optimization strategies required to effectively harness entanglement for QNN performance.