Abstract: As quantum computers continue to increase in size, an efficient proof of quantumness is required to certify that they are performing computations as expected. In this talk, we examine a cryptographic protocol designed to solve this problem, which draws on connections between quantum computation and binary linear codes. Recently, this protocol was shown to be vulnerable to a classical attack, allowing for quantumness to be forged. We show how this attack can be generalised and suggest modifications to the original protocol such that it is no longer amenable to such an attack. 

This is a seminar of the Combinatorial Mathematics Society of Australasia.

To attend email cmsa-webinar@monash.edu with the subject 'subscribe' to receive zoom details. [You only need to subscribe once, not for future talks.]


Ryan Snoyman

Research Area

Pure Maths Seminar


UNSW Sydney


Tue, 10/11/2020 - 1:00pm