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

Lecture notes in networks and systems

An Empirical Investigation into Quantum Algorithms

Himanshak Chawla, Ritika Wason, Parul Arora, Gagandeep Singh Narula

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-2550-2_65

Related papers

Empirical Investigation of Quantum Computing Toolchains and Algorithms : Mining Stack Overflow Repository

Maryam Tavassoli Sabzevari, Arif Ali Khan

ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)•Jul 5, 2026•0 citations

Quantum algorithms: A survey of some recent results

Martin Rötteler

Informatik - Forschung und Entwicklung•Sep 15, 2006•20 citations

Quantum Algorithms: Application and Feasibility

Duong Bui, Kimmo Halunen, Nhan Nguyen +1 more

Lecture notes in computer science•Nov 26, 2024•0 citations

Quantum Gate-Model Approaches to Exact and Approximate Optimization

Stuart Hadfield

Many of the most challenging computational problems arising in practical applications are tackled by heuristic algorithms which have not been rigorously proven to outperform other approaches but rather have been empirically demonstrated to be effective. While quantum heuristics have been proposed since the early days of quantum computing, true empirical evaluation of the real-world performance of these algorithms is only becoming possible now as increasingly powerful quantum gate-model devices continue to come online.In this talk, I will give an overview of the NASA QuAIL team's ongoing investigation into quantum gate-model heuristic algorithms for exact and approximate optimization. In particular, we consider the performance of the Quantum Approximate Optimization Algorithm on NP-hard optimization problems, and describe algorithm parameter setting strategies for real-world quantum hardware. We then show a generalization of QAOA circuits, the Quantum Alternating Operator Ansatz, especially suitable for low-resource implementations of QAOA for problems with hard (feasibility) constraints. The talk will conclude with a discussion of research challenges, particularly for optimization and sampling applications of QAOA, and the potential of more general quantum heuristics to give advantages over classical computers.

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

Quantum Computing in Molecular Design and Drug Discovery: A Systematic Literature Review

Charnelle Razo, Belinda Mutunhu Ndlovu

This study examines how quantum computing (QC) is being applied to molecular design and drug discovery. This study aims to investigates how QC surpasses classical limitations, focusing on empirical performance in precision, accuracy, and optimisation tasks. Study design use PRISMA 2009 guidelines, 15 empirical studies (2020-2025) were included. Data were extracted on the drug-discovery stage, the algorithm used, evaluation metrics, benefits, and limitations. The findings show QC outperforms classical methods particularly through hybrid quantum–classical models. Thirteen studies reported superior gains, including AUC–ROC values of 0.80–0.95, +30% improvement in drug-likeness (QED), +6% increase in prediction accuracy, and up to 99% accuracy in drug–target interaction tasks. However, noisy intermediate-scale quantum (NISQ) hardware limitations and poor scalability limit real-world deployment, due to noise, and limited qubit counts. Consequently, current performance results are largely simulation-based rather than hardware-validated. In contrast to prior algorithm-centric reviews, this study provides a consolidated empirical synthesis and proposes a hybrid quantum–classical pipeline that maps high-performing algorithms across the drug discovery workflow under NISQ-era constraints. These findings inform pharmaceutical research and development by identifying realistic adoption pathways and the boundaries of current technological readiness.

Journal of Information Systems and Informatics•Feb 12, 2026•0 citations

On quantum algorithms

CleveRichard, EkertArtur, HendersonLea +2 more

Complexity•Sep 1, 1998•0 citations
Many of the most challenging computational problems arising in practical applications are tackled by heuristic algorithms which have not been rigorously proven to outperform other approaches but rather have been empirically demonstrated to be effective. While quantum heuristics have been proposed since the early days of quantum computing, true empirical evaluation of the real-world performance of these algorithms is only becoming possible now as increasingly powerful quantum gate-model devices continue to come online.In this talk, I will give an overview of the NASA QuAIL team's ongoing investigation into quantum gate-model heuristic algorithms for exact and approximate optimization. In particular, we consider the performance of the Quantum Approximate Optimization Algorithm on NP-hard optimization problems, and describe algorithm parameter setting strategies for real-world quantum hardware. We then show a generalization of QAOA circuits, the Quantum Alternating Operator Ansatz, especially suitable for low-resource implementations of QAOA for problems with hard (feasibility) constraints. The talk will conclude with a discussion of research challenges, particularly for optimization and sampling applications of QAOA, and the potential of more general quantum heuristics to give advantages over classical computers.
This study examines how quantum computing (QC) is being applied to molecular design and drug discovery. This study aims to investigates how QC surpasses classical limitations, focusing on empirical performance in precision, accuracy, and optimisation tasks. Study design use PRISMA 2009 guidelines, 15 empirical studies (2020-2025) were included. Data were extracted on the drug-discovery stage, the algorithm used, evaluation metrics, benefits, and limitations. The findings show QC outperforms classical methods particularly through hybrid quantum–classical models. Thirteen studies reported superior gains, including AUC–ROC values of 0.80–0.95, +30% improvement in drug-likeness (QED), +6% increase in prediction accuracy, and up to 99% accuracy in drug–target interaction tasks. However, noisy intermediate-scale quantum (NISQ) hardware limitations and poor scalability limit real-world deployment, due to noise, and limited qubit counts. Consequently, current performance results are largely simulation-based rather than hardware-validated. In contrast to prior algorithm-centric reviews, this study provides a consolidated empirical synthesis and proposes a hybrid quantum–classical pipeline that maps high-performing algorithms across the drug discovery workflow under NISQ-era constraints. These findings inform pharmaceutical research and development by identifying realistic adoption pathways and the boundaries of current technological readiness.