This article has highlighted the main features of the existing models of quantum calculators necessary for their successful work. Was also carried out and described in detail the full factorial experiment for the characteristics of the models using the method of fractional replicas. As part of the experiment was the matrix of the experiment, the mathematical model with corresponding linear regression equation. Were treated with the experimental data by regression analysis, F-Fisher criterion, analysis of random error parameters a, b and correlation coefficient r xy, Т-Student statistical criteria and the Durbin-Watson, whereby steam using linear correlation determination r xy and R 2 proved high enough for a 14-factorial experiment connectivity characteristics of quantum models of calculators. We also analyzed the relationship between private twin characteristics. Development of the simulation of quantum calculators in the quantum world is a great importance in the development of quantum computers, because without quantum computer simulation prototyping model becomes difficult. We also consider a number of other equally important reasons for urgency topics: developed quantum model will clearly see the strengths and weaknesses of the model, as well as to improve it in the future; has not yet created a quantum computer, the only possibility of practical study of quantum computing simulation of the quantum computer on a classical or use different elements of physics and chemistry in not typical for these conditions and directions; in the case of a quantum computer simulation of its prototype will be a visual aid for understanding the basic processes and phenomena that have made it possible to create it; developed quantum model and its proven benefits allow easier to attract investment in the physical creation and improvement of a quantum computer.
This article has highlighted the main features of the existing models of quantum calculators necessary for their successful work. Was also carried out and described in detail the full factorial experiment for the characteristics of the models using the method of fractional replicas. As part of the experiment was the matrix of the experiment, the mathematical model with corresponding linear regression equation. Were treated with the experimental data by regression analysis, F-Fisher criterion, analysis of random error parameters a, b and correlation coefficient r xy, Т-Student statistical criteria and the Durbin-Watson, whereby steam using linear correlation determination r xy and R 2 proved high enough for a 14-factorial experiment connectivity characteristics of quantum models of calculators. We also analyzed the relationship between private twin characteristics. Development of the simulation of quantum calculators in the quantum world is a great importance in the development of quantum computers, because without quantum computer simulation prototyping model becomes difficult. We also consider a number of other equally important reasons for urgency topics: developed quantum model will clearly see the strengths and weaknesses of the model, as well as to improve it in the future; has not yet created a quantum computer, the only possibility of practical study of quantum computing simulation of the quantum computer on a classical or use different elements of physics and chemistry in not typical for these conditions and directions; in the case of a quantum computer simulation of its prototype will be a visual aid for understanding the basic processes and phenomena that have made it possible to create it; developed quantum model and its proven benefits allow easier to attract investment in the physical creation and improvement of a quantum computer.
In our days quantum computers are presented in the form of experimental equipment and prototypes [1] and there is no quantum computing devices, which will surpass the performance of modern computers. That means its necessary to perform simulation to study the peculiarities of quantum algorithms. In this article the characteristics of existing models are analyzed and the purpose of this article is to give the requirements for building own model. Also this work is presented to construct a methodic of the numerical evaluation for searching models with best functionality. Method of evaluation allows to rank models, distinguish the best one and make requirements for developed model.
The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.
The article is devoted to the actual problem of teaching methods of the subjects of the educational process of modern information and computer science. The contribution of Ukrainian scientists to the development of electronic computing machines, their programming and teaching methods, prospects for further research are briefly considered. In the natural sciences, elementary units are widely used for various measurements. In particular, Planck’s constant is the smallest portion, quantum of energy, quantum of action, which is used in quantum mechanics. It is also known from the course of physics that the smallest portion of energy in classical mechanics is the energy per one degree of freedom. Logically created mathematical models and theories describing the relevant properties of matter using the specified units. Similarly, emphasis is placed on clarifying the difference between a classical computer and quantum units of information. The concepts of bit of information, qubit and trit are revealed, and depending on the defined units of information, types of computers are distinguished: classical and quantum. The concepts of qubit and trit are considered mainly as a mathematical entity, and attention is not focused on the content of the physics of quantum objects, a comparison of the indicated units of quantum information with a traditional bit of information in the quantum world is given. A historical-genetic analysis of the registers of elementary logic systems, a theoretical study of the principles of superposition and interaction between quantum states, and experimental methods of implementing qubits and their connections have been carried out. An important field for the use of quantum computers is cryptology, for solving the problems of which Grover’s method has already been created. With Grover’s quantum algorithm, it is possible to quickly search for the necessary element in an unsorted database with 2nN (n is the length of the search space of the quantum register - the number of qubits in it; N is the size of the search space). However, although the quantum simulator gives a high probability of the correct result, experimental studies also show large discrepancies. Therefore, there is a problem for further research. Quantum computers can influence each other through the phenomenon of entanglement.
In recent years, the demand for arithmetic power from all walks of life is growing, especially the increasing popularity of AIGC, which makes people realize that huge technological progress cannot be made without the support of large arithmetic power. Quantum computing may bring a leap in computing power and become a ”trigger” and “catalyst” to accelerate the development of science and technology innovation, and its technical development trend and application prospects have become a hot issue of concern, and quantum simulators are a very important part of the development process. The development of quantum simulators is a very important part of the process. However, due to the lack of systematic evaluation theories and methods, it is difficult to quantify and analyze the quality of the increasing number of simulators on the market, which may hinder researchers from practicing their quantum algorithms objectively or developing quantum technologies. For these reasons, this paper proposes a quality model for quantum simulator software, which reflects the quality characteristics of simulators in seven aspects, such as functionality and performance efficiency, and selects some simulators for experimental validation of the proposed model to prove its rationality.
The urgency of conducting research in the field of quantum informatics is grounded. Promising areas of research are highlighted. For foreign and Russian publications and materials, a review of the main scientific results that characterize the current state of research in quantum computer science is made. It is noted that knowledge and funds are invested most intensively in the development of the architecture of a quantum computer and its elements. Despite the fact that today there is no information on the creation of a physical implementation of a quantum computer comparable in functionality to a classical digital computer, the development of quantum algorithms is one of the popular areas of research. An advantage of quantum algorithms is the fact that they reduce the time required to solve the problem due to the parallelization of operations by generating entangled quantum states and their subsequent use. This advantage (quantum acceleration) is most important when solving the problem of modeling the dynamics of complex systems and enumerated mathematical problems. (The general case of enumeration is the Grover scheme and its variants; the tasks of searching for hidden periods: Shor's scheme of using the fast quantum Fourier transform and its analogues.) The demand for cybersecurity developments (search for vulnerabilities in smart spaces, secure storage and use of big data, quantum cryptography) is noted. More than a dozen articles are devoted to quantum algorithms of key search, key distribution on optical fibers of various lengths, and the analysis of quantum resources necessary for conducting a cyber attack. In the field of artificial quantum intelligence, attention is paid, first of all, to the “search” for a model of a quantum neural network that is optimal from the point of view of using all the advantages presented by quantum computing and neural networks, as well as machine learning algorithms. Examples of the use of quantum computing in cognitive and social sciences for studying the decision-making mechanism with incomplete data are given. It is concluded that quantum informatics is promising for the simulation of complex natural and artificial phenomena and processes.
The paper describes the simplest technique for simulating a quantum algorithm based on the direct matrix representation of quantum operators.This approach is stable and precise, but it requires allocation of operator's matrices in the computer memory.Since the size of the operators grows exponentially, this approach is useful for simulating quantum algorithms with a relatively small number of qubits (e.g., approximately 11 qubits on a typical desktop computer).This approach enables relatively simple simulation of the operation of the solution quality control system and performance of a reliability analysis.A more efficient fast quality control simulation method is based on computing all or a part of operator matrices as needed on a current computational basis.This method makes it possible to avoid storing all or a part of the operator matrices.In this case, the number of qubits to be simulated (e.g., the number of input qubits or the number of qubits in the system state register) is affected by: (I) the exponential growth in the number of operations required to calculate the result of matrix products; and (II) the size of the state vector allocated in computer memory.It is reasonable if one embodiment of this approach involves simulating up to 19 or more qubits on typical desktop computer, and even more in a system with a vector architecture.Due to particularities of the memory addressing and access processes in a typical desktop computer (such as, for example, a Pentium PC), when a number of qubits is relatively small, the on-demand computing tends to be faster than the direct storage approach.The compute-on-demand approach benefits from applying the results of studying quantum operators and their structure that enables computing the matrix elements more efficiently.The paper considers effective simulation of Grover's quantum search algorithm using a computer with classical architecture.