Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2408.06368 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929457226317824 |
|---|---|
| author | Bennett, Tavis Noakes, Lyle Wang, Jingbo B. |
| author_facet | Bennett, Tavis Noakes, Lyle Wang, Jingbo B. |
| contents | This paper introduces in detail a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained problems and problems with non-binary variables. The algorithm returns optimal and near-optimal solutions from repeated preparation and measurement of an amplified state. The amplified state is prepared via repeated application of two unitaries; one which phase-shifts solution states dependent on objective function values, and the other which mixes phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific mixing graph. The general interference process responsible for amplifying optimal solutions is derived in part from statistical analysis of objective function values as distributed over the mixing graph. The algorithm's versatility is demonstrated through its application to various problems: weighted maxcut, k-means clustering, quadratic assignment, maximum independent set and capacitated facility location. In all cases, efficient circuit implementations of the CTQWs are discussed. A penalty function approach for constrained problems is also introduced, including a method for optimising the penalty function. For each of the considered problems, the algorithm's performance is simulated for a randomly generated problem instance, and in each case, the amplified state produces a globally optimal solution within a small number of iterations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_06368 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Analysis of the Non-variational Quantum Walk-based Optimisation Algorithm Bennett, Tavis Noakes, Lyle Wang, Jingbo B. Quantum Physics Computational Physics This paper introduces in detail a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained problems and problems with non-binary variables. The algorithm returns optimal and near-optimal solutions from repeated preparation and measurement of an amplified state. The amplified state is prepared via repeated application of two unitaries; one which phase-shifts solution states dependent on objective function values, and the other which mixes phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific mixing graph. The general interference process responsible for amplifying optimal solutions is derived in part from statistical analysis of objective function values as distributed over the mixing graph. The algorithm's versatility is demonstrated through its application to various problems: weighted maxcut, k-means clustering, quadratic assignment, maximum independent set and capacitated facility location. In all cases, efficient circuit implementations of the CTQWs are discussed. A penalty function approach for constrained problems is also introduced, including a method for optimising the penalty function. For each of the considered problems, the algorithm's performance is simulated for a randomly generated problem instance, and in each case, the amplified state produces a globally optimal solution within a small number of iterations. |
| title | Analysis of the Non-variational Quantum Walk-based Optimisation Algorithm |
| topic | Quantum Physics Computational Physics |
| url | https://arxiv.org/abs/2408.06368 |