{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:40:51Z","timestamp":1771980051567,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031485497","type":"print"},{"value":"9783031485503","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:bold>Context:<\/jats:bold> 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. <jats:bold>Problem:<\/jats:bold> 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. <jats:bold>Method:<\/jats:bold> 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\u2019s algorithms and the efficacy of QC as compared to CC was reported. <jats:bold>Results:<\/jats:bold> 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.<\/jats:p>","DOI":"10.1007\/978-3-031-48550-3_22","type":"book-chapter","created":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T11:02:10Z","timestamp":1703674930000},"page":"222-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Empirical Investigation of Quantum Computing on Solving Complex Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3722-8100","authenticated-orcid":false,"given":"Shahid","family":"Hussain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuba","family":"Neupane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0065-4488","authenticated-orcid":false,"given":"Wen-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9967-6434","authenticated-orcid":false,"given":"Naseem","family":"Ibrahim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9643-6858","authenticated-orcid":false,"given":"Saif Ur Rehman","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3987-2873","authenticated-orcid":false,"given":"Asif","family":"Kareem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Rietsche, R., et al.: Quantum computing. Electron. Mark. 1\u201312 (2022). https:\/\/doi.org\/10.1007\/s12525-022-00570-y","DOI":"10.1007\/s12525-022-00570-y"},{"key":"22_CR2","unstructured":"Voorhoede, D.: Superposition and entanglement. Quantum Inspire. https:\/\/www.quantum-inspire.com\/kbase\/superposition-and- entanglement\/"},{"issue":"7280","key":"22_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1038\/463441a","volume":"463","author":"E Knill","year":"2010","unstructured":"Knill, E.: Quantum computing. Nature 463(7280), 441\u2013443 (2010)","journal-title":"Nature"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Devitt, S.J., Fowler, A.G., Hollenberg, L.C.: Investigating the practical implementation of Shor\u2019s algorithm. In: SPIE Proceedings (2005)","DOI":"10.1117\/12.583191"},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"7487","DOI":"10.30534\/ijatcse\/2020\/82952020","volume":"9","author":"CH Ugwuishiwu","year":"2020","unstructured":"Ugwuishiwu, C.H., Orji, U.E., Ugwu, C.I., Asogwa, C.N.: An overview of quantum cryptography and Shor\u2019s algorithm. Int. J. Adv. Trends Comput. Sci. Eng. 9(5), 7487\u20137495 (2020)","journal-title":"Int. J. Adv. Trends Comput. Sci. Eng."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: The limits of quantum. Sci. Am. 298(3), 62\u201369 (2008). JSTOR. http:\/\/www.jstor.org\/stable\/26000518","DOI":"10.1038\/scientificamerican0308-62"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-981-10-1023-1_33","volume-title":"Advanced Computing and Communication Technologies","author":"M Nene","year":"2016","unstructured":"Nene, M., Upadhyay, G.: Shor\u2019s algorithm for quantum factoring. In: Choudhary, R., Mandal, J., Auluck, N., Nagarajaram, H. (eds.) Advanced Computing and Communication Technologies, pp. 325\u2013331. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-981-10-1023-1_33"},{"key":"22_CR8","unstructured":"Google: Shor\u2019s algorithm: Cirq. Google Quantum AI. https:\/\/quantumai.google\/cirq\/experiments\/shor"},{"issue":"5","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"22_CR10","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Quantum Phys. 20\u201322 (1996)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1103\/RevModPhys.68.733","volume":"68","author":"E Artur","year":"1996","unstructured":"Artur, E., Jozsa, R.: Shor\u2019s quantum algorithmfor factorizing numbers. Rev. Mod. Phys. 68, 733\u2013753 (1996)","journal-title":"Rev. Mod. Phys."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1126\/science.aad9480","volume":"351","author":"M Thomas","year":"2016","unstructured":"Thomas, M., et al.: Realization of a scalable Shor algorithm. Science 351, 1068\u20131070 (2016)","journal-title":"Science"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/367701.367709","volume":"32","author":"R Eleanor","year":"2000","unstructured":"Eleanor, R., Polak, W.: An introduction to quantum computing for non-physicists. ACM Comput. Surv. 32, 300\u2013335 (2000)","journal-title":"ACM Comput. Surv."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Li, W., et al.: An image classification algorithm based on hybrid quantum classical convolutional neural network. J. Quantum Eng. (2022)","DOI":"10.1155\/2022\/5701479"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective, 2nd edn. Springer, New York (2001). Section 6.2: Number field sieve, pp. 278\u2013301. https:\/\/doi.org\/10.1007\/978-1-4684-9316-0","DOI":"10.1007\/978-1-4684-9316-0"}],"container-title":["Lecture Notes in Business Information Processing","Agile Processes in Software Engineering and Extreme Programming \u2013 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48550-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T11:05:04Z","timestamp":1703675104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48550-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,28]]},"ISBN":["9783031485497","9783031485503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48550-3_22","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,28]]},"assertion":[{"value":"28 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"XP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agile Software Development","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"xpu2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.agilealliance.org\/xp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 15 papers have been accepted from 38 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}