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 …

We prove that Kilian's four-message succinct argument system is post-quantum secure in
the standard model when instantiated with any probabilistically checkable proof and any …

This is a set of lecture notes suitable for a Master's course on quantum computation and
information from the perspective of theoretical computer science. The first version was …

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 availability of large-scale datasets on which to train, benchmark and test algorithms has
been central to the rapid development of machine learning as a discipline. Despite …

The performance of a quantum information processing protocol is ultimately judged by
distinguishability measures that quantify how distinguishable the actual result of the protocol …

Distributing entanglement over long distances is one of the central tasks in quantum
networks. An important problem, especially for near-term quantum networks, is to develop …

Quantum entanglement is a fundamental property of quantum mechanics and it serves as a
basic resource in quantum computation and information. Despite its importance, the power …

State transformation problems such as compressing quantum information or breaking
quantum commitments are fundamental quantum tasks. However, their computational …

Complexity theory traditionally studies the hardness of solving classical computational
problems. In the quantum setting, it is also natural to consider a different notion of …