Solving simplified Tail Assignment problems with quantum algorithms

OpenSuperQ partners, Forschungszentrum Jülich and Chalmers University of Technology have applied quantum algorithms for solving simplified tail assignment problems.

Ever wondered what quantum computers can be used for? OpenSuperQ partners, Forschungszentrum Jülich and Chalmers University of Technology have prepared a video demonstrating how they use quantum algorithms for solving complex flight path planning problems, the so-called Tail Assignments.

For more details, watch the video:

Ever wondered what quantum computers can be used for? OpenSuperQ partners, Forschungszentrum Jülich and Chalmers University of Technology have prepared a video demonstrating how they use quantum algorithms for solving complex flight path planning problems, the so-called Tail Assignments.

For more details, watch the video:

{% include "partials/videos.html.twig" with {"items": [{url: page.media["juqcs.mp4"].url, poster: page.media["juqcs.png"].url }], "columns": "small-12 medium-8"} %}