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

Quantum Computing vs Classical Computers A Theoretical and Empirical Study of Performance, Reliability, and Sustainability

Rehan Arqam, Zeshan Supervisor

Published Apr 7, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.14912.08966

Related papers

Quantum Computing vs Classical Computers A Theoretical and Empirical Study of Performance, Reliability, and Sustainability Revision History List of Tables

Rehan Arqam, Zeshan Supervisor

•Jan 1, 2026•0 citations

Quantum Circuit Placement in Hybrid Neural Networks: An Empirical Analysis of Early versus Late Fusion Architectures

Punarva Chandrakanth, Venugopal K

Hybrid Quantum-Classical Neural Networks (HQC-NNs) integrate Parameterized Quantum Circuits (PQCs) with classical deep learning. We systematically compare Early Fusion (quantum preprocessing) versus Late Fusion (quantum classification) across nine classification tasks. Using 6-qubit circuits evaluated over 30 independent trials per task with Bonferroni-corrected statistical validation, Early Fusion achieves superior performance on 6/9 tasks, significantly outperforming Late Fusion on problems requiring global feature correlations: Parity Problem (91.5% vs 83.1%), Entangled XOR (89.3% vs 83.5%), and multiclass digit recognition (92.9% vs 88.1%). Late Fusion demonstrates nominal advantages on structured visual data with geometric patterns (Fashion-MNIST: 92.0% vs 90.0%). We characterize performance differences through an information-theoretic embedding bottleneck framework. Gradient flow analysis reveals 2.1× faster convergence (in terms of training epochs) for Early Fusion on complex tasks, while noise robustness analysis indicates advantages persist under representative NISQ noise levels (p ≤ 0.02). The observed performance gains are attributed to architectural inductive bias differences rather than provable quantum computational speedups, providing principled, empirically validated task-dependent architectural guidelines for quantum machine learning practitioners.

IEEE Guwahati Subsection Conference (GCON)•Jun 1, 2026•0 citations

A Study and Analysis of Applications of Classical Computing and Quantum Computing: A Survey

A. V. Navaneeth, M R Dileep

Lecture notes in networks and systems•Dec 16, 2020•13 citations

Implementation of Database Search with Quantum Computing: Grover's Algorithm vs Linear Search

Sachin Khurana, Manisha J. Nene

The present study aims to examine the real-world implications of Grover's algorithm, specifically focusing on its quadratic speedup in contrast to classical linear search techniques employed for unsorted databases. The objective is to bridge the gap between theoretical potential and practical application in the field of quantum computing. This study conducts a comprehensive analysis of Grover's Algorithm and traditional linear search across databases of varying sizes, uniquely contributing by empirically validating Grover's Algorithm's superior performance and aligning it with theoretical expectations. Significantly, the study expands its analysis to encompass larger databases, further affirming the algorithm's utility in handling growing database sizes. This study significantly contributes to the progress of quantum computing through the practical implementation of theoretical principles as well as enhancing the scientific community's understanding of quantum search algorithms and their relative efficacy.

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)•Nov 2, 2023•9 citations

A Brief Summary of Quantum Computing Research

Curtis Busby-Earle

•Jan 1, 2025•0 citations

Quantum vs. Classical Machine Learning: A Unified Empirical Comparison

C Shijia Yu, Jiaming Liu, Zihao Ge +4 more

Quantum computing has emerged as a promising computational paradigm for machine learning (ML), with the potential to offer computational advantages over classical approaches. At this stage, the evidence supporting the performance and advantages of quantum machine learning (QML) models relative to classical models is insufficient. To address this gap, this paper presents an empirical study on the performance of QML models and their classical counterparts. We compare seven model pairs spanning supervised learning and reinforcement learning. Our results indicate that the evaluated quantum machine learning models do not yet surpass the classical baselines in overall prediction performance, policy stability, or training time. Nevertheless, QML remains a promising approach for filtering noise and controlling false positives. Our research findings summarize the challenges facing quantum machine learning across hardware environments, training efficiency, and convergence stability, providing a foundation for research into the robustness and parameter optimization of QML. This work is publicly available at https://github.com/Z-537-437/QML.

arXiv:2607.01197•Jul 1, 2026•1 citation
Hybrid Quantum-Classical Neural Networks (HQC-NNs) integrate Parameterized Quantum Circuits (PQCs) with classical deep learning. We systematically compare Early Fusion (quantum preprocessing) versus Late Fusion (quantum classification) across nine classification tasks. Using 6-qubit circuits evaluated over 30 independent trials per task with Bonferroni-corrected statistical validation, Early Fusion achieves superior performance on 6/9 tasks, significantly outperforming Late Fusion on problems requiring global feature correlations: Parity Problem (91.5% vs 83.1%), Entangled XOR (89.3% vs 83.5%), and multiclass digit recognition (92.9% vs 88.1%). Late Fusion demonstrates nominal advantages on structured visual data with geometric patterns (Fashion-MNIST: 92.0% vs 90.0%). We characterize performance differences through an information-theoretic embedding bottleneck framework. Gradient flow analysis reveals 2.1× faster convergence (in terms of training epochs) for Early Fusion on complex tasks, while noise robustness analysis indicates advantages persist under representative NISQ noise levels (p ≤ 0.02). The observed performance gains are attributed to architectural inductive bias differences rather than provable quantum computational speedups, providing principled, empirically validated task-dependent architectural guidelines for quantum machine learning practitioners.
The present study aims to examine the real-world implications of Grover's algorithm, specifically focusing on its quadratic speedup in contrast to classical linear search techniques employed for unsorted databases. The objective is to bridge the gap between theoretical potential and practical application in the field of quantum computing. This study conducts a comprehensive analysis of Grover's Algorithm and traditional linear search across databases of varying sizes, uniquely contributing by empirically validating Grover's Algorithm's superior performance and aligning it with theoretical expectations. Significantly, the study expands its analysis to encompass larger databases, further affirming the algorithm's utility in handling growing database sizes. This study significantly contributes to the progress of quantum computing through the practical implementation of theoretical principles as well as enhancing the scientific community's understanding of quantum search algorithms and their relative efficacy.
Quantum computing has emerged as a promising computational paradigm for machine learning (ML), with the potential to offer computational advantages over classical approaches. At this stage, the evidence supporting the performance and advantages of quantum machine learning (QML) models relative to classical models is insufficient. To address this gap, this paper presents an empirical study on the performance of QML models and their classical counterparts. We compare seven model pairs spanning supervised learning and reinforcement learning. Our results indicate that the evaluated quantum machine learning models do not yet surpass the classical baselines in overall prediction performance, policy stability, or training time. Nevertheless, QML remains a promising approach for filtering noise and controlling false positives. Our research findings summarize the challenges facing quantum machine learning across hardware environments, training efficiency, and convergence stability, providing a foundation for research into the robustness and parameter optimization of QML. This work is publicly available at https://github.com/Z-537-437/QML.