We are now at an exciting point in our process of developing quantum computers and understanding their computational power: It has been demonstrated that quantum computers can outperform classical …

Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

We show an unconditional classical oracle separation between the class of languages that can be verified using a quantum proof ($\mathsf{QMA}$) and the class of languages that can be verified with a c...

Recently, I gave a couple of perspective talks on quantum advantage, one at the annual retreat of the CIQC and one at a recent KITP programme. I started off by polling the audience on who believed …

We construct a classical oracle proving that, in a relativized setting, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly bigger than those decid...

This paper, and its companion [BCLV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. In this part we study tailored non-local games. This is a subclass of non-...

Peer reviews of the quantum cryptography community at the moment: Reviewers from other areas: "Not my area, not interested so reject" Revi...

Now in one place all of my sixty favorite theorems from the six decades of computational complexity (1965-2024). 2015-2024 Graph Isomorphism...

It doesn't seem to be NP-complete. But has it been proved to be NP-hard?