In this talk, I will begin by describing a new universal scheme of measurement-based quantum computation. This scheme has some practical advantages, but it comes at the cost of having an unusual gate set consisting of rotations generated by long Pauli strings. I will then pivot into discussing such gate sets, including how to identify when they are universal and how to compile quantum algorithms with them. I will also show how certain universal gate sets generate all unitaries faster than others, explain this in terms of the fraction of anticommuting pairs of generators, and discuss potential implications to fault-tolerant quantum computation. Overall, these results reveal the necessity and intrigue of considering universal gate sets with distinct structure and properties compared to standard gate sets. 

Biography

Dr. Stephen obtained a Master's degree at the University of British Columbia with R. Raussendorf, and a PhD at the Max Planck Institute of Quantum Optics with N. Schuch. After doing a Postdoc at the University of Colorado Boulder and Caltech, he moved to Quantinuum where he now works on quantum algorithms. In the past, his research has looked at alternative types of quantum computation such as measurement-based quantum computation, and related them to the physics of quantum many-body systems. He is currently interested in problems related to efficient quantum state preparation and quantum circuit compilation.

Inviter: Dong-Sheng Wang