Self-testing is a method to infer the underlying physics of a quantum experiment in a black
box scenario. As such it represents the strongest form of certification for quantum systems. In …

Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in
Communications is usually peer-reviewed prior to publication. The following paper is …

Certifying quantum properties with minimal assumptions is a fundamental problem in
quantum information science. Self-testing is a method to infer the underlying physics of a …

In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely
classical party to delegate any quantum computation to an untrusted quantum prover. We …

The problem of reliably certifying the outcome of a computation performed by a quantum
device is rapidly gaining relevance. We present two protocols for a classical verifier to …

We present a step towards the goal of producing a general cryptographic'compilation'
procedure which can translate any entangled nonlocal game into a single-prover interactive …

We provide several advances to the understanding of the class of quantum Merlin--Arthur
(QMA) proof systems, the quantum analogue of NP. Our central contribution is proving a …

Self-testing is a method to characterise an arbitrary quantum system based only on its
classical input-output correlations, and plays an important role in device-independent …

We show that given an explicit description of a multiplayer game, with a classical verifier and
a constant number of players, it is QMA-hard, under randomized reductions, to distinguish …

Quantum mechanical effects have enabled the construction of cryptographic primitives that
are impossible classically. For example, quantum copy-protection allows for a program to be …