A note on the non-adiabatic geometric phase and quantum computation

We consider the non-adiabatic, or Aharonov-Anandan, geometric phase as a tool for intrinsically fault-tolerant quantum computation. While this phase seems to answer many of the issues related to the adiabatic version of the geometric gate, we show that it is not straightforward to implement and that it is sensitive to small errors