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

Journal of quantum computing

A critical overview on Quantum Computing

Saptarshi Sahoo, Amit Kumar Mandal, Pijus Kanti Samanta, Indranil Basu, Pratik Roy

Published Jan 1, 2020• 18 citations
Publisher

Abstract

Quantum Computing and Quantum Information Science seem very promising and developing rapidly since its inception in early 1980s by Paul Benioff with the proposal of quantum mechanical model of the Turing machine and later By Richard Feynman and Yuri Manin for the proposal of a quantum computers for simulating various problems that classical computer could not. Quantum computers have a computational advantage for some problems, over classical computers and most applications are trying to use an efficient combination of classical and quantum computers like Shor’s factoring algorithm. Other areas that are expected to be benefitted from quantum computing are Machine Learning and deep learning, molecular biology, genomics and cancer research, space exploration, atomic and nuclear research and macro-economic forecasting. This paper represents a brief overview of the state of art of quantum computing and quantum information science with discussions of various theoretical and experimental aspects adopted by the researchers.

DOI
10.32604/jqc.2020.015688

Related papers

Quantum Computing: Principles, Evolution, Applications, and Future Prospects

Shabarimuthu P, Vijay Anand .R

Quantum computing is an advanced computational paradigm that leverages principles of quantum mechanics, including superposition, entanglement, and interference, to process information more efficiently than classical systems [1][2]. Unlike classical bits, qubits can exist in multiple states simultaneously, enabling exponential computational capabilities for complex problem-solving. Since its theoretical foundations proposed by Richard Feynman and further developed by David Deutsch, quantum computing has progressed into an active research and industrial domain [2][3]. This paper presents an overview of the core concepts of quantum computation, technological evolution, and key algorithms such as Shor’s and Grover’s, which demonstrate significant computational advantages [9][10]. It also explores major application areas including cryptography, healthcare, artificial intelligence, and optimization, while addressing critical challenges such as decoherence, error correction, and scalability [5][6]. The study highlights future prospects, emphasizing the potential of quantum computing to transform scientific and industrial domains [12][15].

International Journal of Science Strategic Management and Technology•Mar 28, 2026•1 citation

Quantum Complexity

Stefan Heinrich

A challenging question in the overlap of computer science, mathematics, and physics, is the exploration of potential capabilities of quantum computers. Milestones were the factoring algorithm of Shor (1994) and the search algorithm of Grover (1996). So far, major research was concentrated on discrete and algebraic problems. Much less was known about computational problems of analysis, including such a prominent example as high dimensional numerical integration, which is well-studied in the classical settings. We seek to understand how efficiently this and related problems can be solved in the quantum model of computation (i.e., on a quantum computer) and how the outcome compares to the efficiency of deterministic or randomized algorithms on a classical (i.e. non-quantum) computer. In this paper we give a survey of the state of the art in this field, including also a brief introduction to the general ideas of quantum computing. Introduction A quantum computer is a computing device based on quantum mechanical laws of the (sub)atomic world. The idea of such a computer was developed by Feynman [8] in 1982. He emphasized that simulating quantum mechanics on a classical computer is extremely hard, probably infeasible. So why not try to simulate quantum mechanics using quantum devices themselves. (Thoughts in this direction were also expressed by Manin [21] in 1980, see also [22].) In 1985 Deutsch [6] presented a formal model of computation for quantum computing.

Cambridge University Press eBooks•Mar 25, 2004•2 citations

Quantum Computation: A Brief Overview

Henan Huang

Quantum computation has teased scientific imagination ever since Richard Feynman dreamed in 1982 of quantum-mechanical computers, which could solve problems that are effectively out of reach of classical computation thanks to their ability to use superposition and entanglement. This critical survey recalls the field’s journey from theoretical advances to present-day engineering challenges, highlighting the yawning gulf between quantum computing’s lofty promises and its actual realizations. By examining three decades of developments, from Shor’s integer factorization and Grover’s search algorithms to recent demonstrations of quantum supremacy, this paper shows how idealized mathematical models interact with the noisy, resource-constrained realities of physical quantum systems. The author presents a literature review through critically analyzing key achievements in quantum computing research.. This paper concludes that quantum advantage will not arise from brute-force universality, but through application specific co-design, combining noise-adjusted algorithms to quantum hardware restrictions whilst mixing classical and quantum processing modes and fundamentally changing the way we think of error correction through the physics of qubits. This shift in paradigm from theoretical maximalism to engineering pragmatism embodies a realistic roadmap for practical quantum computation.

Theoretical and Natural Science•May 23, 2025•0 citations

Quantum Computing—A Journey Through Time

Naresh Tangudu, Deepak Davala, G. V. L. Narasimha +1 more

Quantum computing is a development that bridges quantum physics and computer science. It is an emergent field in computer science uses the unique qualities of quantum mechanics to solve large problems that beyond the ability of most powerful classical computers. This paper examines the historical evolution of quantum computing from its initial conceptual idea in 1930s to current implementations and further possibilities. The foundation of this concept began in the 1930s with the work of scientists like Heisenberg and Schrödinger, who established fundamental principles for understanding quantum mechanical systems. Further, in the 1980s, Feynman conceptualized the application of quantum phenomena to computational processes and started the quantum computing prototype. In early 1994, a crucial juncture occurred when Shor developed his factorization algorithm and stated that quantum computing has the ability to solve RSA encryption by promising security concerns. This chapter explains in detail different quantum machines, like qubit technology and various algorithms in quantum ages, and addresses the concepts of quantum computing that surpass classical computers and development hurdles like error correction and programming frameworks. This work concludes by examining quantum computing applications in different industries and cost considerations in research and development by providing both current and future possibilities in this dynamic field.

CRC Press eBooks•Nov 28, 2025•0 citations

An Introduction to Quantum Computing Algorithms

A. O. Pittenger

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.

Birkhäuser Boston eBooks•Jan 1, 2000•148 citations

Quantum to Quantum Computing

V K Gupta

Quantum theory and quantum computing in recent years, has raised more and more increasing interest within the scientific community because of various reasons. First, the highly interdisciplinary nature of the subject which involves diverse topics such as, on the theoretical side, information theory and foundational issues of quantum mechanics and on the experimental side, the physics of quantum, optical, atomic and solid state systems. Secondly, the field is extremely promising for revolutionary technological implications in the near future. It is now perfectly clear that one can use quantum mechanics to process and transmit information in a way which does not have a classical analogue, and that using quantum techniques one can implement fully secure cryptographic systems. Recent breakthroughs, such as quantum teleportation, have led to extremely rapid progresses in a fascinating new field and, as a consequence, have attracted the interest of many scientists from varied disciplines. The purpose of this article is to provide a comprehensive overview about the deep involvement of quantum theory in quantum computation to young researchers and newcomers in the field.

IETE Technical Review•Sep 1, 2002•4 citations
Quantum Computing and Quantum Information Science seem very promising and developing rapidly since its inception in early 1980s by Paul Benioff with the proposal of quantum mechanical model of the Turing machine and later By Richard Feynman and Yuri Manin for the proposal of a quantum computers for simulating various problems that classical computer could not. Quantum computers have a computational advantage for some problems, over classical computers and most applications are trying to use an efficient combination of classical and quantum computers like Shor’s factoring algorithm. Other areas that are expected to be benefitted from quantum computing are Machine Learning and deep learning, molecular biology, genomics and cancer research, space exploration, atomic and nuclear research and macro-economic forecasting. This paper represents a brief overview of the state of art of quantum computing and quantum information science with discussions of various theoretical and experimental aspects adopted by the researchers.
Quantum computing is an advanced computational paradigm that leverages principles of quantum mechanics, including superposition, entanglement, and interference, to process information more efficiently than classical systems [1][2]. Unlike classical bits, qubits can exist in multiple states simultaneously, enabling exponential computational capabilities for complex problem-solving. Since its theoretical foundations proposed by Richard Feynman and further developed by David Deutsch, quantum computing has progressed into an active research and industrial domain [2][3]. This paper presents an overview of the core concepts of quantum computation, technological evolution, and key algorithms such as Shor’s and Grover’s, which demonstrate significant computational advantages [9][10]. It also explores major application areas including cryptography, healthcare, artificial intelligence, and optimization, while addressing critical challenges such as decoherence, error correction, and scalability [5][6]. The study highlights future prospects, emphasizing the potential of quantum computing to transform scientific and industrial domains [12][15].
A challenging question in the overlap of computer science, mathematics, and physics, is the exploration of potential capabilities of quantum computers. Milestones were the factoring algorithm of Shor (1994) and the search algorithm of Grover (1996). So far, major research was concentrated on discrete and algebraic problems. Much less was known about computational problems of analysis, including such a prominent example as high dimensional numerical integration, which is well-studied in the classical settings. We seek to understand how efficiently this and related problems can be solved in the quantum model of computation (i.e., on a quantum computer) and how the outcome compares to the efficiency of deterministic or randomized algorithms on a classical (i.e. non-quantum) computer. In this paper we give a survey of the state of the art in this field, including also a brief introduction to the general ideas of quantum computing. Introduction A quantum computer is a computing device based on quantum mechanical laws of the (sub)atomic world. The idea of such a computer was developed by Feynman [8] in 1982. He emphasized that simulating quantum mechanics on a classical computer is extremely hard, probably infeasible. So why not try to simulate quantum mechanics using quantum devices themselves. (Thoughts in this direction were also expressed by Manin [21] in 1980, see also [22].) In 1985 Deutsch [6] presented a formal model of computation for quantum computing.
Quantum computation has teased scientific imagination ever since Richard Feynman dreamed in 1982 of quantum-mechanical computers, which could solve problems that are effectively out of reach of classical computation thanks to their ability to use superposition and entanglement. This critical survey recalls the field’s journey from theoretical advances to present-day engineering challenges, highlighting the yawning gulf between quantum computing’s lofty promises and its actual realizations. By examining three decades of developments, from Shor’s integer factorization and Grover’s search algorithms to recent demonstrations of quantum supremacy, this paper shows how idealized mathematical models interact with the noisy, resource-constrained realities of physical quantum systems. The author presents a literature review through critically analyzing key achievements in quantum computing research.. This paper concludes that quantum advantage will not arise from brute-force universality, but through application specific co-design, combining noise-adjusted algorithms to quantum hardware restrictions whilst mixing classical and quantum processing modes and fundamentally changing the way we think of error correction through the physics of qubits. This shift in paradigm from theoretical maximalism to engineering pragmatism embodies a realistic roadmap for practical quantum computation.
Quantum computing is a development that bridges quantum physics and computer science. It is an emergent field in computer science uses the unique qualities of quantum mechanics to solve large problems that beyond the ability of most powerful classical computers. This paper examines the historical evolution of quantum computing from its initial conceptual idea in 1930s to current implementations and further possibilities. The foundation of this concept began in the 1930s with the work of scientists like Heisenberg and Schrödinger, who established fundamental principles for understanding quantum mechanical systems. Further, in the 1980s, Feynman conceptualized the application of quantum phenomena to computational processes and started the quantum computing prototype. In early 1994, a crucial juncture occurred when Shor developed his factorization algorithm and stated that quantum computing has the ability to solve RSA encryption by promising security concerns. This chapter explains in detail different quantum machines, like qubit technology and various algorithms in quantum ages, and addresses the concepts of quantum computing that surpass classical computers and development hurdles like error correction and programming frameworks. This work concludes by examining quantum computing applications in different industries and cost considerations in research and development by providing both current and future possibilities in this dynamic field.
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.
Quantum theory and quantum computing in recent years, has raised more and more increasing interest within the scientific community because of various reasons. First, the highly interdisciplinary nature of the subject which involves diverse topics such as, on the theoretical side, information theory and foundational issues of quantum mechanics and on the experimental side, the physics of quantum, optical, atomic and solid state systems. Secondly, the field is extremely promising for revolutionary technological implications in the near future. It is now perfectly clear that one can use quantum mechanics to process and transmit information in a way which does not have a classical analogue, and that using quantum techniques one can implement fully secure cryptographic systems. Recent breakthroughs, such as quantum teleportation, have led to extremely rapid progresses in a fascinating new field and, as a consequence, have attracted the interest of many scientists from varied disciplines. The purpose of this article is to provide a comprehensive overview about the deep involvement of quantum theory in quantum computation to young researchers and newcomers in the field.