Quantum Computing: A Future Trends in Computing (original) (raw)
Related papers
Quantum Computer : An Overview
Combining physics, mathematics and computer science, quantum computing has developed in the past two decades from a visionary idea to one of the most fascinating areas of quantum mechanics [4]. If the bits of computer are scaled down to the size of individual atom, then it can change the nature of computation itself. In that case the function of such a quantum computer may consist of a superposition of many computations carried out simultaneously. This can solve many computational problem such as factoring of large integers , tractable. This research paper gives an overview of quantum computer, description of qubit, difference between quantum and silicon computer.
A Short Survey on Quantum Computers
International Journal of Computers and Applications, 2006
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 briefly survey the current status of quantum computers, quantum computer systems, and quantum simulators.
Consequences and Limitations of Conventional Computers and their Solutions through Quantum Computers
2011
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. Pres...
Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. www.giapjournals.com/ijsrtm/ 628 computer could efficiently solve this problem using Shor's algorithm to find its factors. This ability would allow a quantum computer to decrypt many of the cryptographic systems in use today. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security. An example of this is a password cracker that attempts to guess the password for an encrypted file (assuming that the password has a maximum possible length).
A critical overview on Quantum Computing
Journal of Quantum Computing, 2020
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 macroeconomic 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.
Reports on Progress in Physics, 1998
The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarise not just quantum computing, but the whole subject of quantum information theory. Information can be identified as the most general thing which must propagate from a cause to an effect. It therefore has a fundamentally important role in the science of physics. However, the mathematical treatment of information, especially information processing, is quite recent, dating from the mid-twentieth century. This has meant that the full significance of information as a basic concept in physics is only now being discovered. This is especially true in quantum mechanics. The theory of quantum information and computing puts this significance on a firm footing, and has lead to some profound and exciting new insights into the natural world. Among these are the use of quantum states to permit the secure transmission of classical information (quantum cryptography), the use of quantum entanglement to permit reliable transmission of quantum states (teleportation), the possibility of preserving quantum coherence in the presence of irreversible noise processes (quantum error correction), and the use of controlled quantum evolution for efficient computation (quantum computation). The common theme of all these insights is the use of quantum entanglement as a computational resource.
Progress in Quantum Electronics, 1998
Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic principles of quantum computation, including the construction of basic gates, and networks. We illustrate the power of quantum algorithms using the simple problem of Deutsch, and explain, again in very simple terms, the well known algorithm of Shor for factorisation of large numbers into primes. We then describe physical implementations of quantum computers, focusing on one in particular, the linear ion-trap realization. We explain that the main obstacle to building an actual quantum computer is the problem of decoherence, which we show may be circumvented using the methods of quantum error correction.
The main advantages of quantum computing are exponential computing power it provides. This exponential computing is derived from the supposition of the states, and possibility to use entanglement of particles to communicate over large distances. This paper shall attempt to identify what constitute quantum computer, its benefits, obstacle and research and in conclusion, I shall address the future direction of quantum computation.
Remarks on the nature of quantum computation
Eprint Arxiv Quant Ph 0306103, 2003
Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the exponential speed-up of quantum computations possess their classical counterparts for the hybrid digital-analog computer. It is argued that the measurement errors which cannot be fully corrected make the computation not efficient for both models.
Quantum computation and Shor's factoring algorithm
Reviews of Modern Physics, 1996
The eld of quantum computation studies the power of computers that are based on quantummechanical principles. We give a brief introduction to the model of quantum computation and to its main success so far: Peter Shor's e cient quantum algorithm for factoring integers.