Felix hatte vor einigen Wochen einen wirklich guten Les über Quantencomputer gefunden, in dem es um die Probleme geht, die überhaupt von einem Quantencomputer gut gelöst werden können:
https://cacm.acm.org/research/disentangling-hype-from-practicality-on-realistically-achieving-quantum-advantage/
Geldzitate:
>The most likely problems to allow for a practical quantum advantage are those with exponential quantum speedup. This includes the simulation of quantum systems for problems in chemistry, materials science, and quantum physics, as well as cryptanalysis using Shor's algorithm.
>Equally important, we identify likely dead ends in the maze of applications. A large range of problem areas with quadratic quantum speedups, such as many current machine learning training approaches, accelerating drug design and protein folding with Grover’s algorithm, speeding up Monte Carlo simulations through quantum walks, as well as more traditional scientific computing simulations including the solution of many non-linear systems of equations, such as fluid dynamics in the turbulent regime, weather, and climate simulations will not achieve quantum advantage with current quantum algorithms in the foreseeable future. We also conclude that the identified I/O limits constrain the performance of quantum computing for big data problems, unstructured linear systems, and database search based on Grover's algorithm such that a speedup is unlikely in those cases.
>Therefore, the most promising candidates for quantum practicality are small-data problems with exponential speedup.
Sachen, die durch Shors Algorithmus schneller lösbar sind (wie z.B. RSA brechen), sind also tatsächlich eine der wenigen womöglich praktikablen Anwendungen von Quantencomputern, da nicht E/A-Flaschenhals-gebunden.