Quantum Computational Supremacy

TL;DR

This paper discusses the concept of quantum supremacy, outlining the main proposals to achieve it and methods to compare quantum and classical computational powers, marking a key milestone in quantum computing.

Contribution

It provides an overview of the leading proposals for achieving quantum supremacy and discusses the theoretical challenges in comparing quantum and classical computational capabilities.

Findings

Identifies key proposals for quantum supremacy

Highlights challenges in benchmarking quantum vs classical performance

Discusses experimental feasibility of quantum supremacy

Abstract

The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. This would be easier to achieve experimentally than full-scale quantum computing, but involves new theoretical challenges. Here we present the leading proposals to achieve quantum supremacy, and discuss how we can reliably compare the power of a classical computer to the power of a quantum computer.