Szczegóły publikacji
Opis bibliograficzny
Variational algorithms for workflow scheduling problem in gate-based quantum devices / Julia Plewa, Joanna Sieńko, Katarzyna RYCERZ // Computing and Informatics / Slovak Academy of Sciences. Institute of Informatics ; ISSN 1335-9150. — Tytuł poprz.: Computers and Artificial Intelligence. — 2021 — vol. 40 no. 4, s. 897–929. — Bibliogr. s. 926–928, Abstr. — XXII KKIO Software Engineering Conference : Krakow, 21–22 September 2021
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 139052 |
|---|---|
| Data dodania do BaDAP | 2022-02-10 |
| Tekst źródłowy | URL |
| DOI | 10.31577/cai_2021_4_897 |
| Rok publikacji | 2021 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Computing and Informatics |
Abstract
In this paper we consider the combinatorial optimization problem known as workflow scheduling. We compare three encoding schemes of varying density: one-hot, binary, and domain wall, and test their performance against two wellknown hybrid quantum-classical algorithms: Quantum Approximate Optimization obtain the best results possible, we investigate various parameters of the algorithms and test out other state-of-the-art improvements, such as dedicated QAOA mixers. Ultimately, we prove that, despite its popularity, one-hot encoding is not always the best, and using a denser encoding scheme, such as binary or domain wall, can allow for solving larger instances of workflow scheduling. Additionally, combining the above-mentioned encodings with dedicated QAOA mixers reduces the number of infeasible solutions, leading to better results.