Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2308.08245 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910436459282432 |
|---|---|
| author | Chiew, Shao-Hen Poirier, Kilian Mishra, Rajesh Bornheimer, Ulrike Munro, Ewan Foon, Si Han Chen, Christopher Wanru Lim, Wei Sheng Nga, Chee Wei |
| author_facet | Chiew, Shao-Hen Poirier, Kilian Mishra, Rajesh Bornheimer, Ulrike Munro, Ewan Foon, Si Han Chen, Christopher Wanru Lim, Wei Sheng Nga, Chee Wei |
| contents | Multi-objective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multi-objective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve multi-objective combinatorial optimization problems. We study the application of this scheme to the network routing problem in detail, by first mapping it to the multi-objective shortest path problem. Focusing on an implementation based on the quantum approximate optimization algorithm (QAOA) -- the go-to approach for tackling optimization problems on near-term quantum computers -- we examine the Pareto plot that results from the scheme, and qualitatively analyze its ability to produce Pareto-optimal solutions. We further provide theoretical and numerical scaling analyses of the resource requirements and performance of QAOA, and identify key challenges associated with this approach. Finally, through Amazon Braket we execute small-scale implementations of our scheme on the IonQ Harmony 11-qubit quantum computer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_08245 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers Chiew, Shao-Hen Poirier, Kilian Mishra, Rajesh Bornheimer, Ulrike Munro, Ewan Foon, Si Han Chen, Christopher Wanru Lim, Wei Sheng Nga, Chee Wei Quantum Physics Multi-objective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multi-objective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve multi-objective combinatorial optimization problems. We study the application of this scheme to the network routing problem in detail, by first mapping it to the multi-objective shortest path problem. Focusing on an implementation based on the quantum approximate optimization algorithm (QAOA) -- the go-to approach for tackling optimization problems on near-term quantum computers -- we examine the Pareto plot that results from the scheme, and qualitatively analyze its ability to produce Pareto-optimal solutions. We further provide theoretical and numerical scaling analyses of the resource requirements and performance of QAOA, and identify key challenges associated with this approach. Finally, through Amazon Braket we execute small-scale implementations of our scheme on the IonQ Harmony 11-qubit quantum computer. |
| title | Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2308.08245 |