Further extensions of Clifford circuits and their classical simulation complexities

Extended Clifford circuits, such as those in [1], straddle the boundary between classical and quantum computational power. Whether such circuits are efficiently classically simulable seems to depend delicately on the ingredients of the circuits. While some combinations of ingredients lead to efficiently classically simulable circuits, other combinations that might just be slightly different, lead to circuits which are likely not. We extend the results of [1] by studying two further extensions of Clifford circuits. Firstly, we consider how the classical simulation complexity changes when we allow for more general measurements. Secondly, we investigate different notions of what it means to ‘classically simulate’ a quantum circuit. These further extensions give us 24 new combinations of ingredients compared to [1], and we give a complete classification of their classical simulation complexities. Our results provide more examples where seemingly modest changes to the ingredients o...

• Type: Journal
• Year: 2016
• Where: ECCC
• Authors: Dax Enshan Koh
• Keywords: ECCC 2016