QUANTUM SUPERIORITY IN THE PARADIGM OF MATHEMATICAL COMPLEXITY THEORY AND THE THEORY OF RECURSIVE FUNCTIONS

UDC 519.688
DOI: 10.36871/2618-9976.2023.02.002

Authors

Vitaly A. Peleshenko,
Ph.D., C. Eng., mRINA, mGlobalCIO, Associate Professor, Department of data analysis and machine learning, Financial University under the Government of the Russian Federation, Moscow, Russia

Abstract

The article is devoted to the issues of quantum computational number theory. In particular, the main approaches used in quantum computing and their differences from the classical ones, according to the basic mathematical canons laid down in the mathematical theory of complexity and the theory of recursive functions.

Keywords

Quotes, Quantum computing, Quantum processors