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

Consequences and Limitations of Conventional Computers and their Solutions through Quantum Computers

Nilesh P. Barde, Deepak Thakur, Pranav P. Bardapurkar, Sanjaykumar N. Dalvi, S. N. Arts, B. N. Sarda

Published Jan 1, 2011• 7 citations
OpenAlex

Abstract

Quantum computer is the current topic of research in the field of computational science, which uses principles of quantum mechanics. Quantum computers will be much more powerful than the classical computer due to its enormous computational speed. Recent developments in quantum computers which are based on the laws of quantum mechanics, shows different ways of performing efficient calculations along with the various results which are not possible on the classical computers in an efficient period of time. One of the most striking results that have obtained on the quantum computers is the prime factorization of the large integer in a polynomial time. The idea of involvement of the quantum mechanics for the computational purpose is outlined briefly in the present work that reflects the importance and advantages of the next generation of the 21st century classical computers, named as quantum computers, in terms of the cost as well as time period required for the computation purpose. Present paper presents a quantum computer simulator for executing the limitations of classical computer with respect to time & the number of digits of a composite integer used for calculating its prime factors.

Related papers

The Review on Quantum Computers and Their Application in Future Era

Sumit Kumar, Anjali Tiwari, Ankit Kumar Mishra

Quantum computing has become a hot topic in recent years. It provides high consumption and exponential speed over classical computers by controlling the behaviour of small physical objects i.e., microscopic particles like atoms, electrons, photons, etc. 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 that time. The quantum computer is one proposal that may have merit in dealing with the problems presented. Currently, there exist some algorithms utilizing the advantage of quantum computers. For example, Shor's algorithm performs factoring of a large integer in polynomial time, whereas classical factoring algorithms can do it in exponential time. In this paper, we will briefly explain quantum computers, their history, the difference between classical computers and Quantum computers, and the challenges they faced Lastly, we conclude with its future scope.

•Jan 5, 2023•0 citations

Quantum Physics and Computers

Adriano Barenco

Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit quantum features could factor large composite integers This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. The additional power of quantum computers comes from the possibility of employing a superposition of states, of following many distinct computation paths and of producing a final output that depends on the interference of all of them. This "quantum parallelism" outstrips by far any parallelism that can be thought of in classical computation and is responsible for the "exponential" speed-up of computation. Experimentally, however, it will be extremely difficult to "decouple" a quantum computer from its environment. Noise fluctuations due to the outside world...

•Dec 2, 1996•100 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 40GHz 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 that time. The quantum computer is one proposal that may have merit in dealing with the problems presented. Currently, there exist some algorithms utilizing the advantage of quantum computers. For example, Shor's algorithm performs factoring of a large integer in polynomial time, whereas 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.

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

The Future of Quantum Computer Advantage

Jimmy Chen

As technological innovations in computers begin to advance past their limit (Moore’s law), a new problem arises: What computational device would emerge after the classical supercomputers reach their physical limitations? At this moment in time, quantum computers are at their starting stage and there are already some strengths and advantages when compared with modern, classical computers. In its testing period, there are a variety of ways to create a quantum computer by processes such as the trapped-ion and the spin-dot methods. Nowadays, there are many drawbacks with quantum computers such as issues with decoherence and scalability, but many of these issues are easily emended. Nevertheless, the benefits of quantum computers at the moment outweigh the potential drawbacks. These benefits include its use of many properties of quantum mechanics such as quantum superposition, entanglement, and parallelism. Using these basic properties of quantum mechanics, quantum computers are capable of achieving faster computational times for certain problems such as finding prime factors of an integer by using Shor’s algorithm. From the advantages such as faster computing times in certain situations and higher computing powers than classical computers, quantum computers have a high probability to be the future of computing after classical computers hit their peak.

American Journal of Computational Mathematics•Jan 1, 2023•5 citations

Introduction to Quantum Computing

Surya Teja Marella, Hemanth Sai Kumar Parisa

Quantum computing is a modern way of computing that is based on the science of quantum mechanics and its unbelievable phenomena. It is a beautiful combination of physics, mathematics, computer science and information theory. It provides high computational power, less energy consumption and exponential speed over classical computers by controlling the behavior of small physical objects i.e. microscopic particles like atoms, electrons, photons, etc. Here, we present an introduction to the fundamental concepts and some ideas of quantum computing. This paper starts with the origin of traditional computing and discusses all the improvements and transformations that have been done due to their limitations until now. Then it moves on to the basic working of quantum computing and the quantum properties it follows like superposition, entanglement and interference. To understand the full potentials and challenges of a practical quantum computer that can be launched commercially, the paper covers the architecture, hardware, software, design, types and algorithms that are specifically required by the quantum computers. It uncovers the capability of quantum computers that can impact our lives in various viewpoints like cyber security, traffic optimization, medicines, artificial intelligence and many more. At last, we concluded all the importance, advantages and disadvantages of quantum computers. Small-scale quantum computers are being developed recently. This development is heading towards a great future due to their high potential capabilities and advancements in ongoing research. Before focusing on the significances of a general-purpose quantum computer and exploring the power of the new arising technology, it is better to review the origin, potentials, and limitations of the existing traditional computing. This information helps us in understanding the possible challenges in developing exotic and competitive technology. It will also give us an insight into the ongoing progress in this field.

IntechOpen eBooks•Nov 6, 2020•52 citations

Limits and Solvability of Quantum Computing

The extent to which the possibilities and limits of computability depend on the assumed mathematical formalism is particularly evident in quantum computing. Here, methods, algorithms, and basic concepts of classical digital computing must be translated into the mathematical formalism of quantum mechanics and new concepts of quantum formalism must be utilized in order to overcome the classical limits of computability. In the sense of Church’s thesis, a classical digital computer can also be understood as a circuit of Boolean gates that process bits. In quantum computing, they are replaced by quantum gates that represent the unitary operators of quantum mechanics and process quantum bits. The enormous computing advantages are due to the special features of quantum mechanical states such as superposition and entanglement. The calculation results of a quantum computer are explained by the quantum mechanical measurement process. Classical calculation methods such as fast Fourier transformations are translated into quantum formalism and thus enable the solution of difficult calculation problems in polynomial time (e.g., factorization with the Shor algorithm). However, in this case, it cannot be ruled out that there is also a classical digital solution in polynomial time. This distinguishes the result from the fundamental impossibility of a digital solution, which was shown for real computing in Chapter 7. Classical pattern recognition and classification of machine learning (ML) with neural networks can also be translated into quantum formalism and lead to a considerable increase in performance with superposition and entanglement. In quantum complexity theory, previous NP problems can be traced back to P problems. In quantum computing too, the theoretical possibilities and limits depend on the mathematical formalism assumed. The technical– physical realization of a quantum computer, on the contrary, is again an empirical question.

World scientific series on nonlinear science, series A•Nov 25, 2024•0 citations
Quantum computer is the current topic of research in the field of computational science, which uses principles of quantum mechanics. Quantum computers will be much more powerful than the classical computer due to its enormous computational speed. Recent developments in quantum computers which are based on the laws of quantum mechanics, shows different ways of performing efficient calculations along with the various results which are not possible on the classical computers in an efficient period of time. One of the most striking results that have obtained on the quantum computers is the prime factorization of the large integer in a polynomial time. The idea of involvement of the quantum mechanics for the computational purpose is outlined briefly in the present work that reflects the importance and advantages of the next generation of the 21st century classical computers, named as quantum computers, in terms of the cost as well as time period required for the computation purpose. Present paper presents a quantum computer simulator for executing the limitations of classical computer with respect to time & the number of digits of a composite integer used for calculating its prime factors.
Quantum computing has become a hot topic in recent years. It provides high consumption and exponential speed over classical computers by controlling the behaviour of small physical objects i.e., microscopic particles like atoms, electrons, photons, etc. 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 that time. The quantum computer is one proposal that may have merit in dealing with the problems presented. Currently, there exist some algorithms utilizing the advantage of quantum computers. For example, Shor's algorithm performs factoring of a large integer in polynomial time, whereas classical factoring algorithms can do it in exponential time. In this paper, we will briefly explain quantum computers, their history, the difference between classical computers and Quantum computers, and the challenges they faced Lastly, we conclude with its future scope.
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit quantum features could factor large composite integers This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. The additional power of quantum computers comes from the possibility of employing a superposition of states, of following many distinct computation paths and of producing a final output that depends on the interference of all of them. This "quantum parallelism" outstrips by far any parallelism that can be thought of in classical computation and is responsible for the "exponential" speed-up of computation. Experimentally, however, it will be extremely difficult to "decouple" a quantum computer from its environment. Noise fluctuations due to the outside world...
Quantum computing is an emerging technology. The clock frequency of current computer processor systems may reach about 40GHz 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 that time. The quantum computer is one proposal that may have merit in dealing with the problems presented. Currently, there exist some algorithms utilizing the advantage of quantum computers. For example, Shor's algorithm performs factoring of a large integer in polynomial time, whereas 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.
As technological innovations in computers begin to advance past their limit (Moore’s law), a new problem arises: What computational device would emerge after the classical supercomputers reach their physical limitations? At this moment in time, quantum computers are at their starting stage and there are already some strengths and advantages when compared with modern, classical computers. In its testing period, there are a variety of ways to create a quantum computer by processes such as the trapped-ion and the spin-dot methods. Nowadays, there are many drawbacks with quantum computers such as issues with decoherence and scalability, but many of these issues are easily emended. Nevertheless, the benefits of quantum computers at the moment outweigh the potential drawbacks. These benefits include its use of many properties of quantum mechanics such as quantum superposition, entanglement, and parallelism. Using these basic properties of quantum mechanics, quantum computers are capable of achieving faster computational times for certain problems such as finding prime factors of an integer by using Shor’s algorithm. From the advantages such as faster computing times in certain situations and higher computing powers than classical computers, quantum computers have a high probability to be the future of computing after classical computers hit their peak.
Quantum computing is a modern way of computing that is based on the science of quantum mechanics and its unbelievable phenomena. It is a beautiful combination of physics, mathematics, computer science and information theory. It provides high computational power, less energy consumption and exponential speed over classical computers by controlling the behavior of small physical objects i.e. microscopic particles like atoms, electrons, photons, etc. Here, we present an introduction to the fundamental concepts and some ideas of quantum computing. This paper starts with the origin of traditional computing and discusses all the improvements and transformations that have been done due to their limitations until now. Then it moves on to the basic working of quantum computing and the quantum properties it follows like superposition, entanglement and interference. To understand the full potentials and challenges of a practical quantum computer that can be launched commercially, the paper covers the architecture, hardware, software, design, types and algorithms that are specifically required by the quantum computers. It uncovers the capability of quantum computers that can impact our lives in various viewpoints like cyber security, traffic optimization, medicines, artificial intelligence and many more. At last, we concluded all the importance, advantages and disadvantages of quantum computers. Small-scale quantum computers are being developed recently. This development is heading towards a great future due to their high potential capabilities and advancements in ongoing research. Before focusing on the significances of a general-purpose quantum computer and exploring the power of the new arising technology, it is better to review the origin, potentials, and limitations of the existing traditional computing. This information helps us in understanding the possible challenges in developing exotic and competitive technology. It will also give us an insight into the ongoing progress in this field.
The extent to which the possibilities and limits of computability depend on the assumed mathematical formalism is particularly evident in quantum computing. Here, methods, algorithms, and basic concepts of classical digital computing must be translated into the mathematical formalism of quantum mechanics and new concepts of quantum formalism must be utilized in order to overcome the classical limits of computability. In the sense of Church’s thesis, a classical digital computer can also be understood as a circuit of Boolean gates that process bits. In quantum computing, they are replaced by quantum gates that represent the unitary operators of quantum mechanics and process quantum bits. The enormous computing advantages are due to the special features of quantum mechanical states such as superposition and entanglement. The calculation results of a quantum computer are explained by the quantum mechanical measurement process. Classical calculation methods such as fast Fourier transformations are translated into quantum formalism and thus enable the solution of difficult calculation problems in polynomial time (e.g., factorization with the Shor algorithm). However, in this case, it cannot be ruled out that there is also a classical digital solution in polynomial time. This distinguishes the result from the fundamental impossibility of a digital solution, which was shown for real computing in Chapter 7. Classical pattern recognition and classification of machine learning (ML) with neural networks can also be translated into quantum formalism and lead to a considerable increase in performance with superposition and entanglement. In quantum complexity theory, previous NP problems can be traced back to P problems. In quantum computing too, the theoretical possibilities and limits depend on the mathematical formalism assumed. The technical– physical realization of a quantum computer, on the contrary, is again an empirical question.