Quantum Algorithms: Application and Feasibility
Bui, Duong; Halunen, Kimmo; Nguyen, Nhan; Röning, Juha (2024-11-27)
Avaa tiedosto
Sisältö avataan julkiseksi: 27.11.2025
Springer
27.11.2024
Bui, D., Halunen, K., Nguyen, N., Röning, J. (2025). Quantum Algorithms: Application and Feasibility. In: Pfahl, D., Gonzalez Huerta, J., Klünder, J., Anwar, H. (eds) Product-Focused Software Process Improvement. Industry-, Workshop-, and Doctoral Symposium Papers. PROFES 2024. Lecture Notes in Computer Science, vol 15453. Springer, Cham. https://doi.org/10.1007/978-3-031-78392-0_10
https://rightsstatements.org/vocab/InC/1.0/
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG. This is a post-peer-review, pre-copyedit version of an article published in Product-Focused Software Process Improvement. Industry-, Workshop-, and Doctoral Symposium Papers. The final authenticated version is available online at: https://doi.org/10.1007/978-3-031-78392-0_10
https://rightsstatements.org/vocab/InC/1.0/
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG. This is a post-peer-review, pre-copyedit version of an article published in Product-Focused Software Process Improvement. Industry-, Workshop-, and Doctoral Symposium Papers. The final authenticated version is available online at: https://doi.org/10.1007/978-3-031-78392-0_10
https://rightsstatements.org/vocab/InC/1.0/
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:oulu-202412207506
https://urn.fi/URN:NBN:fi:oulu-202412207506
Tiivistelmä
Abstract
In this paper, we evaluate the feasibility of quantum algorithms for practical applications and categorize them into three types: green, yellow, and red. Green means the most feasible, while red means the least feasible. We select four quantum algorithms from the Algebraic and Number Theoretic fields, four from the Optimization field, six from the Machine Learning field, and four from the Oracular field to assess their feasibility. Our results show that some quantum algorithms can be applied to solve real-life problems in the near future, while other fields may take a long time to be practically applied. The feasibility assessment is obtained by considering whether there are requirements in the quantum algorithms that are hard to satisfy with current quantum technologies and predicting how much time it will require for those requirements to be satisfied in the future. We also provide a table summarizing the feasibility evaluation results of these quantum algorithms.
In this paper, we evaluate the feasibility of quantum algorithms for practical applications and categorize them into three types: green, yellow, and red. Green means the most feasible, while red means the least feasible. We select four quantum algorithms from the Algebraic and Number Theoretic fields, four from the Optimization field, six from the Machine Learning field, and four from the Oracular field to assess their feasibility. Our results show that some quantum algorithms can be applied to solve real-life problems in the near future, while other fields may take a long time to be practically applied. The feasibility assessment is obtained by considering whether there are requirements in the quantum algorithms that are hard to satisfy with current quantum technologies and predicting how much time it will require for those requirements to be satisfied in the future. We also provide a table summarizing the feasibility evaluation results of these quantum algorithms.
Kokoelmat
- Avoin saatavuus [38865]