{"technology":{"slug":"quantum-computing","name":"Quantum Computing","description":"Quantum computation, quantum algorithms, and quantum hardware. Includes quantum error correction, quantum supremacy experiments, and practical quantum applications.","discipline":"Physics / Computer Science","icon":"⚛️"},"lastUpdated":"2026-10-06T11:08:38.818Z","articleCount":15,"articles":[{"id":"oa-W3198799154","title":"Emerging quantum computing algorithms for quantum chemistry","authors":"Mário Motta, Julia E. Rice","journal":"Wiley Interdisciplinary Reviews Computational Molecular Science","pubDate":"2021-12-08","doi":"10.1002/wcms.1580","abstract":"Abstract Digital quantum computers provide a computational framework for solving the Schrödinger equation for a variety of many‐particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self‐contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molecular systems. Theoretical foundations and implementation details of the method are discussed, and their strengths, limitations, and recent advances are presented. This article is categorized under: Quantum Computing > Algorithms Electronic Structure Theory > Ab Initio Electronic Structure Methods Quantum Computing > Theory Development","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3198799154","citationCount":177,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/2109.02873"},{"id":"oa-W1545025828","title":"An Introduction to Quantum Computing Algorithms","authors":"A. O. Pittenger","journal":"Birkhäuser Boston eBooks","pubDate":"2000-01-01","doi":"10.1007/978-1-4612-1390-1","abstract":"In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of \"quantum machines\" one could imitate any quantum system.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W1545025828","citationCount":155,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W3089712125","title":"Towards a quantum computing algorithm for helicity amplitudes and parton showers","authors":"Khadeejah Bepari, Sarah Malik, Michael Spannowsky, Simon Williams","journal":"Physical review. D/Physical review. D.","pubDate":"2021-04-26","doi":"10.1103/physrevd.103.076020","abstract":"The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators, which include the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum that computers can provide. We propose general and extendable algorithms for quantum gate computers to facilitate calculations of helicity amplitudes and the parton shower process. The helicity amplitude calculation exploits the equivalence between spinors and qubits and the unique features of a quantum computer to compute the helicities of each particle involved simultaneously, thus fully utilizing the quantum nature of the computation. This advantage over classical computers is further exploited by the simultaneous computation of s- and t-channel amplitudes for a $2\\ensuremath{\\rightarrow}2$ process. The parton shower algorithm simulates collinear emission for a two-step, discrete parton shower. In contrast to classical implementations, the quantum algorithm constructs a wave function with a superposition of all shower histories for the whole parton shower process, thus removing the need to explicitly keep track of individual shower histories. Both algorithms utilize the quantum computers ability to remain in a quantum state throughout the computation and represent a first step towards a quantum computing algorithm describing the full collision event at the LHC.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3089712125","citationCount":38,"isOpenAccess":true,"pdfUrl":"http://link.aps.org/pdf/10.1103/PhysRevD.103.076020"},{"id":"oa-W2018051891","title":"Quantum computing algorithm for electromagnetic field simulation","authors":"Siddhartha Sinha, P. Russer","journal":"Quantum Information Processing","pubDate":"2009-10-01","doi":"10.1007/s11128-009-0133-x","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2018051891","citationCount":26,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W4384571950","title":"Quantum Computing: Algorithms,Architectures, and Applications","authors":"Wajdi Alghamdi, Reda Mohamed Salama, S. Hemalatha, Laith H. Jasim Alzubaidi, Uzakov Akrom, Senthil Kumar R","journal":"E3S Web of Conferences","pubDate":"2023-01-01","doi":"10.1051/e3sconf/202339904041","abstract":"Cryptography, optimization, simulation, and machine learning are just a few of the industries that might be completely transformed by quantum computing. This abstract gives a thorough introduction to quantum computing with an emphasis on its algorithms, architectures, and applications. In conclusion, this abstract offers an in-depth analysis of quantum computing, including its algorithms, structures, and applications. It highlights the revolutionary potential of quantum computing in tackling difficult issues that are beyond the scope of conventional computers, laying the groundwork for further research and understanding of this quickly developing topic.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4384571950","citationCount":11,"isOpenAccess":true,"pdfUrl":"https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/36/e3sconf_iconnect2023_04041.pdf"},{"id":"oa-W4413877446","title":"Quantum Computing Algorithm","authors":"Waqar Hassan, Mujahid Tabassum, Mohammad Asif Nawaz","journal":"Information systems engineering and management","pubDate":"2025-01-01","doi":"10.1007/978-3-031-99786-0_8","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4413877446","citationCount":0,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W39874385","title":"Quantum Computing Algorithms","authors":"Lov K. Grover","journal":"","pubDate":"2004-07-16","doi":"10.21236/ada425567","abstract":"When quantum computing was first being invented, it was hoped that it would be able to solve NP-complete problems just through the parallelism of quantum mechanics. Such a scheme would do a brute force search and would not need to use any of the structure of these problems. These hopes were dashed in 1995 by the BBBV paper, this proved that the best improvement that such an unstructured search scheme could provide was a square-root speedup. Based on this result, it is often said that quantum computing algorithms could not possibly solve NP-complete problems. However, it should be emphasized that this is only true if we look at the NP-complete problem as an exhaustive search problem. NP-complete problems have considerable structure and there well might be other more advantageous ways of looking at them. The science of quantum computation is relatively new and there are several unexplored directions. As described in the interim reports and briefly in this report, we have spent some time exploring novel algorithms that make use of the power of quantum mechanics to take advantage of the structured nature of these problems. This report describes the research that I and my collaborators have conducted at Bell Labs over the last five years. The report is organized as follows:","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W39874385","citationCount":0,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W4283277643","title":"Quantum Computing Algorithms","authors":"Alice Flarend, Bob Hilborn","journal":"","pubDate":"2022-04-15","doi":"10.1093/oso/9780192857972.003.0011","abstract":"Abstract Alice and Bob introduce and explain in detail some of the algorithms that convinced physicists and computer scientists that there might be something to this crazy idea of quantum computing. Each algorithm provides a case study of how the properties of quantum states can be used to provide an advantage for using a quantum computer compared to a classical computer. Alice and Bob describe the Deutsch algorithm, designed to answer a simple question about the properties of functions of binary digits (0 and 1), and the Simon algorithm, which finds a “secret code.” The Simon algorithm, like many other quantum algorithms, is a mix of quantum state algorithms and classical computational methods. Alice and Bob also introduce Hadamard gates that act on multi-qubit systems. Those gates play an important role in many quantum algorithms.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4283277643","citationCount":0,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W7215165640","title":"AN INTRODUCTION TO QUANTUM COMPUTING ALGORITHMS","authors":"Mr. Gajendra K. Shirsale, Dr. Deepak S. Sharma, Dr. Yogita D. Patil","journal":"International Engineering Journal For Research & Development","pubDate":"2024-03-08","doi":"","abstract":"With the increasing accessibility of quantum computers to the wider population, there is a growing demand for the education and training of a group of quantum programmers. This cohort predominantly consists of individuals who have primarily focused on the development of classical computer programs throughout their professional careers. Although existing quantum computers currently possess fewer than 100 qubits, it is widely anticipated that the quantum computing hardware will experience significant advancements in terms of qubit quantity, quality, and connectivity. The objective of this review is to elucidate the fundamental principles of quantum programming, which diverge significantly from classical programming. This will be achieved through the utilization of concise algebraic expressions, allowing for an optional comprehension of the captivating underlying principles of quantum mechanics. This paper provides an overview of quantum computing algorithms and their practical implementation on physical quantum hardware. In this study, we undertake a comprehensive examination of various quantum algorithms, with the objective of providing concise and self-contained descriptions for each. In this study, we demonstrate the practical implementation of the aforementioned algorithms on IBM's quantum computer. For each algorithm, we thoroughly analyze and compare the outcomes obtained from the implementation on the quantum computer with those obtained from the simulator. This analysis focuses on identifying and discussing any disparities that arise between the results obtained from the simulator and the actual hardware runs. This article serves as an introduction to quantum algorithms for computer scientists, physicists, and engineers, offering a comprehensive guide for their practical implementation.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W7215165640","citationCount":0,"isOpenAccess":true,"pdfUrl":"https://iejrd.com/index.php/iejrd/article/view/3126"},{"id":"oa-W7135580931","title":"Quantum computing algorithms for quantum chemistry","authors":"Jakub Višňák","journal":"Digital Repository (National Repository of Grey Literature)","pubDate":"2012-01-01","doi":"","abstract":"Title: Quantum computing algorithms for quantum chemistry Author: Jakub Višňák Abstract: The topic of this study is the simulation of the quantum algorithm for the diagonalization of the matrix representation of the all-electron Dirac-Coulomb hamiltonian of the SbH molecule. Two different limited CI expansions were used to describe both the ground state (X 0+ ) and the first excited doublet (A 1) by simulating the Iterative Phase Estinamtion Algorith (IPEA). In the simulations numerically performed in this work, the \"compact mapping\" has been employed for the representation of the evolution operator exp(i Hˆ t); in the theoretical part of the work, the \"direct mapping\" is described as well. The influence of the metodics for choosing the initial eigenvector estimate is studied in both IPEA A and IPEA B variants. For those variants, the success probabilities pm are computed for different single-points on the SbH dissociation curves. The initial eigenvector estimates based on the \"CISD(2)\" method are found to be sufficient for both studied LCI-expansions up to internuclear distance R  6 a0. The pm dependence on the overlap between the eigenvector in question and its inital estimate - 2 0  is studied the for IPEA B method. The usability of the both variants of the IPEA in possible later calculations is...","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W7135580931","citationCount":0,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W4391916300","title":"Quantum Computing Algorithms","authors":"Andreas Baertschi","journal":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","pubDate":"2024-02-16","doi":"","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4391916300","citationCount":0,"isOpenAccess":true,"pdfUrl":"https://www.osti.gov/servlets/purl/1557159"},{"id":"oa-W4408529631","title":"Quantum Computing: Algorithms","authors":"David S. Simon","journal":"Undergraduate texts in physics","pubDate":"2025-01-01","doi":"10.1007/978-3-031-81315-3_17","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4408529631","citationCount":0,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W4411160435","title":"Mathematical Approaches to Quantum Computing Algorithms","authors":"Bijumon Ramalayathil","journal":"Revista Electronica de Veterinaria","pubDate":"2024-12-25","doi":"10.69980/redvet.v25i2.1824","abstract":"Quantum computing has emerged as a revolutionary field that leverages quantum mechanics to perform computations exponentially faster than classical computers for certain problems. This paper explores the mathematical foundations and approaches underpinning quantum computing algorithms. The study delves into linear algebra, probability theory, group theory, and tensor calculus, which are integral to quantum algorithm design. Key algorithms such as Shor's algorithm for integer factorization and Grover's search algorithm are examined in detail, highlighting their mathematical structure and computational efficiency. The paper also discusses recent advances in quantum error correction and optimization algorithms for quantum systems.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W4411160435","citationCount":0,"isOpenAccess":true,"pdfUrl":"https://www.veterinaria.org/index.php/REDVET/article/download/1824/1473"},{"id":"oa-W7210274416","title":"Quantum Computing Algorithm Optimization","authors":"Jincheng Zhang","journal":"Zenodo (CERN European Organization for Nuclear Research)","pubDate":"2026-09-06","doi":"10.5281/zenodo.22512582","abstract":"This paper presents a novel algorithm optimization method leveraging the unique capabilities of quantum computing. Traditional optimization algorithms often struggle with complex systems, requiring significant computational resources and time. We propose a quantum-enhanced optimization approach designed to overcome these limitations by utilizing quantum parallelism and superposition. The core mechanism involves mapping the optimization problem onto a quantum state representation, enabling parallel processing and enhanced exploration of the solution space. The paper details the design of the quantum algorithm, its potential advantages over classical approaches, and preliminary experimental results demonstrating its effectiveness in specific optimization scenarios.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W7210274416","citationCount":0,"isOpenAccess":true,"pdfUrl":"https://doi.org/10.5281/zenodo.22512582"},{"id":"oa-W7210266362","title":"Quantum Computing Algorithm Optimization","authors":"Jincheng Zhang","journal":"Zenodo (CERN European Organization for Nuclear Research)","pubDate":"2026-09-06","doi":"10.5281/zenodo.22512583","abstract":"This paper presents a novel algorithm optimization method leveraging the unique capabilities of quantum computing. Traditional optimization algorithms often struggle with complex systems, requiring significant computational resources and time. We propose a quantum-enhanced optimization approach designed to overcome these limitations by utilizing quantum parallelism and superposition. The core mechanism involves mapping the optimization problem onto a quantum state representation, enabling parallel processing and enhanced exploration of the solution space. The paper details the design of the quantum algorithm, its potential advantages over classical approaches, and preliminary experimental results demonstrating its effectiveness in specific optimization scenarios.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W7210266362","citationCount":0,"isOpenAccess":true,"pdfUrl":"https://doi.org/10.5281/zenodo.22512583"}],"links":{"web":"https://science-database.com/technology/quantum-computing","llms_txt":"https://science-database.com/technology/quantum-computing/llms.txt","api":"https://science-database.com/api/v1/technology/quantum-computing"}}