The Road to Quantum Computational Supremacy
Cristian S. Calude, Elena Calude

TL;DR
This paper discusses the ongoing race for quantum computational supremacy, highlighting the progress, challenges, and implications for classical computing, emphasizing that quantum supremacy won't render classical methods obsolete.
Contribution
It provides an analysis of the strategies of Google and IBM, and reveals how the pursuit of quantum supremacy accelerates classical algorithm development.
Findings
Quantum supremacy remains an elusive goal.
Classical algorithms are rapidly advancing due to the quantum race.
Achieving quantum supremacy won't eliminate the relevance of classical computing.
Abstract
We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms. Quantum supremacy, if achieved, won't make classical computing obsolete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
