University of Cambridge > > CQIF Seminar > Fast navigation with icosahedral golden gates

Fast navigation with icosahedral golden gates

Add to your list(s) Download to your calendar using vCal

  • UserZachary Stier, UC Berkeley World_link
  • ClockThursday 11 January 2024, 14:15-15:30
  • HouseMR2.

If you have a question about this talk, please contact Subhayan Roy Moulik.

We discuss recent algorithmic work in the design of universal single-qubit gate sets for quantum computing. Using the quaternionically-derived “super golden gates,” we connect the problem of efficient approximate synthesis of given gates to arbitrary precision in quantum hardware design to “icosahedral gates” constructed using the symmetries of the icosahedron, which enjoy a form of optimality. This area also has connections with questions of navigating Ramanujan graphs, a problem which arises in other contexts.

Joint work with Terrence Blackman.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity