TY - GEN
T1 - Empirical Investigation of Quantum Computing on Solving Complex Problems
AU - Hussain, Shahid
AU - Neupane, Yuba
AU - Wang, Wen Li
AU - Ibrahim, Naseem
AU - Khan, Saif Ur Rehman
AU - Kareem, Asif
N1 - Publisher Copyright:
© 2024, The Author(s).
PY - 2024
Y1 - 2024
N2 - Context: The rules of Quantum Mechanics have been exploited through Quantum Computing (QC) to solve specific problems and process information in expeditious ways as compared to Conventional Computing (CC) such as factoring integers. Problem: With the alluring computation capability of QC, it is still important to assess the implications and limitations of QC in solving a variety of computationally demanding problems. Method: In this regard, an empirical study was conducted to assess the efficacy of QC in terms of solving certain complex problems by keeping a tradeoff between the execution time and problem size. An analysis was performed based on the widely used Shor’s algorithms and the efficacy of QC as compared to CC was reported. Results: The outcomes show that QC has the potential to exponentially speed up the identification of a solution to certain polynomial problems that are intractable for CC. However, further research is needed to fully understand the potential and limitations of QC for Non-Polynomial (NP) complete problems.
AB - Context: The rules of Quantum Mechanics have been exploited through Quantum Computing (QC) to solve specific problems and process information in expeditious ways as compared to Conventional Computing (CC) such as factoring integers. Problem: With the alluring computation capability of QC, it is still important to assess the implications and limitations of QC in solving a variety of computationally demanding problems. Method: In this regard, an empirical study was conducted to assess the efficacy of QC in terms of solving certain complex problems by keeping a tradeoff between the execution time and problem size. An analysis was performed based on the widely used Shor’s algorithms and the efficacy of QC as compared to CC was reported. Results: The outcomes show that QC has the potential to exponentially speed up the identification of a solution to certain polynomial problems that are intractable for CC. However, further research is needed to fully understand the potential and limitations of QC for Non-Polynomial (NP) complete problems.
UR - http://www.scopus.com/inward/record.url?scp=85181984766&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85181984766&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-48550-3_22
DO - 10.1007/978-3-031-48550-3_22
M3 - Conference contribution
AN - SCOPUS:85181984766
SN - 9783031485497
T3 - Lecture Notes in Business Information Processing
SP - 222
EP - 230
BT - Agile Processes in Software Engineering and Extreme Programming – Workshops - XP 2022 Workshops, and XP 2023 Workshops, Revised Selected Papers
A2 - Kruchten, Philippe
A2 - Gregory, Peggy
PB - Springer Science and Business Media Deutschland GmbH
T2 - workshops presented at 23rd International Conferences on Agile Software Development, XP 2022 and 24th International Conferences on Agile Software Development, XP 2023
Y2 - 13 June 2022 through 16 June 2022
ER -