Development Method of Building a Modular Simulator of Quantum Computations and Algorithms

Abstract

The article assumes a description of the fundamentals of the theory of quantum computing in the field of quantum algorithms. A universal concept of a quantum algorithm is given, and the time of operation of the algorithm with the determination of the probability of a particular result at the output is theoretically described. A method for constructing a modular simulator of quantum computations and algorithms, its architecture and the interactions of its various components is considered. The paper developed a method for constructing a quantum algorithm for graph interpretation, which is a study of the relationship between classical and quantum elements and concepts. An algorithm for graph interpretation and elimination (reduction) of graph vertices is built, and a method of paralleling an undirected graph model by fixing the values of graph vertices is implemented. The advantage of this strategy is that all these assessments can be carried out in parallel. In this paper, an assessment was made of the complexity of a particular algorithm based on the complexity function and a universal formula for calculating it was derived. The basics of developing quantum algorithms are described in accordance with specific software for implementing quantum algorithms and the stages of their development. Quantum algorithms involve the use of vector and matrix algebra. In accordance with this, “quantum” software is defined, including: a quantum intermediate representation of information, a quantum language of physical operations, and a quantum assembler.