Publication in IOP Quantum Science and Technology: “Highly efficient encoding for job-shop scheduling problems and its application on quantum computers”
Our work on combinatorial problems has been published in IOP Quantum Science and Technology. It is the result of research performed by Mathias Schmid, alongside Sarah Braun, Rudolf Sollacher, and Michael J. Hartmann.
In this project, we explore efficient problem encodings for a specific combinatorial problem, the job shop scheduling problem, and we find a representation that reduces the necessary number of qubits to represent the solutions. Quantum computing is believed to have a potentially transformative impact on the solving of combinatorial problems, but its resources are scarce; our main result improves on the current requirements, progressing towards industrial applicability.