Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

SOFT MEASUREMENTS AND COMPUTING

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

Vitaly Alekseevich Peleshenko

Published Jan 1, 2023• 0 citations
Publisher

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.
DOI
10.36871/2618-9976.2023.02.002

Related papers

QUANTUMCOMPUTATIONAL NUMBER THEORY

Vitaly Alekseevich Peleshenko

The article is devoted to the issues of quantum computational number theory. The prerequisites that gave impetus to its formation, as well as the main provisions regulating its further development, are revealed.

SOFT MEASUREMENTS AND COMPUTING•Jan 1, 2022•0 citations

THE MATHEMATICAL EVOLUTION OF QUANTUM COMPUTING: COMPUTATIONAL CHALLENGES, OPPORTUNITIES, AND FUTURE DIRECTIONS

Dipak Ashok Zope

Quantum computing is rapidly emerging as a transformative paradigm, promising to outperform classical systems in solving problems once deemed intractable. At the core of this advancement lies a profound reliance on mathematical structures that define the formulation, execution, and limitations of quantum algorithms and architectures. This study presents a conceptual exploration of the mathematical evolution of quantum computing, with a focus on the computational challenges, opportunities, and prospective directions that shape the field. It critically examines foundational frameworks, including linear algebra, operator theory, probability amplitudes, and complexity classifications, while addressing newer models rooted in geometry, category theory, and tensor networks. The research identifies key computational challenges such as error correction, model unification, and system scalability, and analyzes how emerging mathematical abstractions offer potential solutions. Through comparative analysis and theoretical synthesis, this article maps the current state of the field and articulates a forward-looking agenda aimed at conceptual integration and practical resilience. It concludes that the trajectory of quantum computing will be increasingly defined by its mathematical maturity, and that future breakthroughs will depend as much on theoretical innovation as on technological progress.

International Journal of Apllied Mathematics•Dec 7, 2025•0 citations

Exploring Number Theory and Its Applications in Quantum Computing

Prasanna Kumar K

This paper discusses the deep connection between Number Theory, Cryptography, and Quantum Computing techniques in an endeavor to understand their application in developing new cryptographic techniques, optimization problems, and computational complexity. Like modular arithmetic, which uses prime factorization, in most quantum algorithms like Shor’s and Grover's algorithms, number theory is one of the significant paradigms. This work gives a detailed analysis of some mathematical derivation, theore,m and proof of these algorithms to their practical use as well as computational efficiency. Discussed issues include scaling, correction of errors, and unsolved concerns applying number theory; all discussed from the perspective of existing quantum architecture. Addressing this new research directions of the field, the paper also presents further developments in quantum cryptography, topological quantum computing, and the algorithmic area. In highlighting both theoretical and computational challenges, this work has shown that the synergy between number theory and quantum computing has the opportunity to revolutionize cryptography and optimization and to lay the groundwork for future quantum advancements

International Journal for Research in Applied Science and Engineering Technology•Dec 28, 2024•0 citations

Observation of classical and quantum computer mechanisms

M. Jayalakshmi, K. Maharajan, A. Santhosh Nantha +1 more

This paper extensively studies classical and quantum computing paradigms, analysing their basic principles, architectural distinctions, computational power, and real-world applications. We introduce a formal mathematical model to define both models of computation and compare their strengths and weaknesses. Through a thorough analysis of computational complexity, we prove the theoretical superiority of quantum algorithms for certain problem domains. Moreover, recent experimental implementations of quantum computer structures are discussed here, and problems and probable development directions are marked. The study shows that, whereas quantum computing promises to be ideal for specific computationally hard issues theoretically, implementation challenges in practice remain vast. This contribution to the argument of next-generation computing architecture further illuminates prospects for future advancement in computational sciences.

CRC Press eBooks•Nov 10, 2025•0 citations

QUANTUM ALGORITHMS FOR PROBLEMS IN NUMBER THEORY, ALGEBRAIC GEOMETRY, AND GROUP THEORY

Wim van Dam, Yoshitaka Sasaki

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same problem appears to be intractable on classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article will review the current state of quantum algorithms, focusing on algorithms for problems with an algebraic flavor that achieve an apparent superpolynomial speedup over classical computation.

arXiv:1206.6126•Dec 1, 2012•5 citations

Quantum mechanical computation

James D. Brasher

The physics and the mathematics of computation are examined to provide a foundation and perspective for the investigation of the quantum mechanics of computation. Our purpose is to explore the fundamental limits and constraints imposed on computation by Nature through the laws of physics and the mathematics of computational complexity. Inasmuch as information storage and transmission are an integral part of computation, their physical bounds are considered. The computer is viewed both physically and mathematically as a dynamical system, and is depicted in terms of the basic Turing machine paradigm. Three fundamental classes of the Turing machine are defined; the deterministic, stochastic and quantum Turing machines. Hamiltonian models and physical realizations of quantum computing are described. Quantum computers can perform some tasks which have no classical analogue, but they cannot compute functions that are non-computable by classical means. Some classically intractable problems can be solved with quantum computers.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 1, 1994•0 citations
Quantum computing is rapidly emerging as a transformative paradigm, promising to outperform classical systems in solving problems once deemed intractable. At the core of this advancement lies a profound reliance on mathematical structures that define the formulation, execution, and limitations of quantum algorithms and architectures. This study presents a conceptual exploration of the mathematical evolution of quantum computing, with a focus on the computational challenges, opportunities, and prospective directions that shape the field. It critically examines foundational frameworks, including linear algebra, operator theory, probability amplitudes, and complexity classifications, while addressing newer models rooted in geometry, category theory, and tensor networks. The research identifies key computational challenges such as error correction, model unification, and system scalability, and analyzes how emerging mathematical abstractions offer potential solutions. Through comparative analysis and theoretical synthesis, this article maps the current state of the field and articulates a forward-looking agenda aimed at conceptual integration and practical resilience. It concludes that the trajectory of quantum computing will be increasingly defined by its mathematical maturity, and that future breakthroughs will depend as much on theoretical innovation as on technological progress.
This paper discusses the deep connection between Number Theory, Cryptography, and Quantum Computing techniques in an endeavor to understand their application in developing new cryptographic techniques, optimization problems, and computational complexity. Like modular arithmetic, which uses prime factorization, in most quantum algorithms like Shor’s and Grover's algorithms, number theory is one of the significant paradigms. This work gives a detailed analysis of some mathematical derivation, theore,m and proof of these algorithms to their practical use as well as computational efficiency. Discussed issues include scaling, correction of errors, and unsolved concerns applying number theory; all discussed from the perspective of existing quantum architecture. Addressing this new research directions of the field, the paper also presents further developments in quantum cryptography, topological quantum computing, and the algorithmic area. In highlighting both theoretical and computational challenges, this work has shown that the synergy between number theory and quantum computing has the opportunity to revolutionize cryptography and optimization and to lay the groundwork for future quantum advancements
This paper extensively studies classical and quantum computing paradigms, analysing their basic principles, architectural distinctions, computational power, and real-world applications. We introduce a formal mathematical model to define both models of computation and compare their strengths and weaknesses. Through a thorough analysis of computational complexity, we prove the theoretical superiority of quantum algorithms for certain problem domains. Moreover, recent experimental implementations of quantum computer structures are discussed here, and problems and probable development directions are marked. The study shows that, whereas quantum computing promises to be ideal for specific computationally hard issues theoretically, implementation challenges in practice remain vast. This contribution to the argument of next-generation computing architecture further illuminates prospects for future advancement in computational sciences.
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same problem appears to be intractable on classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article will review the current state of quantum algorithms, focusing on algorithms for problems with an algebraic flavor that achieve an apparent superpolynomial speedup over classical computation.
The physics and the mathematics of computation are examined to provide a foundation and perspective for the investigation of the quantum mechanics of computation. Our purpose is to explore the fundamental limits and constraints imposed on computation by Nature through the laws of physics and the mathematics of computational complexity. Inasmuch as information storage and transmission are an integral part of computation, their physical bounds are considered. The computer is viewed both physically and mathematically as a dynamical system, and is depicted in terms of the basic Turing machine paradigm. Three fundamental classes of the Turing machine are defined; the deterministic, stochastic and quantum Turing machines. Hamiltonian models and physical realizations of quantum computing are described. Quantum computers can perform some tasks which have no classical analogue, but they cannot compute functions that are non-computable by classical means. Some classically intractable problems can be solved with quantum computers.