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

ICERI proceedings

QUANTUM COMPUTING KNOWLEDGE PROVIDES AN EXPONENTIAL SPEEDUP TO HARD COMPUTATIONAL PROBLEMS: AN EXPERIENCE WITH ENGINEERING STUDENTS

Elvira Muñoz-García, Germán-Lenin Dugarte-Peña

Published Nov 1, 2022• 0 citations
Publisher

Abstract

QUANTUM COMPUTING KNOWLEDGE PROVIDES AN EXPONENTIAL SPEEDUP TO HARD COMPUTATIONAL PROBLEMS: AN EXPERIENCE WITH ENGINEERING STUDENTS
DOI
10.21125/iceri.2022.1978

Related papers

The Impact of Quantum Computing on Computer Science

Hicham Amellal, Abdelmajid Meslouhi, Abderrahim El Allati

Lecture notes in intelligent transportation and infrastructure•Jan 1, 2019•2 citations

METHODOLOGICAL PROBLEMS OF TEACHING THE THEORY OF PARTICLE-WAVE DUALISM FOR PHYSICS STUDENTS.

E.N. Xudayberdiyev, L.K. Samandarov

Theoretical & Applied Science•Oct 30, 2021•0 citations

Exploration of Key Challenges and Features of Quantum Computing

Abhinav Tripathi, G. R. Mishra, Geetika Srivastava +2 more

Springer proceedings in physics•Jan 1, 2026•0 citations

THE STRUCTURAL EVOLUTION OF QUANTUM COMPUTATIONAL ADVANTAGE A COMPREHENSIVE ANALYSIS OF SHOR’S ALGORITHM AND EXPONENTIAL SPEEDUP PARADIGMS

Erra Lokeshwari, Mahender Veshala

Quantum information science has transformed from a theoretical curiosity to a fundamental concept of associ ated with modern computational complexity theory, primarily because of the recognition that quantum mechanical principles permit the solving of particular issues at an exponentially quicker rate than any conventional classical technique. Shor’s algorithm, which speeds up integer factorization and discrete logarithms by a superpolynomial value, is the best example of this advantage [1]. This poses a direct threat the security of current public-key cryp tographic protocols, such as RSA and Elliptic Curve Cryptography (ECC) [3]. But the world of quantum speedups is not the identical all the time. It consists of everything from Grover’s search algorithm’s quadratic advantages to quantum walks on structured graphs’ exponential hitting times [6]. This report appears at the math behind these speedup paradigms, the hardware they need, and the security problems they might cause, bringing together what we know so far and what we think will happen in the future with quantum-resistant security.

Iterative International Publishers eBooks•May 1, 2026•0 citations

Impact of quantum computing on computer science/engineering education

Richard Jay Spillman

Journal of computing sciences in colleges•Dec 1, 2003•0 citations

EXPONENTIAL TILTING IN QUANTUM COMPUTING: FOUNDATIONS AND APPLICATIONS

QIU YIXIAN

•May 21, 2026•0 citations
Quantum information science has transformed from a theoretical curiosity to a fundamental concept of associ ated with modern computational complexity theory, primarily because of the recognition that quantum mechanical principles permit the solving of particular issues at an exponentially quicker rate than any conventional classical technique. Shor’s algorithm, which speeds up integer factorization and discrete logarithms by a superpolynomial value, is the best example of this advantage [1]. This poses a direct threat the security of current public-key cryp tographic protocols, such as RSA and Elliptic Curve Cryptography (ECC) [3]. But the world of quantum speedups is not the identical all the time. It consists of everything from Grover’s search algorithm’s quadratic advantages to quantum walks on structured graphs’ exponential hitting times [6]. This report appears at the math behind these speedup paradigms, the hardware they need, and the security problems they might cause, bringing together what we know so far and what we think will happen in the future with quantum-resistant security.