PIRSA Logo


PERIMETER INSTITUTE RECORDED SEMINAR ARCHIVE

Pirsa: 16080019 - Racing in parallel: Quantum versus Classical

Speaker(s):

Damien Steiger

Playing this video requires MP4 / H.264 support to be configured and enabled in your browser.

Download link (right click and 'save-as') for playing in VLC or other compatible player.

Download Video

Abstract:

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 the same amount of resources. Our classical parallelism considerations are especially important for quantum machine learning algorithms, which either use QRAM, allow for unbounded fanout, or require an all-to-all communication network.
Valid XHTML 1.0!