Abstract
Present paper describes the basics of quantum algorithms development and modeling of entangled quantum computations used in quantum algorithms. Since quantum algorithms assume the use of vector and matrix algebras, so the suggested structure of the quantum computer model (QCM) considers this specialty and reflects all functional features of such model. The basic tasks of the proposed model simulation are determined within the quantum algorithms execution taking into account the entanglement property. In accordance with the constructed system for determining the computational complexity of quantum algorithms, the entire set of necessary elements is shown: the time complexity, the number of operations and queries to the quantum oracle, the complexity class of the quantum algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wikipedia contributors: NP (complexity). In Wikipedia, The Free Encyclopedia. https://en.wikipedia.org/w/index.php?title = NP_(complexity)&oldid = 835998319 (2018)
Guzik, V., Gushanskiy, S., Polenov, M., Potapov, V.: Models of a quantum computer, their characteristics and analysis. In: Proceedings of the 9th International Conference on Application of Information and Communication Technologies (AICT 2015), pp. 583–587. IEEE Press (2015)
Pravilshchikov, P.: Quantum parallelism and a new model of computation. In: Proceedings of the XII All-Russian Meeting on the Control Problems, pp. 7319–7334 (2014) (in Russian)
Potapov, V., Guzik, V., Gushansky, S.: About the performance and computational complexity of quantum algorithms. In: Informatization and Communication, vol. 3, pp. 24–29. Moscow (2017) (in Russian)
Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Contemporary Mathematics 305 Quantum Computation and Information, pp. 53–74. American Mathematical Society (2000)
Kornovan, D., Sheremet, A., Petrov, M.: Collective polaritonic modes in an array of two-level quantum emitters coupled to an optical nanofiber. Phys. Rev. B 94, 16 (2016)
Smith, J., Mosca, M.: Algorithms for quantum computers. In: Handbook of Natural Computing, pp. 1451–1492. Springer (2010)
Potapov, V., Gushansky, S., Guzik, V., Polenov, M.: Architecture and software implementation of a quantum computer model. In: Software Engineering Perspectives and Application in Intelligent Systems Advances in Intelligent Systems and Computing, vol. 465, pp. 59–68. Springer (2016)
Potapov, V., Gushansky, S., Guzik, V., Polenov, M.: Development of methodology for entangled quantum calculations modeling in the area of quantum algorithms In: Software Engineering Perspectives and Application in Intelligent Systems Advances in Intelligent Systems and Computing. vol. 575, pp. 106–115. Springer (2017)
Ekert, A., Hayden, P., Inamori, H.: Basic Concepts in Quantum Computation. arXiv:quant-ph/0011013 (2008)
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
Potapov, V., Gushanskiy, S., Samoylov, A., Polenov, M. (2019). The Quantum Computer Model Structure and Estimation of the Quantum Algorithms Complexity. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Computational and Statistical Methods in Intelligent Systems. CoMeSySo 2018. Advances in Intelligent Systems and Computing, vol 859. Springer, Cham. https://doi.org/10.1007/978-3-030-00211-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-00211-4_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00210-7
Online ISBN: 978-3-030-00211-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)