Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

There is a large body of evidence for the potential of greater computational power using
information carriers that are quantum mechanical over those governed by the laws of …

The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate
model quantum computer and has shallow depth. It takes as input a combinatorial …

We give new evidence that quantum computers--moreover, rudimentary quantum computers
built entirely out of linear-optical elements--cannot be efficiently simulated by classical …

I study the class of problems efficiently solvable by a quantum computer, given the ability to
'postselect'on the outcomes of measurements. I prove that this class coincides with a …

Quantum computational supremacy arguments, which describe a way for a quantum
computer to perform a task that cannot also be done by a classical computer, typically …

We present evidence that there exist quantum computations that can be carried out in
constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy …

Noise is the defining feature of the NISQ era, but it remains unclear if noisy quantum devices
are capable of quantum speedups. Quantum supremacy experiments have been a major …

The article considers a quantum computational variant of nondeterminism based on the
notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in …

It all started with a machine. In 1936, Turing developed his theoretical computational model.
He based his model on how he perceived mathematicians think. As digital computers were …