Circuit lower bounds for linear functions is hardSpeaker: Kevin
Title: Circuit lower bounds for linear functions is hard
Date: 29 Oct 2021 11:30-13:00 EST
Location: SEC Level 3 NW Terrace
Abstract: The CNOT (controlled-not) gate is known to be universal for quantum computation and thus understanding it is crucial to understanding quantum circuit synthesis. In this talk we’ll look at the CNOT complexity of linear reversible functions and various dead ends I’ve run into while working on this very natural but elusive problem.