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

Communications in computer and information science

A Survey of Quantum Algorithms for Computer Science

Ajay H. Kumar, Amar Jeet Singh, Sanjay Kumar

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-86069-0_29

Related papers

A brief introduction to quantum algorithms

Shihao Zhang, Lvzhou Li

arXiv:2212.10734•CCF Transactions on High Performance Computing•Feb 17, 2022•27 citations

Quantum Computing for Computational Sciences

Saleh Almutairi, Asem Alenaizan, Abduljabar Alsayoud +4 more

This article presents a comprehensive survey of the current frontier in quantum computing for computational sciences, evaluating the technical requirements to translate theoretical asymptotic speedups into practical utility in the areas of chemistry, biochemistry, and materials science. We review foundational algorithms, including the quantum Fourier transform, quantum phase estimation, and the quantum linear-system solver, along with variational heuristics such as variational quantum eigensolver and quantum approximate optimization algorithm. Particular emphasis is placed on near-optimal Hamiltonian simulation frameworks, specifically qubitization and quantum signal processing. Furthermore, we shed light on the current advances in quantum error correction codes, quantum hardware, and quantum software platforms. We then provide a comprehensive review of the application of quantum algorithms in four computational science domains that collectively represent the most compelling near-term targets for quantum advantage. This article aims to provide a clear and balanced perspective on the current state of the field and its future potential for advancing computational science.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Quantum Approaches to CICO Problems- A Survey of Current Solutions and Future Research Directions

Lalit Mohan Singh Negi, Sandeep Kumar

Quantum Computing is revolutionary paradigm that harnesses the principles of quantum mechanics such as superposition and entanglement to process the information in fundamentally new ways. It has shown potential across various fields, including Cryptography, Materials Science, Machine Learning, Optimization and many others. Among its many applications, Combinatorial Optimization problems stand out as a critical area where Quantum Computing can address problems that are often intractable for classical methods. This paper surveys current quantum approaches including Quantum Annealing, Variational Algorithms, Quantum Approximation Optimization Algorithm (QAOA) and asses their effectiveness in solving Classical Intractable Combinatorial Optimization (CICO) problems such as Max Cut Problem, Traveling Salesman Problem, Graph Coloring and Knapsack Problems. The paper explores the QAOA, approach to solve the CICO problems. Practical applications of quantum optimization approaches are highlighted in the fields such as finance, material science, communication networks. Additionally, the case studies demonstrate the algorithm's efficacy in real world scenarios. However, the paper also discusses the challenges that remain including issues related to noise, scalability and complexity of the algorithms. Finally, the survey discusses the future directions for research, emphasizing the potential of hybrid-quantum classical frameworks and the development of new quantum algorithms, aiming to enhance the practical applications in complex optimization scenarios. This survey provides valuable insights for researchers and practitioners interested in leveraging quantum advantages to solve combinatorial optimization problems effectively.

•Dec 27, 2024•1 citation

Review on Quantum Computing Tools and Algorithms

Midhun Madhu, Sunanda Dixit

Lecture notes on data engineering and communications technologies•Jan 1, 2020•1 citation

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

arXiv:1001.0767•Springer eBooks•Jan 1, 2012•23 citations

Quantum Computing Applications in the Fields of Cryptography, Material Science, and Machine Learning

Md Samiun, Nur Mohammad, Mohammad Ismail Hossain +1 more

Despite the significant scientific and engineering hurdles in advancing quantum computers, notable strides are being made toward utilizing this technology in commercial domains. Quantum computers are projected to exceed the computational power of classical computers within the next decade, potentially revolutionizing various industries. This study explores a range of fields that have already begun integrating quantum hardware. By presenting these as examples of combinatorial problems, we demonstrate their applications across three key sectors: cryptography, material science, and Machine Learning. Further, we will conduct a survey on various industries and companies to identify the broader usage of quantum computing in their manufacturing. The survey will analyze the diverse potential applications and current advantages of quantum hardware and algorithms. The results will help further researchers identify and segment the companies and understand the rapid application of quantum computing.

Journal of Mathematics and Statistics Studies•Dec 26, 2020•0 citations
This article presents a comprehensive survey of the current frontier in quantum computing for computational sciences, evaluating the technical requirements to translate theoretical asymptotic speedups into practical utility in the areas of chemistry, biochemistry, and materials science. We review foundational algorithms, including the quantum Fourier transform, quantum phase estimation, and the quantum linear-system solver, along with variational heuristics such as variational quantum eigensolver and quantum approximate optimization algorithm. Particular emphasis is placed on near-optimal Hamiltonian simulation frameworks, specifically qubitization and quantum signal processing. Furthermore, we shed light on the current advances in quantum error correction codes, quantum hardware, and quantum software platforms. We then provide a comprehensive review of the application of quantum algorithms in four computational science domains that collectively represent the most compelling near-term targets for quantum advantage. This article aims to provide a clear and balanced perspective on the current state of the field and its future potential for advancing computational science.
Quantum Computing is revolutionary paradigm that harnesses the principles of quantum mechanics such as superposition and entanglement to process the information in fundamentally new ways. It has shown potential across various fields, including Cryptography, Materials Science, Machine Learning, Optimization and many others. Among its many applications, Combinatorial Optimization problems stand out as a critical area where Quantum Computing can address problems that are often intractable for classical methods. This paper surveys current quantum approaches including Quantum Annealing, Variational Algorithms, Quantum Approximation Optimization Algorithm (QAOA) and asses their effectiveness in solving Classical Intractable Combinatorial Optimization (CICO) problems such as Max Cut Problem, Traveling Salesman Problem, Graph Coloring and Knapsack Problems. The paper explores the QAOA, approach to solve the CICO problems. Practical applications of quantum optimization approaches are highlighted in the fields such as finance, material science, communication networks. Additionally, the case studies demonstrate the algorithm's efficacy in real world scenarios. However, the paper also discusses the challenges that remain including issues related to noise, scalability and complexity of the algorithms. Finally, the survey discusses the future directions for research, emphasizing the potential of hybrid-quantum classical frameworks and the development of new quantum algorithms, aiming to enhance the practical applications in complex optimization scenarios. This survey provides valuable insights for researchers and practitioners interested in leveraging quantum advantages to solve combinatorial optimization problems effectively.
Despite the significant scientific and engineering hurdles in advancing quantum computers, notable strides are being made toward utilizing this technology in commercial domains. Quantum computers are projected to exceed the computational power of classical computers within the next decade, potentially revolutionizing various industries. This study explores a range of fields that have already begun integrating quantum hardware. By presenting these as examples of combinatorial problems, we demonstrate their applications across three key sectors: cryptography, material science, and Machine Learning. Further, we will conduct a survey on various industries and companies to identify the broader usage of quantum computing in their manufacturing. The survey will analyze the diverse potential applications and current advantages of quantum hardware and algorithms. The results will help further researchers identify and segment the companies and understand the rapid application of quantum computing.