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

With the rapid development of quantum technologies, a pressing need has emerged for a
wide array of tools for the certification and characterization of quantum devices. Such tools …

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 …

The precise control of complex quantum systems promises numerous technological
applications including digital quantum computing. The complexity of such devices renders …

Laser-cooled and trapped atomic ions form an ideal standard for the simulation of interacting
quantum spin models. Effective spins are represented by appropriate internal energy levels …

We use the class of commuting quantum computations known as IQP (instantaneous
quantum polynomial time) to strengthen the conjecture that quantum computers are hard to …

Quantum technologies hold the promise of not only faster algorithmic processing of data, via
quantum computation, but also of more secure communications, in the form of quantum …

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-
time) has been shown to be hard to simulate classically, assuming certain complexity …

Quantum computers promise to efficiently solve not only problems believed to be intractable
for classical computers, but also problems for which verifying the solution is also considered …

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 …