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

The power of quantum computing technologies is based on the fundamentals of quantum
mechanics, such as quantum superposition, quantum entanglement, or the no-cloning …

A critical question for quantum computing in the near future is whether quantum devices
without error correction can perform a well-defined computational task beyond the …

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 …

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 search for an application of near-term quantum devices is widespread. Quantum
machine learning is touted as a potential utilisation of such devices, particularly those out of …

Near term quantum computers with a high quantity (around 50) and quality (around 0.995
fidelity for two-qubit gates) of qubits will approximately sample from certain probability …

Gate model quantum computers with too many qubits to be simulated by available classical
computers are about to arrive. We present a strategy for programming these devices without …

One of the main aims in the field of quantum simulation is to achieve a quantum speedup,
often referred to as “quantum computational supremacy,” referring to the experimental …

The performance of variational quantum algorithms relies on the success of using quantum
and classical computing resources in tandem. Here, we study how these quantum and …