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 well-known hybrid quantum-classical algorithms: Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). In an attempt to 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.

Keywords

MSC

68Q12

Cite this article

@article{cai-5734,
  author  = {Julia Plewa and Joanna Sieńko and Katarzyna Rycerz},
  title   = {Variational Algorithms for Workflow Scheduling Problem in Gate-Based Quantum Devices},
  journal = {Computing and Informatics},
  volume  = {40},
  number  = {4},
  pages   = {897--929},
  year    = {2021},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2021_4_897}
}
Download .bib