Using quantum computing to solve the maximal covering location problem
Abstract In this article, we present the process and results of using quantum computing (QC) to solve the maximal covering location problem proposed by Church and ReVelle. With this contribution, we seek to lay the foundations for other urban and regional scientists to begin to consider quantum tech...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2022-12-01
|
| Series: | Computational Urban Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s43762-022-00070-x |
| _version_ | 1811203768657641472 |
|---|---|
| author | Alejandro Giraldo-Quintero Juan G. Lalinde-Pulido Juan C. Duque Daniel Sierra-Sosa |
| author_facet | Alejandro Giraldo-Quintero Juan G. Lalinde-Pulido Juan C. Duque Daniel Sierra-Sosa |
| author_sort | Alejandro Giraldo-Quintero |
| collection | DOAJ |
| description | Abstract In this article, we present the process and results of using quantum computing (QC) to solve the maximal covering location problem proposed by Church and ReVelle. With this contribution, we seek to lay the foundations for other urban and regional scientists to begin to consider quantum technologies. We obtained promising results, but it is clear that there is a need for more capable devices with more qubits and less susceptibility to electronic noise to solve instances that currently cannot be optimally solved by traditional solvers. We foresee that QC will be of common use in urban and regional science and its applications in the years to come. |
| first_indexed | 2024-04-12T03:00:42Z |
| format | Article |
| id | doaj.art-69340519698a47d59432ef688bfe2b38 |
| institution | Directory Open Access Journal |
| issn | 2730-6852 |
| language | English |
| last_indexed | 2024-04-12T03:00:42Z |
| publishDate | 2022-12-01 |
| publisher | Springer |
| record_format | Article |
| series | Computational Urban Science |
| spelling | doaj.art-69340519698a47d59432ef688bfe2b382022-12-22T03:50:41ZengSpringerComputational Urban Science2730-68522022-12-012111410.1007/s43762-022-00070-xUsing quantum computing to solve the maximal covering location problemAlejandro Giraldo-Quintero0Juan G. Lalinde-Pulido1Juan C. Duque2Daniel Sierra-Sosa3EAFIT UniversityEAFIT UniversityResearch in Spatial Economics (RiSE) Group, School of Applied Sciences and Engineering, EAFIT UniversityDepartment of Computer Science & Information Technology, Hood CollegeAbstract In this article, we present the process and results of using quantum computing (QC) to solve the maximal covering location problem proposed by Church and ReVelle. With this contribution, we seek to lay the foundations for other urban and regional scientists to begin to consider quantum technologies. We obtained promising results, but it is clear that there is a need for more capable devices with more qubits and less susceptibility to electronic noise to solve instances that currently cannot be optimally solved by traditional solvers. We foresee that QC will be of common use in urban and regional science and its applications in the years to come.https://doi.org/10.1007/s43762-022-00070-xMaximal Covering Location ProblemQuantum Computing |
| spellingShingle | Alejandro Giraldo-Quintero Juan G. Lalinde-Pulido Juan C. Duque Daniel Sierra-Sosa Using quantum computing to solve the maximal covering location problem Computational Urban Science Maximal Covering Location Problem Quantum Computing |
| title | Using quantum computing to solve the maximal covering location problem |
| title_full | Using quantum computing to solve the maximal covering location problem |
| title_fullStr | Using quantum computing to solve the maximal covering location problem |
| title_full_unstemmed | Using quantum computing to solve the maximal covering location problem |
| title_short | Using quantum computing to solve the maximal covering location problem |
| title_sort | using quantum computing to solve the maximal covering location problem |
| topic | Maximal Covering Location Problem Quantum Computing |
| url | https://doi.org/10.1007/s43762-022-00070-x |
| work_keys_str_mv | AT alejandrogiraldoquintero usingquantumcomputingtosolvethemaximalcoveringlocationproblem AT juanglalindepulido usingquantumcomputingtosolvethemaximalcoveringlocationproblem AT juancduque usingquantumcomputingtosolvethemaximalcoveringlocationproblem AT danielsierrasosa usingquantumcomputingtosolvethemaximalcoveringlocationproblem |