Computational power of matchgates with supplementary resources

Abstract

The authors study the classical simulability and computational power of so-called matchgate circuits in the presence of additional resources, and find striking parallels to the known results for Clifford circuits. They also clarify under which conditions universal quantum computation is achieved with this gate set.