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

Advanced Computing and Communication Technologies for High Performance Applications (ACCTHPA)

Comparative Analysis of Quantum Computing Algorithm

A P Nirmala, V Asha, Binju Saju, Sarath C Murali, Darwin P Jacob, Basil John Mathew

Published Jan 20, 2023• 1 citation
Publisher

Abstract

The reason of quantum computer systems is to carry out preferred computer systems through jogging the quantum algorithm. Quantum algorithms can be utilized in a ramification of contexts, such as search and optimization, cryptography, the answer of complex linear equations, and simulation of quantum systems. Right here in this look at a quick survey of some familiar quantum algorithms, with the significance of a large assessment of their application instead of their technical details. Also, cover the application of quantum algorithms and a discussion of latest improvement.

DOI
10.1109/accthpa57160.2023.10083363

Related papers

Quantum algorithms: an overview

Ashley Montanaro

Abstract Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.

arXiv:1511.04206•npj Quantum Information•Jan 12, 2016•1,071 citations

Progress and Prospects of Quantum Algorithms

Hang Yang, Bi Wu, Yongbo Xuan +2 more

Quantum computers are designed to outperform standard computers by running quantum algorithms. Fields in which quantum algorithms can be applied include cryptography, search and optimization, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We focus to introduce the development of entire field, and provide a comprehensive and accurate understanding concerning this field, which may be helpful for interested researchers in this area.

World Symposium on Software Engineering (WSSE)•Sep 28, 2022•2 citations

Comparative Study of Quantum Algorithms: A Comprehensive Analysis

Neha Junagade, Sheetal Umesh Bhandari, Rachana Y Patil

Quantum computing is a rapidly growing field. Quantum algorithms play a significant role and have applications in cryptography, machine learning, optimization, and computational issues [1][2]. They quantum features like entanglement and superposition that help carryout tasks that would be difficult for a classical computer. More Interest has been developed in Quantum algorithms due to their ability to solve specific computational problems quicker than that in classical algorithms [3]. These algorithms use fundamentals of quantum physics to carryout calculations quickly and effectively than traditional algorithms. Here in-depth analysis of quantum algorithms and classical algorithms is done by looking at the time and space complexity of quantum and classical algorithms including their capacity to tackle specific types of issues.First, we conduct a general comparison of Classical and Quantum Algorithm along with Background and motivation. We also discuss Simon's algorithm first and then Grover's algorithm in depth and their comparison with few other algorithms in a table format [5][6][7][8]. We also cover some recent advancements, Quantum supremacy, Post-Quantum Cryptography, 8 Quantum Artificial Intelligence, Hybrid Quantum-Classical Algorithms and few other important parameters. We also discuss the plausible impact of quantum algorithms on cybersecurity and cryptography [13][9]. Overall, this comparative study shows the uses and challenges involved in implementing quantum algorithms while offering an overview of quantum algorithms. We conclude by the fundamental ideas of quantum algorithms. Adding to this we also discuss the challenges and limitations of using quantum algorithms in practically. At the end, we provide a summary of the primary findings from this comparative study of Quantum and classical algorithms.

International Conference on Computing Communication Control and automation•Aug 23, 2024•1 citation

Quantum Algorithms: A Survey of Applications and End-to-end Complexities

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multiple quantum algorithmic primitives into an overall quantum algorithm, which must then incorporate the methods of quantum error correction and fault tolerance to be implemented correctly on quantum hardware. As such, it can be difficult to assess how much a particular application benefits from quantum computing, as the various approaches are often sensitive to intricate technical details about the underlying primitives and their complexities. Here we present a survey of several potential application areas of quantum algorithms and their underlying algorithmic primitives, carefully considering technical caveats and subtleties. We outline the challenges and opportunities in each area in an "end-to-end" fashion by clearly defining the problem being solved alongside the input-output model, instantiating all "oracles," and spelling out all hidden costs. We also compare quantum solutions against state-of-the-art classical methods and complexity-theoretic limitations to evaluate possible quantum speedups. The survey is written in a modular, wiki-like fashion to facilitate navigation of the content. Each primitive and application area is discussed in a standalone section, with its own bibliography of references and embedded hyperlinks that direct to other relevant sections. This structure mirrors that of complex quantum algorithms that involve several layers of abstraction, and it enables rapid evaluation of how end-to-end complexities are impacted when subroutines are altered.

arXiv:2310.03011•Oct 4, 2023•49 citations

Modelling the Impact of Quantum Circuit Imperfections on Networks and Computer Applications

Savo Glisic

Post Quantum and Quantum Cryptography schemes are feasible quantum computer applications for 7G networks. These schemes could possibly replace existing schemes. These algorithms have been compromised by advances in quantum search algorithms run on quantum computers like Shor algorithm. Shor algorithm is a quantum algorithm for finding the prime factors of an integer which is the basis of existing algorithm. This has become an available quantum computer application putting the use of ESA algorithm at risk. Our recent paper provides a detailed survey of the work on post quantum and quantum cryptography algorithms with focus on their applicability in 7G networks. Since the paper focuses on the cryptography algorithms as a follow up, in this paper, we provide a new framework for quantum network optimization and survey in detail the work on enabling technologies (quantum hardware) for the practical implementation of these algorithms including the most important segments of quantum hardware in 7G. As always in engineering practice practical solutions are a compromise between the performance and complexity of the implementation. For this reason, as the main contribution, the paper presents a network and computer applications optimization framework that includes implementation imperfections. The tools should be useful in optimizing future generation practical computer system design. After that a comprehensive survey of the existing work on quantum hardware is presented pointing out the sources of these imperfections. This enables us to make a fair assessment of how much investment into quantum hardware improvements contributes to the performance enhancement of the overall system. In this way a decision can be made on proper partitioning between the investment in hardware and system level complexity.

arXiv:2404.00062•Mar 27, 2024•0 citations

Quantum Computing: Algorithms and Applications

Sara Syed

Quantum computing is a modern new paradigm of computation similarly exploiting the standards of quantum mechanics like superposition, entanglement and quantum interference to finish computations a good way to be unfathomable for classical computers. This paper follows the trails to the theoretical foundations of quantum computing and offers with a few essential algorithms for quantum computing like Shor's set of rules for factorization, Grover's set of rules for search, Quantum Fourier Transform and Quantum Approximate Optimization Algorithm (QAOA). This paper specializes in how complicated the computation is, mathematical ideas underlying such algorithms and their feasible makes use of in cryptography, optimization and simulation in quantum. By sifting thru the interaction among quantum mechanics and algorithmic design, this paintings offers a few perception into the mechanisms that permit for quantum speedup, the cutting-edge obstacles due to hardware obstacles and mistakess charges and what may be carried out withinside the destiny each theoretically and empirically.

J-STAR: Journal of Social & Technological Advanced Research•Sep 16, 2025•0 citations
The reason of quantum computer systems is to carry out preferred computer systems through jogging the quantum algorithm. Quantum algorithms can be utilized in a ramification of contexts, such as search and optimization, cryptography, the answer of complex linear equations, and simulation of quantum systems. Right here in this look at a quick survey of some familiar quantum algorithms, with the significance of a large assessment of their application instead of their technical details. Also, cover the application of quantum algorithms and a discussion of latest improvement.
Abstract Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.
Quantum computers are designed to outperform standard computers by running quantum algorithms. Fields in which quantum algorithms can be applied include cryptography, search and optimization, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We focus to introduce the development of entire field, and provide a comprehensive and accurate understanding concerning this field, which may be helpful for interested researchers in this area.
Quantum computing is a rapidly growing field. Quantum algorithms play a significant role and have applications in cryptography, machine learning, optimization, and computational issues [1][2]. They quantum features like entanglement and superposition that help carryout tasks that would be difficult for a classical computer. More Interest has been developed in Quantum algorithms due to their ability to solve specific computational problems quicker than that in classical algorithms [3]. These algorithms use fundamentals of quantum physics to carryout calculations quickly and effectively than traditional algorithms. Here in-depth analysis of quantum algorithms and classical algorithms is done by looking at the time and space complexity of quantum and classical algorithms including their capacity to tackle specific types of issues.First, we conduct a general comparison of Classical and Quantum Algorithm along with Background and motivation. We also discuss Simon's algorithm first and then Grover's algorithm in depth and their comparison with few other algorithms in a table format [5][6][7][8]. We also cover some recent advancements, Quantum supremacy, Post-Quantum Cryptography, 8 Quantum Artificial Intelligence, Hybrid Quantum-Classical Algorithms and few other important parameters. We also discuss the plausible impact of quantum algorithms on cybersecurity and cryptography [13][9]. Overall, this comparative study shows the uses and challenges involved in implementing quantum algorithms while offering an overview of quantum algorithms. We conclude by the fundamental ideas of quantum algorithms. Adding to this we also discuss the challenges and limitations of using quantum algorithms in practically. At the end, we provide a summary of the primary findings from this comparative study of Quantum and classical algorithms.
The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multiple quantum algorithmic primitives into an overall quantum algorithm, which must then incorporate the methods of quantum error correction and fault tolerance to be implemented correctly on quantum hardware. As such, it can be difficult to assess how much a particular application benefits from quantum computing, as the various approaches are often sensitive to intricate technical details about the underlying primitives and their complexities. Here we present a survey of several potential application areas of quantum algorithms and their underlying algorithmic primitives, carefully considering technical caveats and subtleties. We outline the challenges and opportunities in each area in an "end-to-end" fashion by clearly defining the problem being solved alongside the input-output model, instantiating all "oracles," and spelling out all hidden costs. We also compare quantum solutions against state-of-the-art classical methods and complexity-theoretic limitations to evaluate possible quantum speedups. The survey is written in a modular, wiki-like fashion to facilitate navigation of the content. Each primitive and application area is discussed in a standalone section, with its own bibliography of references and embedded hyperlinks that direct to other relevant sections. This structure mirrors that of complex quantum algorithms that involve several layers of abstraction, and it enables rapid evaluation of how end-to-end complexities are impacted when subroutines are altered.
Post Quantum and Quantum Cryptography schemes are feasible quantum computer applications for 7G networks. These schemes could possibly replace existing schemes. These algorithms have been compromised by advances in quantum search algorithms run on quantum computers like Shor algorithm. Shor algorithm is a quantum algorithm for finding the prime factors of an integer which is the basis of existing algorithm. This has become an available quantum computer application putting the use of ESA algorithm at risk. Our recent paper provides a detailed survey of the work on post quantum and quantum cryptography algorithms with focus on their applicability in 7G networks. Since the paper focuses on the cryptography algorithms as a follow up, in this paper, we provide a new framework for quantum network optimization and survey in detail the work on enabling technologies (quantum hardware) for the practical implementation of these algorithms including the most important segments of quantum hardware in 7G. As always in engineering practice practical solutions are a compromise between the performance and complexity of the implementation. For this reason, as the main contribution, the paper presents a network and computer applications optimization framework that includes implementation imperfections. The tools should be useful in optimizing future generation practical computer system design. After that a comprehensive survey of the existing work on quantum hardware is presented pointing out the sources of these imperfections. This enables us to make a fair assessment of how much investment into quantum hardware improvements contributes to the performance enhancement of the overall system. In this way a decision can be made on proper partitioning between the investment in hardware and system level complexity.
Quantum computing is a modern new paradigm of computation similarly exploiting the standards of quantum mechanics like superposition, entanglement and quantum interference to finish computations a good way to be unfathomable for classical computers. This paper follows the trails to the theoretical foundations of quantum computing and offers with a few essential algorithms for quantum computing like Shor's set of rules for factorization, Grover's set of rules for search, Quantum Fourier Transform and Quantum Approximate Optimization Algorithm (QAOA). This paper specializes in how complicated the computation is, mathematical ideas underlying such algorithms and their feasible makes use of in cryptography, optimization and simulation in quantum. By sifting thru the interaction among quantum mechanics and algorithmic design, this paintings offers a few perception into the mechanisms that permit for quantum speedup, the cutting-edge obstacles due to hardware obstacles and mistakess charges and what may be carried out withinside the destiny each theoretically and empirically.