Industrial Automatic Control Systems and Controllers Annotation << Back Development of a Quantum Algorithm Based on Quantum Parallelism Quality to Search the Shortest Path in the Graph A.V. Ostroukh, C.B. Pronin The following research highlights the development of a quantum algorithm designed to use quantum parallelism for performing parallel quantum calculations. This algorithm was used to make a quantum algorithm for fi nding the shortest path in a graph. For the software for quantum algorithms developing within 16 qbit, the Quirk quantum device emulator was chosen, which has an extended set of sensors that allow to visually examine the transformations occurring in quantum circuits and a large number of complex quantum gateways, which greatly simplifi es the construction of new quantum circuits on their basis. Keywords: Dijkstra’s algorithm, finding the shortest path in a graph, quantum informatics, qubit, superposition, quantum gate, graph, control qubit. Contacts: E-mail: ostroukh@mail.ru, E-mail: caesarpr12@gmail.com Pp. 08-14.