Racing in parallel: Quantum versus Classical

Perimeter Institute
In a fair comparison of the performance of a quantum algorithm to a classical one it is important to treat them on equal footing, both regarding resource usage and parallelism. We show how one may otherwise mistakenly attribute speedup due to parallelism as quantum speedup. As an illustration we will go through a few quantum machine learning algorithms, e.g. Quantum Page Rank, and show how a classical parallel computer can solve these problems faster with...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.