QUANTUM SUPERIORITY IN THE PARADIGM OF MATHEMATICAL COMPLEXITY THEORY AND THE THEORY OF RECURSIVE FUNCTIONS
Vitaly Alekseevich Peleshenko
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.
SOFT MEASUREMENTS AND COMPUTING•Jan 1, 2023•0 citations