Warsaw Quantum Computing Group, Episode XXXVI, 28.02, 18:00 CET, Julia Plewa & Joanna Sieńko “Comparison of quantum optimization algorithms and encoding schemes for workflow scheduling”

Acronym: 

WQCG, Episode XXXVI

Dates: 

Monday, February 28, 2022

Organising group(s): 

Quantum AI Foundation

Registration deadline: 

Sunday, February 27, 2022

Submission deadline: 

Sunday, February 27, 2022

Tags: 

Location: 

Online meeting
United States
US

We invite you to attend (remote-only) Episode XXXVI of the Warsaw Quantum Computing Group meetup, this time on 28.02.2022, 18:00 CET. Julia Plewa & Joanna Sieńko will give a talk “Comparison of quantum optimization algorithms and encoding schemes for workflow scheduling”

If you are interested, please register by 27.02 EOD: https://docs.google.com/forms/d/e/1FAIpQLSdUCMAvwDShQR9P2CjCHxUh0rmKhjM3...
 

Abstract from Julia and Joanna: 
In this presentation, we will consider the trade-off between space efficiency and circuit complexity in the context of a specific optimization problem – workflow scheduling. We will compare three encoding schemes of varying density: one-hot, binary [2], and domain wall [1], and test their performance against two hybrid quantum-classical algorithms: QAOA and VQE. We will also discuss the various parameters of the algorithms and other state-of-the-art improvements, such as dedicated QAOA mixers. We will present the results of our experiments that were run using the Qiskit simulator [3]. Ultimately, we will prove that one-hot encoding is not always the best, and that using a denser encoding scheme, such as binary or domain wall, can allow for encoding larger problems and sometimes even for better results.

References
[1] Chancellor N.: Domain wall encoding of discrete variables for quantum annealing and QAOA. In: Quantum Science and Technology, vol. 4(4), p. 045004, 2019. URL http://dx.doi.org/10.1088/2058-9565/ab33c2.
[2] Glos A., Krawiec A., Zimborás Z.: Space-efficient binary optimization for variational computing. arXiv:quant-ph/2009.07309, 2020.[3] Plewa J., Sienko J.: Hybrid algorithms for workflow scheduling problem in quantum devices based on gate model. Master’s thesis supervised by Katarzyna Rycerz, PhD, Institute of Computer Science, AGH University of Science and Technology, Krakow, September 2021. URL dice.cyfronet.pl/publications/source/MSc_theses/JPlewa_JSienko_msc.pdf.

BIO: 
Julia Plewa received her M.Sc. degree in computer science in 2021 from the AGH University of Science and Technology in Kraków, Poland. Her research interests include driver behavior modeling and quantum computing. She currently works as a quantum computing researcher at BNP Paribas.Joanna Sieńko received her M.Sc. degree in computer science in 2021 from the AGH University of Science and Technology in Kraków, Poland. Her interests include object-oriented programming, microservices, and cloud computing. She currently works as a software engineer at an e-commerce company.

This meeting is organized by the Quantum AI Foundation, and supported by our Strategic Partners: Snarto and Cogit.

You can find the details on the event's website: https://www.qaif.org/events/warsaw-quantum-computing-group/next-meeting.