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

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 …

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 …

Within the context of hybrid quantum-classical optimization, gradient descent based
optimizers typically require the evaluation of expectation values with respect to the outcome …

Quantum effects can enhance information-processing capabilities and speed up the solution
of certain computational problems. Whether a quantum advantage can be rigorously proven …

Part of the challenge for quantum many-body problems comes from the difficulty of
representing large-scale quantum states, which in general requires an exponentially large …

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

We present a scheme for measuring Rényi entropies in generic atomic Hubbard and spin
models using single copies of a quantum state and for partitions in arbitrary spatial …

Demonstrating quantum advantage requires experimental implementation of a
computational task that is hard to achieve using state-of-the-art classical systems. One …

A central question of quantum computing is determining the source of the advantage of
quantum computation over classical computation. Even though simulating quantum …