A quantum annealing approach to solve max-cover problem
The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating pro...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Trường Đại học Vinh
2022-12-01
|
| Series: | Tạp chí Khoa học |
| Subjects: | |
| Online Access: | https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eaf |
| _version_ | 1797869548544720896 |
|---|---|
| author | NGUYEN Thi Uyen NGUYEN Canh An DO Mai Trang TRAN Xuan Sang |
| author_facet | NGUYEN Thi Uyen NGUYEN Canh An DO Mai Trang TRAN Xuan Sang |
| author_sort | NGUYEN Thi Uyen |
| collection | DOAJ |
| description | The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating programmable quantum processors to implement the quantum annealing technique. In this article, we apply the quantum annealing approach to solve the Max-Cover problem. The experimental results show that this approach gives better results than Simulated Annealing in
terms of both solution quality and annealing time. |
| first_indexed | 2024-04-10T00:13:15Z |
| format | Article |
| id | doaj.art-6dcfd30a5aad430ca5b19934ba99da24 |
| institution | Directory Open Access Journal |
| issn | 1859-2228 |
| language | English |
| last_indexed | 2024-04-10T00:13:15Z |
| publishDate | 2022-12-01 |
| publisher | Trường Đại học Vinh |
| record_format | Article |
| series | Tạp chí Khoa học |
| spelling | doaj.art-6dcfd30a5aad430ca5b19934ba99da242023-03-16T07:08:03ZengTrường Đại học VinhTạp chí Khoa học1859-22282022-12-01514A304210.56824/vujs.2022nt29A quantum annealing approach to solve max-cover problemNGUYEN Thi Uyen0NGUYEN Canh An1DO Mai Trang2TRAN Xuan Sang3School of Engineering and Technology, Vinh University, VietnamSchool of Engineering and Technology, Vinh University, VietnamDepartment of Research and International Affairs, Vinh University, Vietnam3Cyber School, Vinh University, VietnamThe Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating programmable quantum processors to implement the quantum annealing technique. In this article, we apply the quantum annealing approach to solve the Max-Cover problem. The experimental results show that this approach gives better results than Simulated Annealing in terms of both solution quality and annealing time. https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eafquantum computingquantum annealingmax-cover problem |
| spellingShingle | NGUYEN Thi Uyen NGUYEN Canh An DO Mai Trang TRAN Xuan Sang A quantum annealing approach to solve max-cover problem Tạp chí Khoa học quantum computing quantum annealing max-cover problem |
| title | A quantum annealing approach to solve max-cover problem |
| title_full | A quantum annealing approach to solve max-cover problem |
| title_fullStr | A quantum annealing approach to solve max-cover problem |
| title_full_unstemmed | A quantum annealing approach to solve max-cover problem |
| title_short | A quantum annealing approach to solve max-cover problem |
| title_sort | quantum annealing approach to solve max cover problem |
| topic | quantum computing quantum annealing max-cover problem |
| url | https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eaf |
| work_keys_str_mv | AT nguyenthiuyen aquantumannealingapproachtosolvemaxcoverproblem AT nguyencanhan aquantumannealingapproachtosolvemaxcoverproblem AT domaitrang aquantumannealingapproachtosolvemaxcoverproblem AT tranxuansang aquantumannealingapproachtosolvemaxcoverproblem AT nguyenthiuyen quantumannealingapproachtosolvemaxcoverproblem AT nguyencanhan quantumannealingapproachtosolvemaxcoverproblem AT domaitrang quantumannealingapproachtosolvemaxcoverproblem AT tranxuansang quantumannealingapproachtosolvemaxcoverproblem |