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

International Journal of Advanced Research in Computer Science

Quantum Computing: A Future Trends in Computing

Amit V. Pandhare, Sunil Gupta Syed Tanzeem

Published Jan 1, 2012• 0 citations
Publisher

Abstract

If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation. Keywords: Quantum Computing, Qubit, Bloch Spher, Quantum Circuits, Quantum Gates, Shor's algorithm.

DOI
10.26483/ijarcs.v3i3.1217

Related papers

Quantum Computation

David Peter Divincenzo

If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.

Science•Oct 13, 1995•1,653 citations

Quantum Computing

William J. Mullin

Quantum computing makes use of wave-function superposition to provide a computational system with remarkable possibilities. A computing bit is a 0 or 1, but a quantum bit, a qubit, is a superposition of two quantum states, of, say, an atom. A number n of qubits will then be in a superposition of 2n distinct states. An operation on such a state then does 2n simultaneous operations, demonstrating quantum parallelism. The possibilities of quantum computing are demonstrated via discussion of Deutch’s problem, Shor’s period-finding algorithm, and Grover’s search algorithm. Shor’s algorithm might allow the factoring of large numbers, which might enable the decoding of many encryption schemes. Details are given for the solution of Deutch’s problem. The analysis introduces certain operators, the NOT and Hadamard, that are used in computer logic.

Oxford University Press eBooks•Mar 16, 2017•0 citations

Epilogue: Quantum Computing

Vivek S Kale

The requirements of massive parallelism envisaged in the future are achievable more effectively through quantum computing. In a quantum computer, the atoms are essentially used as processors and memories at the same time. One of the most significant problems in making practical applications of quantum computers is retrieving the results of the computations. Measuring the results of a quantum computation is problematic because interfering in any way with the atoms being used for computation can change their value, collapsing them back into the single state 1 or 0 instead of their coherent superposition of many states. A person, organization, or government with access to a powerful quantum computer could use Peter Shor’s factoring algorithm to break into any encrypted message and recover the supposedly secure information; encryption methods could be made obsolete. Substantial progress in fighting decoherence and other potential error sources will need to be made before robust quantum computers, capable of solving computationally difficult problems, can be built.

Chapman & Hall/CRC eBooks•Dec 6, 2019•0 citations

A SHORT SURVEY ON QUANTUM COMPUTERS

Yoshito Kanamori, Seong-Moo Yoo, W. David Pan +1 more

Quantum computing is an emerging technology. The clock frequency of current computer processor systems may reach about 40 GHz within the next 10 years. By then, one atom may represent one bit. Electrons under such conditions are no longer described by classical physics and a new model of the computer may be necessary by then. The quantum computer is one proposal that may have merit in dealing with the problems associated with the fact that certain important computationally intense problems present that current (classical) computers cannot solve because they require too much processing time. For example, Shor's algorithm performs factoring a large integer in polynomial time while classical factoring algorithms can do it in exponential time. In this paper we briefly survey the current status of quantum computers, quantum computer systems, and quantum simulators. Keywords Classical computers, quantum computers, quantum computer systems, quantum simulators, Shor's algorithm.

International Journal of Computers and Applications•Jan 1, 2006•24 citations

Analyze Shor Algorithm Optimization Trends and Suggest Optimization Directions

Jaehan Cho, Dawit Shin, Yeonjeong Hwang +1 more

Quantum computers leverage the principles of quantum mechanics to solve complex problems beyond the capabilities of classical computers, such as prime factorization, which poses a significant threat to cryptographic algorithms like RSA and ECC. Although current quantum resources are insufficient for effective decryption, ongoing research focuses on optimizing Shor's algorithm to overcome these limitations. Shor's algorithm, a quantum algorithm designed for efficient integer factorization, exploits quantum parallelism and entanglement to perform prime factorization exponentially faster than classical algorithms. This paper reviews recent trends in Shor algorithm optimization, particularly in enhancing the efficiency of ripple-carry operators and the Karatsuba algorithm in multiplication and proposes a multiplication method that applies the Strassen algorithm to constant adders

International Conference on Platform Technology and Service•Aug 26, 2024•1 citation

From Qubits to Quantum Algorithms: The Evolution of Modern Computing

Addy Arif Bin Mahathir, Sivamuganathan Mohana Dass, Jerry Wingsky +4 more

This paper presents an extensive exploration of quantum computing as an emerging paradigm that operates on the principles of quantum mechanics to process information in ways unattainable by classical systems. It traces the evolution of quantum theory from its early conceptual foundations to its present-day technological applications, highlighting key milestones such as the development of qubits, quantum gates, and essential algorithms including Shor’s and Grover’s. The study examines the fundamental mechanisms of quantum superposition and entanglement, alongside the hardware and software innovations driving scalability and performance. By analysing experimental progress, programming models, and comparative advantages over classical and cloud computing, this paper underscores how quantum computing can transform industries such as data security, medicine, and artificial intelligence. Furthermore, it outlines future prospects involving error correction, neuromorphic integration, and commercialization trends that are shaping the next generation of computational technology.

•Dec 2, 2025•0 citations
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation. Keywords: Quantum Computing, Qubit, Bloch Spher, Quantum Circuits, Quantum Gates, Shor's algorithm.
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.
Quantum computing makes use of wave-function superposition to provide a computational system with remarkable possibilities. A computing bit is a 0 or 1, but a quantum bit, a qubit, is a superposition of two quantum states, of, say, an atom. A number n of qubits will then be in a superposition of 2n distinct states. An operation on such a state then does 2n simultaneous operations, demonstrating quantum parallelism. The possibilities of quantum computing are demonstrated via discussion of Deutch’s problem, Shor’s period-finding algorithm, and Grover’s search algorithm. Shor’s algorithm might allow the factoring of large numbers, which might enable the decoding of many encryption schemes. Details are given for the solution of Deutch’s problem. The analysis introduces certain operators, the NOT and Hadamard, that are used in computer logic.
The requirements of massive parallelism envisaged in the future are achievable more effectively through quantum computing. In a quantum computer, the atoms are essentially used as processors and memories at the same time. One of the most significant problems in making practical applications of quantum computers is retrieving the results of the computations. Measuring the results of a quantum computation is problematic because interfering in any way with the atoms being used for computation can change their value, collapsing them back into the single state 1 or 0 instead of their coherent superposition of many states. A person, organization, or government with access to a powerful quantum computer could use Peter Shor’s factoring algorithm to break into any encrypted message and recover the supposedly secure information; encryption methods could be made obsolete. Substantial progress in fighting decoherence and other potential error sources will need to be made before robust quantum computers, capable of solving computationally difficult problems, can be built.
Quantum computing is an emerging technology. The clock frequency of current computer processor systems may reach about 40 GHz within the next 10 years. By then, one atom may represent one bit. Electrons under such conditions are no longer described by classical physics and a new model of the computer may be necessary by then. The quantum computer is one proposal that may have merit in dealing with the problems associated with the fact that certain important computationally intense problems present that current (classical) computers cannot solve because they require too much processing time. For example, Shor's algorithm performs factoring a large integer in polynomial time while classical factoring algorithms can do it in exponential time. In this paper we briefly survey the current status of quantum computers, quantum computer systems, and quantum simulators. Keywords Classical computers, quantum computers, quantum computer systems, quantum simulators, Shor's algorithm.
Quantum computers leverage the principles of quantum mechanics to solve complex problems beyond the capabilities of classical computers, such as prime factorization, which poses a significant threat to cryptographic algorithms like RSA and ECC. Although current quantum resources are insufficient for effective decryption, ongoing research focuses on optimizing Shor's algorithm to overcome these limitations. Shor's algorithm, a quantum algorithm designed for efficient integer factorization, exploits quantum parallelism and entanglement to perform prime factorization exponentially faster than classical algorithms. This paper reviews recent trends in Shor algorithm optimization, particularly in enhancing the efficiency of ripple-carry operators and the Karatsuba algorithm in multiplication and proposes a multiplication method that applies the Strassen algorithm to constant adders
This paper presents an extensive exploration of quantum computing as an emerging paradigm that operates on the principles of quantum mechanics to process information in ways unattainable by classical systems. It traces the evolution of quantum theory from its early conceptual foundations to its present-day technological applications, highlighting key milestones such as the development of qubits, quantum gates, and essential algorithms including Shor’s and Grover’s. The study examines the fundamental mechanisms of quantum superposition and entanglement, alongside the hardware and software innovations driving scalability and performance. By analysing experimental progress, programming models, and comparative advantages over classical and cloud computing, this paper underscores how quantum computing can transform industries such as data security, medicine, and artificial intelligence. Furthermore, it outlines future prospects involving error correction, neuromorphic integration, and commercialization trends that are shaping the next generation of computational technology.