Holonomic Quantum Computation via Adiabatic Shortcut

  1. J. Zhang,
  2. Thi Ha Kyaw,
  3. D.M. Tong,
  4. Erik Sjöqvist,
  5. and L. C. Kwek
Fast quantum gates based on geometric phases provide a platform for performing robust quantum computation. In particular, non-adiabatic holonomic quantum computation, which involves
non-Abelian geometric phases to achieve universality, has recently been demonstrated in several experiments. Here, we generalize the transitionless quantum driving algorithm to a degenerate Hilbert space, with which we propose a route towards fast holonomic quantum computation. We propose a proof-of-principle experiment in a superconducting circuit architecture to realize our scheme.