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

Encoding information redundantly using quantum error-correcting (QEC) codes allows one
to overcome the inherent sensitivity to noise in quantum computers to ultimately achieve …

The prospect of achieving computational speedups by exploiting quantum phenomena
makes the use of quantum processing units (QPUs) attractive for many algorithmic database …

We show a general method of compiling any k-prover non-local game into a single-prover
(computationally sound) interactive game maintaining the same quantum completeness and …

The Self-Attention Mechanism (SAM) excels at distilling important information from the
interior of data to improve the computational efficiency of models. Nevertheless, many …

A proof of quantumness is a type of challenge-response protocol in which a classical verifier
can efficiently certify the $\textit {quantum advantage} $ of an untrusted prover. That is, a …

Quantum computers are expected to achieve a significant speed-up over classical
computers in solving a range of computational problems. Chains of ions held in a linear Paul …

Quantum state preparation is a key step in all digital quantum simulation algorithms. Here
we propose methods to initialize on a gate-based quantum computer a general class of …

Measurement-induced state disturbance is a major challenge in obtaining quantum statistics
at multiple time points. We propose a method to extract dynamic information from a quantum …

A test of quantumness is a protocol that allows a classical verifier to certify (only) that a
prover is not classical. We show that tests of quantumness that follow a certain template …