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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Sukachev, D.D., Sipahigil, A., Lukin, M.D.: Silicon-vacancy spin qubit in diamond: a quantum memory exceeding 10 ms with single-shot state readout. Phys. Rev. Lett. 119(22), 223602 (2017)
Lukin, M.D.: Probing many-body dynamics on a 51-atom quantum simulator. Nature 551(7682), 579 (2013)
Potapov, V., Gushansky, S., Guzik, V., Polenov, M.: Architecture and software implementation of a quantum computer model. In: Advances in Intelligent Systems and Computing, vol. 465, pp. 59–68. Springer (2016)
Raedt, K.D., Michielsen, K., De Raedt, H., Trieu, B., Arnold, G., Richter, M., Lippert, T., Watanabe, H., Ito, N.: Massively parallel quantum computer simulator. Comput. Phys. Commun. 176, 121–136 (2007)
Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Babbush, R., Ding, N., Jiang, Z., Martinis, J.M., Neven, H.: Characterizing quantum supremacy in near-term devices. arXiv preprint arXiv:1608.00263 (2016)
Stierhoff, G.C., Davis, A.G.: A history of the IBM systems Journal. IEEE Ann. Hist. Comput. 20(1), 29–35 (1998)
Lipschutz, S., Lipson, M.: Linear Algebra (Schaum’s Outlines), 4th edn. McGraw Hill, New York (2009)
Collier, D.: The Comparative Method. In: Finifter, A.W. (ed.) Political Sciences: The State of the Discipline II, pp. 105–119. American Science Association, Washington, DC (1993)
Vectorization.https://en.wikipedia.org/w/index.php?title=Vectorization&ldid=829988201
Williams, C.P.: Quantum gates (chap. 2). In: Explorations in Quantum Computing. Texts in Computer Science, pp. 51–122. Springer (2011)
Olukotun, K.: Chip Multiprocessor Architecture – Techniques to Improve Throughput and Latency. Morgan and Claypool Publishers, San Rafael (2007)
Potapov, V., Guzik, V., Gushanskiy, S., Polenov, M.: Complexity estimation of quantum algorithms using entanglement properties. In: Informatics, Geoinformatics and Remote Sensing (Proceedings of 16-th International Multidisciplinary Scientific Geoconference, SGEM 2016, Bulgaria), vol. 1, pp. 133–140. STEF92 Technology Ltd. (2016)
Inverter (logic gate). https://en.wikipedia.org/w/index.php?title=Inverter_(logic_gate)&oldid = 844691629
Lachowicz, P.: Walsh – Hadamard Transform and Tests for Randomness of Financial Return-Series. http://www.quantatrisk.com/2015/04/07/walsh-hadamard-transform-python-tests-for-randomness-of-financial-return-series/ (2015)
Potapov, V., Gushanskiy, S., Guzik, V., Polenov, M.: The computational structure of the quantum computer simulator and its performance evaluation. In: Software Engineering Perspectives and Application in Intelligent Systems. Advances in Intelligent Systems and Computing, vol. 763, pp. 198–207. Springer (2019)
Zwiebach, B.: A First Course in String Theory. Cambridge University Press, Cambridge (2009)
Potapov, V., Gushanskiy, S., Samoylov, A., Polenov, M.: The quantum computer model structure and estimation of the quantum algorithms complexity. In: Advances in Intelligent Systems and Computing, vol. 859, pp. 307–315. Springer (2019)
Universe of Light: What is the Amplitude of a Wave? Regents of the University of California. http://cse.ssl.berkeley.edu/light/measure_amp.html
Sternberg, R.J., Sternberg, K.: Cognitive Psychology, 6th edn. Wadsworth, Cengage Learning (2012)
Acknowledgments
This work was carried out within the State Task of the Ministry of Science and Higher Education of the Russian Federation (Project part No. 2.3928.2017/4.6) in Southern Federal University.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Guzik, V., Gushanskiy, S., Potapov, V. (2019). Development Method of Building a Modular Simulator of Quantum Computations and Algorithms. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Intelligent Systems Applications in Software Engineering. CoMeSySo 2019 2019. Advances in Intelligent Systems and Computing, vol 1046. Springer, Cham. https://doi.org/10.1007/978-3-030-30329-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-30329-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30328-0
Online ISBN: 978-3-030-30329-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)