This paper reports on the trends in development of quantum computer, QC. The assumed advantage of QC in comparison with the standard computer is that the QC works not with digits but with the quantum states. Also, the advantage of QC over the DECM consists in the quantum parallelism and comes from the exponential space of states of the number of cubits. As a single cubit can be in the state of superposition of 0 and 1 states, the register of n cubits can be in the state of superposition of all 2/sup n/ possible states. The requirements to the construction of the QC are: 1) necessity of assembly (register) of cubits; 2) necessity of constant magnetic field; and 3) necessity of low temperatures.
This paper reports on the trends in development of quantum computer, QC. The assumed advantage of QC in comparison with the standard computer is that the QC works not with digits but with the quantum states. Also, the advantage of QC over the DECM consists in the quantum parallelism and comes from the exponential space of states of the number of cubits. As a single cubit can be in the state of superposition of 0 and 1 states, the register of n cubits can be in the state of superposition of all 2/sup n/ possible states. The requirements to the construction of the QC are: 1) necessity of assembly (register) of cubits; 2) necessity of constant magnetic field; and 3) necessity of low temperatures.
The article deals with new approaches in studying the features of the structure and principles of functioning of quantum computers, as one of the components of the elemental base of modern computer electronics, due to more efficient layout and supply of the corresponding lecture material using the multimedia presentation system. It is shown that at the present stage of the creation of quantum computers goes in two directions: specialized quantum computers that are aimed at solving one particular specific task, such as optimization tasks (quantum computers D-Wave); and universal quantum computers that are capable of implementing arbitrary quantum algorithms (Shore, Simon, Grover) - in implementing from IBM, Google, etc. The work of quantum registers is analyzed. When processing this material, students show that the ability of devices that are based on the classical principles of computing machines, in recent years reached a level in which most tasks can be solved relatively quickly and quite accurately. However, in various areas of knowledge, there are problems to decide which, including using the best supercomputers of the world, is not possible. After all, modern transistors have already reached a few nanometers, and in the future, electronic semiconductor components cannot be reduced infinitely, because their elements will consist of one atom. The development of classical computers in the form of cloud computing capacities is also limited in the area and consumed energy. In addition, not each algorithm is subject to parallelization. Effective processing of large volumes of data requires high-performance computations in the field of artificial intelligence, science-intensive industrial areas, modeling of chemical and physical phenomena and processes, that is, where it ceases to have the capabilities of modern supercomputers. Solving this problem is possible to apply the latest technologies of quantum computers. It has been shown that the quantum computer is a computing device that uses the phenomenon of quantum superposition (parallelism) and quantum confusion to transmit data and data processing, that is, the basis of its central processor is laid logic of quantum mechanics using special quantum algorithms. Such a computer is fundamentally different from a traditional computer that perceives any information in the form of a binary code, which may be in one of two possible states: 0 or 1. Any classic processor represents these two states of low or high voltage levels inside the semiconductor transistor. Its task to select zero or unit. Quantum processors are made according to the same principle, but a radical cancellation that instead of a transistor, they use kubit (Qubit) – quantum bits.
Abstract This paper is focused on the field of quantum computing which is an important area of research these days. The paper gives a brief history of this phenomenon and discusses how it has been developing since its conception. Furthermore, the paper describes the principles on which the quantity computer is built, such as qubits, entanglement, and superposition. It also discusses the necessity to build a quantum computer and how it could an improvement upon the existing computers. In addition, the paper covers some of the fields in which quantum computing could be particularly beneficial. Finally, some of the problems and challenges associated with the development of quantum computing are addressed.
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
Computer technology fundamentally works as on/off switches. These switches are digits: 1s and 0s; 1s are on, 0s are off. In computerese these switchable binary digits are called bits. Quantum computing utilizes subatomic bits, or “qubits,” that can exist as a 1 or a 0 or as both simultaneously. Quantum computers use quantum-mechanical interactions that allow amazing calculating power. The chief advantage of a quantum computer is that it can be in multiple states simultaneously, known as “superposition,” while also simultaneously acting on each possible state. A quantum computer could therefore perform innumerable calculations in parallel using only one processing unit.
To overcome the scaling limitations of conventional semiconductor chips, quantum computing has emerged and experienced significant growth in recent years. Quantum computing utilizes resources such as quantum superposition and quantum entanglement to encode and process information. Compared to classical computing, this technology can provide exponential acceleration in the field of ultra-large-scale parallel computing. Consequently, its practical application is anticipated to have profound impacts on information and related technologies. The paper employs a comparative analysis approach to systematically examine the research progress of quantum computer technology. Specifically, the study emphasizes the analysis and consolidation of various quantum computing technology routes, critically evaluates their advantages and disadvantages, and provides a foresight into their future development trends. Currently, research on quantum computing technology is in its early stages and is evolving rapidly. Multiple technical paths are being pursued, resulting in a diverse and competitive landscape that is expected to persist in the short term, as it will take some time before the practical application of quantum computers becomes feasible.
This article analyzes mathematical models of quantum parallelism based on the transfer of a quantum system into a superposition state. The principles of quantum parallelism and its mathematical foundations are substantiated. To demonstrate the quantum advantage, mathematical models of fundamental quantum algorithms Deutsch-Joža and Grover are analyzed, which illustrate the efficiency of quantum computing compared to classical methods. The Deutsch-Joshy algorithm is considered, which generalizes the problem of determining the type of a binary function by extending it to a set of arguments written in a quantum register. This algorithm allows determining whether a function is constant or balanced in a single quantum call, while in classical calculations this requires exponential time. It is noted that although the Deutsch-Joshy algorithm demonstrates the possibilities of parallel quantum computing, it is of mainly theoretical importance. Grover’s algorithm implements quantum parallel computing for the practical problem of searching for an element in an unordered database. It is based on iterative amplification of the amplitude of the state corresponding to the searched element and provides quadratic speedup compared to classical algorithms. In addition to database search, Grover’s algorithm can be adapted to solve other optimization problems. The work of the considered algorithms is illustrated by numerical examples, which simplifies the understanding of their principles and contributes to the further methodological development of parallel quantum computing. The article also outlines the advantages of quantum parallelism over classical computing and identifies the prospects for the application of parallel quantum algorithms.