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 on data engineering and communications technologies

Quantum Computing Algorithms and Real-World Applications

Li Huang

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-96-0208-7_31

Related papers

QUANTUM COMPUTING AND ALGORITHMS

Mr. K. Suresh Babu Dr. T. P. Anish Dr. Cornelius K

•Mar 24, 2026•0 citations

Emerging Trends in Quantum Computing: From Theory to Real World Applications

Faisal Javed, Maria Aslam

Quantum computing (QC) has shifted from purely theoretical constructs to experimental platforms approaching practical application. Recent advancements in qubit coherence, error correction, quantum algorithms, and hardware scalability have enabled the first prototypes of quantum advantage in select tasks. This article reviews emerging trends in quantum computing—from theoretical foundations to real-world implementations—highlighting progress in hardware (superconducting qubits, trapped ions, topological qubits), software (quantum algorithms, hybrid quantum-classical frameworks), and application domains (cryptography, optimization, quantum simulation, and materials design). We analyze challenges that remain—noise, error rates, decoherence, scalability—and discuss prospective pathways for integrating quantum computers into industry-scale applications. Insights from recent experimental demonstrations and roadmap studies are synthesized to project a near-term outlook for QC adoption.

International Research Journal of Advanced Science•Jun 30, 2022•0 citations

Quantum computing and algorithms

Author 1 - Mr. K. Suresh Babu Author 2 : Dr. T. P. Anish Author 3 : Dr. Cornelius K

•Dec 3, 2025•0 citations

Characterizing Grover search algorithm on large-scale superconducting quantum computers

M. AbuGhanem

Quantum computing is on the cusp of transforming the way we tackle complex problems, and the Grover search algorithm exemplifying its potential to revolutionize the search for unstructured large datasets, offering remarkable speedups over classical methods. Here, we report results for the implementation and characterization of a three-qubit Grover search algorithm using the state-of-the-art scalable quantum computing technology of superconducting quantum architectures. To delve into the algorithm's scalability and performance metrics, our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum's 127-qubit quantum computers. Moreover, we conduct five quantum state tomography experiments to precisely gauge the behavior and efficiency of our implemented algorithm under diverse conditions - ranging from noisy, noise-free environments to the complexities of real-world quantum hardware. By connecting theoretical concepts with real-world experiments, this study not only shed light on the potential of Noisy Intermediate-Scale Quantum Computers in facilitating large-scale database searches but also offer valuable insights into the practical application of the Grover search algorithm in real-world quantum computing applications.

arXiv:2406.16018•Scientific Reports•Jan 8, 2025•53 citations

Quantum Computing Algorithms

Andreas Bärtschi

•Feb 16, 2024•0 citations

Application of quantum computing to a linear non-Gaussian acyclic model for novel medical knowledge discovery

Hideaki Kawaguchi

Recently, the utilization of real-world medical data collected from clinical sites has been attracting attention. Especially as the number of variables in real-world medical data increases, causal discovery becomes more and more effective. On the other hand, it is necessary to develop new causal discovery algorithms suitable for small data sets for situations where sample sizes are insufficient to detect reasonable causal relationships, such as rare diseases and emerging infectious diseases. This study aims to develop a new causal discovery algorithm suitable for a small number of real-world medical data using quantum computing, one of the emerging information technologies attracting attention for its application in machine learning. In this study, a new algorithm that applies the quantum kernel to a linear non-Gaussian acyclic model, one of the causal discovery algorithms, is developed. Experiments on several artificial data sets showed that the new algorithm proposed in this study was more accurate than existing methods with the Gaussian kernel under various conditions in the low-data regime. When the new algorithm was applied to real-world medical data, a case was confirmed in which the causal structure could be correctly estimated even when the amount of data was small, which was not possible with existing methods. Furthermore, the possibility of implementing the new algorithm on real quantum hardware was discussed. This study suggests that the new proposed algorithm using quantum computing might be a good choice among the causal discovery algorithms in the low-data regime for novel medical knowledge discovery.

arXiv:2110.04485•PLoS ONE•Apr 5, 2023•11 citations
Quantum computing (QC) has shifted from purely theoretical constructs to experimental platforms approaching practical application. Recent advancements in qubit coherence, error correction, quantum algorithms, and hardware scalability have enabled the first prototypes of quantum advantage in select tasks. This article reviews emerging trends in quantum computing—from theoretical foundations to real-world implementations—highlighting progress in hardware (superconducting qubits, trapped ions, topological qubits), software (quantum algorithms, hybrid quantum-classical frameworks), and application domains (cryptography, optimization, quantum simulation, and materials design). We analyze challenges that remain—noise, error rates, decoherence, scalability—and discuss prospective pathways for integrating quantum computers into industry-scale applications. Insights from recent experimental demonstrations and roadmap studies are synthesized to project a near-term outlook for QC adoption.
Quantum computing is on the cusp of transforming the way we tackle complex problems, and the Grover search algorithm exemplifying its potential to revolutionize the search for unstructured large datasets, offering remarkable speedups over classical methods. Here, we report results for the implementation and characterization of a three-qubit Grover search algorithm using the state-of-the-art scalable quantum computing technology of superconducting quantum architectures. To delve into the algorithm's scalability and performance metrics, our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum's 127-qubit quantum computers. Moreover, we conduct five quantum state tomography experiments to precisely gauge the behavior and efficiency of our implemented algorithm under diverse conditions - ranging from noisy, noise-free environments to the complexities of real-world quantum hardware. By connecting theoretical concepts with real-world experiments, this study not only shed light on the potential of Noisy Intermediate-Scale Quantum Computers in facilitating large-scale database searches but also offer valuable insights into the practical application of the Grover search algorithm in real-world quantum computing applications.
Recently, the utilization of real-world medical data collected from clinical sites has been attracting attention. Especially as the number of variables in real-world medical data increases, causal discovery becomes more and more effective. On the other hand, it is necessary to develop new causal discovery algorithms suitable for small data sets for situations where sample sizes are insufficient to detect reasonable causal relationships, such as rare diseases and emerging infectious diseases. This study aims to develop a new causal discovery algorithm suitable for a small number of real-world medical data using quantum computing, one of the emerging information technologies attracting attention for its application in machine learning. In this study, a new algorithm that applies the quantum kernel to a linear non-Gaussian acyclic model, one of the causal discovery algorithms, is developed. Experiments on several artificial data sets showed that the new algorithm proposed in this study was more accurate than existing methods with the Gaussian kernel under various conditions in the low-data regime. When the new algorithm was applied to real-world medical data, a case was confirmed in which the causal structure could be correctly estimated even when the amount of data was small, which was not possible with existing methods. Furthermore, the possibility of implementing the new algorithm on real quantum hardware was discussed. This study suggests that the new proposed algorithm using quantum computing might be a good choice among the causal discovery algorithms in the low-data regime for novel medical knowledge discovery.