The usefullness of quantum computing is often considered well-understood from a theoretical point of view. Textbooks will tell you a lot about certain tasks that a quantum computer may be better at than its classical counterpart.

Finding a googd "use case" for a quantum computer is, however not that simple. In this talk, I will give some examples of "classical" quantum algorithms, and discuss the current status of their usefulness. I will then try to convey my take on promising near- and long-term use cases, and give some exsamples of recent work in both theoretical and practical quantum computing.