Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917879839981568 |
|---|---|
| author | Takabayashi, Taisei Sudo, Shoichi Aoki, Toshihiro Seo, Shun Ohzeki, Masayuki |
| author_facet | Takabayashi, Taisei Sudo, Shoichi Aoki, Toshihiro Seo, Shun Ohzeki, Masayuki |
| contents | In current mobile networks, optimizing which base station a mobile phone in a particular area connects to is crucial for ensuring good communication quality for each mobile phone but presents a challenging combinatorial optimization problem. In this study, we optimize the connection patterns to base stations using quantum annealing which is a generic solver using quantum fluctuation. However, since the number of qubits on a quantum annealer is limited, it is necessary to consider a formulation that efficiently utilizes qubits. By adopting a variable reduction formulation, we significantly reduce the qubit requirements compared to the naive formulation that is typically used when considering pattern-matching problems. Furthermore, experiments using quantum annealing revealed that the accuracy of the approximate solution obtained by the new formulation is superior to that of the conventional formulation. Additionally, we demonstrate that the new formulation provides better solutions than the conventional formulation as the problem size increases, even when using simulated annealing, the classical counterpart of quantum annealing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_19434 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing Takabayashi, Taisei Sudo, Shoichi Aoki, Toshihiro Seo, Shun Ohzeki, Masayuki Quantum Physics In current mobile networks, optimizing which base station a mobile phone in a particular area connects to is crucial for ensuring good communication quality for each mobile phone but presents a challenging combinatorial optimization problem. In this study, we optimize the connection patterns to base stations using quantum annealing which is a generic solver using quantum fluctuation. However, since the number of qubits on a quantum annealer is limited, it is necessary to consider a formulation that efficiently utilizes qubits. By adopting a variable reduction formulation, we significantly reduce the qubit requirements compared to the naive formulation that is typically used when considering pattern-matching problems. Furthermore, experiments using quantum annealing revealed that the accuracy of the approximate solution obtained by the new formulation is superior to that of the conventional formulation. Additionally, we demonstrate that the new formulation provides better solutions than the conventional formulation as the problem size increases, even when using simulated annealing, the classical counterpart of quantum annealing. |
| title | Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.19434 |